GitHub - kylecordes/adjacency-nested-sets-delphi: Delphi implementation of the Celko "nested sets" approach to represent a hierarchy in a relational DB.

kylecordes / adjacency-nested-sets-delphi Public

Notifications You must be signed in to change notification settings
Fork 2
Star 1

Delphi implementation of the Celko "nested sets" approach to represent a hierarchy in a relational DB.

kylecordes.com/2007/nested-sets

View license

1 star 2 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
.gitignore		.gitignore
.hgignore		.hgignore
NestedSetTests.dpr		NestedSetTests.dpr
NestedSetTests.dproj		NestedSetTests.dproj
Readme.txt		Readme.txt
license.txt		license.txt
uNester.pas		uNester.pas
uNesterTests.pas		uNesterTests.pas

Repository files navigation

Kyle's Adjacency -> Nested Sets Translator

Copyright 2007 Kyle Cordes

This class converts an "Adjacency" hierarchy representation in to a
"nested set" representation.  Search the web for Joe Celko's nested set
articles to learn what that means.

This assumes that nodes are identified by ints. You could change it to use
strings etc. as needed, of course.

To use this class:

  * create an instance. instances are single-shot, one use.

  * call "AddNode" 0..N times, once for each node.

  * call Convert.  The processing will occur, and your handler
    will be called once for each node, with the Left and Right values.


Enjoy. I'd love to hear if anyone finds this useful.

kyle@kylecordes.com
http://kylecordes.com/