walk-back

Walk up the directory tree until the specified path is found.

v5.1.1 URL: https://unpkg.com/walk-back@5.1.1/index.js

Open Browse Files

walk up back filesystem fs find file search system

koa-convert

convert modern Koa legacy generator-based middleware to promise-based middleware

v2.0.0 URL: https://unpkg.com/koa-convert@2.0.0/index.js

Open Browse Files

koa middleware convert back generator promise generator-based-middleware promise-based-middleware support

extra-array

An array is a collection of values, stored contiguously.

v4.2.0 URL: https://unpkg.com/extra-array@4.2.0/index.js

Open Browse Files

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

extra-array.web

An array is a collection of values, stored contiguously {web}.

v4.2.0 URL: https://unpkg.com/extra-array.web@4.2.0/index.js

Open Browse Files

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

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