compareChunkGroupsByIndex(a, b): 0 | 1 | -1Attributes
<
<ChunkGraph>
,
<Chunk>
>compareChunksById(a, b): 0 | 1 | -1Attributes
compareChunksNatural(chunkGraph): ComparatorAttributes
chunkGraph:
<ChunkGraph>Returns:
<Comparator><
<Chunk>
>compareIds(a, b): 0 | 1 | -1Attributes
compareIterables(elementComparator): ComparatorAttributes
elementComparator:
<Comparator><
<T>
>Returns:
<Comparator><
<Iterable>
<
<T>
>>compareLocations(a, b): 0 | 1 | -1Attributes
<
<Compiler>
,
<Module>
><
<ChunkGraph>
,
<Module>
>compareModulesByIdentifier(a, b): 0 | 1 | -1Attributes
<
<ChunkGraph>
,
<Module>
><
<ModuleGraph>
,
<Module>
><
<ModuleGraph>
,
<Module>
>compareNumbers(a, b): 0 | 1 | -1Attributes
compareSelect(getter, comparator): ComparatorAttributes
compareStrings(a, b): 0 | 1 | -1Attributes
compareStringsNumeric(a, b): 0 | 1 | -1Attributes
concatComparators(c1, c2, ...cRest?): ComparatorAttributes
keepOriginalOrder(iterable): ComparatorAttributes
iterable:
<Iterable><
<T>
>Returns:
<Comparator><
<T>
>sortWithSourceOrder(dependencies, dependencySourceOrderMap, onDependencyReSort?): voidAttributes
dependencies:
<Dependency>[]
dependencySourceOrderMap:
<WeakMap>onDependencyReSort:
<Function>Returns:
<void>a{T}b{T}- Returns:
<-1>|<0>|<1>
Creates a cached parameterized comparator.
Attributes
tArg{TArg}- Returns:
<Comparator><<T>>
input{A}- Returns:
<B>|<null>|<undefined>