# The following was supposedly scribed by
# Sam Vilain
# on Monday 14 February 2005 04:12 pm:
>Something like a Directed Acyclic Graph? �(see Tree::DAG_Node)
Thanks for the lead. That describes the directory side of things (and
maybe describes the files too...) The Tree::DAG_Node module does have
the ordered daughter list that I was aiming for, but (at first reading)
seems to have a little more formality in the API than what I wanted and
no support for metadata.
>Mapping a DAG to native types using magic rather than objects for the
>extra information is an interesting idea.
This method does have some key-naming restrictions (though they only
exist in the current API and not in the data-structure.) We'll see how
far I get before my DWIM style shoots me in the foot. There's also the
issue of re-arranging the node's contents, but that has more to do with
how it is tied (I did consider making the what-to-tie-to into an
option.)
>How about Tie::DAG? �or Tie::DAG::Meta/Tree::DAGMeta ...
I like Tree::DAGMeta well enough (or maybe Tree::MetaDAG has a better
ring to it), unless someone has hints as to how the name could evoke
something more along the lines of
in-memory-filesystem-like-api-for-dealing-with-complicated-table-data.
In any case, it will probably be kicking around in my subversion
repository with the other lovechildren until I get some time, money, or
nightly-build-gnomes working on it. Heck, maybe I need to use it to
configure my nightly-build-gnomes!
Anyway,
Eric
--
"Chess is a foolish expedient for making idle people believe
they are doing something very clever when they are only wasting
their time."
-- George Bernard Shaw
---------------------------------------------
http://scratchcomputing.com
---------------------------------------------
