[augeas-devel] Re: Simplify handling of path expressions

[David Lutterkort]

On Mon, 2008-12-22 at 21:13 +0100, Free Ekanayaka wrote:
> Hi David,
> 
> |--==> On Mon, 22 Dec 2008 11:46:26 -0800, David Lutterkort <lutter at redhat.com> said:
> 
>   DL> This series of patches considerably simplifies the evaluation of path
>   DL> expressions and searching/iterating in the tree. The two big changes are that
> 
>   DL> (1) tree nodes now have an explicit 'parent' pointer
> 
>   DL> (2) root nodes of a tree now point back to a fake parent (called 'origin'),
>   DL>     i.e. the tree is now edge-labeled
> 
>   DL> These patches clean up a good deal of ugliness in handling path
>   DL> expressions. In particular, the paths that are generated when a tree is
>   DL> printed are now much more correct ;)
> 
> Sounds very good, but I'm not sure to get everything you mean. Please
> would you provide some examples of what you can now do that you
> couldn't before? Code sniplets are welcome :)

It doesn't change any functionality yet, it's strictly a refactoring.
The next patch series will expand the capabilities of path
expressions ;)

David