You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
106 lines
3.1 KiB
JavaScript
106 lines
3.1 KiB
JavaScript
/* This file is automatically rebuilt by the Cesium build process. */
|
|
define(['exports', './Check-285f6bfc', './when-f31b6bd1', './Math-8c161f1c'], function (exports, Check, when, _Math) { 'use strict';
|
|
|
|
var removeDuplicatesEpsilon = _Math.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.
|
|
* @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);
|
|
*
|
|
* @private
|
|
*/
|
|
function arrayRemoveDuplicates(values, equalsEpsilon, wrapAround) {
|
|
//>>includeStart('debug', pragmas.debug);
|
|
Check.Check.defined("equalsEpsilon", equalsEpsilon);
|
|
//>>includeEnd('debug');
|
|
|
|
if (!when.defined(values)) {
|
|
return undefined;
|
|
}
|
|
|
|
wrapAround = when.defaultValue(wrapAround, false);
|
|
|
|
var length = values.length;
|
|
if (length < 2) {
|
|
return values;
|
|
}
|
|
|
|
var i;
|
|
var v0;
|
|
var v1;
|
|
|
|
for (i = 1; i < length; ++i) {
|
|
v0 = values[i - 1];
|
|
v1 = values[i];
|
|
if (equalsEpsilon(v0, v1, removeDuplicatesEpsilon)) {
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (i === length) {
|
|
if (
|
|
wrapAround &&
|
|
equalsEpsilon(
|
|
values[0],
|
|
values[values.length - 1],
|
|
removeDuplicatesEpsilon
|
|
)
|
|
) {
|
|
return values.slice(1);
|
|
}
|
|
return values;
|
|
}
|
|
|
|
var cleanedvalues = values.slice(0, i);
|
|
for (; i < length; ++i) {
|
|
// v0 is set by either the previous loop, or the previous clean point.
|
|
v1 = values[i];
|
|
if (!equalsEpsilon(v0, v1, removeDuplicatesEpsilon)) {
|
|
cleanedvalues.push(v1);
|
|
v0 = v1;
|
|
}
|
|
}
|
|
|
|
if (
|
|
wrapAround &&
|
|
cleanedvalues.length > 1 &&
|
|
equalsEpsilon(
|
|
cleanedvalues[0],
|
|
cleanedvalues[cleanedvalues.length - 1],
|
|
removeDuplicatesEpsilon
|
|
)
|
|
) {
|
|
cleanedvalues.shift();
|
|
}
|
|
|
|
return cleanedvalues;
|
|
}
|
|
|
|
exports.arrayRemoveDuplicates = arrayRemoveDuplicates;
|
|
|
|
});
|