Dimsh\Models\Collections\Collection

Complexity

Total Complexity

83

Size/Duplication

Total Lines	548
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Test Coverage

Coverage

61.53%

Importance

Changes

0

33 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	4	1
A	count()	0	4	1
A	preAdd()	0	3	1
A	add()	0	5	1
A	addByReference()	0	6	1
A	offsetGet()	0	8	2
A	offsetExists()	0	4	1
A	rewind()	0	5	1
A	next()	0	5	1
A	prev()	0	5	1
A	valid()	0	7	2
A	current()	0	7	2
A	key()	0	6	1
A	position()	0	4	1
A	last()	0	10	2
A	first()	0	10	2
A	keys()	0	4	1
A	toArray()	0	4	1
A	swap()	0	17	4
A	byPositionGet()	0	10	2
A	offsetPosition()	0	6	1
A	isEmpty()	0	4	1
A	nextOffset()	0	11	2
A	offsetSet()	0	9	2
A	offsetUnset()	0	11	4
A	merge()	0	12	4
B	swapReorder()	0	27	7
A	diffKey()	0	9	2
C	arrayDiffRecursiveAssoc()	0	29	12
A	diffRecursiveAssoc()	0	9	2
C	arrayDiffRecursive()	0	29	12
A	diffRecursive()	0	9	2
A	intersectKey()	0	10	3

<?php
/*
 * This file is part of Dimsh\Models\Collections;
 * (c) Abdulrahman Dimashki <idimsh@gmail.com>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

namespace Dimsh\Models\Collections;

/**
 * Class Collection
 *
 * @method {} offsetGet();
 * @method {} @current()
 * @method {} @last()
 * @method {} @first()
 *
 * @package Dimsh\Models\Collections;
 */
class Collection implements \Iterator, \ArrayAccess, \Countable
{
    /**
     * @var array
     */
    protected $list = [];

    /**
     * @var int
     */
    protected $position = 0;

    /**
     * this is required for the unset() <=> offsetUnset() where an exception is
     * thrown if next() or rewind() is not called after unset.
     * @var bool
     */
    protected $next_or_rewind_required = false;

    public function __construct()
    {
        $this->position = 0;
    }

    /**
     * @return int
     */
    public function count()
    {
        return count($this->list);
    }

    /**
     * This method is meant to be overridden by child Classes in order to throw
     * an Exception if the value can't be added, else it will be added normally.
     *
     * @param mixed $value
     */
    protected function preAdd($value)
    {
    }

    /**
     * Get the next numeric offset.
     *
     * we get the MAX numeric offset we have and increment it by 1.
     */
    protected function nextOffset()
    {
        $keys = array_keys($this->list);
        $keys = array_filter($keys, 'is_numeric'); // get numeric keys only
        if ($keys) {

The expression $keys of type array is implicitly converted to a boolean; are you sure this is intended? If so, consider using ! empty($expr) instead to make it clear that you intend to check for an array without elements.

            $last_key = max($keys);
        } else {
            $last_key = -1;
        }
        return $last_key + 1;
    }

    /**
     * @param string|int $offset
     * @param mixed      $value
     *
     * @throws \Exception
     */
    public function offsetSet($offset, $value)
    {
        if ($offset === null) {
            // a value is appended using [] array append operator.
            $offset = $this->nextOffset();
        }
        $this->preAdd($value);
        $this->list[$offset] = &$value;
    }

    /**
     * This is not in the interface, add an item.
     * @return self
     * @throws \Exception
     */
    public function add($item)
    {
        $this->offsetSet(null, $item);
        return $this;
    }

    /**
     * This is not in the interface, add an item passing it by reference.
     *
     * This will only accept variables as input.
     *
     * @return self
     * @throws \Exception
     */
    public function addByReference(&$item)
    {
        $this->preAdd($item);
        $this->list[$this->nextOffset()] = &$item;
        return $this;
    }

    /**
     * @param string|int $offset
     *
     * @return mixed|null
     */
    public function &offsetGet($offset)
    {
        if (array_key_exists($offset, $this->list)) {
            return $this->list[$offset];
        }
        $null = null;
        return $null;
    }

    /**
     * @return bool
     */
    public function offsetExists($offset)
    {
        return (array_key_exists($offset, $this->list));
    }

    public function offsetUnset($offset)
    {
        $offset_pos = $this->offsetPosition($offset);
        if ($offset_pos !== false && $this->position === $offset_pos) {
            $this->next_or_rewind_required = true;
            if ($this->position > 0) {
                $this->position--;
            }
        }
        unset($this->list[$offset]);
    }

    public function rewind()
    {
        $this->position                = 0;
        $this->next_or_rewind_required = false;
    }

    public function next()
    {
        ++$this->position;
        $this->next_or_rewind_required = false;
    }

