library headbanger

syaiful6/headbanger

Headbanger! PHP Data structure

Headbanger

PHP data structure and or collections., _(*1)

Motivation: PHP only give us array and object as compound type. There are no list, hash table, set, etc. Array on PHP doest it all. This make operation on array not predictable, is sometimes act as ordered set, list, ordered map. This package aim to provide some basic data structure to cover this gap., _(*2)

Install

composer require syaiful6/headbanger, _(*3)

This package contains implementations of Map, List, Set and Str. We consider string as container, because it can be accessed via array notation and when we want to iterate string, we actually want to iterate over character., _(*4)

Map

Python call this dict, Ruby call this type Hash. Whatever the name, this data type can 'map' key value pair. Typically the key are unique (within one map)., _(*5)

The main operations on a map are storing a value with some key and extracting the value given the key. It's also should possible to delete a key-value pair for the given key., _(*6)

This package provide one implementation for this data type. HashMap that also implements Countable, Traversable and ArrayAccess. So you can treat this instance as array. To delete key-value pair use unset($hash['somekey']), _(*7)

Note: HashMap is unordered map and not permit adding item during iteration, replacing a key-value is fine. Iterate over map will give you the key only, with this key you can access the value anyway. If you need the value use values method, if you need both use ```items`` method., _(*8)

$map = new Headbanger\HashMap();
// Add item, or just give map your array or any traversable on constructor
$map['one'] = 1;
$map['two'] = 2;
$map['three'] = 3;
// deleting
unset($map['one']);
// check if item exists
isset($map['one']);

List

A list or sequence, represents an ordered sequence of values, these values may occur more than once within on list. Think of it as finite sequence. Currently only one implementation provided: ArrayList. Using SplFixedArray as their storage., _(*9)

You can use ArrayList as Stack, where the last element added is the first element retrieved (“last-in, first-out”). Use push to add item, and retrieve an item from the top use pop (without argument). However dont use ArrayList as Queue, they are not efficient for this purpose. But it possible., _(*10)

Set

A set is an unordered collection with no duplicate elements. The common operations are remove duplicates entries and membership testing. Set also support mathematical operations like union, intersection, difference, etc., _(*11)