Cache array length in ol.structs.Buffer
This commit is contained in:
@@ -86,7 +86,8 @@ ol.structs.Buffer.prototype.add = function(values) {
|
|||||||
for (i = 0; i < size; ++i) {
|
for (i = 0; i < size; ++i) {
|
||||||
this.arr_[offset + i] = values[i];
|
this.arr_[offset + i] = values[i];
|
||||||
}
|
}
|
||||||
for (i = 0; i < this.dirtySets_.length; ++i) {
|
var ii;
|
||||||
|
for (i = 0, ii = this.dirtySets_.length; i < ii; ++i) {
|
||||||
this.dirtySets_[i].addRange(offset, offset + size);
|
this.dirtySets_[i].addRange(offset, offset + size);
|
||||||
}
|
}
|
||||||
return offset;
|
return offset;
|
||||||
@@ -151,9 +152,9 @@ ol.structs.Buffer.prototype.getUsage = function() {
|
|||||||
* @param {number} offset Offset.
|
* @param {number} offset Offset.
|
||||||
*/
|
*/
|
||||||
ol.structs.Buffer.prototype.remove = function(size, offset) {
|
ol.structs.Buffer.prototype.remove = function(size, offset) {
|
||||||
var i;
|
var i, ii;
|
||||||
this.freeSet_.addRange(offset, offset + size);
|
this.freeSet_.addRange(offset, offset + size);
|
||||||
for (i = 0; i < this.dirtySets_.length; ++i) {
|
for (i = 0, ii = this.dirtySets_.length; i < ii; ++i) {
|
||||||
this.dirtySets_[i].removeRange(offset, offset + size);
|
this.dirtySets_[i].removeRange(offset, offset + size);
|
||||||
}
|
}
|
||||||
if (ol.BUFFER_REPLACE_UNUSED_ENTRIES_WITH_NANS) {
|
if (ol.BUFFER_REPLACE_UNUSED_ENTRIES_WITH_NANS) {
|
||||||
@@ -186,7 +187,8 @@ ol.structs.Buffer.prototype.set = function(values, offset) {
|
|||||||
for (i = 0; i < n; ++i) {
|
for (i = 0; i < n; ++i) {
|
||||||
arr[offset + i] = values[i];
|
arr[offset + i] = values[i];
|
||||||
}
|
}
|
||||||
for (i = 0; i < this.dirtySets_.length; ++i) {
|
var ii;
|
||||||
|
for (i = 0, ii = this.dirtySets_.length; i < ii; ++i) {
|
||||||
this.dirtySets_[i].addRange(offset, offset + n);
|
this.dirtySets_[i].addRange(offset, offset + n);
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|||||||
Reference in New Issue
Block a user