Bisarca\Graph\AbstractSet

Complexity

Total Complexity

5

Size/Duplication

Total Lines	55
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Importance

Changes

0

5 Methods

Rating	Name	Duplication	Size	Complexity
A	get()	0	4	1
A	getIterator()	0	4	1
A	clear()	0	4	1
A	isEmpty()	0	4	1
A	count()	0	4	1

<?php

/*
 * This file is part of the bisarca/graph package.
 *
 * (c) Emanuele Minotto <minottoemanuele@gmail.com>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

namespace Bisarca\Graph;

use ArrayIterator;
use Bisarca\Graph\Attribute\AttributeAwareInterface;
use Bisarca\Graph\Attribute\AttributeAwareTrait;
use Countable;
use IteratorAggregate;
use Traversable;

/**
 * Abstract set of utilities for internal sets.
 */
abstract class AbstractSet implements AttributeAwareInterface, Countable, IteratorAggregate
{
    use AttributeAwareTrait;

    /**
     * Contained elements.
     *
     * @var array
     */
    protected $data = [];

    /**
     * Gets the contained elements.
     *
     * @return array
     */
    public function get(): array
    {
        return $this->data;
    }

    /**
     * {@inheritdoc}
     */
    public function getIterator(): Traversable
    {
        return new ArrayIterator($this->data);
    }

    /**
     * Remove all contained elements.
     */
    public function clear()
    {
        $this->data = [];
    }

    /**
     * Checks if no elements are contained.
     *
     * @return bool
     */
    public function isEmpty(): bool
    {
        return empty($this->data);
    }

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