DataStructures\Lists\Traits\ArrayAccessTrait

Complexity

Total Complexity

7

Size/Duplication

Total Lines	32
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Importance

Changes	1
Bugs	0	Features	0

6 Methods

Rating	Name	Duplication	Size	Complexity
	get()	0	1	?
	delete()	0	1	?
A	offsetSet()	0	11	3
A	offsetExists()	0	7	2
A	offsetUnset()	0	3	1
A	offsetGet()	0	3	1

<?php
/**
 * DataStructures for PHP
 *
 * @link      https://github.com/SiroDiaz/DataStructures
 * @copyright Copyright (c) 2017 Siro Díaz Palazón
 * @license   https://github.com/SiroDiaz/DataStructures/blob/master/README.md (MIT License)
 */
namespace DataStructures\Lists\Traits;

use OutOfBoundsException;

/**
 * ArrayAccessTrait
 *
 * ArrayAccessTrait is a trait that implements the ArrayAccess methods
 * to avoid repeating code in the List hierarchy classes.
 *
 * @author Siro Diaz Palazon <siro_diaz@yahoo.com>
 */
trait ArrayAccessTrait {
    abstract public function get($index);
    abstract public function delete($index);
    
    public function offsetSet($offset, $value) {
        if (is_null($offset)) {
            $offset = $this->size;
            if($this->size === 0) {
                $offset = 0;
            }
            $this->insert($offset, $value);
        } else {
            $this->insert($offset, $value);
        }
    }
    
    public function offsetExists($offset) {
        try {
            return $this->get($offset);
        } catch(OutOfBoundsException $e) {
            return false;
        }
    }

    public function offsetUnset($offset) {
        $this->delete($offset);
    }

    public function offsetGet($offset) {
        return $this->get($offset);
    }
}