array.prototype.at

An ES-spec-compliant (proposed) Array.prototype.at shim/polyfill/replacement that works as far down as ES3

v1.1.3 URL: https://unpkg.com/array.prototype.at@1.1.3/index.js

Array.prototype.at Array.prototype.item String.prototype.at String.prototype.item item at array shim polyfill es-shim API

string.prototype.at

An ES-spec-compliant (proposed) String.prototype.at shim/polyfill/replacement that works as far down as ES3

v1.0.6 URL: https://unpkg.com/string.prototype.at@1.0.6/index.js

Open Browse Files

String.prototype.at String.prototype.item Array.prototype.at Array.prototype.item at item string shim polyfill es-shim API

@putout/plugin-apply-at

🐊Putout plugin adds ability apply at()

v2.0.0 URL: https://unpkg.com/@putout/plugin-apply-at@2.0.0/lib/apply-at.js

Open Browse Files

putout putout-plugin plugin at

circular-at

Access array items at any positive or negative index. If the index is out of bounds, it will be wrapped around the length of the array.

v1.0.4 URL: https://unpkg.com/circular-at@1.0.4/index.js

Open Browse Files

array index nth circular cyclic negative at

extra-array

An array is a collection of values, stored contiguously.

v4.3.1 URL: https://unpkg.com/extra-array@4.3.1/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