extra-array
An array is a collection of values, stored contiguously.
Ecosystem
npmjs.org
npmjs.org
Latest Release
about 1 year ago
4.3.3
about 1 year ago
Versions
860
860
Downloads
7,157 last month
7,157 last month
Dependent Packages
141
141
Dependent Repos
9
9
Loading...
Readme
Loading...
Links
| Registry | npmjs.org |
| Source | Repository |
| Homepage | Homepage |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:npm/extra-array
spec |
| License | MIT |
| First Release | over 7 years ago |
| Last Synced | about 1 month ago |
Keywords
extra array accumulate allOf anyOf append append$ at back clone countAs endsWith findAll findIndex findLastIndex first from from$ fromApply fromCall front groupToMap infix left max maxEntry min minEntry partitionAs permutation permutation$ permute$ popBack popBack$ popFront popFront$ prefix prepend prepend$ pushBack pushBack$ pushFront pushFront$ right searchAdjacentDuplicate searchMismatch shuffle$ size startsWith subsequence suffix toReversed toSorted toSpliced value with CombineFunction CompareFunction EndFunction Entries IEntries ILists Lists MapFunction ProcessFunction ReadFunction ReduceFunction SwapFunction TestFunction adjacentCombine adjacentCombine$ cartesianProduct chunk clear$ compare concat concat$ copy copy$ copyWithin copyWithin$ count countEach cut cutAt cutAtRight cutRight cycle deepClone difference drop dropRight dropWhile dropWhileRight entries every exclusiveScan exclusiveScan$ fill fill$ filter filter$ filterAt find findRight flat flatMap forEach fromApplication fromInvocation fromIterable fromIterable$ fromRange get getAll getPath group hasInfix hasPath hasPermutation hasPrefix hasSubsequence hasSuffix hasUnsortedValue hasValue head ientries iinfixes ikeys includes inclusiveScan inclusiveScan$ index indexOf indexRange infixes init interleave intermix interpolate intersection intersperse ipermutations iprefixes is isDisjoint isEmpty isEqual isSorted isUnique isubsequences isuffixes ivalues join keys last lastIndexOf length map map$ maximum maximumEntries maximumEntry maximums middle minimum minimumEntries minimumEntry minimums moveWithin moveWithin$ partialSort partialSort$ partition partitionEach permutations pop pop$ prefixes push push$ randomInfix randomPermutation randomPermutation$ randomPrefix randomSubsequence randomSuffix randomValue range rangeEntries rangedPartialSort rangedPartialSort$ rangedSort rangedSort$ reduce reduceRight reject reject$ rejectAt remove remove$ removePath$ repeat resize$ reverse reverse$ rotate rotate$ scanUntil scanUntilRight scanWhile scanWhileRight search searchAdjacentDuplicateValue searchAll searchInfix searchInfixAll searchInfixRight searchMaximumValue searchMaximumValues searchMinimumValue searchMinimumValues searchMismatchedValue searchRight searchSubsequence searchUnsortedValue searchValue searchValueAll searchValueRight set set$ setPath$ shallowClone shift shift$ slice slice$ some sort sort$ splice splice$ split splitAt subsequences suffixes swap swap$ swapRanges swapRanges$ symmetricDifference tail take takeRight takeWhile takeWhileRight union union$ unique unshift unshift$ values zip adjacent-combine cartesian-product clear copy-within count-each cut-at cut-at-right cut-right
extra array accumulate allOf anyOf append append$ at back clone countAs endsWith findAll findIndex findLastIndex first from from$ fromApply fromCall front groupToMap infix left max maxEntry min minEntry partitionAs permutation permutation$ permute$ popBack popBack$ popFront popFront$ prefix prepend prepend$ pushBack pushBack$ pushFront pushFront$ right searchAdjacentDuplicate searchMismatch shuffle$ size startsWith subsequence suffix toReversed toSorted toSpliced value with CombineFunction CompareFunction EndFunction Entries IEntries ILists Lists MapFunction ProcessFunction ReadFunction ReduceFunction SwapFunction TestFunction adjacentCombine adjacentCombine$ cartesianProduct chunk clear$ compare concat concat$ copy copy$ copyWithin copyWithin$ count countEach cut cutAt cutAtRight cutRight cycle deepClone difference drop dropRight dropWhile dropWhileRight entries every exclusiveScan exclusiveScan$ fill fill$ filter filter$ filterAt find findRight flat flatMap forEach fromApplication fromInvocation fromIterable fromIterable$ fromRange get getAll getPath group hasInfix hasPath hasPermutation hasPrefix hasSubsequence hasSuffix hasUnsortedValue hasValue head ientries iinfixes ikeys includes inclusiveScan inclusiveScan$ index indexOf indexRange infixes init interleave intermix interpolate intersection intersperse ipermutations iprefixes is isDisjoint isEmpty isEqual isSorted isUnique isubsequences isuffixes ivalues join keys last lastIndexOf length map map$ maximum maximumEntries maximumEntry maximums middle minimum minimumEntries minimumEntry minimums moveWithin moveWithin$ partialSort partialSort$ partition partitionEach permutations pop pop$ prefixes push push$ randomInfix randomPermutation randomPermutation$ randomPrefix randomSubsequence randomSuffix randomValue range rangeEntries rangedPartialSort rangedPartialSort$ rangedSort rangedSort$ reduce reduceRight reject reject$ rejectAt remove remove$ removePath$ repeat resize$ reverse reverse$ rotate rotate$ scanUntil scanUntilRight scanWhile scanWhileRight search searchAdjacentDuplicateValue searchAll searchInfix searchInfixAll searchInfixRight searchMaximumValue searchMaximumValues searchMinimumValue searchMinimumValues searchMismatchedValue searchRight searchSubsequence searchUnsortedValue searchValue searchValueAll searchValueRight set set$ setPath$ shallowClone shift shift$ slice slice$ some sort sort$ splice splice$ split splitAt subsequences suffixes swap swap$ swapRanges swapRanges$ symmetricDifference tail take takeRight takeWhile takeWhileRight union union$ unique unshift unshift$ values zip adjacent-combine cartesian-product clear copy-within count-each cut-at cut-at-right cut-right
Repository
| Stars | 16 on GitHub |
| Forks | 5 on GitHub |
| Commits | 560 |
| Committers | 4 |
| Avg per Author | 140.0 |
| DDS | 0.009 |
Rankings on npmjs.org
Overall
Top 4.3%
Downloads
Top 1.4%
Dependent packages
Top 0.3%
Dependent repos
Top 3.9%
Forks
Top 7.7%