#include <lists32.h>
|
typedef T ** | iterator |
|
typedef T *const * | const_iterator |
|
typedef T * | value_type |
|
typedef uint | size_type |
|
template<class T, uint N>
class Sci::StablePointerDynamicArray< T, N >
StablePointerDynamicArray is like StablePointerArray above, except that it uses a Common::Array for storage instead of a fixed array. It is only used by DrawList, and was created upon discovering that LSL7 room 301 can overflow DrawList when displaying a large menu. Bug #14632
◆ add()
template<class T , uint N>
Adds a new pointer to the array.
◆ erase() [1/2]
template<class T , uint N>
Erases the object pointed to by the given iterator.
◆ erase() [2/2]
template<class T , uint N>
Erases the object pointed to by the given iterator.
◆ erase_at()
template<class T , uint N>
Erases the object pointed to at the given index.
◆ pack()
template<class T , uint N>
Removes freed pointers from the pointer list.
◆ size()
template<class T , uint N>
The number of populated slots in the array. The size of the array will only go down once pack
is called.
The documentation for this class was generated from the following file: