[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Bug#211119: libgdbm3: ordered traversal option for firstkey/nextkey?



control: tag -1 +wontfix
control: close -1

[2003-09-16 02:02] Colin Watson <cjwatson@debian.org>
> It'd be nice to have a flag to gdbm_setopt() or similar which would
> cause gdbm_firstkey() and gdbm_nextkey() to return entries in a
> lexicographically sorted fashion, or I suppose even with an arbitrary
> comparison function if somebody were feeling particularly industrious
> (although I don't need that myself). When migrating man-db from Berkeley
> DB to GDBM and brushing up the old support code, I just had to write a
> hashtable of ordered hashtables in order to do the sort myself without
> turning lots of code upside down, which is not the most pleasant data
> structure in the world.
>
> I'm guessing that gdbm could also manage a more efficient sorted
> traversal internally than I can in a wrapper.

This bugreport asks for very significant change, so it is better to
discuss it directly with upstream.

-- 
X-Web-Site: https://sinsekvu.github.io | Note that I process my email in batch,
Accept-Languages: eo,ru,en             | at most once every 24 hours. If matter
Accept: text/plain, text/x-diff        | is urgent, you have my phone number.

Attachment: pgprZF2GqFlft.pgp
Description: PGP signature


Reply to: