JMGQ\AStar\Node\Collection\NodeHashTable

Complexity

Total Complexity

12

Size/Duplication

Total Lines	64
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes

0

8 Methods

Rating	Name	Duplication	Size	Complexity
A	getIterator()	0	3	1
A	remove()	0	3	1
A	add()	0	3	1
A	clear()	0	3	1
A	contains()	0	3	1
A	get()	0	3	1
A	isEmpty()	0	3	1
A	extractBest()	0	15	5

<?php

namespace JMGQ\AStar\Node\Collection;

use JMGQ\AStar\Node\Node;

class NodeHashTable implements \IteratorAggregate, NodeCollectionInterface
{
    /** @var Node[] */
    private array $nodes = [];

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

    /**
     * {@inheritdoc}
     */
    public function extractBest(): ?Node
    {
        $bestNode = null;

        foreach ($this->nodes as $node) {
            if ($bestNode === null || $node->getF() < $bestNode->getF()) {

The method getF() does not exist on null.

                $bestNode = $node;
            }
        }

        if ($bestNode !== null) {
            $this->remove($bestNode);
        }

        return $bestNode;
    }

    public function get(string $nodeId): ?Node
    {
        return $this->nodes[$nodeId] ?? null;
    }

    public function add(Node $node): void
    {
        $this->nodes[$node->getId()] = $node;
    }

    public function remove(Node $node): void
    {
        unset($this->nodes[$node->getId()]);
    }

    public function isEmpty(): bool
    {
        return empty($this->nodes);
    }

    public function contains(Node $node): bool
    {
        return isset($this->nodes[$node->getId()]);
    }

    /**
     * {@inheritdoc}
     */
    public function clear(): void
    {
        $this->nodes = [];
    }
}