@thi.ng/transducers

Collection of ~170 lightweight, composable transducers, reducers, generators, iterators for functional data transformations

v9.2.8 URL: https://unpkg.com/@thi.ng/transducers@9.2.8/index.js

enhancedmath

This package contains some enhanced mathematical operations

v3.0.2 URL: https://unpkg.com/enhancedmath@3.0.2/lib/index.js

math probability algebra matrix bisection discriminator factorial fibonacci combination permutation determinant transpose typescript

brute-force-generator

🔨 Build a dictionary by permuting passed letters (using ES2015+)

v1.0.11 URL: https://unpkg.com/brute-force-generator@1.0.11/src/index.js

Open Browse Files

cli brute force brute force generate generator dictionary dict permutation

js-combinatorics

Simple combinatorics like power set, combination, and permutation in JavaScript

v2.1.2 URL: https://unpkg.com/js-combinatorics@2.1.2/combinatorics.js

Open Browse Files

Combinatorics combination permutation

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