[ANNOUNCEMENT] Tree-0.1.2 (beta) Released.
| From: | PEAR Announce | Date: | Mon, 30 Sep 2002 15:15:20 +0000 |
| Subject: | [ANNOUNCEMENT] Tree-0.1.2 (beta) Released. | ||
| Groups: | php.pear.general | ||
| Request: | Send a blank email to pear-general+get-2414@lists.php.net to get a copy of this message | ||
The new PEAR package Tree-0.1.2 (beta) has been released at http://pear.php.net/.
Release notes
-------------
- added example that can demonstrates the Tree-class optionally on
either a DB, FileSystem, Array or XML-File
- enhanced the returning of proper PEAR-errors
- experimental FileSystem-class that can be used to read a directory structure
and work on it using the known tree-methods
- experimental Array-class which allows the same on arrays
- check for existence of methods in the delegated-classes before calling them
return proper PEAR-error if they are not implemented yet
- implemented getChildrens method, for Memory-way
Package Info
-------------
Provides methods to read and manipulate trees, which are stored in the DB
or an XML file. The trees can be stored in the DB either as nested trees.
Or as simple trees ('brain dead method'), which use parentId-like structure.
Currently XML data can only be read from a file and accessed.
The package offers a big number of methods to access and manipulate trees.
For example methods like: getRoot, getChild[ren[Ids]], getParent[s[Ids]], getPath[ById] and many
more.
There are two ways of retreiving the data from the place where they are stored,
one is by reading the entire tree into the memory - the Memory way. The other
is reading the tree nodes as needed (very useful in combination with huge trees
and the nested set model).
The package is designed that way that it is possible to convert/copy tree data
from either structure to another (from XML into DB).
Related Links
-------------
Package home: http://pear.php.net/package-info.php?package=Tree
Changelog: http://pear.php.net/package-changelog.php?package=Tree
Download: http://pear.php.net/get/Tree-0.1.2.tgz
Authors
-------------
Wolfram Kriesing <wolfram@kriesing.de> (lead)