Search
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-string
A collection of common string functions.
v2.2.0 URL:
https://unpkg.com/extra-string@2.2.0/index.js
Open
Browse Files
extra
string
at
infix
isInfix
isPrefix
isSuffix
left
prefix
right
size
suffix
CompareFunction
MapFunction
ReplaceFunction
TestFunction
DIGITS
HEX_DIGITS
LETTERS
LOWERCASE
MAX_CODE_POINT
MIN_CODE_POINT
OCT_DIGITS
PRINTABLE
PUNCTUATION
UPPERCASE
WHITESPACE
begin
charAt
charCodeAt
codePointAt
codePointRange
compare
concat
countEachMatchingNgram
countEachNgram
countMatchingNgrams
countNgrams
countUniqueMatchingNgrams
countUniqueNgrams
damerauLevenshteinDistance
end
endsWith
euclideanDistance
filter
from
fromCharCode
fromCodePoint
get
getAll
hammingDistance
includes
index
indexOf
indexRange
is
isCharacter
isEmpty
isEqual
jaccardDistance
jaccardIndex
jaroDistance
jaroSimilarity
jaroWinklerDistance
jaroWinklerSimilarity
lastIndexOf
length
levenshteinDistance
localeCompare
longestCommonInfix
longestCommonPrefix
longestCommonSuffix
longestUncommonInfixes
match
matchAll
matchingNgrams
middle
ngrams
normalize
of
padEnd
padStart
repeat
replace
reverse
search
set
slice
sorensenDiceDistance
sorensenDiceIndex
sort
spaces
splice
split
startsWith
substring
toBaseline
toCamelCase
toKebabCase
toLocaleLowerCase
toLocaleUpperCase
toLowerCase
toPascalCase
toSnakeCase
toString
toSubscript
toSuperscript
toUpperCase
trim
trimEnd
trimStart
tverskyDistance
tverskyIndex
uniqueMatchingNgrams
uniqueNgrams
valueOf
extra-string.web
A collection of common string functions {web}.
v2.2.0 URL:
https://unpkg.com/extra-string.web@2.2.0/index.js
Open
Browse Files
extra
string
at
infix
isInfix
isPrefix
isSuffix
left
prefix
right
size
suffix
CompareFunction
MapFunction
ReplaceFunction
TestFunction
DIGITS
HEX_DIGITS
LETTERS
LOWERCASE
MAX_CODE_POINT
MIN_CODE_POINT
OCT_DIGITS
PRINTABLE
PUNCTUATION
UPPERCASE
WHITESPACE
begin
charAt
charCodeAt
codePointAt
codePointRange
compare
concat
countEachMatchingNgram
countEachNgram
countMatchingNgrams
countNgrams
countUniqueMatchingNgrams
countUniqueNgrams
damerauLevenshteinDistance
end
endsWith
euclideanDistance
filter
from
fromCharCode
fromCodePoint
get
getAll
hammingDistance
includes
index
indexOf
indexRange
is
isCharacter
isEmpty
isEqual
jaccardDistance
jaccardIndex
jaroDistance
jaroSimilarity
jaroWinklerDistance
jaroWinklerSimilarity
lastIndexOf
length
levenshteinDistance
localeCompare
longestCommonInfix
longestCommonPrefix
longestCommonSuffix
longestUncommonInfixes
match
matchAll
matchingNgrams
middle
ngrams
normalize
of
padEnd
padStart
repeat
replace
reverse
search
set
slice
sorensenDiceDistance
sorensenDiceIndex
sort
spaces
splice
split
startsWith
substring
toBaseline
toCamelCase
toKebabCase
toLocaleLowerCase
toLocaleUpperCase
toLowerCase
toPascalCase
toSnakeCase
toString
toSubscript
toSuperscript
toUpperCase
trim
trimEnd
trimStart
tverskyDistance
tverskyIndex
uniqueMatchingNgrams
uniqueNgrams
valueOf
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