    /**
     * This is not in the interface, go back in the array.
     */
    public function prev()
    {
        --$this->position;
        $this->next_or_rewind_required = false;
    }

    /**
     * @return bool
     */
    public function valid()
    {
        if (empty($this->list)) {
            return false;
        }
        return array_key_exists($this->position, array_keys($this->list));
    }

    public function current()
    {
        if ($this->next_or_rewind_required) {
            throw new \Exception('Calling next or rewind is required after call to unset, current item can\'t be accessed otherwise because it is removed.');
        }
        return $this->list[$this->key()];
    }

    /**
     * @return string
     */
    public function key()
    {
        $keys   = array_keys($this->list);
        $offset = $keys[$this->position];
        return $offset;
    }

    /**
     * @return int
     */
    public function position()
    {
        return $this->position;
    }

    /**
     * This is not in the interface, Get the last item.
     */
    public function last()
    {
        $keys   = array_keys($this->list);
        $offset = array_pop($keys);
        if (array_key_exists($offset, $this->list)) {
            return $this->list[$offset];
        }
        $null = null;
        return $null;
    }

    /**
     * This is not in the interface, Get the first item.
     */
    public function first()
    {
        $keys   = array_keys($this->list);
        $offset = array_shift($keys);
        if (array_key_exists($offset, $this->list)) {
            return $this->list[$offset];
        }
        $null = null;
        return $null;
    }

    /**
     * This is not in the interface, Return the keys of the internal list.
     *
     * @return array
     */
    public function keys()
    {
        return array_keys($this->list);
    }

    /**
     * This is not in the interface, cast the internal list to an array.
     *
     * @return array
     */
    public function toArray()
    {
        return $this->list;
    }


    /**
     * This is not in the interface, merge this object with another object and act
     * like array_merge, numeric indexes are added, other indexes are overridden.
     *
     * This method will alter the current object.
     *
     * @param Collection $another_list
     *
     * @return self
     *
     * @throws \Exception
     *
     */
    public function merge(Collection $another_list)
    {
        for ($another_list->rewind(); $another_list->valid(); $another_list->next()) {
            $key = $another_list->key();
            try {
                $this->offsetSet(is_numeric($key) ? null : $key, $another_list->current());
            } catch (\Exception $e) {
                throw $e;
            }
        }
        return $this;
    }

    /**
     * Change the position of item at $offset1 in the internal array to be at
     * the position of item at $offset2 and vise versa.
     *
     * @param $offset1
     * @param $offset2
     *
     * @return $this
     * @throws \Exception
     */
    public function swap($offset1, $offset2)
    {
        $pos1 = $this->offsetPosition($offset1);
        $pos2 = $this->offsetPosition($offset2);
        if ($pos1 === false || $pos2 === false) {
            // offset does not exist
            throw new \Exception("Trying to swap non exist offsets");
        }
        if ($pos1 == $pos2) {
            return $this;
        }
        $temp           = $this[$offset1];
        $this[$offset1] = $this[$offset2];
        $this[$offset2] = $temp;

        return $this;
    }

    /**
     * Change the position of item at $offset1 in the internal array to be at
     * the position of item at $offset2 and vise versa using re-order and refilling
     * the array
     *
     * @param $offset1
     * @param $offset2
     *
     * @return self
     *
     * @throws \Exception
     */
    public function swapReorder($offset1, $offset2)
    {
        $pos1 = $this->offsetPosition($offset1);
        $pos2 = $this->offsetPosition($offset2);
        if ($pos1 === false || $pos2 === false) {
            // offset does not exist
            throw new \Exception("Trying to swap non exist offsets");
        }
        if ($pos1 == $pos2) {
            return $this;
        }

        $clone = clone $this;
        for ($clone->rewind(); $clone->valid(); $clone->next()) {
            $key      = $clone->key();
            $curr_pos = $clone->position();
            if ($curr_pos === $pos1) {
                $this[$key] = $clone->offsetGet($offset2);
            } elseif ($curr_pos === $pos2) {
                $this[$key] = $clone->offsetGet($offset1);
            } else {
                $this[$key] = $clone->current();
            }
        }

        return $this;
    }


    /**
     * Get the item by internal pointer numeric position and not by the offset.
     *
     * This is not in the interface.
     *
     * @param int $pos
     *
     * @return null|mixed
     */
    public function byPositionGet($pos)
    {
        $keys = $this->keys();
        if (array_key_exists($pos, $keys)) {
            $offset = $keys[$pos];
            return $this->list[$offset];
        }

        return null;
    }

    /**
     * Get the internal pointer numeric position which corresponds to the
     * offset passed.
     * this is not in the interface
     *
     * @param $offset
     *
     * @return int|FALSE
     */
    public function offsetPosition($offset)
    {
        $keys = array_keys($this->list);
        $key  = array_search($offset, $keys);
        return $key;
    }

