Eric Wilhelm wrote:
associative arrays. This module uses tied associative arrays and some
conventions to represent ordered trees where each node of the tree has
both contents (deeper nodes) and properties (things about the node.)
It's not exactly homogeneous (like an n-ary tree) because it uses a
file/directory concept (a "directory" contains more nodes (a recursive
version of the same data-structure), but a "file" only contains flat
data (as arrays.))
Something like a Directed Acyclic Graph? (see Tree::DAG_Node)
Mapping a DAG to native types using magic rather than objects for the
extra information is an interesting idea.
How about Tie::DAG? or Tie::DAG::Meta/Tree::DAGMeta ...
--
Sam Vilain, sam /\T vilain |><>T net, PGP key ID: 0x05B52F13
(include my PGP key ID in personal replies to avoid spam filtering)
