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 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 | 9146x 623x 623x 623x 39x 39x 40x 1x 372x 83x 83x 5x 5x 80x 80x 80x 5x 5x 5x 1030x 122x 1x 25x 7x 18x 18x 18x 18x 18x 6x 12x 19x 2x 10x 1x 4762x 1x 4761x 1x 17x 17x 17x 1x 114x 113x 1x 539x 538x 1x 51x 1x 1x 3667x 4x 3663x 3663x 3663x 3663x 3663x 3225x 3123x 102x 91x 11x 438x 438x 259x 179x 1x 305x 305x 305x 305x 305x 305x 305x 2085x 2085x 3x 302x 1x 1453x 1x 1452x 1452x 1452x 679x 679x 679x 773x 773x 767x 6x 6x 773x 766x 766x 754x 12x 10x 2x 12x 12x 742x 742x 7x 742x 773x 24x 24x 24x 1x 1x 23x 23x 10x 13x 773x 773x 1x 35x 1x 34x 2x 32x 32x 32x 19x 32x 32x 7x 7x 2x 7x 32x 2x 2x 2x 32x 5x 5x 32x 16x 16x 3x 3x 13x 32x 12x 12x 32x 28x 32x 1x 7x 1x 6x 6x 6x 6x 6x 6x 5x 5x 5x 5x 5x 5x 5x 4x 5x 3x 2x 6x 1x 63x 63x 63x 63x 63x 63x 63x 63x 63x 63x 63x 63x 63x 6x 6x 6x 6x 63x 247x 247x 247x 247x 247x 247x 63x 6x 6x 6x 63x 1x 1x 89x 89x 89x 89x 89x 89x 89x 89x 89x 89x 89x 10x 10x 89x 2x 2x 89x 9x 9x 89x 10x 10x 89x 89x 11x 10x 10x 11x 11x 11x 11x 11x 11x 89x 89x 89x 89x 89x 89x 89x 89x 1x 1x 32x 1x 31x 31x 31x 31x 31x 31x 31x 31x 30x 30x 30x 4x 30x 4x 30x 30x 12x 30x 4x 30x 15x 30x 5x 5x 5x 1x 1x 1x 31x 1x 1x 26x 1x 25x 1x 24x 24x 24x 24x 24x 1x 23x 23x 23x 81x 81x 81x 23x 81x 24x 1x 8x 8x 8x 22x 1x 2x 2x 2x 2x 2x 2x 2x 2x 2x 8x 8x 3x 5x 8x 8x 2x | import binarySearch from "./binarySearch.js";
import Frozen from "./Frozen.js";
import defined from "./defined.js";
import DeveloperError from "./DeveloperError.js";
import Event from "./Event.js";
import GregorianDate from "./GregorianDate.js";
import isLeapYear from "./isLeapYear.js";
import Iso8601 from "./Iso8601.js";
import JulianDate from "./JulianDate.js";
import TimeInterval from "./TimeInterval.js";
function compareIntervalStartTimes(left, right) {
return JulianDate.compare(left.start, right.start);
}
/**
* A non-overlapping collection of {@link TimeInterval} instances sorted by start time.
* @alias TimeIntervalCollection
* @constructor
*
* @param {TimeInterval[]} [intervals] An array of intervals to add to the collection.
*/
function TimeIntervalCollection(intervals) {
this._intervals = [];
this._changedEvent = new Event();
if (defined(intervals)) {
const length = intervals.length;
for (let i = 0; i < length; i++) {
this.addInterval(intervals[i]);
}
}
}
Object.defineProperties(TimeIntervalCollection.prototype, {
/**
* Gets an event that is raised whenever the collection of intervals change.
* @memberof TimeIntervalCollection.prototype
* @type {Event}
* @readonly
*/
changedEvent: {
get: function () {
return this._changedEvent;
},
},
/**
* Gets the start time of the collection.
* @memberof TimeIntervalCollection.prototype
* @type {JulianDate}
* @readonly
*/
start: {
get: function () {
const intervals = this._intervals;
return intervals.length === 0 ? undefined : intervals[0].start;
},
},
/**
* Gets whether or not the start time is included in the collection.
* @memberof TimeIntervalCollection.prototype
* @type {boolean}
* @readonly
*/
isStartIncluded: {
get: function () {
const intervals = this._intervals;
return intervals.length === 0 ? false : intervals[0].isStartIncluded;
},
},
/**
* Gets the stop time of the collection.
* @memberof TimeIntervalCollection.prototype
* @type {JulianDate}
* @readonly
*/
stop: {
get: function () {
const intervals = this._intervals;
const length = intervals.length;
return length === 0 ? undefined : intervals[length - 1].stop;
},
},
/**
* Gets whether or not the stop time is included in the collection.
* @memberof TimeIntervalCollection.prototype
* @type {boolean}
* @readonly
*/
isStopIncluded: {
get: function () {
const intervals = this._intervals;
const length = intervals.length;
return length === 0 ? false : intervals[length - 1].isStopIncluded;
},
},
/**
* Gets the number of intervals in the collection.
* @memberof TimeIntervalCollection.prototype
* @type {number}
* @readonly
*/
length: {
get: function () {
return this._intervals.length;
},
},
/**
* Gets whether or not the collection is empty.
* @memberof TimeIntervalCollection.prototype
* @type {boolean}
* @readonly
*/
isEmpty: {
get: function () {
return this._intervals.length === 0;
},
},
});
/**
* Compares this instance against the provided instance componentwise and returns
* <code>true</code> if they are equal, <code>false</code> otherwise.
*
* @param {TimeIntervalCollection} [right] The right hand side collection.
* @param {TimeInterval.DataComparer} [dataComparer] A function which compares the data of the two intervals. If omitted, reference equality is used.
* @returns {boolean} <code>true</code> if they are equal, <code>false</code> otherwise.
*/
TimeIntervalCollection.prototype.equals = function (right, dataComparer) {
if (this === right) {
return true;
}
Iif (!(right instanceof TimeIntervalCollection)) {
return false;
}
const intervals = this._intervals;
const rightIntervals = right._intervals;
const length = intervals.length;
if (length !== rightIntervals.length) {
return false;
}
for (let i = 0; i < length; i++) {
if (!TimeInterval.equals(intervals[i], rightIntervals[i], dataComparer)) {
return false;
}
}
return true;
};
/**
* Gets the interval at the specified index.
*
* @param {number} index The index of the interval to retrieve.
* @returns {TimeInterval|undefined} The interval at the specified index, or <code>undefined</code> if no interval exists as that index.
*/
TimeIntervalCollection.prototype.get = function (index) {
//>>includeStart('debug', pragmas.debug);
if (!defined(index)) {
throw new DeveloperError("index is required.");
}
//>>includeEnd('debug');
return this._intervals[index];
};
/**
* Removes all intervals from the collection.
*/
TimeIntervalCollection.prototype.removeAll = function () {
Eif (this._intervals.length > 0) {
this._intervals.length = 0;
this._changedEvent.raiseEvent(this);
}
};
/**
* Finds and returns the interval that contains the specified date.
*
* @param {JulianDate} date The date to search for.
* @returns {TimeInterval|undefined} The interval containing the specified date, <code>undefined</code> if no such interval exists.
*/
TimeIntervalCollection.prototype.findIntervalContainingDate = function (date) {
const index = this.indexOf(date);
return index >= 0 ? this._intervals[index] : undefined;
};
/**
* Finds and returns the data for the interval that contains the specified date.
*
* @param {JulianDate} date The date to search for.
* @returns {object} The data for the interval containing the specified date, or <code>undefined</code> if no such interval exists.
*/
TimeIntervalCollection.prototype.findDataForIntervalContainingDate = function (
date,
) {
const index = this.indexOf(date);
return index >= 0 ? this._intervals[index].data : undefined;
};
/**
* Checks if the specified date is inside this collection.
*
* @param {JulianDate} julianDate The date to check.
* @returns {boolean} <code>true</code> if the collection contains the specified date, <code>false</code> otherwise.
*/
TimeIntervalCollection.prototype.contains = function (julianDate) {
return this.indexOf(julianDate) >= 0;
};
const indexOfScratch = new TimeInterval();
/**
* Finds and returns the index of the interval in the collection that contains the specified date.
*
* @param {JulianDate} date The date to search for.
* @returns {number} The index of the interval that contains the specified date, if no such interval exists,
* it returns a negative number which is the bitwise complement of the index of the next interval that
* starts after the date, or if no interval starts after the specified date, the bitwise complement of
* the length of the collection.
*/
TimeIntervalCollection.prototype.indexOf = function (date) {
//>>includeStart('debug', pragmas.debug);
if (!defined(date)) {
throw new DeveloperError("date is required");
}
//>>includeEnd('debug');
const intervals = this._intervals;
indexOfScratch.start = date;
indexOfScratch.stop = date;
let index = binarySearch(
intervals,
indexOfScratch,
compareIntervalStartTimes,
);
if (index >= 0) {
if (intervals[index].isStartIncluded) {
return index;
}
if (
index > 0 &&
intervals[index - 1].stop.equals(date) &&
intervals[index - 1].isStopIncluded
) {
return index - 1;
}
return ~index;
}
index = ~index;
if (
index > 0 &&
index - 1 < intervals.length &&
TimeInterval.contains(intervals[index - 1], date)
) {
return index - 1;
}
return ~index;
};
/**
* Returns the first interval in the collection that matches the specified parameters.
* All parameters are optional and <code>undefined</code> parameters are treated as a don't care condition.
*
* @param {object} [options] Object with the following properties:
* @param {JulianDate} [options.start] The start time of the interval.
* @param {JulianDate} [options.stop] The stop time of the interval.
* @param {boolean} [options.isStartIncluded] <code>true</code> if <code>options.start</code> is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.isStopIncluded] <code>true</code> if <code>options.stop</code> is included in the interval, <code>false</code> otherwise.
* @returns {TimeInterval|undefined} The first interval in the collection that matches the specified parameters.
*/
TimeIntervalCollection.prototype.findInterval = function (options) {
options = options ?? Frozen.EMPTY_OBJECT;
const start = options.start;
const stop = options.stop;
const isStartIncluded = options.isStartIncluded;
const isStopIncluded = options.isStopIncluded;
const intervals = this._intervals;
for (let i = 0, len = intervals.length; i < len; i++) {
const interval = intervals[i];
if (
(!defined(start) || interval.start.equals(start)) &&
(!defined(stop) || interval.stop.equals(stop)) &&
(!defined(isStartIncluded) ||
interval.isStartIncluded === isStartIncluded) &&
(!defined(isStopIncluded) || interval.isStopIncluded === isStopIncluded)
) {
return intervals[i];
}
}
return undefined;
};
/**
* Adds an interval to the collection, merging intervals that contain the same data and
* splitting intervals of different data as needed in order to maintain a non-overlapping collection.
* The data in the new interval takes precedence over any existing intervals in the collection.
*
* @param {TimeInterval} interval The interval to add.
* @param {TimeInterval.DataComparer} [dataComparer] A function which compares the data of the two intervals. If omitted, reference equality is used.
*/
TimeIntervalCollection.prototype.addInterval = function (
interval,
dataComparer,
) {
//>>includeStart('debug', pragmas.debug);
if (!defined(interval)) {
throw new DeveloperError("interval is required");
}
//>>includeEnd('debug');
Iif (interval.isEmpty) {
return;
}
const intervals = this._intervals;
// Handle the common case quickly: we're adding a new interval which is after all existing intervals.
if (
intervals.length === 0 ||
JulianDate.greaterThan(interval.start, intervals[intervals.length - 1].stop)
) {
intervals.push(interval);
this._changedEvent.raiseEvent(this);
return;
}
// Keep the list sorted by the start date
let index = binarySearch(intervals, interval, compareIntervalStartTimes);
if (index < 0) {
index = ~index;
} else {
// interval's start date exactly equals the start date of at least one interval in the collection.
// It could actually equal the start date of two intervals if one of them does not actually
// include the date. In that case, the binary search could have found either. We need to
// look at the surrounding intervals and their IsStartIncluded properties in order to make sure
// we're working with the correct interval.
// eslint-disable-next-line no-lonely-if
Iif (
index > 0 &&
interval.isStartIncluded &&
intervals[index - 1].isStartIncluded &&
intervals[index - 1].start.equals(interval.start)
) {
--index;
} else Iif (
index < intervals.length &&
!interval.isStartIncluded &&
intervals[index].isStartIncluded &&
intervals[index].start.equals(interval.start)
) {
++index;
}
}
let comparison;
if (index > 0) {
// Not the first thing in the list, so see if the interval before this one
// overlaps this one.
comparison = JulianDate.compare(intervals[index - 1].stop, interval.start);
if (
comparison > 0 ||
(comparison === 0 &&
(intervals[index - 1].isStopIncluded || interval.isStartIncluded))
) {
// There is an overlap
if (
defined(dataComparer)
? dataComparer(intervals[index - 1].data, interval.data)
: intervals[index - 1].data === interval.data
) {
// Overlapping intervals have the same data, so combine them
if (JulianDate.greaterThan(interval.stop, intervals[index - 1].stop)) {
interval = new TimeInterval({
start: intervals[index - 1].start,
stop: interval.stop,
isStartIncluded: intervals[index - 1].isStartIncluded,
isStopIncluded: interval.isStopIncluded,
data: interval.data,
});
} else {
interval = new TimeInterval({
start: intervals[index - 1].start,
stop: intervals[index - 1].stop,
isStartIncluded: intervals[index - 1].isStartIncluded,
isStopIncluded:
intervals[index - 1].isStopIncluded ||
(interval.stop.equals(intervals[index - 1].stop) &&
interval.isStopIncluded),
data: interval.data,
});
}
intervals.splice(index - 1, 1);
--index;
} else {
// Overlapping intervals have different data. The new interval
// being added 'wins' so truncate the previous interval.
// If the existing interval extends past the end of the new one,
// split the existing interval into two intervals.
comparison = JulianDate.compare(
intervals[index - 1].stop,
interval.stop,
);
if (
comparison > 0 ||
(comparison === 0 &&
intervals[index - 1].isStopIncluded &&
!interval.isStopIncluded)
) {
intervals.splice(
index,
0,
new TimeInterval({
start: interval.stop,
stop: intervals[index - 1].stop,
isStartIncluded: !interval.isStopIncluded,
isStopIncluded: intervals[index - 1].isStopIncluded,
data: intervals[index - 1].data,
}),
);
}
intervals[index - 1] = new TimeInterval({
start: intervals[index - 1].start,
stop: interval.start,
isStartIncluded: intervals[index - 1].isStartIncluded,
isStopIncluded: !interval.isStartIncluded,
data: intervals[index - 1].data,
});
}
}
}
while (index < intervals.length) {
// Not the last thing in the list, so see if the intervals after this one overlap this one.
comparison = JulianDate.compare(interval.stop, intervals[index].start);
if (
comparison > 0 ||
(comparison === 0 &&
(interval.isStopIncluded || intervals[index].isStartIncluded))
) {
// There is an overlap
if (
defined(dataComparer)
? dataComparer(intervals[index].data, interval.data)
: intervals[index].data === interval.data
) {
// Overlapping intervals have the same data, so combine them
interval = new TimeInterval({
start: interval.start,
stop: JulianDate.greaterThan(intervals[index].stop, interval.stop)
? intervals[index].stop
: interval.stop,
isStartIncluded: interval.isStartIncluded,
isStopIncluded: JulianDate.greaterThan(
intervals[index].stop,
interval.stop,
)
? intervals[index].isStopIncluded
: interval.isStopIncluded,
data: interval.data,
});
intervals.splice(index, 1);
} else {
// Overlapping intervals have different data. The new interval
// being added 'wins' so truncate the next interval.
intervals[index] = new TimeInterval({
start: interval.stop,
stop: intervals[index].stop,
isStartIncluded: !interval.isStopIncluded,
isStopIncluded: intervals[index].isStopIncluded,
data: intervals[index].data,
});
if (intervals[index].isEmpty) {
intervals.splice(index, 1);
} else {
// Found a partial span, so it is not possible for the next
// interval to be spanned at all. Stop looking.
break;
}
}
} else E{
// Found the last one we're spanning, so stop looking.
break;
}
}
// Add the new interval
intervals.splice(index, 0, interval);
this._changedEvent.raiseEvent(this);
};
/**
* Removes the specified interval from this interval collection, creating a hole over the specified interval.
* The data property of the input interval is ignored.
*
* @param {TimeInterval} interval The interval to remove.
* @returns {boolean} <code>true</code> if the interval was removed, <code>false</code> if no part of the interval was in the collection.
*/
TimeIntervalCollection.prototype.removeInterval = function (interval) {
//>>includeStart('debug', pragmas.debug);
if (!defined(interval)) {
throw new DeveloperError("interval is required");
}
//>>includeEnd('debug');
if (interval.isEmpty) {
return false;
}
const intervals = this._intervals;
let index = binarySearch(intervals, interval, compareIntervalStartTimes);
if (index < 0) {
index = ~index;
}
let result = false;
// Check for truncation of the end of the previous interval.
if (
index > 0 &&
(JulianDate.greaterThan(intervals[index - 1].stop, interval.start) ||
(intervals[index - 1].stop.equals(interval.start) &&
intervals[index - 1].isStopIncluded &&
interval.isStartIncluded))
) {
result = true;
if (
JulianDate.greaterThan(intervals[index - 1].stop, interval.stop) ||
(intervals[index - 1].isStopIncluded &&
!interval.isStopIncluded &&
intervals[index - 1].stop.equals(interval.stop))
) {
// Break the existing interval into two pieces
intervals.splice(
index,
0,
new TimeInterval({
start: interval.stop,
stop: intervals[index - 1].stop,
isStartIncluded: !interval.isStopIncluded,
isStopIncluded: intervals[index - 1].isStopIncluded,
data: intervals[index - 1].data,
}),
);
}
intervals[index - 1] = new TimeInterval({
start: intervals[index - 1].start,
stop: interval.start,
isStartIncluded: intervals[index - 1].isStartIncluded,
isStopIncluded: !interval.isStartIncluded,
data: intervals[index - 1].data,
});
}
// Check if the Start of the current interval should remain because interval.start is the same but
// it is not included.
if (
index < intervals.length &&
!interval.isStartIncluded &&
intervals[index].isStartIncluded &&
interval.start.equals(intervals[index].start)
) {
result = true;
intervals.splice(
index,
0,
new TimeInterval({
start: intervals[index].start,
stop: intervals[index].start,
isStartIncluded: true,
isStopIncluded: true,
data: intervals[index].data,
}),
);
++index;
}
// Remove any intervals that are completely overlapped by the input interval.
while (
index < intervals.length &&
JulianDate.greaterThan(interval.stop, intervals[index].stop)
) {
result = true;
intervals.splice(index, 1);
}
// Check for the case where the input interval ends on the same date
// as an existing interval.
if (index < intervals.length && interval.stop.equals(intervals[index].stop)) {
result = true;
if (!interval.isStopIncluded && intervals[index].isStopIncluded) {
// Last point of interval should remain because the stop date is included in
// the existing interval but is not included in the input interval.
Iif (
index + 1 < intervals.length &&
intervals[index + 1].start.equals(interval.stop) &&
intervals[index].data === intervals[index + 1].data
) {
// Combine single point with the next interval
intervals.splice(index, 1);
intervals[index] = new TimeInterval({
start: intervals[index].start,
stop: intervals[index].stop,
isStartIncluded: true,
isStopIncluded: intervals[index].isStopIncluded,
data: intervals[index].data,
});
} else {
intervals[index] = new TimeInterval({
start: interval.stop,
stop: interval.stop,
isStartIncluded: true,
isStopIncluded: true,
data: intervals[index].data,
});
}
} else {
// Interval is completely overlapped
intervals.splice(index, 1);
}
}
// Truncate any partially-overlapped intervals.
if (
index < intervals.length &&
(JulianDate.greaterThan(interval.stop, intervals[index].start) ||
(interval.stop.equals(intervals[index].start) &&
interval.isStopIncluded &&
intervals[index].isStartIncluded))
) {
result = true;
intervals[index] = new TimeInterval({
start: interval.stop,
stop: intervals[index].stop,
isStartIncluded: !interval.isStopIncluded,
isStopIncluded: intervals[index].isStopIncluded,
data: intervals[index].data,
});
}
if (result) {
this._changedEvent.raiseEvent(this);
}
return result;
};
/**
* Creates a new instance that is the intersection of this collection and the provided collection.
*
* @param {TimeIntervalCollection} other The collection to intersect with.
* @param {TimeInterval.DataComparer} [dataComparer] A function which compares the data of the two intervals. If omitted, reference equality is used.
* @param {TimeInterval.MergeCallback} [mergeCallback] A function which merges the data of the two intervals. If omitted, the data from the left interval will be used.
* @returns {TimeIntervalCollection} A new TimeIntervalCollection which is the intersection of this collection and the provided collection.
*/
TimeIntervalCollection.prototype.intersect = function (
other,
dataComparer,
mergeCallback,
) {
//>>includeStart('debug', pragmas.debug);
if (!defined(other)) {
throw new DeveloperError("other is required.");
}
//>>includeEnd('debug');
const result = new TimeIntervalCollection();
let left = 0;
let right = 0;
const intervals = this._intervals;
const otherIntervals = other._intervals;
while (left < intervals.length && right < otherIntervals.length) {
const leftInterval = intervals[left];
const rightInterval = otherIntervals[right];
Iif (JulianDate.lessThan(leftInterval.stop, rightInterval.start)) {
++left;
} else Iif (JulianDate.lessThan(rightInterval.stop, leftInterval.start)) {
++right;
} else {
// The following will return an intersection whose data is 'merged' if the callback is defined
Eif (
defined(mergeCallback) ||
(defined(dataComparer) &&
dataComparer(leftInterval.data, rightInterval.data)) ||
(!defined(dataComparer) && rightInterval.data === leftInterval.data)
) {
const intersection = TimeInterval.intersect(
leftInterval,
rightInterval,
new TimeInterval(),
mergeCallback,
);
if (!intersection.isEmpty) {
// Since we start with an empty collection for 'result', and there are no overlapping intervals in 'this' (as a rule),
// the 'intersection' will never overlap with a previous interval in 'result'. So, no need to do any additional 'merging'.
result.addInterval(intersection, dataComparer);
}
}
if (
JulianDate.lessThan(leftInterval.stop, rightInterval.stop) ||
(leftInterval.stop.equals(rightInterval.stop) &&
!leftInterval.isStopIncluded &&
rightInterval.isStopIncluded)
) {
++left;
} else {
++right;
}
}
}
return result;
};
/**
* Creates a new instance from a JulianDate array.
*
* @param {object} options Object with the following properties:
* @param {JulianDate[]} options.julianDates An array of ISO 8601 dates.
* @param {boolean} [options.isStartIncluded=true] <code>true</code> if start time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.isStopIncluded=true] <code>true</code> if stop time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.leadingInterval=false] <code>true</code> if you want to add a interval from Iso8601.MINIMUM_VALUE to start time, <code>false</code> otherwise.
* @param {boolean} [options.trailingInterval=false] <code>true</code> if you want to add a interval from stop time to Iso8601.MAXIMUM_VALUE, <code>false</code> otherwise.
* @param {Function} [options.dataCallback] A function that will be return the data that is called with each interval before it is added to the collection. If unspecified, the data will be the index in the collection.
* @param {TimeIntervalCollection} [result] An existing instance to use for the result.
* @returns {TimeIntervalCollection} The modified result parameter or a new instance if none was provided.
*/
TimeIntervalCollection.fromJulianDateArray = function (options, result) {
//>>includeStart('debug', pragmas.debug);
Iif (!defined(options)) {
throw new DeveloperError("options is required.");
}
Iif (!defined(options.julianDates)) {
throw new DeveloperError("options.iso8601Array is required.");
}
//>>includeEnd('debug');
Eif (!defined(result)) {
result = new TimeIntervalCollection();
}
const julianDates = options.julianDates;
const length = julianDates.length;
const dataCallback = options.dataCallback;
const isStartIncluded = options.isStartIncluded ?? true;
const isStopIncluded = options.isStopIncluded ?? true;
const leadingInterval = options.leadingInterval ?? false;
const trailingInterval = options.trailingInterval ?? false;
let interval;
// Add a default interval, which will only end up being used up to first interval
let startIndex = 0;
if (leadingInterval) {
++startIndex;
interval = new TimeInterval({
start: Iso8601.MINIMUM_VALUE,
stop: julianDates[0],
isStartIncluded: true,
isStopIncluded: !isStartIncluded,
});
interval.data = defined(dataCallback)
? dataCallback(interval, result.length)
: result.length;
result.addInterval(interval);
}
for (let i = 0; i < length - 1; ++i) {
let startDate = julianDates[i];
const endDate = julianDates[i + 1];
interval = new TimeInterval({
start: startDate,
stop: endDate,
isStartIncluded: result.length === startIndex ? isStartIncluded : true,
isStopIncluded: i === length - 2 ? isStopIncluded : false,
});
interval.data = defined(dataCallback)
? dataCallback(interval, result.length)
: result.length;
result.addInterval(interval);
startDate = endDate;
}
if (trailingInterval) {
interval = new TimeInterval({
start: julianDates[length - 1],
stop: Iso8601.MAXIMUM_VALUE,
isStartIncluded: !isStopIncluded,
isStopIncluded: true,
});
interval.data = defined(dataCallback)
? dataCallback(interval, result.length)
: result.length;
result.addInterval(interval);
}
return result;
};
const scratchGregorianDate = new GregorianDate();
const monthLengths = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
/**
* Adds duration represented as a GregorianDate to a JulianDate
*
* @param {JulianDate} julianDate The date.
* @param {GregorianDate} duration An duration represented as a GregorianDate.
* @param {JulianDate} result An existing instance to use for the result.
* @returns {JulianDate} The modified result parameter.
*
* @private
*/
function addToDate(julianDate, duration, result) {
Eif (!defined(result)) {
result = new JulianDate();
}
JulianDate.toGregorianDate(julianDate, scratchGregorianDate);
let millisecond = scratchGregorianDate.millisecond + duration.millisecond;
let second = scratchGregorianDate.second + duration.second;
let minute = scratchGregorianDate.minute + duration.minute;
let hour = scratchGregorianDate.hour + duration.hour;
let day = scratchGregorianDate.day + duration.day;
let month = scratchGregorianDate.month + duration.month;
let year = scratchGregorianDate.year + duration.year;
if (millisecond >= 1000) {
second += Math.floor(millisecond / 1000);
millisecond = millisecond % 1000;
}
if (second >= 60) {
minute += Math.floor(second / 60);
second = second % 60;
}
if (minute >= 60) {
hour += Math.floor(minute / 60);
minute = minute % 60;
}
if (hour >= 24) {
day += Math.floor(hour / 24);
hour = hour % 24;
}
// If days is greater than the month's length we need to remove those number of days,
// readjust month and year and repeat until days is less than the month's length.
monthLengths[2] = isLeapYear(year) ? 29 : 28;
while (day > monthLengths[month] || month >= 13) {
if (day > monthLengths[month]) {
day -= monthLengths[month];
++month;
}
Eif (month >= 13) {
--month;
year += Math.floor(month / 12);
month = month % 12;
++month;
}
monthLengths[2] = isLeapYear(year) ? 29 : 28;
}
scratchGregorianDate.millisecond = millisecond;
scratchGregorianDate.second = second;
scratchGregorianDate.minute = minute;
scratchGregorianDate.hour = hour;
scratchGregorianDate.day = day;
scratchGregorianDate.month = month;
scratchGregorianDate.year = year;
return JulianDate.fromGregorianDate(scratchGregorianDate, result);
}
const scratchJulianDate = new JulianDate();
const durationRegex =
/P(?:([\d.,]+)Y)?(?:([\d.,]+)M)?(?:([\d.,]+)W)?(?:([\d.,]+)D)?(?:T(?:([\d.,]+)H)?(?:([\d.,]+)M)?(?:([\d.,]+)S)?)?/;
/**
* Parses ISO8601 duration string
*
* @param {string} iso8601 An ISO 8601 duration.
* @param {GregorianDate} result An existing instance to use for the result.
* @returns {boolean} True is parsing succeeded, false otherwise
*
* @private
*/
function parseDuration(iso8601, result) {
if (!defined(iso8601) || iso8601.length === 0) {
return false;
}
// Reset object
result.year = 0;
result.month = 0;
result.day = 0;
result.hour = 0;
result.minute = 0;
result.second = 0;
result.millisecond = 0;
if (iso8601[0] === "P") {
const matches = iso8601.match(durationRegex);
Iif (!defined(matches)) {
return false;
}
if (defined(matches[1])) {
// Years
result.year = Number(matches[1].replace(",", "."));
}
if (defined(matches[2])) {
// Months
result.month = Number(matches[2].replace(",", "."));
}
Iif (defined(matches[3])) {
// Weeks
result.day = Number(matches[3].replace(",", ".")) * 7;
}
if (defined(matches[4])) {
// Days
result.day += Number(matches[4].replace(",", "."));
}
if (defined(matches[5])) {
// Hours
result.hour = Number(matches[5].replace(",", "."));
}
if (defined(matches[6])) {
// Weeks
result.minute = Number(matches[6].replace(",", "."));
}
if (defined(matches[7])) {
// Seconds
const seconds = Number(matches[7].replace(",", "."));
result.second = Math.floor(seconds);
result.millisecond = (seconds % 1) * 1000;
}
} else {
// They can technically specify the duration as a normal date with some caveats. Try our best to load it.
Eif (iso8601[iso8601.length - 1] !== "Z") {
// It's not a date, its a duration, so it always has to be UTC
iso8601 += "Z";
}
JulianDate.toGregorianDate(
JulianDate.fromIso8601(iso8601, scratchJulianDate),
result,
);
}
// A duration of 0 will cause an infinite loop, so just make sure something is non-zero
return (
result.year ||
result.month ||
result.day ||
result.hour ||
result.minute ||
result.second ||
result.millisecond
);
}
const scratchDuration = new GregorianDate();
/**
* Creates a new instance from an {@link http://en.wikipedia.org/wiki/ISO_8601|ISO 8601} time interval (start/end/duration).
*
* @param {object} options Object with the following properties:
* @param {string} options.iso8601 An ISO 8601 interval.
* @param {boolean} [options.isStartIncluded=true] <code>true</code> if start time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.isStopIncluded=true] <code>true</code> if stop time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.leadingInterval=false] <code>true</code> if you want to add a interval from Iso8601.MINIMUM_VALUE to start time, <code>false</code> otherwise.
* @param {boolean} [options.trailingInterval=false] <code>true</code> if you want to add a interval from stop time to Iso8601.MAXIMUM_VALUE, <code>false</code> otherwise.
* @param {Function} [options.dataCallback] A function that will be return the data that is called with each interval before it is added to the collection. If unspecified, the data will be the index in the collection.
* @param {TimeIntervalCollection} [result] An existing instance to use for the result.
* @returns {TimeIntervalCollection} The modified result parameter or a new instance if none was provided.
*/
TimeIntervalCollection.fromIso8601 = function (options, result) {
//>>includeStart('debug', pragmas.debug);
if (!defined(options)) {
throw new DeveloperError("options is required.");
}
if (!defined(options.iso8601)) {
throw new DeveloperError("options.iso8601 is required.");
}
//>>includeEnd('debug');
const dates = options.iso8601.split("/");
const start = JulianDate.fromIso8601(dates[0]);
const stop = JulianDate.fromIso8601(dates[1]);
const julianDates = [];
if (!parseDuration(dates[2], scratchDuration)) {
julianDates.push(start, stop);
} else {
let date = JulianDate.clone(start);
julianDates.push(date);
while (JulianDate.compare(date, stop) < 0) {
date = addToDate(date, scratchDuration);
const afterStop = JulianDate.compare(stop, date) <= 0;
if (afterStop) {
JulianDate.clone(stop, date);
}
julianDates.push(date);
}
}
return TimeIntervalCollection.fromJulianDateArray(
{
julianDates: julianDates,
isStartIncluded: options.isStartIncluded,
isStopIncluded: options.isStopIncluded,
leadingInterval: options.leadingInterval,
trailingInterval: options.trailingInterval,
dataCallback: options.dataCallback,
},
result,
);
};
/**
* Creates a new instance from a {@link http://en.wikipedia.org/wiki/ISO_8601|ISO 8601} date array.
*
* @param {object} options Object with the following properties:
* @param {string[]} options.iso8601Dates An array of ISO 8601 dates.
* @param {boolean} [options.isStartIncluded=true] <code>true</code> if start time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.isStopIncluded=true] <code>true</code> if stop time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.leadingInterval=false] <code>true</code> if you want to add a interval from Iso8601.MINIMUM_VALUE to start time, <code>false</code> otherwise.
* @param {boolean} [options.trailingInterval=false] <code>true</code> if you want to add a interval from stop time to Iso8601.MAXIMUM_VALUE, <code>false</code> otherwise.
* @param {Function} [options.dataCallback] A function that will be return the data that is called with each interval before it is added to the collection. If unspecified, the data will be the index in the collection.
* @param {TimeIntervalCollection} [result] An existing instance to use for the result.
* @returns {TimeIntervalCollection} The modified result parameter or a new instance if none was provided.
*/
TimeIntervalCollection.fromIso8601DateArray = function (options, result) {
//>>includeStart('debug', pragmas.debug);
Iif (!defined(options)) {
throw new DeveloperError("options is required.");
}
Iif (!defined(options.iso8601Dates)) {
throw new DeveloperError("options.iso8601Dates is required.");
}
//>>includeEnd('debug');
return TimeIntervalCollection.fromJulianDateArray(
{
julianDates: options.iso8601Dates.map(function (date) {
return JulianDate.fromIso8601(date);
}),
isStartIncluded: options.isStartIncluded,
isStopIncluded: options.isStopIncluded,
leadingInterval: options.leadingInterval,
trailingInterval: options.trailingInterval,
dataCallback: options.dataCallback,
},
result,
);
};
/**
* Creates a new instance from a {@link http://en.wikipedia.org/wiki/ISO_8601|ISO 8601} duration array.
*
* @param {object} options Object with the following properties:
* @param {JulianDate} options.epoch An date that the durations are relative to.
* @param {string} options.iso8601Durations An array of ISO 8601 durations.
* @param {boolean} [options.relativeToPrevious=false] <code>true</code> if durations are relative to previous date, <code>false</code> if always relative to the epoch.
* @param {boolean} [options.isStartIncluded=true] <code>true</code> if start time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.isStopIncluded=true] <code>true</code> if stop time is included in the interval, <code>false</code> otherwise.
* @param {boolean} [options.leadingInterval=false] <code>true</code> if you want to add a interval from Iso8601.MINIMUM_VALUE to start time, <code>false</code> otherwise.
* @param {boolean} [options.trailingInterval=false] <code>true</code> if you want to add a interval from stop time to Iso8601.MAXIMUM_VALUE, <code>false</code> otherwise.
* @param {Function} [options.dataCallback] A function that will be return the data that is called with each interval before it is added to the collection. If unspecified, the data will be the index in the collection.
* @param {TimeIntervalCollection} [result] An existing instance to use for the result.
* @returns {TimeIntervalCollection} The modified result parameter or a new instance if none was provided.
*/
TimeIntervalCollection.fromIso8601DurationArray = function (options, result) {
//>>includeStart('debug', pragmas.debug);
Iif (!defined(options)) {
throw new DeveloperError("options is required.");
}
Iif (!defined(options.epoch)) {
throw new DeveloperError("options.epoch is required.");
}
Iif (!defined(options.iso8601Durations)) {
throw new DeveloperError("options.iso8601Durations is required.");
}
//>>includeEnd('debug');
const epoch = options.epoch;
const iso8601Durations = options.iso8601Durations;
const relativeToPrevious = options.relativeToPrevious ?? false;
const julianDates = [];
let date, previousDate;
const length = iso8601Durations.length;
for (let i = 0; i < length; ++i) {
// Allow a duration of 0 on the first iteration, because then it is just the epoch
Eif (parseDuration(iso8601Durations[i], scratchDuration) || i === 0) {
if (relativeToPrevious && defined(previousDate)) {
date = addToDate(previousDate, scratchDuration);
} else {
date = addToDate(epoch, scratchDuration);
}
julianDates.push(date);
previousDate = date;
}
}
return TimeIntervalCollection.fromJulianDateArray(
{
julianDates: julianDates,
isStartIncluded: options.isStartIncluded,
isStopIncluded: options.isStopIncluded,
leadingInterval: options.leadingInterval,
trailingInterval: options.trailingInterval,
dataCallback: options.dataCallback,
},
result,
);
};
export default TimeIntervalCollection;
|