Hi,
In the documentation on page http://www.sqlite.org/lang_with.html
there is an example of a recursive query if you scroll down to the heading
"Controlling Depth-First Versus Breadth-First Search Of a Tree Using ORDER
BY".
The second example under that heading shows how to get a depth-first
search. Here's the query:
WITH RECURSIVE
under_alice(name,level) AS (
VALUES('Alice',0)
UNION ALL
SELECT org.name, under_alice.level+1
FROM org JOIN under_alice ON org.boss=under_alice.name
ORDER BY 2 *DESC*
)
SELECT substr('..........',1,level*3) || name FROM under_alice;
It turns out that this query not only provides a correctly indented output
of the tree, but it also sorts every branch alphabetically by name.
What I don't understand is *why* it sorts alphabetically by name.
I would have expected to need to change the query to have ORDER BY 2 DESC,
org.name
for it to work, but it works anyway.
Thanks!
_______________________________________________
sqlite-users mailing list
sqlite-users@sqlite.org
http://sqlite.org:8080/cgi-bin/mailman/listinfo/sqlite-users
