Re: Collections module for ESL
D. Newhall wrote:
snipped stuff by Gordon
> We'll definitely have all or most of those but maybe we should put them all in
> different
> files.
>
> I expect that we'll have a few advanced data type modules for the standard
> variety
> of structures that most programmers use.
>
> So how about:
> queue.e
> stack.e
> hash.e
> set.e
> record.e
Also, I already have a stack.e, a queue.e, and a set.e file that I wrote for my
own use that I'd be glad to submit to the ESL.
stack.e defines x=pop(), push(x), and x=peek().
queue.e defines enqueue(x), x=dequeue(), x=front() (looks at first element), and
x=last() (looks at last element)
set.e defines union(s,s), intersect(s,s), compelement(s,s), b=subset(s,s),
b=superset(s,s) and some other stuff (will probably need to be
modified/rewritten).
|
Not Categorized, Please Help
|
|