ResidualVM logo ResidualVM website - Forums - Contact us BuildBot - Doxygen - Wiki curved edge

Common::SortedArray< T > Class Template Reference

Double linked list with sorted nodes. More...

#include <array.h>

Inheritance diagram for Common::SortedArray< T >:
Collaboration diagram for Common::SortedArray< T >:

List of all members.

Public Types

typedef T * iterator
typedef uint size_type

Public Member Functions

 SortedArray (int(*comparator)(const void *, const void *))
void insert (const T &element)
 Inserts element at the sorted position.

Private Member Functions

T & operator[] (size_type idx)
void insert_at (size_type idx, const T &element)
void insert_at (size_type idx, const Array< T > &array)
void insert (iterator pos, const T &element)
 Inserts element before pos.
void push_back (const T &element)
 Appends element to the end of the array.
void push_back (const Array< T > &array)
T * bsearchMin (void *key)

Private Attributes

int(* _comparator )(const void *, const void *)

Detailed Description

template<class T>
class Common::SortedArray< T >

Double linked list with sorted nodes.

Definition at line 396 of file array.h.


Member Typedef Documentation

template<class T >
typedef T* Common::SortedArray< T >::iterator

Reimplemented from Common::Array< T >.

Definition at line 398 of file array.h.

template<class T >
typedef uint Common::SortedArray< T >::size_type

Reimplemented from Common::Array< T >.

Definition at line 399 of file array.h.


Constructor & Destructor Documentation

template<class T >
Common::SortedArray< T >::SortedArray ( int(*)(const void *, const void *)  comparator  )  [inline]

Definition at line 401 of file array.h.


Member Function Documentation

template<class T >
T* Common::SortedArray< T >::bsearchMin ( void *  key  )  [inline, private]

Definition at line 438 of file array.h.

template<class T >
void Common::SortedArray< T >::insert ( const T &  element  )  [inline]

Inserts element at the sorted position.

Definition at line 408 of file array.h.

template<class T >
void Common::SortedArray< T >::insert ( iterator  pos,
const T &  element 
) [private]

Inserts element before pos.

Reimplemented from Common::Array< T >.

template<class T >
void Common::SortedArray< T >::insert_at ( size_type  idx,
const Array< T > &  array 
) [private]

Reimplemented from Common::Array< T >.

template<class T >
void Common::SortedArray< T >::insert_at ( size_type  idx,
const T &  element 
) [private]

Reimplemented from Common::Array< T >.

template<class T >
T& Common::SortedArray< T >::operator[] ( size_type  idx  )  [private]

Reimplemented from Common::Array< T >.

template<class T >
void Common::SortedArray< T >::push_back ( const Array< T > &  array  )  [private]

Reimplemented from Common::Array< T >.

template<class T >
void Common::SortedArray< T >::push_back ( const T &  element  )  [private]

Appends element to the end of the array.

Reimplemented from Common::Array< T >.


Member Data Documentation

template<class T >
int(* Common::SortedArray< T >::_comparator)(const void *, const void *) [private]

Definition at line 457 of file array.h.


The documentation for this class was generated from the following file:


Generated on Sat May 18 2019 05:05:49 for ResidualVM by doxygen 1.7.1
curved edge   curved edge