Boost logo

Boost :

From: Zach Laine (whatwasthataddress_at_[hidden])
Date: 2008-05-21 09:34:22


On Wed, May 21, 2008 at 1:19 AM, David Abrahams <dave_at_[hidden]> wrote:
>

[snip]

>
> Paths don't have leaves. They have beginnings, endings, and middles.
> They are linear.

This sheds their context. The linear sequence does not exist in a
vacuum. It is a sequence of nodes that defines a path through a
filesystem tree. When I think of a filesystem, I think of it as (a)
root node(s), interior nodes, and leaf nodes. The fact that I'm only
looking at a subset of them when dealing with a given path does not
change what kind of node each is conceptually. In short, I like
"leaf()".

Zach


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk