Re: limited types

Simon Wright <simon@[EMAIL PROTECTED]
> writes:

> I would have expected some operation like Succ on CT? 

Yeah, you're right; I forgot to write an ellipsis.  Each algorithm would
have
to pass in the requisite element/cursor operations as generic formals.

For a similar idea, see Ada.Containers.Generic_Anonymous_Array_Sort in the
GNAT
distribution.


> (and equality?  would predefined equality on cursors be OK?)

The standard container library guarantees that cursor equality composes,
so
predefined equality would work fine.  It wouldn't hurt to pass in a
default
equality operator, though.