This library provides handling of data that is structured hierarchically using parent ID references. A typical example is a table in a relational database where each record’s “parent” field references the primary key of another record. Of course, usage is not limited to data originating from a database, but anything: you supply the data, and the library uses it, regardless of where the data came from and how it was processed.
It is important to know that the tree structure created by this package is read-only: you can’t use it to perform modifications of the tree nodes.
On the other hand, one nice thing is that it’s pretty fast. This does not only mean the code itself, but also that the constructor takes the input data in a format that is simple to create. For instance, to create a tree from database content, a single SELECT
is sufficient, regardless of the depth of the tree and even for thousands of nodes.
The preferred way to install Tree is through Composer. For this, simply execute composer require bluem/tree
(depending on your Composer installation, it could be “composer.phar” instead of “composer”) and everything should work fine. Or you manually add "bluem/tree": "^3.0"
to the dependencies in your composer.json
file and subsequently install/update dependencies.
Alternatively, you can clone the repository using git or download a tagged release.
As this library uses semantic versioning, you will get fixes and feature additions when running composer update
, but not changes which break the API.
// Create the tree with an array of arrays (or use an array of Iterators,
// Traversable of arrays or Traversable of Iterators):
$data = [
['id' => 1, 'parent' => 0, 'title' => 'Node 1'],
['id' => 2, 'parent' => 1, 'title' => 'Node 1.1'],
['id' => 3, 'parent' => 0, 'title' => 'Node 3'],
['id' => 4, 'parent' => 1, 'title' => 'Node 1.2'],
];
$tree = new BlueM\Tree($data);
// When using a data source that uses different keys for "id" and "parent",
// or if the root node ID is not 0 (in this example: -1), use the options
// array you can pass to the constructor:
$data = [
['nodeId' => 1, 'parentId' => -1, 'title' => 'Node 1'],
['nodeId' => 2, 'parentId' => 1, 'title' => 'Node 1.1'],
['nodeId' => 3, 'parentId' => -1, 'title' => 'Node 3'],
['nodeId' => 4, 'parentId' => 1, 'title' => 'Node 1.2'],
];
$tree = new BlueM\Tree(
$data,
['rootId' => -1, 'id' => 'nodeId', 'parent' => 'parentId']
);
// Rebuild the tree from new data
$tree->rebuildWithData($newData);
// Get the top-level nodes (returns array)
$rootNodes = $tree->getRootNodes();
// Get all nodes (returns array)
$allNodes = $tree->getNodes();
// Get a single node by its unique identifier
$node = $tree->getNodeById(12345);
// Get a node's parent node (will be null for the root node)
$parentNode = $node->getParent();
// Get a node's siblings as an array
$siblings = $node->getSiblings();
// Ditto, but include the node itself (identical to $node->getParent()->getChildren())
$siblings = $node->getSiblingsAndSelf();
// Get a node's preceding sibling (null, if there is no preceding sibling)
$precedingSibling = $node->getPrecedingSibling();
// Get a node's following sibling (null, if there is no following sibling)
$followingSibling = $node->getFollowingSibling();
// Does the node have children?
$bool = $node->hasChildren();
// Get the number of Children
$bool = $node->countChildren();
// Get a node's child nodes
$children = $node->getChildren();
// Get a node's ancestors (parent, grandparent, ...)
$ancestors = $node->getAncestors();
// Ditto, but include the node itself
$ancestorsPlusSelf = $node->getAncestorsAndSelf();
// Get a node's descendants (children, grandchildren, ...)
$descendants = $node->getDescendants();
// Ditto, but include the node itself
$descendantsPlusSelf = $node->getDescendantsAndSelf();
// Get a node's ID
$id = $node->getId();
// Get the node's hierarchical level (1-based)
$level = $node->getLevel();
// Access node properties using get() overloaded getters or __get():
$value = $node->get('myproperty');
$value = $node->myproperty;
$value = $node->getMyProperty();
// Get the node's properties as an associative array
$array = $node->toArray();
// Get a string representation (which will be the node ID)
echo "$node";
<?php
require 'vendor/autoload.php';
// Create the Tree instance
$tree = new BlueM\Tree([
['id' => 1, 'name' => 'Africa'],
['id' => 2, 'name' => 'America'],
['id' => 3, 'name' => 'Asia'],
['id' => 4, 'name' => 'Australia'],
['id' => 5, 'name' => 'Europe'],
['id' => 6, 'name' => 'Santa Barbara', 'parent' => 8],
['id' => 7, 'name' => 'USA', 'parent' => 2],
['id' => 8, 'name' => 'California', 'parent' => 6],
['id' => 9, 'name' => 'Germany', 'parent' => 5],
['id' => 10, 'name' => 'Hamburg', 'parent' => 9],
]);
...
...
<?php
require 'vendor/autoload.php';
// Database setup (or use Doctrine or whatever ...)
$db = new PDO(...);
// SELECT the records in the sort order you need
$stm = $db->query('SELECT id, parent, title FROM tablename ORDER BY title');
$records = $stm->fetchAll(PDO::FETCH_ASSOC);
// Create the Tree instance
$tree = new BlueM\Tree($records);
...
...
As Tree
implements JsonSerializable
, a tree can be serialized to JSON. By default, the resulting JSON represents a flat (non-hierarchical) representation of the tree data, which – once decoded from JSON – can be re-fed into a new Tree instance. In former versions, you had to subclass the Tree
and the Node
class to customize the JSON output. Now, serialization is extracted to an external helper class which can be changed both by setting a constructor argument or at runtime just before serialization. However, the default serialization result is the same as before, so you won’t notice any change in behavior unless you tweaked JSON serialization.
To control the JSON, you can either pass an option jsonSerializer
to the constructor (i.e. pass something like ['jsonSerializer' => $mySerializer]
as argument 2), which must be an object implementing \BlueM\Tree\Serializer\TreeJsonSerializerInterface
. Or you call method setJsonSerializer()
on the tree. The latter approach can also be used to re-set serialization behavior to the default by calling it without an argument.
The library comes with two distinct serializers: \BlueM\Tree\Serializer\FlatTreeJsonSerializer
is the default, which is used if no serializer is set and which results in the “old”, flat JSON output. Plus, there is \BlueM\Tree\Serializer\HierarchicalTreeJsonSerializer
, which creates a hierarchical, depth-first sorted representation of the tree nodes. If you need something else, feel free to write your own serializer.
PHPUnit is configured as a dev dependency, so running tests is a matter of:
composer install
./vendor/bin/phpunit
If you want to see TestDox output or coverage data, you can comment in the commented lines in the <log>
section of phpunit.xml.dist
.
- JSON serialization is easily customizable by setting a custom serializer. (See section “JSON serialization” in this Readme.) Potential BC break: if in your own code, you subclassed
Tree
orTree\Node
and added an own implementation ofjsonSerialize()
, your current code might break. This is the only reason for the major version number bump, as everything else is unchanged. It is highly likely that you don’t have to change anything to be compatible with v3. - License change: BSD-2 to BSD-3
- BC break:
getAncestors()
orgetAncestorsAndSelf()
no longer include the root node as last item of the returned array. Solution: add it yourself, if you need it. - BC break: Removed argument to
getAncestors()
. Solution: If you passedtrue
as argument before, change this togetAncestorsAndSelf()
. - BC break: Removed argument to
getDescendants()
. Solution: If you passedtrue
as argument before, change this togetDescendantsAndSelf()
. - BC break: Removed argument to
getSiblings()
. Solution: If you passedtrue
as argument before, change this togetSiblingsAndSelf()
. - BC break: Moved
BlueM\Tree\InvalidParentException
toBlueM\Tree\Exception\InvalidParentException
. Solution: Update namespace imports. - New: Added method
Tree::rebuildWithData()
to rebuild the tree with new data. - New:
Tree
andTree\Node
implementJsonSerializable
and provide default implementations, which means that you can easily serialize the whole tree oder nodes to JSON. - New: The tree data no longer has to be an
array
, but instead it must be aniterable
, which means that you can either pass in anarray
or an object implementing theTraversable
interface. Also, the data for a node no longer has to be an array, but can also be an object implementing theIterator
interface. These changes should make working with the library more flexible. - Internal change: Changed autoloading from PSR-0 to PSR-4, renamed sources’ directory from
lib/
tosrc/
and tests’ directory fromtest/
totests/
. - Internal change: Code modernization, which now requires PHP >= 7.0
- Handle IDs of mixed type (strings and integers)
- Add info on JSON serialization in Readme. No code changes.
- Remove superfluous 2nd argument to
build()
in constructor
- Added
createNode()
method to Tree, which makes it possible to use instances of a Node subclass as nodes
- Added
getSiblingsAndSelf()
method onNode
class. - The argument to
getSiblings()
is deprecated and will be removed in version 2
- Added
getNodeByValuePath()
method onTree
class, which can be used to find a node deeply nested in the tree based on ancestors’ and the node’s values for an arbitrary property. (See method doc comment for example.)
- Implemented
__isset()
and__get()
on theNode
class. This makes it possible to pass nodes to Twig (or other libraries that handle object properties similarly) and to access nodes’ properties intuitively. - Improved case-insensitive handling of node properties
- Added
getDescendantsAndSelf()
- Added
getAncestorsAndSelf()
- Arguments to
getDescendants()
andgetAncestors()
are deprecated and will be removed with version 2 - Added a check to make sure that nodes don’t use their own ID as parent ID. This throws an exception which would not have been thrown before if this is the case. Hence, it might break backward compatibility, but only if the data data is inconsistent.
- First public release
This code was written by Carsten Blüm (www.bluem.net) and licensed under the BSD 3-Clause license.