Preparing search index...
The search index is not available
extra-string
extra-string
ngrams
Function ngrams
ngrams
(
x
,
n
)
:
string
[]
Get n-grams of a string.
Parameters
x
:
string
a string
n
:
number
n-gram length
Returns
string
[]
[x[0:n], x[1:n+1], ...]
Settings
Member Visibility
Protected
Private
Inherited
External
Theme
OS
Light
Dark
extra-
string
at
infix
is
Infix
is
Prefix
is
Suffix
left
prefix
right
size
suffix
Compare
Function
Map
Function
Replace
Function
Test
Function
DIGITS
HEX_
DIGITS
LETTERS
LOWERCASE
MAX_
CODE_
POINT
MIN_
CODE_
POINT
OCT_
DIGITS
PRINTABLE
PUNCTUATION
UPPERCASE
WHITESPACE
begin
char
At
char
Code
At
code
Point
At
code
Point
Range
compare
concat
count
Each
Matching
Ngram
count
Each
Ngram
count
Matching
Ngrams
count
Ngrams
count
Unique
Matching
Ngrams
count
Unique
Ngrams
damerau
Levenshtein
Distance
end
ends
With
euclidean
Distance
filter
from
from
Char
Code
from
Code
Point
get
get
All
hamming
Distance
includes
index
index
Of
index
Range
is
is
Character
is
Empty
is
Equal
jaccard
Distance
jaccard
Index
jaro
Distance
jaro
Similarity
jaro
Winkler
Distance
jaro
Winkler
Similarity
last
Index
Of
length
levenshtein
Distance
locale
Compare
longest
Common
Infix
longest
Common
Prefix
longest
Common
Suffix
longest
Uncommon
Infixes
match
match
All
matching
Ngrams
middle
ngrams
normalize
of
pad
End
pad
Start
repeat
replace
reverse
search
set
slice
sorensen
Dice
Distance
sorensen
Dice
Index
sort
spaces
splice
split
starts
With
substring
to
Baseline
to
Camel
Case
to
Kebab
Case
to
Locale
Lower
Case
to
Locale
Upper
Case
to
Lower
Case
to
Pascal
Case
to
Snake
Case
to
String
to
Subscript
to
Superscript
to
Upper
Case
trim
trim
End
trim
Start
tversky
Distance
tversky
Index
unique
Matching
Ngrams
unique
Ngrams
value
Of
Generated using
TypeDoc
Get n-grams of a string.