Mercurial > hg > truffle
comparison src/share/vm/utilities/growableArray.hpp @ 1080:7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
Reviewed-by: kvn, twisti
author | never |
---|---|
date | Thu, 12 Nov 2009 09:24:21 -0800 |
parents | ad8c8ca4ab0f |
children | c18cbe5936b8 |
comparison
equal
deleted
inserted
replaced
1078:8e7adf982378 | 1080:7c57aead6d3e |
---|---|
276 assert(0 <= index && index < _len, "illegal index"); | 276 assert(0 <= index && index < _len, "illegal index"); |
277 for (int j = index + 1; j < _len; j++) _data[j-1] = _data[j]; | 277 for (int j = index + 1; j < _len; j++) _data[j-1] = _data[j]; |
278 _len--; | 278 _len--; |
279 } | 279 } |
280 | 280 |
281 // inserts the given element before the element at index i | |
282 void insert_before(const int idx, const E& elem) { | |
283 check_nesting(); | |
284 if (_len == _max) grow(_len); | |
285 for (int j = _len - 1; j >= idx; j--) { | |
286 _data[j + 1] = _data[j]; | |
287 } | |
288 _len++; | |
289 _data[idx] = elem; | |
290 } | |
291 | |
281 void appendAll(const GrowableArray<E>* l) { | 292 void appendAll(const GrowableArray<E>* l) { |
282 for (int i = 0; i < l->_len; i++) { | 293 for (int i = 0; i < l->_len; i++) { |
283 raw_at_put_grow(_len, l->_data[i], 0); | 294 raw_at_put_grow(_len, l->_data[i], 0); |
284 } | 295 } |
285 } | 296 } |