Class DiscriminatingNameMapper
java.lang.Object
org.eclipse.aether.internal.impl.synccontext.named.DiscriminatingNameMapper
- All Implemented Interfaces:
NameMapper
Wrapping
NameMapper
, that wraps another NameMapper
and adds a "discriminator" as prefix, that
makes lock names unique including the hostname and local repository (by default). The discriminator may be passed
in via RepositorySystemSession
or is automatically calculated based on the local hostname and repository
path. The implementation retains order of collection elements as it got it from
NameMapper.nameLocks(RepositorySystemSession, Collection, Collection)
method.
The default setup wraps GAVNameMapper
, but manually may be created any instance needed.
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionboolean
Returnstrue
if lock names returned by this lock name mapper are file system friendly, can be used as file names and paths.nameLocks
(RepositorySystemSession session, Collection<? extends Artifact> artifacts, Collection<? extends Metadata> metadatas) Creates (opaque) names for passed in artifacts and metadata.
-
Constructor Details
-
DiscriminatingNameMapper
-
-
Method Details
-
isFileSystemFriendly
Description copied from interface:NameMapper
Returnstrue
if lock names returned by this lock name mapper are file system friendly, can be used as file names and paths.- Specified by:
isFileSystemFriendly
in interfaceNameMapper
-
nameLocks
public Collection<String> nameLocks(RepositorySystemSession session, Collection<? extends Artifact> artifacts, Collection<? extends Metadata> metadatas) Description copied from interface:NameMapper
Creates (opaque) names for passed in artifacts and metadata. Returned collection has max size of sum of the passed in artifacts and metadata collections, or less. If an empty collection is returned, there will be no locking happening. Never returnsnull
. The resulting collection MUST BE "stable" (always sorted by same criteria) to avoid deadlocks by acquiring locks in same order, essentially disregarding the order of the input collections.There is no requirement of any kind of "parity" between input element count (sum of two collections, that is) and output collection size, just the returned upper size limit is defined (sum of the passed in two collections size). If returned collection is empty, no locking will happen, if single element, one lock will be used, if two then two named locks will be used etc.
- Specified by:
nameLocks
in interfaceNameMapper
-