La clase Map

(PECL ds >= 1.0.0)

Introducción

Un Map es una colección secuencial de pares clave-valor, casi identico a un array usado en un contexto similar. Las claves pueden ser de cualquier tipo, pero deben ser únicos. Los valores se reemplazan si se agregan al mapa usando la misma clave.

Fortalezas

Las claves y valores pueden ser de cualquer tipo, incluyendo objetos.
Soporta la sintaxis array (corchetes).
Se mantiene el orden de inserción.
El rendimiento y la eficiencia de memoria son muy similares al de un array.
Automáticamente libera la memoria asignada cuando su tamaño cae lo suficientemente bajo.

Debilidades

No puede ser convertido a un array cuando los objetos son usados como claves.

Sinopsis de la Clase

classDs\MapimplementsDs\Collection, ArrayAccess {

constintMIN_CAPACITY = 16;

publicallocate(int$capacity): void

publicapply(callable$callback): void

publiccapacity(): int

publicclear(): void

publiccopy(): Ds\Map

publicdiff(Ds\Map$map): Ds\Map

publicfilter(callable$callback = ?): Ds\Map

publicfirst(): Ds\Pair

publicget(mixed$key, mixed$default = ?): mixed

publichasKey(mixed$key): bool

publichasValue(mixed$value): bool

publicintersect(Ds\Map$map): Ds\Map

publicisEmpty(): bool

publickeys(): Ds\Set

publicksort(callable$comparator = ?): void

publicksorted(callable$comparator = ?): Ds\Map

publiclast(): Ds\Pair

publicmap(callable$callback): Ds\Map

publicmerge(mixed$values): Ds\Map

publicpairs(): Ds\Sequence

publicput(mixed$key, mixed$value): void

publicputAll(mixed$pairs): void

publicreduce(callable$callback, mixed$initial = ?): mixed

publicremove(mixed$key, mixed$default = ?): mixed

publicreverse(): void

publicreversed(): Ds\Map

publicskip(int$position): Ds\Pair

publicslice(int$index, int$length = ?): Ds\Map

publicsort(callable$comparator = ?): void

publicsorted(callable$comparator = ?): Ds\Map

publicsum(): int|float

publictoArray(): array

publicunion(Ds\Map$map): Ds\Map

publicvalues(): Ds\Sequence

publicxor(Ds\Map$map): Ds\Map

}

Constantes predefinidas

Ds\Map::MIN_CAPACITY

Historial de cambios

Versión	Descripción
PECL ds 1.3.0	La clase ahora implementa ArrayAccess.

Tabla de contenidos

Ds\Map::allocate — Allocates enough memory for a required capacity
Ds\Map::apply — Updates all values by applying a callback function to each value
Ds\Map::capacity — Returns the current capacity
Ds\Map::clear — Removes all values
Ds\Map::__construct — Creates a new instance
Ds\Map::copy — Returns a shallow copy of the map
Ds\Map::count — Returns the number of values in the map
Ds\Map::diff — Creates a new map using keys that aren't in another map
Ds\Map::filter — Creates a new map using a callable to determine which pairs to include
Ds\Map::first — Returns the first pair in the map
Ds\Map::get — Returns the value for a given key
Ds\Map::hasKey — Determines whether the map contains a given key
Ds\Map::hasValue — Determines whether the map contains a given value
Ds\Map::intersect — Creates a new map by intersecting keys with another map
Ds\Map::isEmpty — Returns whether the map is empty
Ds\Map::jsonSerialize — Returns a representation that can be converted to JSON
Ds\Map::keys — Returns a set of the map's keys
Ds\Map::ksort — Sorts the map in-place by key
Ds\Map::ksorted — Returns a copy, sorted by key
Ds\Map::last — Returns the last pair of the map
Ds\Map::map — Returns the result of applying a callback to each value
Ds\Map::merge — Returns the result of adding all given associations
Ds\Map::pairs — Returns a sequence containing all the pairs of the map
Ds\Map::put — Associates a key with a value
Ds\Map::putAll — Associates all key-value pairs of a traversable object or array
Ds\Map::reduce — Reduces the map to a single value using a callback function
Ds\Map::remove — Removes and returns a value by key
Ds\Map::reverse — Reverses the map in-place
Ds\Map::reversed — Returns a reversed copy
Ds\Map::skip — Returns the pair at a given positional index
Ds\Map::slice — Returns a subset of the map defined by a starting index and length
Ds\Map::sort — Sorts the map in-place by value
Ds\Map::sorted — Returns a copy, sorted by value
Ds\Map::sum — Returns the sum of all values in the map
Ds\Map::toArray — Converts the map to an array
Ds\Map::union — Creates a new map using values from the current instance and another map
Ds\Map::values — Returns a sequence of the map's values
Ds\Map::xor — Creates a new map using keys of either the current instance or of another map, but not of both