Lines Matching defs:array
25 /** SkTArray<T> implements a typical, mostly std::vector-like array.
28 MEM_MOVE controls the behavior when a T needs to be moved (e.g. when the array is resized)
43 * Creates an empty array with no initial storage
48 * Creates an empty array that will preallocate space for reserveCount
54 * Copies one array to another. The new array will be heap allocated.
80 * Creates a SkTArray by copying contents of a standard C array. The new
81 * array will be heap allocated. Be careful not to use this constructor
84 SkTArray(const T* array, int count) {
86 this->copy(array);
158 * Resets to a copy of a C array and resets any reserve count.
160 void reset(const T* array, int count) {
167 this->copy(array);
173 * until the array size grows above n and subsequently shrinks below n, any version of reset()
197 * Number of elements in the array.
202 * Is the array empty.
233 * Construct a new T at the back of this array.
243 * next API call made on the array that might add or remove elements.
331 /** Swaps the contents of this array with that array. Does a pointer swap if possible,
443 * Creates an empty array that will use the passed storage block until it
444 * is insufficiently large to hold the entire array.
452 * Copy a C array, using preallocated storage if preAllocCount >=
453 * count. Otherwise storage will only be used when array shrinks
457 SkTArray(const T* array, int count, SkAlignedSTStorage<N,T>* storage) {
459 this->copy(array);
593 * Subclass of SkTArray that contains a preallocated memory block for the array.
605 SkSTArray(const T* array, int count)
606 : STORAGE{}, INHERITED(array, count, static_cast<STORAGE*>(this)) {}