#include <contain.h>
Inheritance diagram for PCollection:
Public Member Functions | |
Overrides from class PObject | |
| virtual void | PrintOn (ostream &strm) const |
Common functions for collections | |
| virtual PINDEX | Append (PObject *obj)=0 |
| virtual PINDEX | Insert (const PObject &before, PObject *obj)=0 |
| virtual PINDEX | InsertAt (PINDEX index, PObject *obj)=0 |
| virtual BOOL | Remove (const PObject *obj)=0 |
| virtual PObject * | RemoveAt (PINDEX index)=0 |
| virtual void | RemoveAll () |
| virtual BOOL | SetAt (PINDEX index, PObject *val)=0 |
| virtual PObject * | GetAt (PINDEX index) const =0 |
| virtual PINDEX | GetObjectsIndex (const PObject *obj) const=0 |
| virtual PINDEX | GetValuesIndex (const PObject &obj) const=0 |
| PINLINE void | AllowDeleteObjects (BOOL yes=TRUE) |
| void | DisallowDeleteObjects () |
Protected Member Functions | |
| PINLINE | PCollection (int dummy, const PCollection *coll) |
The exact form of the collection depends on the descendent of PCollection and determines the access modes for the objects in it. Thus a collection can be an array which allows fast random access at the expense of slow insertion and deletion. Or the collection may be a list which has fast insertion and deletion but very slow random access.
The basic paradigm of all collections is the "virtual array". Regardless of the internal implementation of the collection; array, list, sorted list etc, the user may access elements via an ordinal index. The implementation then optimises the access as best it can. For instance, in a list ordinal zero will go directly to the head of the list. Stepping along sequential indexes then will return the next element of the list, remembering the new position at each step, thus allowing sequential access with little overhead as is expected for lists. If a random location is specified, then the list implementation must sequentially search for that ordinal from either the last location or an end of the list, incurring an overhead.
All collection classes implement a base set of functions, though they may be meaningless or degenerative in some collection types eg Insert()# for PSortedList# will degenerate to be the same as Append()#.
| PINLINE PCollection::PCollection | ( | PINDEX | initialSize = 0 |
) |
Create a new collection
| initialSize | Initial number of things in the collection. |
| PINLINE PCollection::PCollection | ( | int | dummy, | |
| const PCollection * | coll | |||
| ) | [protected] |
Constructor used in support of the Clone() function. This creates a new unique reference of a copy of the contents. It does { not} create another reference.
The dummy parameter is there to prevent the contructor from being invoked automatically by the compiler when a pointer is used by accident when a normal instance or reference was expected. The container would be silently cloned and the copy used instead of the container expected leading to unpredictable results.
| dummy | Dummy to prevent accidental use of the constructor. |
| coll | Collection class to clone. |
| PINLINE PCollection::PCollection | ( | PINDEX | initialSize = 0 |
) |
Create a new collection
| initialSize | Initial number of things in the collection. |
| virtual void PCollection::PrintOn | ( | ostream & | strm | ) | const [virtual] |
Print the collection on the stream. This simply executes the PObject::PrintOn()# function on each element in the collection.
The default behaviour for collections is to print each element separated by the stream fill character. Note that if the fill character is the default ' ' then no separator is printed at all.
Also if the fill character is not ' ', the the streams width parameter is set before each individual element of the colllection.
| strm | Output stream to print the collection. |
Reimplemented from PObject.
Reimplemented in PAbstractDictionary.
| virtual PINDEX PCollection::Append | ( | PObject * | obj | ) | [pure virtual] |
Append a new object to the collection.
The exact semantics depends on the specific type of the collection. So the function may not place the object at the "end" of the collection at all. For example, in a PSortedList# the object is placed in the correct ordinal position in the list.
| obj | New object to place into the collection. |
Implemented in PAbstractSet, PAbstractList, and PAbstractSortedList.
Insert a new object immediately before the specified object. If the object to insert before is not in the collection then the equivalent of the Append()# function is performed.
The exact semantics depends on the specific type of the collection. So the function may not place the object before the specified object at all. For example, in a PSortedList# the object is placed in the correct ordinal position in the list.
Note that the object values are compared for the search of the before# parameter, not the pointers. So the objects in the collection must correctly implement the PObject::Compare()# function.
| before | Object value to insert before. |
| obj | New object to place into the collection. |
Implemented in PAbstractSet, PAbstractDictionary, PAbstractList, and PAbstractSortedList.
| virtual PINDEX PCollection::InsertAt | ( | PINDEX | index, | |
| PObject * | obj | |||
| ) | [pure virtual] |
Insert a new object at the specified ordinal index. If the index is greater than the number of objects in the collection then the equivalent of the Append()# function is performed.
The exact semantics depends on the specific type of the collection. So the function may not place the object at the specified index at all. For example, in a PSortedList# the object is placed in the correct ordinal position in the list.
| index | Index position in collection to place the object. |
| obj | New object to place into the collection. |
Implemented in PAbstractSet, PAbstractDictionary, PAbstractList, and PAbstractSortedList.
| virtual BOOL PCollection::Remove | ( | const PObject * | obj | ) | [pure virtual] |
Remove the object from the collection. If the AllowDeleteObjects option is set then the object is also deleted.
Note that the comparison for searching for the object in collection is made by pointer, not by value. Thus the parameter must point to the same instance of the object that is in the collection.
| obj | Existing object to remove from the collection. |
Implemented in PAbstractSet, PAbstractList, and PAbstractSortedList.
| virtual PObject* PCollection::RemoveAt | ( | PINDEX | index | ) | [pure virtual] |
Remove the object at the specified ordinal index from the collection. If the AllowDeleteObjects option is set then the object is also deleted.
Note if the index is beyond the size of the collection then the function will assert.
| index | Index position in collection to place the object. |
Implemented in PAbstractSet, PAbstractDictionary, PAbstractList, and PAbstractSortedList.
| virtual void PCollection::RemoveAll | ( | ) | [virtual] |
Remove all of the elements in the collection. This operates by continually calling RemoveAt()# until there are no objects left.
The objects are removed from the last, at index #(GetSize()-1)# toward the first at index zero.
Reimplemented in PAbstractSortedList.
| virtual BOOL PCollection::SetAt | ( | PINDEX | index, | |
| PObject * | val | |||
| ) | [pure virtual] |
Set the object at the specified ordinal position to the new value. This will overwrite the existing entry. If the AllowDeleteObjects option is set then the old object is also deleted.
The exact semantics depends on the specific type of the collection. For some, eg PSortedList#, the object inserted will not stay at the ordinal position. Also the exact behaviour when the index is greater than the size of the collection depends on the collection type, eg in an array collection the array is expanded to accommodate the new index, whereas in a list it will return FALSE.
| index | Index position in collection to set. |
| val | New value to place into the collection. |
Implemented in PAbstractSet, PAbstractDictionary, PAbstractList, and PAbstractSortedList.
| virtual PObject* PCollection::GetAt | ( | PINDEX | index | ) | const [pure virtual] |
Get the object at the specified ordinal position. If the index was greater than the size of the collection then NULL is returned.
| index | Index position in the collection of the object. |
Implemented in PAbstractSet, PAbstractDictionary, PAbstractList, and PAbstractSortedList.
| virtual PINDEX PCollection::GetObjectsIndex | ( | const PObject * | obj | ) | const [pure virtual] |
Search the collection for the specific instance of the object. The object pointers are compared, not the values. The fastest search algorithm is employed depending on the collection type.
| obj | Object to search for. |
Implemented in PAbstractSet, PAbstractDictionary, PAbstractList, and PAbstractSortedList.
| virtual PINDEX PCollection::GetValuesIndex | ( | const PObject & | obj | ) | const [pure virtual] |
Search the collection for the specified value of the object. The object values are compared, not the pointers. So the objects in the collection must correctly implement the PObject::Compare()# function. The fastest search algorithm is employed depending on the collection type.
| obj | Object to search for. |
Implemented in PAbstractSet, PAbstractDictionary, PAbstractList, and PAbstractSortedList.
| PINLINE void PCollection::AllowDeleteObjects | ( | BOOL | yes = TRUE |
) |
Allow or disallow the deletion of the objects contained in the collection. If TRUE then whenever an object is removed, overwritten or the colelction is deleted due to all references being destroyed, the object is deleted.
For example: {verbatim} coll.SetAt(2, new PString("one")); coll.SetAt(2, new PString("Two")); {verbatim} would automatically delete the string containing "one" on the second call to SetAt().
| yes | New value for flag for deleting objects |
| PINLINE void PCollection::DisallowDeleteObjects | ( | ) |
Disallow the deletion of the objects contained in the collection. See the AllowDeleteObjects()# function for more details.
1.5.1