The Map class
(No version information available, might only be in Git)
简介
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.
类摘要
Ds\Map
implements
Ds\Collection
{
public allocate
(
int $capacity
) :
void
public clear
(
void
) :
void
public copy
(
void
) :
Ds\Map
public diff
(
Ds\Map $map
) :
Ds\Map
public first
(
void
) :
Ds\Pair
public keys
(
void
) :
Ds\Set
public last
(
void
) :
Ds\Pair
public pairs
(
void
) :
Ds\Sequence
public skip
(
int $position
) :
Ds\Pair
public slice
(
int $index
[,
int $length
] ) :
Ds\Map
public union
(
Ds\Map $map
) :
Ds\Map
public values
(
void
) :
Ds\Sequence
public xor
(
Ds\Map $map
) :
Ds\Map
}
预定义常量
Ds\Map::MIN_CAPACITY
-
Table of Contents
User Contributed Notes
There are no user contributed notes for this page.