    /**
     * Check if this container is empty.
     *
     * This is not in the interface
     * @return bool
     */
    public function isEmpty()
    {
        return count($this) === 0;
    }

    /**
     * Perform array_diff_key against another list where the first parameter is
     * this collection and the second is the new list.
     *
     * This will return a new Collection.
     *
     * @param Collection $another_list
     *
     * @return Collection
     */
    public function diffKey(Collection $another_list)
    {
        $diff     = array_diff_key($this->toArray(), $another_list->toArray());
        $new_list = new static();
        foreach ($diff as $key => $value) {
            $new_list[$key] = $value;
        }
        return $new_list;
    }

    /**
     * A version of php array_diff_assoc which is recursive.
     *
     * array_diff_assoc — Computes the difference of arrays with additional index check
     *
     * @param array $array1
     * @param array $array2
     *
     * @return array
     */
    protected static function arrayDiffRecursiveAssoc(array $array1, array $array2)
    {
        $ret = array();

        foreach ($array1 as $key1 => $value1) {
            if (!array_key_exists($key1, $array2)) {
                $ret[$key1] = $value1;
                continue;
            }
            if (is_array($value1) && is_array($array2[$key1])) {
                $recursive_diff = self::arrayDiffRecursiveAssoc($value1, $array2[$key1]);
                if (count($recursive_diff)) {
                    $ret[$key1] = $recursive_diff;
                }
            } elseif ($value1 instanceof Collection && $array2[$key1] instanceof Collection) {
                $recursive_diff = $value1->diffRecursiveAssoc($array2[$key1]);
                if ($recursive_diff->count()) {
                    $ret[$key1] = $recursive_diff;
                }
            } elseif (!is_array($value1) && !is_array($array2[$key1])) {
                if ($value1 !== $array2[$key1]) {
                    $ret[$key1] = $value1;
                }
            } else {
                $ret[$key1] = $value1;
            }
        }
        return $ret;
    }

    /**
     * Return Recursive diff from another list with index check.
     *
     * The first array is this collection and compute the diff against the passed collection.
     *
     * This will return a new Collection.
     *
     * @param Collection $another_list
     *
     * @return static
     */
    public function diffRecursiveAssoc(Collection $another_list)
    {
        $ret  = new static();
        $diff = static::arrayDiffRecursiveAssoc($this->toArray(), $another_list->toArray());
        foreach ($diff as $key => $value) {
            $ret[$key] = $value;
        }
        return $ret;
    }

    /**
     * A version of php array_diff which is recursive.
     *
     * array_diff — Computes the difference of arrays
     *
     * This function is costy because it uses array_search
     *
     * @param array $array1
     * @param array $array2
     *
     * @return array
     */
    protected static function arrayDiffRecursive(array $array1, array $array2)
    {
        $ret = array();

        foreach ($array1 as $key1 => $value1) {
            if (false === ($key2 = array_search($value1, $array2, true))) {
                $ret[$key1] = $value1;
                continue;
            }
            if (is_array($value1) && is_array($array2[$key2])) {
                $recursive_diff = self::arrayDiffRecursive($value1, $array2[$key2]);
                if (count($recursive_diff)) {
                    $ret[$key1] = $recursive_diff;
                }
            } elseif ($value1 instanceof Collection && $array2[$key2] instanceof Collection) {
                $recursive_diff = $value1->diffRecursive($array2[$key2]);
                if ($recursive_diff->count()) {
                    $ret[$key1] = $recursive_diff;
                }
            } elseif (!is_array($value1) && !is_array($array2[$key2])) {
                if ($value1 !== $array2[$key2]) {
                    $ret[$key1] = $value1;
                }
            } else {
                $ret[$key1] = $value1;
            }
        }
        return $ret;
    }

    /**
     * Return Recursive diff from another list.
     *
     * The first array is this collection and compute the diff against the passed collection.
     *
     * This will return a new Collection.
     *
     * @param Collection $another_list
     *
     * @return static
     */
    public function diffRecursive(Collection $another_list)
    {
        $ret  = new static();
        $diff = static::arrayDiffRecursive($this->toArray(), $another_list->toArray());
        foreach ($diff as $key => $value) {
            $ret[$key] = $value;
        }
        return $ret;
    }

    /**
     * Implementation of array_intesect_key against another list.
     *
     * This will return a new Collection.
     *
     * @param Collection $another_list
     *
     * @return static
     */
    public function intersectKey(Collection $another_list)
    {
        $ret = new static();
        foreach ($this as $key => $value) {
            if ($another_list->offsetExists($key)) {
                $ret[$key] = $value;
            }
        }
        return $ret;
    }
}