Ticket #34 (new enhancement)
Implement a persistent aggregates library/abstraction
| Reported by: | ieslick | Owned by: | ieslick |
|---|---|---|---|
| Priority: | major | Milestone: | |
| Component: | system-wide | Version: | |
| Keywords: | Cc: |
Description (last modified by ieslick) (diff)
Implement some subset of pcons, parray, phash, ptable, pset, etc.
Provide a similar to lisp API, but prefixed with 'p'. How to implement? What data structures make sense to layer over btrees and indexes, if any?
This could be trivial to implement, but useful for newcomers looking for familiar ground and can avoid contamination by cursors and instead do iterators or mapping functions?
Change History
Note: See
TracTickets for help on using
tickets.
