menu
lonate package
documentation
lonate
ArraySorted extension
ArraySorted
brightness_4
ArraySorted<
T
>
extension
Null safety
on
List
<
T
>
Properties
sortedUniq
→
List
sortedUniq
Creates a duplicate-free version of an array, using
read-only
Methods
sortedIndex
(
dynamic
value
)
→
int
sortedIndex
is like
indexOf
but except that it performs a binary search on a sorted array. @param
value
the value to find the index of
sortedIndexOf
(
dynamic
value
,
[
int
?
fromIndex
]
)
→
int
sortedIndexBy
is like
sortedIndex
except that it accepts a iteratee for value @param
value
the value to find the index of @param
fromIndex
the index of the first element to be searched
sortedUniqBy
(
Function
iteratee
)
→
List
sortedUniqBy
Creates a duplicate-free version of an array, using except that it's designed and optimized for sorted arrays.
lonate package
documentation
lonate
ArraySorted extension
lonate library
Extensions
ArrayCliz
ArrayDifference
ArrayDrop
ArrayFlatten
ArrayFrom
ArrayIndexing
ArrayPull
ArraySorted
ArrayUnion
ArrayZip
CollectiveList
CollectiveMap
CollectiveNum
RichFunction
StringCase
StringEscape
StringMunipulator
StringPad
Properties
MAX_ARRAY_LENGTH
timeouts
Functions
add
arrayMax
arrayMean
arrayMin
arraySum
assign
baseFill
camelCase
capitalize
ceil
chunk
clamp
compact
debounce
deburr
delay
difference
differenceBy
divide
drop
dropRight
dropWhile
escape
escapeRegExp
fill
findIndex
findKey
flatten
flattenDeep
flattenDepth
floor
fromPairs
get
hasInObject
hasObject
initial
inRange
intersection
isEqual
isGreater
isGreaterEqual
isLength
isLess
kebabCase
lastIndexOf
lowerFirst
mapsEqual
median
memoize
mode
multipleComputation
multiply
pad
padEnd
padStart
pull
pullAt
random
repeat
replace
round
snakeCase
sortedIndex
sortedIndexOf
sortedUniq
sortedUniqBy
standardDeviation
startCase
startsWith
subtract
tail
throttle
truncate
union
unionBy
uniq
uniqueId
upperFirst
values
variance
withOut
zip
Properties
sortedUniq
Methods
sortedIndex
sortedIndexOf
sortedUniqBy