associative array

It is a simple way of implementing an associative array.

In Perl they are also used to refer to elements of an associative array.

If no value is found, some associative array implementations raise an exception.

It is considered a best practice to use symbols as keys to an associative array in Ruby.

A more flexible approach is to use something similar to an Associative Array.

In computer science, finite map is a synonym for an associative array.

They are used most for associative arrays, databases, caches, and sets.

An associative array can be declared using the following syntax:

Traditionally, associative arrays are heavily used in the expression of optimization problems.

Associative array, a specific type of Set (computer science)

In Perl 6 they combine quoting and associative array lookup.

The dictionary problem is the task of designing a data structure that implements an associative array.

The key implies an ordering; the elements of an associative array can be read out in lexicographic order.

Versions of Delphi prior to 2009 do not offer direct support for associative arrays.

Go has built-in, language-level support for associative arrays, called maps.

You can loop through an associative array as follows:

Content-addressable memory is a form of direct hardware-level support for associative arrays.

The operations that are usually defined for an associative array are:

Hash tables, in turn, are used to implement associative arrays and dynamic sets.

Constructing and using an associative array (called hashes in Ruby):

The operations defined for a u-form are similar to associative arrays:

An associative array key may be prefixed with a question mark ( ? )

Many data serialization formats also support associative arrays (see this table)

JavaScript objects are associative arrays, augmented with prototypes (see below).

Such arrays are typically called associative arrays or maps.