Search
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-map
A group of functions for working with Maps.
v3.2.0 URL:
https://unpkg.com/extra-map@3.2.0/index.js
Open
Browse Files
extra
map
entry
fromEntries
fromEntries$
hasKey
key
length
subset
CombineFunction
CompareFunction
EndFunction
Entries
Lists
MapFunction
ProcessFunction
ReadFunction
ReduceFunction
TestFunction
cartesianProduct
chunk
compare
concat
concat$
count
countAs
difference
difference$
drop
drop$
entries
every
filter
filter$
filterAt
filterAt$
find
findAll
flat
flatMap
forEach
from
from$
fromKeys
fromLists
fromValues
get
getAll
getPath
has
hasEntry
hasPath
hasSubset
hasValue
head
intersection
intersection$
intersectionKeys
is
isDisjoint
isEmpty
isEqual
join
keys
map$
max
maxEntry
min
minEntry
partition
partitionAs
randomEntry
randomKey
randomSubset
range
rangeEntries
reduce
reject
reject$
rejectAt
rejectAt$
remove
remove$
removePath$
search
searchAll
searchValue
searchValueAll
set
set$
setPath$
size
some
subsets
swap
swap$
symmetricDifference
symmetricDifference$
tail
take
take$
union
union$
unionKeys
values
zip
extra-map.web
A group of functions for working with Maps {web}.
v3.2.0 URL:
https://unpkg.com/extra-map.web@3.2.0/index.js
Open
Browse Files
extra
map
entry
fromEntries
fromEntries$
hasKey
key
length
subset
CombineFunction
CompareFunction
EndFunction
Entries
Lists
MapFunction
ProcessFunction
ReadFunction
ReduceFunction
TestFunction
cartesianProduct
chunk
compare
concat
concat$
count
countAs
difference
difference$
drop
drop$
entries
every
filter
filter$
filterAt
filterAt$
find
findAll
flat
flatMap
forEach
from
from$
fromKeys
fromLists
fromValues
get
getAll
getPath
has
hasEntry
hasPath
hasSubset
hasValue
head
intersection
intersection$
intersectionKeys
is
isDisjoint
isEmpty
isEqual
join
keys
map$
max
maxEntry
min
minEntry
partition
partitionAs
randomEntry
randomKey
randomSubset
range
rangeEntries
reduce
reject
reject$
rejectAt
rejectAt$
remove
remove$
removePath$
search
searchAll
searchValue
searchValueAll
set
set$
setPath$
size
some
subsets
swap
swap$
symmetricDifference
symmetricDifference$
tail
take
take$
union
union$
unionKeys
values
zip
extra-set.web
A pack of functions for working with Sets {web}.
v3.2.0 URL:
https://unpkg.com/extra-set.web@3.2.0/index.js
Open
Browse Files
extra
set
default
entry
key
keys
length
randomKey
search
searchAll
value
CombineFunction
CompareFunction
EndFunction
MapFunction
ProcessFunction
ReadFunction
ReduceFunction
TestFunction
add
add$
cartesianProduct
chunk
compare
concat
concat$
count
countAs
difference
difference$
drop
drop$
entries
every
filter
filter$
find
findAll
flat
flatMap
forEach
from
from$
has
hasSubset
head
intersection
intersection$
is
isDisjoint
isEmpty
isEqual
join
map
map$
max
min
partition
partitionAs
randomEntry
randomSubset
randomValue
range
reduce
reject
reject$
remove
remove$
size
some
subsets
symmetricDifference
symmetricDifference$
tail
take
take$
union
union$
values