Re: List container strawman 1.2

[Ted Dennison<dennison@telepath.com>]

In article <3BECAAE8.62110AFC@acm.org>, Jeffrey Carter says...
>Inserting one list into another seems like overkill. If we're going to

It seemed that way to me too when suggested, but no one else said anything of
the sort, and its easy enough to code up. I'm still unconvinced that this is
something that folks would have to do a lot.

>type Bunch_O_Elements is array (Positive range <>) of Element; -- :)
>
>function Make (Elements : Bunch_O_Elements) return List;
>
>Primes : Int_List.List := Int_List.Make ((2, 3, 5, 7, 11, 13));

:-)
I seriously considered adding routines to convert between unbounded arrays and
lists. I'd probably just name them "To" and "From" (which is what the same
routines in Ada.Strings.Unbounded *should* have been named).

---
T.E.D.    homepage   - http://www.telepath.com/dennison/Ted/TED.html

No trees were killed in the sending of this message. 
However a large number of electrons were terribly inconvenienced.