
Security News
Browserslist-rs Gets Major Refactor, Cutting Binary Size by Over 1MB
Browserslist-rs now uses static data to reduce binary size by over 1MB, improving memory use and performance for Rust-based frontend tools.
associative-array
Advanced tools
A combination of Map and Array that maintains key ordering.
var AssociativeArray = require('associative-array');
var arr = new AssociativeArray();
arr.push('key', {value: 'value'});
arr.push('key2', {value: 'value2'});
arr.push('key3', {value: 'value3'});
arr.has('key'); //true
arr.has('beans'); //false
arr.length; //3
arr.push('key3', {value: 'value3 again'});
arr.length; //3
arr.map(function(val, idx, key) {
return idx + ':' + val.value + ':' key;
}); //['0:value:key', '1:value2:key2', '2:value3:key3']
arr.remove('key2');
arr.map(function(val, idx, key) {
return idx + ':' + val.value + ':' key;
}); //['0:value:key', '1:value3:key3']
Construct a new AssociativeArray
.
size
int - the initial size of the underlying Array
.The number of items currently stored in the AssociativeArray
.
Push a new key, value pair onto the AssociativeArray
. Will not affect the AssociativeArray
if key
is already in it.
key
mixed - the key to associate with value
. Can be any key supported by Map
.value
mixed - the value to storePop the last value off of the AssociativeArray
.
Check whether the AssociativeArray
contains key
.
key
mixed - the key to look forGet the value associated with key
.
key
mixed - the key to look forGet the value stored at index
.
index
int - the index to look upGet the first value.
Get the last value.
Set a key, value pair at a particular index in the AssociativeArray
.
Replaces any value that previously occupied that index.
If key
is already present in the AssociativeArray
, value
will replace the old value if index
matches the current index of key
, or if index
is not supplied.
Otherwise, set()
will not affect the AssociativeArray
if key
is already in it.
Omitting index
makes this equivalent to AssociativeArray.push(key, value)
when key
is not already present in the AssociativeArray
.
key
mixed - the key to associate with value
. Can be any key supported by Map
.value
mixed - the value to storeindex
int - the index to store value
atClear all values from the AssociativeArray
.
Iterate over the values in the AssociativeArray
.
fn
function - the callback to execute with each value, index, and key. If fn
returns false, the loop will be broken.Map the values in the AssociativeArray
to a plain Array
.
fn
function - the callback to execute with each value, index, and key.Return a plain Array
of values in the AssociativeArray
which pass the fn
test.
fn
function - the callback to test each value with. Should return boolean.Remove the value associated with key
from the AssociativeArray
.
key
mixed - the key to look forFAQs
A combination of Map and Array, with order of keys maintained.
We found that associative-array demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Browserslist-rs now uses static data to reduce binary size by over 1MB, improving memory use and performance for Rust-based frontend tools.
Research
Security News
Eight new malicious Firefox extensions impersonate games, steal OAuth tokens, hijack sessions, and exploit browser permissions to spy on users.
Security News
The official Go SDK for the Model Context Protocol is in development, with a stable, production-ready release expected by August 2025.