Lines Matching refs:length
53 ResourceArray(size_t esize, int length) {
55 initialize(esize, length);
58 void initialize(size_t esize, int length) {
59 assert(length >= 0, "illegal length");
61 _length = length;
62 _data = resource_allocate_bytes(esize * length);
77 int length() const { return _length; }
78 bool is_empty() const { return length() == 0; }
94 CHeapArray(size_t esize, int length) {
95 assert(length >= 0, "illegal length");
96 _length = length;
97 _data = (void*) NEW_C_HEAP_ARRAY(char *, esize * length, F);
111 int length() const { return _length; }
112 bool is_empty() const { return length() == 0; }
126 array_name(const int length) : base_class(esize, length) {} \
127 array_name(const int length, const etype fx) { initialize(length, fx); } \
128 void initialize(const int length) { base_class::initialize(esize, length); } \
129 void initialize(const int length, const etype fx) { \
130 initialize(length); \
131 for (int i = 0; i < length; i++) ((etype*)_data)[i] = fx; \
136 assert(0 <= i && i < length(), "index out of bounds"); \
141 int i = length(); \
168 assert(i >= length(), "index too small"); \
170 for (int j = length(); j <= i; j++) ((etype*)_data)[j] = fx; \
187 _length = 0; /* reset length to zero; _size records the allocation */ \
194 int len = length(); \
208 return ((etype*)_data)[length() - 1]; \
212 const int l = stack->length(); \
217 if (i >= length()) grow(i, fx); \
222 if (i >= length()) grow(i, fx); \
226 void truncate(const int length) { \
227 assert(0 <= length && length <= this->length(), "illegal length"); \
228 _length = length; \
236 int len = length(); \
248 if (st->length() == 0) return; \
249 int len = length(); \
250 int st_len = st->length(); \
266 void trunc_to(const int length) { truncate(length); } \