/* This file is automatically rebuilt by the Cesium build process. */
|
define(['exports', './RuntimeError-4fdc4459', './when-8166c7dd', './ComponentDatatype-9ed50558'], (function (exports, RuntimeError, when, ComponentDatatype) { 'use strict';
|
|
var removeDuplicatesEpsilon = ComponentDatatype.CesiumMath.EPSILON10;
|
|
/**
|
* Removes adjacent duplicate values in an array of values.
|
*
|
* @param {Array.<*>} [values] The array of values.
|
* @param {Function} equalsEpsilon Function to compare values with an epsilon. Boolean equalsEpsilon(left, right, epsilon).
|
* @param {Boolean} [wrapAround=false] Compare the last value in the array against the first value. If they are equal, the last value is removed.
|
* @param {Array.<Number>} [removedIndices=undefined] Store the indices that correspond to the duplicate items removed from the array, if there were any.
|
* @returns {Array.<*>|undefined} A new array of values with no adjacent duplicate values or the input array if no duplicates were found.
|
*
|
* @example
|
* // Returns [(1.0, 1.0, 1.0), (2.0, 2.0, 2.0), (3.0, 3.0, 3.0), (1.0, 1.0, 1.0)]
|
* var values = [
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0),
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0),
|
* new Cesium.Cartesian3(2.0, 2.0, 2.0),
|
* new Cesium.Cartesian3(3.0, 3.0, 3.0),
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0)];
|
* var nonDuplicatevalues = Cesium.PolylinePipeline.removeDuplicates(values, Cartesian3.equalsEpsilon);
|
*
|
* @example
|
* // Returns [(1.0, 1.0, 1.0), (2.0, 2.0, 2.0), (3.0, 3.0, 3.0)]
|
* var values = [
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0),
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0),
|
* new Cesium.Cartesian3(2.0, 2.0, 2.0),
|
* new Cesium.Cartesian3(3.0, 3.0, 3.0),
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0)];
|
* var nonDuplicatevalues = Cesium.PolylinePipeline.removeDuplicates(values, Cartesian3.equalsEpsilon, true);
|
*
|
* @example
|
* // Returns [(1.0, 1.0, 1.0), (2.0, 2.0, 2.0), (3.0, 3.0, 3.0)]
|
* // removedIndices will be equal to [1, 3, 5]
|
* var values = [
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0),
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0),
|
* new Cesium.Cartesian3(2.0, 2.0, 2.0),
|
* new Cesium.Cartesian3(2.0, 2.0, 2.0),
|
* new Cesium.Cartesian3(3.0, 3.0, 3.0),
|
* new Cesium.Cartesian3(1.0, 1.0, 1.0)];
|
* var nonDuplicatevalues = Cesium.PolylinePipeline.removeDuplicates(values, Cartesian3.equalsEpsilon, true);
|
* @private
|
*/
|
function arrayRemoveDuplicates(
|
values,
|
equalsEpsilon,
|
wrapAround,
|
removedIndices
|
) {
|
//>>includeStart('debug', pragmas.debug);
|
RuntimeError.Check.defined("equalsEpsilon", equalsEpsilon);
|
//>>includeEnd('debug');
|
|
if (!when.defined(values)) {
|
return undefined;
|
}
|
|
wrapAround = when.defaultValue(wrapAround, false);
|
var storeRemovedIndices = when.defined(removedIndices);
|
|
var length = values.length;
|
if (length < 2) {
|
return values;
|
}
|
|
var i;
|
var v0 = values[0];
|
var v1;
|
|
// We only want to create a new array if there are duplicates in the array.
|
// As such, cleanedValues is undefined until it encounters the first duplicate, if it exists.
|
var cleanedValues;
|
var lastCleanIndex = 0;
|
|
// removedIndexLCI keeps track of where lastCleanIndex would be if it were sorted into the removedIndices array.
|
// In case of arrays such as [A, B, C, ..., A, A, A], removedIndices will not be sorted properly without this.
|
var removedIndexLCI = -1;
|
|
for (i = 1; i < length; ++i) {
|
v1 = values[i];
|
if (equalsEpsilon(v0, v1, removeDuplicatesEpsilon)) {
|
if (!when.defined(cleanedValues)) {
|
cleanedValues = values.slice(0, i);
|
lastCleanIndex = i - 1;
|
removedIndexLCI = 0;
|
}
|
if (storeRemovedIndices) {
|
removedIndices.push(i);
|
}
|
} else {
|
if (when.defined(cleanedValues)) {
|
cleanedValues.push(v1);
|
lastCleanIndex = i;
|
if (storeRemovedIndices) {
|
removedIndexLCI = removedIndices.length;
|
}
|
}
|
v0 = v1;
|
}
|
}
|
|
if (
|
wrapAround &&
|
equalsEpsilon(values[0], values[length - 1], removeDuplicatesEpsilon)
|
) {
|
if (storeRemovedIndices) {
|
if (when.defined(cleanedValues)) {
|
removedIndices.splice(removedIndexLCI, 0, lastCleanIndex);
|
} else {
|
removedIndices.push(length - 1);
|
}
|
}
|
|
if (when.defined(cleanedValues)) {
|
cleanedValues.length -= 1;
|
} else {
|
cleanedValues = values.slice(0, -1);
|
}
|
}
|
|
return when.defined(cleanedValues) ? cleanedValues : values;
|
}
|
|
exports.arrayRemoveDuplicates = arrayRemoveDuplicates;
|
|
}));
|
