The Map class
Map
&reftitle.intro;
A Map is a sequential collection of key-value pairs, almost identical to an
&array; used in a similar context. Keys can be any type, but must be unique.
Values are replaced if added to the map using the same key.
Strengths
Keys and values can be any type, including objects.
Supports array syntax (square brackets).
Insertion order is preserved.
Performance and memory efficiency is very similar to an &array;.
Automatically frees allocated memory when its size drops low enough.
Weaknesses
Can’t be converted to an array when objects are used as keys.
&reftitle.classsynopsis;
Ds\Map
Ds\Map
Ds\Collection
ArrayAccess
Constants
const
int
Ds\Map::MIN_CAPACITY
16
&Methods;
&reftitle.constants;
Ds\Map::MIN_CAPACITY
&reftitle.changelog;
&Version;
&Description;
PECL ds 1.3.0
The class now implements ArrayAccess.
&reference.ds.ds.entities.map;