Implementations are responsible for enumerating the requested files given the current execution and task directory configuration.
This interface is used for detecting any addition-wise changes to the file system during incremental builds. If a task is run for a given file set, and new files are added by the user, implementations of this interface can detect the addition of the new files, and a rerun will be triggered for the task with appropriate deltas.
Implementations can collect files and directories alike as they wish.
Subclasses should satisfy the equals(
It is strongly recommended that subclasses implement the Externalizable interface.
Examples:
- Collect files in a given directory. (DirectoryChildrenFileCollectionStrategy)
- Collect files with a given extension, recursively. (RecursiveFileCollectionStrategy)
- Collect files based on a wildcard. (WildcardFileCollectionStrategy)
It is recommended that subclasses have a static factory method (with name create
) to instantiate an
appropriately made FileCollectionStrategy instance.
public NavigableMap< | collectFiles( Collects the files for the given configuration using this strategy. |
public boolean | Check if this strategy will collect the same files as the argument given they are passed the same parameters. |
public int | hashCode() Returns a hash code value for the object. |
Implementations should use the passed parameter to retrieve the directories of interest and collect the requested files accordingly.
This method should not be called directly, but through
TaskExecutionUtilities.collectFiles(
Implementations should gracefully handle the case when the
task working directory is null
. When it
is null
, implementations should handle that case in the same way it would handle if the directory
did not exist.
Indicates whether some other object is "equal to" this one.
The equals
method implements an equivalence relation on non-null object references:
- It is reflexive: for any non-null reference value
x
,x.equals(x)
should returntrue
. - It is symmetric: for any non-null reference values
x
andy
,x.equals(y)
should returntrue
if and only ify.equals(x)
returnstrue
. - It is transitive: for any non-null reference values
x
,y
, andz
, ifx.equals(y)
returnstrue
andy.equals(z)
returnstrue
, thenx.equals(z)
should returntrue
. - It is consistent: for any non-null reference values
x
andy
, multiple invocations ofx.equals(y)
consistently returntrue
or consistently returnfalse
, provided no information used inequals
comparisons on the objects is modified. - For any non-null reference value
x
,x.equals(null)
should returnfalse
.
The equals
method for class Object
implements the most discriminating possible equivalence
relation on objects; that is, for any non-null reference values x
and y
, this method returns
true
if and only if x
and y
refer to the same object (x == y
has the value
true
).
Note that it is generally necessary to override the hashCode
method whenever this method is overridden,
so as to maintain the general contract for the hashCode
method, which states that equal objects must have
equal hash codes.
true
if this object is the same as the obj argument; false
otherwise.
The general contract of hashCode
is:
- Whenever it is invoked on the same object more than once during an execution of a Java application, the
hashCode
method must consistently return the same integer, provided no information used inequals
comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. - If two objects are equal according to the
equals(Object)
method, then calling thehashCode
method on each of the two objects must produce the same integer result. - It is not required that if two objects are unequal according to the
Object.equals(
Object) method, then calling thehashCode
method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by class Object
does return distinct
integers for distinct objects. (This is typically implemented by converting the internal address of the object
into an integer, but this implementation technique is not required by the Java™ programming language.)