A List of pointers-to-T sorted in an ascending order defined by T.
This is a subclass of the generic List<T> that uses T::operator <=() to insert each element in ascending order, after any elements it is equal to. It behaves like the generic List<T> in all other respects.
This sorted insert behaviour occurs only when the insert() function is passed a single pointer. Using prepend(), append(), and insert() with an Iterator will still insert elements into specific positions irrespective of their value.
This function inserts the object d into a SortedList, and returns a reference to an Iterator pointing to it.
This web page based on source code belonging to Oryx Mail Systems GmbH. All rights reserved.