You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Original bug ID: 4456 Reporter: Oliver Bandel Status: closed (set by @mshinwell on 2016-12-06T21:37:25Z) Resolution: not fixable Priority: normal Severity: feature Category: ~DO NOT USE (was: OCaml general)
Bug description
Hi,
dbm/ndbm supports different databases-schemes:
Hash
Btree
Recno
(See "man 3 dbopen" and the other manpages
for hash, btree and recno, accordingly.)
In Ocaml's Dbm-module I only found hash-like DBMs.
It's nice to have this module, but other schemes,
at least btree, also would be fine.
A sorted nextkey-output would be fine...
...and an iter that also has a predictable order of operation.
With btree-like fileformat this should be possible.
Would be fine to have all Dbm-options available in Ocaml. :)
Thanks.
The text was updated successfully, but these errors were encountered:
Original bug ID: 4456
Reporter: Oliver Bandel
Status: closed (set by @mshinwell on 2016-12-06T21:37:25Z)
Resolution: not fixable
Priority: normal
Severity: feature
Category: ~DO NOT USE (was: OCaml general)
Bug description
Hi,
dbm/ndbm supports different databases-schemes:
(See "man 3 dbopen" and the other manpages
for hash, btree and recno, accordingly.)
In Ocaml's Dbm-module I only found hash-like DBMs.
It's nice to have this module, but other schemes,
at least btree, also would be fine.
A sorted nextkey-output would be fine...
...and an iter that also has a predictable order of operation.
With btree-like fileformat this should be possible.
Would be fine to have all Dbm-options available in Ocaml. :)
Thanks.
The text was updated successfully, but these errors were encountered: