|
| | JPtrArray (const JPtrArrayT::CleanUpAction action, const JSize aBlockSize=10) |
| |
| | JPtrArray (const JPtrArray< T > &source, const JPtrArrayT::CleanUpAction action) |
| |
| | JPtrArray (JPtrArray< T > &&dyingSource) noexcept |
| |
| | ~JPtrArray () override |
| |
| const JPtrArray< T > & | CopyPointers (const JPtrArray< T > &source, const JPtrArrayT::CleanUpAction action, const bool append) |
| |
| void | InsertAtIndex (const JIndex index, T *dataPtr) |
| |
| void | Prepend (T *dataPtr) |
| |
| void | Append (T *dataPtr) |
| |
| void | InsertBefore (const T *beforePtr, T *dataPtr) |
| |
| void | InsertAfter (const T *afterPtr, T *dataPtr) |
| |
| void | SetItem (const JIndex index, T *dataPtr, const JPtrArrayT::SetAction action) |
| |
| void | SetToNull (const JIndex index, const JPtrArrayT::SetAction action) |
| |
| const JPtrArray< T > & | CopyObjects (const JPtrArray< T > &source, const JPtrArrayT::CleanUpAction action, const bool append) |
| |
| void | InsertAtIndex (const JIndex index, const T &data) |
| |
| void | Prepend (const T &data) |
| |
| void | Append (const T &data) |
| |
| void | InsertBefore (const T *beforePtr, const T &data) |
| |
| void | InsertAfter (const T *afterPtr, const T &data) |
| |
| void | SetItem (const JIndex index, const T &data, const JPtrArrayT::SetAction action) |
| |
| bool | Remove (const T *dataPtr) |
| |
| void | DeleteItem (const JIndex index) |
| |
| void | DeleteAll () |
| |
| void | DeleteItemAsArray (const JIndex index) |
| |
| void | DeleteAllAsArrays () |
| |
| bool | Includes (const T *dataPtr) const |
| |
| bool | Find (const T *dataPtr, JIndex *itemIndex) const |
| |
| JPtrArrayT::CleanUpAction | GetCleanUpAction () const |
| |
| void | SetCleanUpAction (const JPtrArrayT::CleanUpAction action) |
| |
| void | CleanOut () |
| |
| | JArray (const JSize blockSize=10) |
| |
| | JArray (const JArray< T * > &source) |
| |
| | JArray (JArray< T * > &&dyingSource) noexcept |
| |
| | ~JArray () override |
| |
| JArray< T * > & | operator= (const JArray< T * > &source) |
| |
| | operator const T * * () const |
| |
| const T * * | GetCArray () const |
| |
| T * * | AllocateCArray () const |
| |
| T * | GetItem (const JIndex index) const |
| |
| void | SetItem (const JIndex index, const T * &data) |
| |
| T * | GetItemFromEnd (const JIndex index) const |
| |
| void | SetItemFromEnd (const JIndex index, const T * &data) |
| |
| T * | GetFirstItem () const override |
| |
| T * | GetLastItem () const override |
| |
| void | InsertItemAtIndex (const JIndex index, const T * &data) |
| |
| void | PrependItem (const T * &data) override |
| |
| void | AppendItem (const T * &data) override |
| |
| void | RemoveItem (const JIndex index) |
| |
| void | RemoveNextItems (const JIndex firstIndex, const JSize count) |
| |
| void | RemovePrevItems (const JIndex lastIndex, const JSize count) |
| |
| void | RemoveItems (const JIndexRange &range) |
| |
| void | RemoveItems (const JListT::ItemsRemoved &info) |
| |
| void | RemoveAll () override |
| |
| void | MoveItemToIndex (const JIndex currentIndex, const JIndex newIndex) |
| |
| void | MoveItemToIndex (const JListT::ItemMoved &info) |
| |
| void | SwapItems (const JIndex index1, const JIndex index2) |
| |
| void | SwapItems (const JListT::ItemsSwapped &info) |
| |
| JListIterator< T * > * | NewIterator (const JListT::Position start=JListT::kStartAtBeginning, const JIndex index=0) override |
| |
| JListIterator< T * > * | NewIterator (const JListT::Position start=JListT::kStartAtBeginning, const JIndex index=0) const override |
| |
| JSize | GetBlockSize () const |
| |
| void | SetBlockSize (const JSize newBlockSize) |
| |
| void | Sort () |
| |
| bool | InsertSorted (const T * &data, const bool insertIfDuplicate=true, JIndex *index=nullptr) |
| |
| JIndex | GetInsertionSortIndex (const T * &data, bool *isDuplicate=nullptr) const |
| |
| bool | SearchSorted (const T * &target, const JListT::SearchReturn which, JIndex *index) const |
| |
| JIndex | SearchSortedOTI (const T * &target, const JListT::SearchReturn which, bool *found) const |
| |
| void | QuickSort (int(*compare)(const void *, const void *)) |
| |
| const T * * | begin () const |
| |
| const T * * | end () const |
| |
| | JList () |
| |
| | JList (const JList< T > &source) |
| |
| | ~JList () override |
| |
| void | SetCompareFunction (const std::function< std::weak_ordering(const T &, const T &)> compareFn) |
| |
| void | CopyCompareFunction (const JList< T > &source) |
| |
| void | ClearCompareFunction () |
| |
| JListT::SortOrder | GetSortOrder () const |
| |
| void | SetSortOrder (const JListT::SortOrder order) |
| |
| bool | IsSorted () const |
| |
| | JCollection () |
| |
| | JCollection (const JCollection &source) |
| |
| | ~JCollection () override |
| |
| JCollection & | operator= (const JCollection &source) |
| |
| JSize | GetItemCount () const |
| |
| bool | IsEmpty () const |
| |
| bool | IndexValid (const JIndex index) const |
| |
| JIndex | GetIndexFromEnd (const JIndex index) const |
| |
| JString | ToString () const override |
| |
| | JBroadcaster () |
| |
| virtual | ~JBroadcaster () |
| |
| JBroadcaster & | operator= (const JBroadcaster &source) |
| |
| bool | HasSenders () const |
| |
| JSize | GetSenderCount () const |
| |
| bool | HasRecipients () const |
| |
| JSize | GetRecipientCount () const |
| |
| template<class T > |
| void | ListenTo (const JBroadcaster *sender, const std::function< void(const T &)> &f) |
| |
template<class T>
class JPtrArray< T >
Interface for JPtrArray class
Comparison functions for JString, for use with JPtrArray<JString>.
The Pointer Array Template Class
Template for a dynamically sized array of pointers. The pointers are stored contiguously.
Since only the pointers are stored, this is good for objects.
Implementation notes:
Retrieving an item from the actual array gives a pointer.
We do not override ToString(): Since this function is virtual, it is always instantiated. Thus, we cannot print the objects, because they might not have ToString() or operator<<