Search
tail-call-proxy
A template for creating npm packages using TypeScript and VSCode
v1.1.12 URL:
https://unpkg.com/tail-call-proxy@1.1.12/lib/index.js
Open
Browse Files
tail
tail-call
tailcall
proxy
lazy
utility
utilities
util
utils
memoize
memoization
functional
typescript
extra-iterable
An iterable is a sequence of values.
v3.3.0 URL:
https://unpkg.com/extra-iterable@3.3.0/index.js
Open
Browse Files
extra
iterable
callable
findAll
fromApply
fromCall
many
pop
shift
size
toCallable
toOnce
CombineFunction
CompareFunction
EndFunction
MapFunction
ProcessFunction
ReadFunction
ReduceFunction
TestFunction
END
accumulate
cartesianProduct
chunk
compare
concat
copy
copyWithin
count
countAs
cut
cutAt
cutAtRight
cutRight
cycle
difference
drop
dropRight
dropWhile
dropWhileRight
entries
every
fill
filter
filterAt
find
findRight
flat
flatMap
forEach
from
fromApplication
fromInvocation
fromIterator
fromRange
get
getAll
getPath
group
hasInfix
hasPath
hasPrefix
hasSubsequence
hasSuffix
hasValue
head
includes
index
indexOf
indexRange
init
interleave
intermix
interpolate
intersection
intersperse
is
isDisjoint
isEmpty
isEqual
isIterator
isList
isMany
isOnce
isUnique
iterator
join
keys
last
lastIndexOf
left
length
map
max
maxEntry
merge
middle
min
minEntry
moveWithin
partition
partitionAs
push
range
rangeEntries
reduce
reject
rejectAt
remove
repeat
reverse
right
rotate
scanUntil
scanUntilRight
scanWhile
scanWhileRight
search
searchAll
searchInfix
searchInfixAll
searchInfixRight
searchRight
searchSubsequence
searchValue
searchValueAll
searchValueRight
set
slice
some
splice
split
splitAt
swap
symmetricDifference
tail
take
takeRight
takeWhile
takeWhileRight
toInvokable
toMany
union
unique
unshift
values
zip
extra-iterable.web
An iterable is a sequence of values {web}.
v3.3.0 URL:
https://unpkg.com/extra-iterable.web@3.3.0/index.js
Open
Browse Files
extra
iterable
callable
findAll
fromApply
fromCall
many
pop
shift
size
toCallable
toOnce
CombineFunction
CompareFunction
EndFunction
MapFunction
ProcessFunction
ReadFunction
ReduceFunction
TestFunction
END
accumulate
cartesianProduct
chunk
compare
concat
copy
copyWithin
count
countAs
cut
cutAt
cutAtRight
cutRight
cycle
difference
drop
dropRight
dropWhile
dropWhileRight
entries
every
fill
filter
filterAt
find
findRight
flat
flatMap
forEach
from
fromApplication
fromInvocation
fromIterator
fromRange
get
getAll
getPath
group
hasInfix
hasPath
hasPrefix
hasSubsequence
hasSuffix
hasValue
head
includes
index
indexOf
indexRange
init
interleave
intermix
interpolate
intersection
intersperse
is
isDisjoint
isEmpty
isEqual
isIterator
isList
isMany
isOnce
isUnique
iterator
join
keys
last
lastIndexOf
left
length
map
max
maxEntry
merge
middle
min
minEntry
moveWithin
partition
partitionAs
push
range
rangeEntries
reduce
reject
rejectAt
remove
repeat
reverse
right
rotate
scanUntil
scanUntilRight
scanWhile
scanWhileRight
search
searchAll
searchInfix
searchInfixAll
searchInfixRight
searchRight
searchSubsequence
searchValue
searchValueAll
searchValueRight
set
slice
some
splice
split
splitAt
swap
symmetricDifference
tail
take
takeRight
takeWhile
takeWhileRight
toInvokable
toMany
union
unique
unshift
values
zip
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