Author: dr
Date: Thu Jul 5 16:09:37 2007
New Revision: 5700
Log:
- Clarifications after comments by Alexandru.
Modified:
experimental/Tree/design/requirements.txt
Modified: experimental/Tree/design/requirements.txt
==============================================================================
--- experimental/Tree/design/requirements.txt [iso-8859-1] (original)
+++ experimental/Tree/design/requirements.txt [iso-8859-1] Thu Jul 5 16:09:37
2007
@@ -32,8 +32,9 @@
with multiple backends for each specific optimized algorithm.
Besides the database backends there could be other places on where to
-store tree structures - for example simply on the file system or in an
-XML file. The backend mechanism should support this as well.
+store tree structures - for example simply on the file system, in a file
+containing a PHP array or in an XML file. The backend mechanism should support
+this as well.
The following operations should be possible on the trees:
@@ -62,7 +63,8 @@
It's desirable to have an OO API to handle the nodes like the DOM
extension, e.g. Node->appendChild(). On the other hand it's an advantage
not be obliged to extend an abstract node class when working with the
-content of the leaves.
+content of the leaves. The contents are should be disconnected from the tree
+node itself, for example through a property.
Special considerations
======================
@@ -74,7 +76,8 @@
Format
======
-The following algorithms should be supported:
+This section lists the backends that should be supported. Conversion between
+backends should also be possible.
Parent - child relations
--
svn-components mailing list
[email protected]
http://lists.ez.no/mailman/listinfo/svn-components
