Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 | 1x 126x 126x 351x 351x 2466x 2466x 2466x 2466x 2466x 184x 184x 906x 2466x 453078x 213518x 789x 212729x 60x 212669x 1x 1x 1179x 1179x 1279x 1279x 1279x 1279x 1279x 1233x 1233x 1233x 1233x 1233x 212239x 212239x 54x 212185x 212185x 212185x 240893x 240893x 212185x 1233x 1233x 1233x 1233x 1233x 46x 134x 134x 46x 1097x 1096x 1096x 511x 1096x 1096x 1096x 1096x 20x 20x 20x 25x 25x 11x 25x 25x 25x 25x 20x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1096x 1x 145x 3611x 2x 2x 6x 6x 6x 18x 10x 10x 6x 10x 5x 5x 6x 15x 6x 6x 6x 10x 5x 5x 1x 1x 1610x 1x 1610x 1610x 1610x 11x 1599x 1599x 1599x 1599x 233x 233x 14x 14x 14x 12x 2x 1x 220x 20x 20x 20x 20x 16x 4x 1x 1x 203x 203x 203x 203x 203x 203x 57x 57x 57x 57x 57x 57x 203x 203x 203x 203x 203x 203x 203x 203x 1x 203x 203x 203x 203x 203x 203x 408x 203x 200x 200x 200x 200x 200x 1428x 1428x 1428x 3x 203x 203x 156x 47x 47x 203x 200x 3x 1366x 1x 324x 324x 324x 324x 324x 29x 29x 324x 20x 20x 324x 31x 31x 1x 280x 280x 280x 280x 280x 16x 280x 280x 280x 280x 280x 16x 16x 21x 280x 280x 280x 1x 58x 58x 58x 58x 58x 58x 2x 56x 56x 56x 56x 155x 155x 155x 11x 11x 11x 11x 56x 56x 56x 1x 8x 8x 8x 8x 8x 4x 8x 1x 831x 831x 831x 831x 1x 4x 4x 4x 2x 2x 2x 16x 16x 16x 16x 16x 1x 14x 14x 14x 14x 5x 9x 2x 14x 14x 4x 10x 8x 14x 1x 38x 17x 21x 21x 4x 17x 17x 17x 17x 17x 1x 16x 3x 3x 1x 2x 2x 1x 14x 14x 14x 14x 2x 12x 3x 12x 12x 12x 12x 8x 1x 11x 1x | import binarySearch from "../Core/binarySearch.js";
import Check from "../Core/Check.js";
import defined from "../Core/defined.js";
import DeveloperError from "../Core/DeveloperError.js";
import Event from "../Core/Event.js";
import ExtrapolationType from "../Core/ExtrapolationType.js";
import JulianDate from "../Core/JulianDate.js";
import LinearApproximation from "../Core/LinearApproximation.js";
const PackableNumber = {
packedLength: 1,
pack: function (value, array, startingIndex) {
startingIndex = startingIndex ?? 0;
array[startingIndex] = value;
},
unpack: function (array, startingIndex, result) {
startingIndex = startingIndex ?? 0;
return array[startingIndex];
},
};
//We can't use splice for inserting new elements because function apply can't handle
//a huge number of arguments. See https://code.google.com/p/chromium/issues/detail?id=56588
function arrayInsert(array, startIndex, items) {
let i;
const arrayLength = array.length;
const itemsLength = items.length;
const newLength = arrayLength + itemsLength;
array.length = newLength;
if (arrayLength !== startIndex) {
let q = arrayLength - 1;
for (i = newLength - 1; i >= startIndex; i--) {
array[i] = array[q--];
}
}
for (i = 0; i < itemsLength; i++) {
array[startIndex++] = items[i];
}
}
function convertDate(date, epoch) {
if (date instanceof JulianDate) {
return date;
}
if (typeof date === "string") {
return JulianDate.fromIso8601(date);
}
return JulianDate.addSeconds(epoch, date, new JulianDate());
}
const timesSpliceArgs = [];
const valuesSpliceArgs = [];
function mergeNewSamples(epoch, times, values, newData, packedLength) {
let newDataIndex = 0;
let i;
let prevItem;
let timesInsertionPoint;
let valuesInsertionPoint;
let currentTime;
let nextTime;
while (newDataIndex < newData.length) {
currentTime = convertDate(newData[newDataIndex], epoch);
timesInsertionPoint = binarySearch(times, currentTime, JulianDate.compare);
let timesSpliceArgsCount = 0;
let valuesSpliceArgsCount = 0;
if (timesInsertionPoint < 0) {
//Doesn't exist, insert as many additional values as we can.
timesInsertionPoint = ~timesInsertionPoint;
valuesInsertionPoint = timesInsertionPoint * packedLength;
prevItem = undefined;
nextTime = times[timesInsertionPoint];
while (newDataIndex < newData.length) {
currentTime = convertDate(newData[newDataIndex], epoch);
if (
(defined(prevItem) &&
JulianDate.compare(prevItem, currentTime) >= 0) ||
(defined(nextTime) && JulianDate.compare(currentTime, nextTime) >= 0)
) {
break;
}
timesSpliceArgs[timesSpliceArgsCount++] = currentTime;
newDataIndex = newDataIndex + 1;
for (i = 0; i < packedLength; i++) {
valuesSpliceArgs[valuesSpliceArgsCount++] = newData[newDataIndex];
newDataIndex = newDataIndex + 1;
}
prevItem = currentTime;
}
Eif (timesSpliceArgsCount > 0) {
valuesSpliceArgs.length = valuesSpliceArgsCount;
arrayInsert(values, valuesInsertionPoint, valuesSpliceArgs);
timesSpliceArgs.length = timesSpliceArgsCount;
arrayInsert(times, timesInsertionPoint, timesSpliceArgs);
}
} else {
//Found an exact match
for (i = 0; i < packedLength; i++) {
newDataIndex++;
values[timesInsertionPoint * packedLength + i] = newData[newDataIndex];
}
newDataIndex++;
}
}
}
/**
* A {@link Property} whose value is interpolated for a given time from the
* provided set of samples and specified interpolation algorithm and degree.
* @alias SampledProperty
* @constructor
*
* @param {number|Packable} type The type of property.
* @param {Packable[]} [derivativeTypes] When supplied, indicates that samples will contain derivative information of the specified types.
*
*
* @example
* //Create a linearly interpolated Cartesian2
* const property = new Cesium.SampledProperty(Cesium.Cartesian2);
*
* //Populate it with data
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-01T00:00:00.00Z'), new Cesium.Cartesian2(0, 0));
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-02T00:00:00.00Z'), new Cesium.Cartesian2(4, 7));
*
* //Retrieve an interpolated value
* const result = property.getValue(Cesium.JulianDate.fromIso8601('2012-08-01T12:00:00.00Z'));
*
* @example
* //Create a simple numeric SampledProperty that uses third degree Hermite Polynomial Approximation
* const property = new Cesium.SampledProperty(Number);
* property.setInterpolationOptions({
* interpolationDegree : 3,
* interpolationAlgorithm : Cesium.HermitePolynomialApproximation
* });
*
* //Populate it with data
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-01T00:00:00.00Z'), 1.0);
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-01T00:01:00.00Z'), 6.0);
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-01T00:02:00.00Z'), 12.0);
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-01T00:03:30.00Z'), 5.0);
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-01T00:06:30.00Z'), 2.0);
*
* //Samples can be added in any order.
* property.addSample(Cesium.JulianDate.fromIso8601('2012-08-01T00:00:30.00Z'), 6.2);
*
* //Retrieve an interpolated value
* const result = property.getValue(Cesium.JulianDate.fromIso8601('2012-08-01T00:02:34.00Z'));
*
* @see SampledPositionProperty
*/
function SampledProperty(type, derivativeTypes) {
//>>includeStart('debug', pragmas.debug);
Check.defined("type", type);
//>>includeEnd('debug');
let innerType = type;
if (innerType === Number) {
innerType = PackableNumber;
}
let packedLength = innerType.packedLength;
let packedInterpolationLength =
innerType.packedInterpolationLength ?? packedLength;
let inputOrder = 0;
let innerDerivativeTypes;
if (defined(derivativeTypes)) {
const length = derivativeTypes.length;
innerDerivativeTypes = new Array(length);
for (let i = 0; i < length; i++) {
let derivativeType = derivativeTypes[i];
if (derivativeType === Number) {
derivativeType = PackableNumber;
}
const derivativePackedLength = derivativeType.packedLength;
packedLength += derivativePackedLength;
packedInterpolationLength +=
derivativeType.packedInterpolationLength ?? derivativePackedLength;
innerDerivativeTypes[i] = derivativeType;
}
inputOrder = length;
}
this._type = type;
this._innerType = innerType;
this._interpolationDegree = 1;
this._interpolationAlgorithm = LinearApproximation;
this._numberOfPoints = 0;
this._times = [];
this._values = [];
this._xTable = [];
this._yTable = [];
this._packedLength = packedLength;
this._packedInterpolationLength = packedInterpolationLength;
this._updateTableLength = true;
this._interpolationResult = new Array(packedInterpolationLength);
this._definitionChanged = new Event();
this._derivativeTypes = derivativeTypes;
this._innerDerivativeTypes = innerDerivativeTypes;
this._inputOrder = inputOrder;
this._forwardExtrapolationType = ExtrapolationType.NONE;
this._forwardExtrapolationDuration = 0;
this._backwardExtrapolationType = ExtrapolationType.NONE;
this._backwardExtrapolationDuration = 0;
}
Object.defineProperties(SampledProperty.prototype, {
/**
* Gets a value indicating if this property is constant. A property is considered
* constant if getValue always returns the same result for the current definition.
* @memberof SampledProperty.prototype
*
* @type {boolean}
* @readonly
*/
isConstant: {
get: function () {
return this._values.length === 0;
},
},
/**
* Gets the event that is raised whenever the definition of this property changes.
* The definition is considered to have changed if a call to getValue would return
* a different result for the same time.
* @memberof SampledProperty.prototype
*
* @type {Event}
* @readonly
*/
definitionChanged: {
get: function () {
return this._definitionChanged;
},
},
/**
* Gets the type of property.
* @memberof SampledProperty.prototype
* @type {*}
*/
type: {
get: function () {
return this._type;
},
},
/**
* Gets the derivative types used by this property.
* @memberof SampledProperty.prototype
* @type {Packable[]}
*/
derivativeTypes: {
get: function () {
return this._derivativeTypes;
},
},
/**
* Gets the degree of interpolation to perform when retrieving a value.
* @memberof SampledProperty.prototype
* @type {number}
* @default 1
*/
interpolationDegree: {
get: function () {
return this._interpolationDegree;
},
},
/**
* Gets the interpolation algorithm to use when retrieving a value.
* @memberof SampledProperty.prototype
* @type {InterpolationAlgorithm}
* @default LinearApproximation
*/
interpolationAlgorithm: {
get: function () {
return this._interpolationAlgorithm;
},
},
/**
* Gets or sets the type of extrapolation to perform when a value
* is requested at a time after any available samples.
* @memberof SampledProperty.prototype
* @type {ExtrapolationType}
* @default ExtrapolationType.NONE
*/
forwardExtrapolationType: {
get: function () {
return this._forwardExtrapolationType;
},
set: function (value) {
if (this._forwardExtrapolationType !== value) {
this._forwardExtrapolationType = value;
this._definitionChanged.raiseEvent(this);
}
},
},
/**
* Gets or sets the amount of time to extrapolate forward before
* the property becomes undefined. A value of 0 will extrapolate forever.
* @memberof SampledProperty.prototype
* @type {number}
* @default 0
*/
forwardExtrapolationDuration: {
get: function () {
return this._forwardExtrapolationDuration;
},
set: function (value) {
if (this._forwardExtrapolationDuration !== value) {
this._forwardExtrapolationDuration = value;
this._definitionChanged.raiseEvent(this);
}
},
},
/**
* Gets or sets the type of extrapolation to perform when a value
* is requested at a time before any available samples.
* @memberof SampledProperty.prototype
* @type {ExtrapolationType}
* @default ExtrapolationType.NONE
*/
backwardExtrapolationType: {
get: function () {
return this._backwardExtrapolationType;
},
set: function (value) {
if (this._backwardExtrapolationType !== value) {
this._backwardExtrapolationType = value;
this._definitionChanged.raiseEvent(this);
}
},
},
/**
* Gets or sets the amount of time to extrapolate backward
* before the property becomes undefined. A value of 0 will extrapolate forever.
* @memberof SampledProperty.prototype
* @type {number}
* @default 0
*/
backwardExtrapolationDuration: {
get: function () {
return this._backwardExtrapolationDuration;
},
set: function (value) {
if (this._backwardExtrapolationDuration !== value) {
this._backwardExtrapolationDuration = value;
this._definitionChanged.raiseEvent(this);
}
},
},
});
const timeScratch = new JulianDate();
/**
* Gets the value of the property at the provided time.
*
* @param {JulianDate} [time=JulianDate.now()] The time for which to retrieve the value. If omitted, the current system time is used.
* @param {object} [result] The object to store the value into, if omitted, a new instance is created and returned.
* @returns {object} The modified result parameter or a new instance if the result parameter was not supplied.
*/
SampledProperty.prototype.getValue = function (time, result) {
if (!defined(time)) {
time = JulianDate.now(timeScratch);
}
const times = this._times;
const timesLength = times.length;
if (timesLength === 0) {
return undefined;
}
let timeout;
const innerType = this._innerType;
const values = this._values;
let index = binarySearch(times, time, JulianDate.compare);
if (index < 0) {
index = ~index;
if (index === 0) {
const startTime = times[index];
timeout = this._backwardExtrapolationDuration;
if (
this._backwardExtrapolationType === ExtrapolationType.NONE ||
(timeout !== 0 &&
JulianDate.secondsDifference(startTime, time) > timeout)
) {
return undefined;
}
if (this._backwardExtrapolationType === ExtrapolationType.HOLD) {
return innerType.unpack(values, 0, result);
}
}
if (index >= timesLength) {
index = timesLength - 1;
const endTime = times[index];
timeout = this._forwardExtrapolationDuration;
if (
this._forwardExtrapolationType === ExtrapolationType.NONE ||
(timeout !== 0 && JulianDate.secondsDifference(time, endTime) > timeout)
) {
return undefined;
}
if (this._forwardExtrapolationType === ExtrapolationType.HOLD) {
index = timesLength - 1;
return innerType.unpack(values, index * innerType.packedLength, result);
}
}
const xTable = this._xTable;
const yTable = this._yTable;
const interpolationAlgorithm = this._interpolationAlgorithm;
const packedInterpolationLength = this._packedInterpolationLength;
const inputOrder = this._inputOrder;
if (this._updateTableLength) {
this._updateTableLength = false;
const numberOfPoints = Math.min(
interpolationAlgorithm.getRequiredDataPoints(
this._interpolationDegree,
inputOrder,
),
timesLength,
);
Eif (numberOfPoints !== this._numberOfPoints) {
this._numberOfPoints = numberOfPoints;
xTable.length = numberOfPoints;
yTable.length = numberOfPoints * packedInterpolationLength;
}
}
const degree = this._numberOfPoints - 1;
Iif (degree < 1) {
return undefined;
}
let firstIndex = 0;
let lastIndex = timesLength - 1;
const pointsInCollection = lastIndex - firstIndex + 1;
Eif (pointsInCollection >= degree + 1) {
let computedFirstIndex = index - ((degree / 2) | 0) - 1;
if (computedFirstIndex < firstIndex) {
computedFirstIndex = firstIndex;
}
let computedLastIndex = computedFirstIndex + degree;
Iif (computedLastIndex > lastIndex) {
computedLastIndex = lastIndex;
computedFirstIndex = computedLastIndex - degree;
if (computedFirstIndex < firstIndex) {
computedFirstIndex = firstIndex;
}
}
firstIndex = computedFirstIndex;
lastIndex = computedLastIndex;
}
const length = lastIndex - firstIndex + 1;
// Build the tables
for (let i = 0; i < length; ++i) {
xTable[i] = JulianDate.secondsDifference(
times[firstIndex + i],
times[lastIndex],
);
}
if (!defined(innerType.convertPackedArrayForInterpolation)) {
let destinationIndex = 0;
const packedLength = this._packedLength;
let sourceIndex = firstIndex * packedLength;
const stop = (lastIndex + 1) * packedLength;
while (sourceIndex < stop) {
yTable[destinationIndex] = values[sourceIndex];
sourceIndex++;
destinationIndex++;
}
} else {
innerType.convertPackedArrayForInterpolation(
values,
firstIndex,
lastIndex,
yTable,
);
}
// Interpolate!
const x = JulianDate.secondsDifference(time, times[lastIndex]);
let interpolationResult;
if (inputOrder === 0 || !defined(interpolationAlgorithm.interpolate)) {
interpolationResult = interpolationAlgorithm.interpolateOrderZero(
x,
xTable,
yTable,
packedInterpolationLength,
this._interpolationResult,
);
} else {
const yStride = Math.floor(packedInterpolationLength / (inputOrder + 1));
interpolationResult = interpolationAlgorithm.interpolate(
x,
xTable,
yTable,
yStride,
inputOrder,
inputOrder,
this._interpolationResult,
);
}
if (!defined(innerType.unpackInterpolationResult)) {
return innerType.unpack(interpolationResult, 0, result);
}
return innerType.unpackInterpolationResult(
interpolationResult,
values,
firstIndex,
lastIndex,
result,
);
}
return innerType.unpack(values, index * this._packedLength, result);
};
/**
* Sets the algorithm and degree to use when interpolating a value.
*
* @param {object} [options] Object with the following properties:
* @param {InterpolationAlgorithm} [options.interpolationAlgorithm] The new interpolation algorithm. If undefined, the existing property will be unchanged.
* @param {number} [options.interpolationDegree] The new interpolation degree. If undefined, the existing property will be unchanged.
*/
SampledProperty.prototype.setInterpolationOptions = function (options) {
Iif (!defined(options)) {
return;
}
let valuesChanged = false;
const interpolationAlgorithm = options.interpolationAlgorithm;
const interpolationDegree = options.interpolationDegree;
if (
defined(interpolationAlgorithm) &&
this._interpolationAlgorithm !== interpolationAlgorithm
) {
this._interpolationAlgorithm = interpolationAlgorithm;
valuesChanged = true;
}
if (
defined(interpolationDegree) &&
this._interpolationDegree !== interpolationDegree
) {
this._interpolationDegree = interpolationDegree;
valuesChanged = true;
}
if (valuesChanged) {
this._updateTableLength = true;
this._definitionChanged.raiseEvent(this);
}
};
/**
* Adds a new sample.
*
* @param {JulianDate} time The sample time.
* @param {Packable} value The value at the provided time.
* @param {Packable[]} [derivatives] The array of derivatives at the provided time.
*/
SampledProperty.prototype.addSample = function (time, value, derivatives) {
const innerDerivativeTypes = this._innerDerivativeTypes;
const hasDerivatives = defined(innerDerivativeTypes);
//>>includeStart('debug', pragmas.debug);
Check.defined("time", time);
Check.defined("value", value);
if (hasDerivatives) {
Check.defined("derivatives", derivatives);
}
//>>includeEnd('debug');
const innerType = this._innerType;
const data = [];
data.push(time);
innerType.pack(value, data, data.length);
if (hasDerivatives) {
const derivativesLength = innerDerivativeTypes.length;
for (let x = 0; x < derivativesLength; x++) {
innerDerivativeTypes[x].pack(derivatives[x], data, data.length);
}
}
mergeNewSamples(
undefined,
this._times,
this._values,
data,
this._packedLength,
);
this._updateTableLength = true;
this._definitionChanged.raiseEvent(this);
};
/**
* Adds an array of samples.
*
* @param {JulianDate[]} times An array of JulianDate instances where each index is a sample time.
* @param {Packable[]} values The array of values, where each value corresponds to the provided times index.
* @param {Array[]} [derivativeValues] An array where each item is the array of derivatives at the equivalent time index.
*
* @exception {DeveloperError} times and values must be the same length.
* @exception {DeveloperError} times and derivativeValues must be the same length.
*/
SampledProperty.prototype.addSamples = function (
times,
values,
derivativeValues,
) {
const innerDerivativeTypes = this._innerDerivativeTypes;
const hasDerivatives = defined(innerDerivativeTypes);
//>>includeStart('debug', pragmas.debug);
Check.defined("times", times);
Check.defined("values", values);
Iif (times.length !== values.length) {
throw new DeveloperError("times and values must be the same length.");
}
if (
hasDerivatives &&
(!defined(derivativeValues) || derivativeValues.length !== times.length)
) {
throw new DeveloperError(
"times and derivativeValues must be the same length.",
);
}
//>>includeEnd('debug');
const innerType = this._innerType;
const length = times.length;
const data = [];
for (let i = 0; i < length; i++) {
data.push(times[i]);
innerType.pack(values[i], data, data.length);
if (hasDerivatives) {
const derivatives = derivativeValues[i];
const derivativesLength = innerDerivativeTypes.length;
for (let x = 0; x < derivativesLength; x++) {
innerDerivativeTypes[x].pack(derivatives[x], data, data.length);
}
}
}
mergeNewSamples(
undefined,
this._times,
this._values,
data,
this._packedLength,
);
this._updateTableLength = true;
this._definitionChanged.raiseEvent(this);
};
/**
* Retrieves the time of the provided sample associated with the index. A negative index accesses the list of samples in reverse order.
*
* @param {number} index The index of samples list.
* @returns {JulianDate | undefined} The JulianDate time of the sample, or undefined if failed.
*/
SampledProperty.prototype.getSample = function (index) {
//>>includeStart('debug', pragmas.debug);
Check.typeOf.number("index", index);
//>>includeEnd('debug');
const times = this._times;
const len = times.length;
Iif (!defined(len)) {
return undefined;
}
if (index < 0) {
index += len;
}
return times[index];
};
/**
* Adds samples as a single packed array where each new sample is represented as a date,
* followed by the packed representation of the corresponding value and derivatives.
*
* @param {number[]} packedSamples The array of packed samples.
* @param {JulianDate} [epoch] If any of the dates in packedSamples are numbers, they are considered an offset from this epoch, in seconds.
*/
SampledProperty.prototype.addSamplesPackedArray = function (
packedSamples,
epoch,
) {
//>>includeStart('debug', pragmas.debug);
Check.defined("packedSamples", packedSamples);
//>>includeEnd('debug');
mergeNewSamples(
epoch,
this._times,
this._values,
packedSamples,
this._packedLength,
);
this._updateTableLength = true;
this._definitionChanged.raiseEvent(this);
};
/**
* Removes a sample at the given time, if present.
*
* @param {JulianDate} time The sample time.
* @returns {boolean} <code>true</code> if a sample at time was removed, <code>false</code> otherwise.
*/
SampledProperty.prototype.removeSample = function (time) {
//>>includeStart('debug', pragmas.debug);
Check.defined("time", time);
//>>includeEnd('debug');
const index = binarySearch(this._times, time, JulianDate.compare);
if (index < 0) {
return false;
}
removeSamples(this, index, 1);
return true;
};
function removeSamples(property, startIndex, numberToRemove) {
const packedLength = property._packedLength;
property._times.splice(startIndex, numberToRemove);
property._values.splice(
startIndex * packedLength,
numberToRemove * packedLength,
);
property._updateTableLength = true;
property._definitionChanged.raiseEvent(property);
}
/**
* Removes all samples for the given time interval.
*
* @param {TimeInterval} time The time interval for which to remove all samples.
*/
SampledProperty.prototype.removeSamples = function (timeInterval) {
//>>includeStart('debug', pragmas.debug);
Check.defined("timeInterval", timeInterval);
//>>includeEnd('debug');
const times = this._times;
let startIndex = binarySearch(times, timeInterval.start, JulianDate.compare);
if (startIndex < 0) {
startIndex = ~startIndex;
} else if (!timeInterval.isStartIncluded) {
++startIndex;
}
let stopIndex = binarySearch(times, timeInterval.stop, JulianDate.compare);
if (stopIndex < 0) {
stopIndex = ~stopIndex;
} else if (timeInterval.isStopIncluded) {
++stopIndex;
}
removeSamples(this, startIndex, stopIndex - startIndex);
};
/**
* Compares this property to the provided property and returns
* <code>true</code> if they are equal, <code>false</code> otherwise.
*
* @param {Property} [other] The other property.
* @returns {boolean} <code>true</code> if left and right are equal, <code>false</code> otherwise.
*/
SampledProperty.prototype.equals = function (other) {
if (this === other) {
return true;
}
Iif (!defined(other)) {
return false;
}
if (
this._type !== other._type || //
this._interpolationDegree !== other._interpolationDegree || //
this._interpolationAlgorithm !== other._interpolationAlgorithm
) {
return false;
}
const derivativeTypes = this._derivativeTypes;
const hasDerivatives = defined(derivativeTypes);
const otherDerivativeTypes = other._derivativeTypes;
const otherHasDerivatives = defined(otherDerivativeTypes);
if (hasDerivatives !== otherHasDerivatives) {
return false;
}
let i;
let length;
if (hasDerivatives) {
length = derivativeTypes.length;
if (length !== otherDerivativeTypes.length) {
return false;
}
for (i = 0; i < length; i++) {
if (derivativeTypes[i] !== otherDerivativeTypes[i]) {
return false;
}
}
}
const times = this._times;
const otherTimes = other._times;
length = times.length;
if (length !== otherTimes.length) {
return false;
}
for (i = 0; i < length; i++) {
Iif (!JulianDate.equals(times[i], otherTimes[i])) {
return false;
}
}
const values = this._values;
const otherValues = other._values;
length = values.length;
//Since time lengths are equal, values length and other length are guaranteed to be equal.
for (i = 0; i < length; i++) {
if (values[i] !== otherValues[i]) {
return false;
}
}
return true;
};
//Exposed for testing.
SampledProperty._mergeNewSamples = mergeNewSamples;
export default SampledProperty;
|