| Anonymous | Login | Signup for a new account | 2013-05-22 07:13 CEST | ![]() |
| Main | My View | View Issues | Change Log | Roadmap |
| View Issue Details [ Jump to Notes ] | [ Issue History ] [ Print ] | ||||||||||
| ID | Project | Category | View Status | Date Submitted | Last Update | ||||||
| 0004456 | OCaml | OCaml general | public | 2007-11-28 13:16 | 2008-01-18 16:25 | ||||||
| Reporter | Oliver Bandel | ||||||||||
| Assigned To | |||||||||||
| Priority | normal | Severity | feature | Reproducibility | N/A | ||||||
| Status | acknowledged | Resolution | open | ||||||||
| Platform | OS | OS Version | |||||||||
| Product Version | |||||||||||
| Target Version | Fixed in Version | ||||||||||
| Summary | 0004456: DBM-Module: different database-schemes | ||||||||||
| 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. | ||||||||||
| Tags | No tags attached. | ||||||||||
| Attached Files | |||||||||||
Issue History |
|||
| Date Modified | Username | Field | Change |
| 2007-11-28 13:16 | Oliver Bandel | New Issue | |
| 2008-01-18 16:25 | doligez | Status | new => acknowledged |
| Copyright © 2000 - 2011 MantisBT Group |