Lines Matching full:elements
63 * allows efficient constant time access to elements with a specified index.
64 * A vector grows transparently as the user adds elements to the array.
66 * As the vector grows in size, it does not relocate existing elements in
67 * memory. This allows using pointers to elements stored in a Vector.
111 * used as initializer for elements being allocated by a vector.
150 * used as destructor for elements being deallocated from a vector.
182 * used to iterate elements in a vector.
218 * used to find elements in a vector.
257 * used to copy elements in a vector.
310 * Number of elements successfully initialized in the vector.
313 * Number of elements to allocate when growing.
316 * total # of elements allocated.
337 * Internal array of pointers to elements.
397 * [in] Initial number of elements.
400 * [in] Number of elements to allocate when incrementally growing
412 * [in] Destructor callback to invoke for elements being deallocated.
489 * Capacity, in elements, of the vector.
492 * The capacity is the number of elements that the vector can store, and
493 * can be greater than the number of elements stored. To get the number of
494 * elements stored in the vector, use cl_vector_get_size.
523 * Size, in elements, of the vector.
616 * of the vector. To access elements after performing boundary checks,
712 * specified number of elements.
725 * [in] Total number of elements for which the vector should
762 * [in] Number of elements desired in the vector.
773 * The destructor function, if any, will be invoked for all elements that
775 * be invoked for all new elements.
803 * [in] Minimum number of elements that the vector should contain.
839 * [in] Pointer to a cl_vector_t structure whose elements to iterate.
867 * search for elements in a vector starting from the lowest index.
908 * for elements in a vector starting from the highest index.