extra-sorted-array

A sorted array is a collection of values, arranged in an order.

v1.1.0 URL: https://unpkg.com/extra-sorted-array@1.1.0/index.js

Open Browse Files

extra sorted array at back clone concat findIndex findLastIndex first from front groupToMap left right searchAdjacentDuplicate searchMismatch size CombineFunction CompareFunction EndFunction Entries IEntries ILists Lists MapFunction ProcessFunction ReadFunction ReduceFunction TestFunction chunk clear$compare count countEach cut cutAt cutAtRight cutRight deepClone difference drop dropRight dropWhile dropWhileRight entries every filter filter$filterAt find findRight forEach fromArray fromRange get getAll getPath group hasInfix hasPath hasPermutation hasPrefix hasSubsequence hasSuffix hasValue head ientries iinfixes ikeys includes index indexOf indexRange infixes init intersection iprefixes is isDisjoint isEmpty isEqual isUnique isubsequences isuffixes ivalues join keys last lastIndexOf length merge mergeAll middle partition partitionEach prefixes randomInfix randomPrefix randomSubsequence randomSuffix randomValue rangedMerge reduce reduceRight reject reject$rejectAt remove remove$removePath$scanUntil scanUntilRight scanWhile scanWhileRight search searchAdjacentDuplicateValue searchAll searchClosestValue searchInfix searchInfixAll searchInfixRight searchMismatchedValue searchRight searchSubsequence searchValue searchValueAny searchValueRight shallowClone slice slice$some split splitAt subsequences suffixes symmetricDifference tail take takeRight takeWhile takeWhileRight union unique values

extra-sorted-array.web

A sorted array is a collection of values, arranged in an order {web}.

v1.1.0 URL: https://unpkg.com/extra-sorted-array.web@1.1.0/index.js

Open Browse Files

extra sorted array at back clone concat findIndex findLastIndex first from front groupToMap left right searchAdjacentDuplicate searchMismatch size CombineFunction CompareFunction EndFunction Entries IEntries ILists Lists MapFunction ProcessFunction ReadFunction ReduceFunction TestFunction chunk clear$compare count countEach cut cutAt cutAtRight cutRight deepClone difference drop dropRight dropWhile dropWhileRight entries every filter filter$filterAt find findRight forEach fromArray fromRange get getAll getPath group hasInfix hasPath hasPermutation hasPrefix hasSubsequence hasSuffix hasValue head ientries iinfixes ikeys includes index indexOf indexRange infixes init intersection iprefixes is isDisjoint isEmpty isEqual isUnique isubsequences isuffixes ivalues join keys last lastIndexOf length merge mergeAll middle partition partitionEach prefixes randomInfix randomPrefix randomSubsequence randomSuffix randomValue rangedMerge reduce reduceRight reject reject$rejectAt remove remove$removePath$scanUntil scanUntilRight scanWhile scanWhileRight search searchAdjacentDuplicateValue searchAll searchClosestValue searchInfix searchInfixAll searchInfixRight searchMismatchedValue searchRight searchSubsequence searchValue searchValueAny searchValueRight shallowClone slice slice$some split splitAt subsequences suffixes symmetricDifference tail take takeRight takeWhile takeWhileRight union unique values