extra-sorted-array
A sorted array is a collection of values, arranged in an order.
Ecosystem
npmjs.org
npmjs.org
Latest Release
11 months ago
1.2.1
11 months ago
Versions
78
78
Downloads
227 last month
227 last month
Loading...
Readme
Loading...
Links
| Registry | npmjs.org |
| Source | Repository |
| Homepage | Homepage |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:npm/extra-sorted-array
spec |
| License | MIT |
| First Release | almost 3 years ago |
| Last Synced | 6 days ago |
Keywords
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 clear count-each cut-at cut-at-right cut-right deep-clone drop-right drop-while drop-while-right
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 clear count-each cut-at cut-at-right cut-right deep-clone drop-right drop-while drop-while-right
Repository
| Stars | 0 on GitHub |
| Forks | 0 on GitHub |
| Commits | 20 |
| Committers | 1 |
| Avg per Author | 20.0 |
| DDS | 0.0 |