[m-dev.] for review: use bitsets in quantification

[Simon Taylor]

Ralph Becket wrote:
> > > +	% `fold(Func, Set, Start)' calls Func with each element
> > > +	% of `Set' and an accumulator (with the initial value of
> > > +	% `Start'), and returns the final value.
> > > +	% Takes O(NlogN) time.
> > > +:- func fold(func(T, U) = U, sparse_bitset(T), U) = U <= enum(T).
> > 
> > You should document the order in which elements are processed.
> 
> I recently posted a draft spec. for collection types of which this
> is obviously an instance.  It'd be nice if the interface to this
> module conformed.

...

> One final remark: you include pred versions of the funcs - why?!

I wanted sparse_bitset.m to be a drop-in replacement for set.m as
much as possible.

Simon.
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------