Date: Wed, 16 Oct 2024 21:02:48 -0400
From: Bruce Momjian <bruce@momjian.us>
To: pierre@vennin.net,
	PostgreSQL-development <pgsql-hackers@postgresql.org>
Subject: Re: ltree docs imprecise about sorting order
Message-ID: <ZxBiOIuP6EIOvhBc@momjian.us>
References: 
 <171648107027.2021729.14071096098945602529@wrigleys.postgresql.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: 
 <171648107027.2021729.14071096098945602529@wrigleys.postgresql.org>
Archived-At: 
 <https://www.postgresql.org/message-id/ZxBiOIuP6EIOvhBc%40momjian.us>
Precedence: bulk

On Thu, May 23, 2024 at 04:17:50PM +0000, PG Doc comments form wrote:
> The following documentation comment has been logged on the website:
> 
> Page: https://www.postgresql.org/docs/16/ltree.html
> Description:
> 
> The ltree docs available at
> https://www.postgresql.org/docs/current/ltree.html state "Comparison sorts
> in the order of a tree traversal" without specifying the strategy
> implemented to walk the tree. 
> A quick experiment suggests that the implemented solution is pre-ordered
> depth-first search.
> I suggest the ltree docs be amended to "Comparison sorts in the order of a
> pre-ordered depth-first tree traversal".

[ moved to hackers ]

Can someone confirm this and/or create a patch?

-- 
  Bruce Momjian  <bruce@momjian.us>        https://momjian.us
  EDB                                      https://enterprisedb.com

  When a patient asks the doctor, "Am I going to die?", he means 
  "Am I going to die soon?"