|
Options |
Name |
Purpose |
|
|
|
LOGICAL Add (integer, Object)
|
|
|
|
|
LOGICAL Add (Object)
|
|
|
|
|
LOGICAL AddAll (ICollection)
|
/** Adds all of the input collection to the current list.
Items from the input collection as added to the END of
the current list.
To prepend items, call AddAll(1, ICollection)
@param ICollection The collection to add.
@return logical TRUE if items were added (ie the input collection has at least one item) */
|
|
|
|
LOGICAL AddAll (integer, ICollection)
|
/** Adds all of the input collection to the current list, starting at the
index given (ie the index passed is the first item)
@param integer The index from which to add. Must be non-zero and positive
@param ICollection The collection to add
@return logical TRUE if items were added (ie the input collection has at least one item) */
|
|
|
|
LOGICAL AddArray (integer, Object[])
|
|
|
|
|
LOGICAL Equals (Object)
|
/* Two Lists are defined to be equal if they are the same size and
all of the elements in this collection are in the to-compare List and
in the same sequence.
@param P.L.Object
@return logical TRUE if the Lists are equal. FALSE otherwise */
|
|
|
|
FindBufferUseObject (Object)
|
/* Find the FIRST reference of the search object; the search order
is by the List's Sequence. This means that if there are 2 instances
of this object, a dev will need to iterate over the collection to
determine which ones match.
@param Progress.Lang.Object The search object */
|
|
|
|
FindBufferUseObject (Object, buffer)
|
/* Find the FIRST reference of the search object; the search order
is by the List's Sequence. This means that if there are 2 instances
of this object, a dev will need to iterate over the collection to
determine which ones match.
The input buffer is RELEASED (so that we don't leak scope).
@param Progress.Lang.Object The search object
@param buffer ttList The buffer to search */
|
|
|
|
Progress.Lang.Object Get (integer)
|
/* Returns the object represented by the index
@param integer The sequence to find. Must be positive and <= the Size.
@return Object The object represented by the sequence. May be ? */
|
|
|
|
INTEGER IndexOf (Object)
|
|
|
|
|
OpenEdge.Core.Collections.IIterator Iterator ()
|
/* Returns a new IIterator over the collection. */
|
|
|
|
INTEGER LastIndexOf (Object)
|
|
|
|
|
OpenEdge.Core.Collections.IListIterator ListIterator ()
|
/* Returns a new IListIterator over the collection. */
|
|
|
|
OpenEdge.Core.Collections.IListIterator ListIterator (integer)
|
/* Returns a new IListIterator over the collection.*/
|
|
|
|
Progress.Lang.Object Remove (integer)
|
/** Removes an item at the given index
@param integer The index to remove. Must be between 1 and the size of the List
@return Progress.Lang.Object The item that was removed. */
|
|
|
|
LOGICAL Remove (Object)
|
|
|
|
|
Progress.Lang.Object Set (integer, Object)
|
|
|
|
|
OpenEdge.Core.Collections.IList SubList (integer, integer)
|
/* Returns a view of the portion of this list between the specified fromIndex, inclusive, and toIndex, exclusive.
The fromIndex value must be positive and <= this list's Size
The toIndex value must be positive and <= this list's Size
The fromIndex value must be <= toIndex value
If fromIndex and toIndex are equal, the returned list has 1 entry.
@param integer fromIndex Low endpoint (INCLUSIVE) of the subList
@param integer toIndex High endpoint (INCLUSIVE) of the subList
@return IList a List containing the items. Has at least 1 entry. */
|