[m-rev.] New library module: pile

[Ralph Becket]

Fergus Henderson, Wednesday,  5 February 2003:
> On 05-Feb-2003, Ralph Becket <rafe at cs.mu.OZ.AU> wrote:
> > Added a new library module, pile, for a collection type supporting O(1)
> > insertion and concatenation.
> 
> Does this type represent a set, a multiset, or a sequence?
> Looking at the code, I see that it represents a sequence.
> The documentation should make that clear.

Done.

> This data type looks quite similar to the `cord' data type
> defined in the Boehm collector (see boehm_gc/include/cord.h),
> except that it is generalized to allow the sequence to contain
> elements of any type, rather than just `char'.

Hmm.  Do you think `cord' might be a better choice of name?

Functionality I'm in two minds about adding:
- decomposition;
- indexing;
- length;
- comparison.

Given that the main point of a pile is to just collect data together
cheaply, I'm not convinced that adding the above would be particularly
useful.

	Ralph
--------------------------------------------------------------------------
mercury-reviews mailing list
post:  mercury-reviews at cs.mu.oz.au
administrative address: owner-mercury-reviews at cs.mu.oz.au
unsubscribe: Address: mercury-reviews-request at cs.mu.oz.au Message: unsubscribe
subscribe:   Address: mercury-reviews-request at cs.mu.oz.au Message: subscribe
--------------------------------------------------------------------------