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 | 170x 170x 170x 1x 370x 370x 412x 412x 14x 356x 1x 788x 788x 788x 147x 175x 370x 356x 788x 788x 788x 788x 788x 788x 788x 788x 1723x 1723x 1075x 1x 514x 686x 686x 481x 481x 514x 33x 481x 1x 1x 1x 1x 1x 7x 7x 7x 2x 2x 5x 7x 7x 7x 42x 7x 9x 7x 1x 1x 488x 488x 488x 1x 81x 81x 81x 81x 81x 81x 81x 81x 2141x 2141x 2141x 2141x 2141x 2141x 2141x 2141x 2141x 2141x 2141x 1x 2159x 484x 2159x 2023x 456x 2023x 1596x 427x 1596x 1486x 418x 1486x 788x 788x 788x 788x 788x 1898x 1898x 1898x 1898x 1898x 1075x 1936x 223x 1713x 310x 1403x 193x 1210x 276x 934x 1075x 1071x 4x 4x 4x 6x 6262x 3679x 581x 581x 581x 1263x 1263x 1263x 1263x 1263x 26x 24x 26x 26x 26x 24x 26x 26x 26x 1237x 208x 1029x 212x 817x 62x 755x 200x 555x 581x 1263x 1263x 1263x 628x 628x 384x 1263x 581x 270x 150x 120x 120x 148x 120x 63x 57x 57x 27x 27x 18x 27x 57x 57x 57x 57x 27x 27x 32x 32x 5x 27x 2x 27x 3x 27x 3x 27x 1x 27x | import binarySearch from "./binarySearch.js";
import Cartographic from "./Cartographic.js";
import defined from "./defined.js";
import Rectangle from "./Rectangle.js";
/**
* Reports the availability of tiles in a {@link TilingScheme}.
*
* @alias TileAvailability
* @constructor
*
* @param {TilingScheme} tilingScheme The tiling scheme in which to report availability.
* @param {number} maximumLevel The maximum tile level that is potentially available.
*/
function TileAvailability(tilingScheme, maximumLevel) {
this._tilingScheme = tilingScheme;
this._maximumLevel = maximumLevel;
this._rootNodes = [];
}
const rectangleScratch = new Rectangle();
function findNode(level, x, y, nodes) {
const count = nodes.length;
for (let i = 0; i < count; ++i) {
const node = nodes[i];
if (node.x === x && node.y === y && node.level === level) {
return true;
}
}
return false;
}
/**
* Marks a rectangular range of tiles in a particular level as being available. For best performance,
* add your ranges in order of increasing level.
*
* @param {number} level The level.
* @param {number} startX The X coordinate of the first available tiles at the level.
* @param {number} startY The Y coordinate of the first available tiles at the level.
* @param {number} endX The X coordinate of the last available tiles at the level.
* @param {number} endY The Y coordinate of the last available tiles at the level.
*/
TileAvailability.prototype.addAvailableTileRange = function (
level,
startX,
startY,
endX,
endY,
) {
const tilingScheme = this._tilingScheme;
const rootNodes = this._rootNodes;
if (level === 0) {
for (let y = startY; y <= endY; ++y) {
for (let x = startX; x <= endX; ++x) {
if (!findNode(level, x, y, rootNodes)) {
rootNodes.push(new QuadtreeNode(tilingScheme, undefined, 0, x, y));
}
}
}
}
tilingScheme.tileXYToRectangle(startX, startY, level, rectangleScratch);
const west = rectangleScratch.west;
const north = rectangleScratch.north;
tilingScheme.tileXYToRectangle(endX, endY, level, rectangleScratch);
const east = rectangleScratch.east;
const south = rectangleScratch.south;
const rectangleWithLevel = new RectangleWithLevel(
level,
west,
south,
east,
north,
);
for (let i = 0; i < rootNodes.length; ++i) {
const rootNode = rootNodes[i];
if (rectanglesOverlap(rootNode.extent, rectangleWithLevel)) {
putRectangleInQuadtree(this._maximumLevel, rootNode, rectangleWithLevel);
}
}
};
/**
* Determines the level of the most detailed tile covering the position. This function
* usually completes in time logarithmic to the number of rectangles added with
* {@link TileAvailability#addAvailableTileRange}.
*
* @param {Cartographic} position The position for which to determine the maximum available level. The height component is ignored.
* @return {number} The level of the most detailed tile covering the position.
* @throws {DeveloperError} If position is outside any tile according to the tiling scheme.
*/
TileAvailability.prototype.computeMaximumLevelAtPosition = function (position) {
// Find the root node that contains this position.
let node;
for (let nodeIndex = 0; nodeIndex < this._rootNodes.length; ++nodeIndex) {
const rootNode = this._rootNodes[nodeIndex];
if (rectangleContainsPosition(rootNode.extent, position)) {
node = rootNode;
break;
}
}
if (!defined(node)) {
return -1;
}
return findMaxLevelFromNode(undefined, node, position);
};
const rectanglesScratch = [];
const remainingToCoverByLevelScratch = [];
const westScratch = new Rectangle();
const eastScratch = new Rectangle();
/**
* Finds the most detailed level that is available _everywhere_ within a given rectangle. More detailed
* tiles may be available in parts of the rectangle, but not the whole thing. The return value of this
* function may be safely passed to {@link sampleTerrain} for any position within the rectangle. This function
* usually completes in time logarithmic to the number of rectangles added with
* {@link TileAvailability#addAvailableTileRange}.
*
* @param {Rectangle} rectangle The rectangle.
* @return {number} The best available level for the entire rectangle.
*/
TileAvailability.prototype.computeBestAvailableLevelOverRectangle = function (
rectangle,
) {
const rectangles = rectanglesScratch;
rectangles.length = 0;
if (rectangle.east < rectangle.west) {
// Rectangle crosses the IDL, make it two rectangles.
rectangles.push(
Rectangle.fromRadians(
-Math.PI,
rectangle.south,
rectangle.east,
rectangle.north,
westScratch,
),
);
rectangles.push(
Rectangle.fromRadians(
rectangle.west,
rectangle.south,
Math.PI,
rectangle.north,
eastScratch,
),
);
} else {
rectangles.push(rectangle);
}
const remainingToCoverByLevel = remainingToCoverByLevelScratch;
remainingToCoverByLevel.length = 0;
let i;
for (i = 0; i < this._rootNodes.length; ++i) {
updateCoverageWithNode(
remainingToCoverByLevel,
this._rootNodes[i],
rectangles,
);
}
for (i = remainingToCoverByLevel.length - 1; i >= 0; --i) {
if (
defined(remainingToCoverByLevel[i]) &&
remainingToCoverByLevel[i].length === 0
) {
return i;
}
}
return 0;
};
const cartographicScratch = new Cartographic();
/**
* Determines if a particular tile is available.
* @param {number} level The tile level to check.
* @param {number} x The X coordinate of the tile to check.
* @param {number} y The Y coordinate of the tile to check.
* @return {boolean} True if the tile is available; otherwise, false.
*/
TileAvailability.prototype.isTileAvailable = function (level, x, y) {
// Get the center of the tile and find the maximum level at that position.
// Because availability is by tile, if the level is available at that point, it
// is sure to be available for the whole tile. We assume that if a tile at level n exists,
// then all its parent tiles back to level 0 exist too. This isn't really enforced
// anywhere, but Cesium would never load a tile for which this is not true.
const rectangle = this._tilingScheme.tileXYToRectangle(
x,
y,
level,
rectangleScratch,
);
Rectangle.center(rectangle, cartographicScratch);
return this.computeMaximumLevelAtPosition(cartographicScratch) >= level;
};
/**
* Computes a bit mask indicating which of a tile's four children exist.
* If a child's bit is set, a tile is available for that child. If it is cleared,
* the tile is not available. The bit values are as follows:
* <table>
* <tr><th>Bit Position</th><th>Bit Value</th><th>Child Tile</th></tr>
* <tr><td>0</td><td>1</td><td>Southwest</td></tr>
* <tr><td>1</td><td>2</td><td>Southeast</td></tr>
* <tr><td>2</td><td>4</td><td>Northwest</td></tr>
* <tr><td>3</td><td>8</td><td>Northeast</td></tr>
* </table>
*
* @param {number} level The level of the parent tile.
* @param {number} x The X coordinate of the parent tile.
* @param {number} y The Y coordinate of the parent tile.
* @return {number} The bit mask indicating child availability.
*/
TileAvailability.prototype.computeChildMaskForTile = function (level, x, y) {
const childLevel = level + 1;
Iif (childLevel >= this._maximumLevel) {
return 0;
}
let mask = 0;
mask |= this.isTileAvailable(childLevel, 2 * x, 2 * y + 1) ? 1 : 0;
mask |= this.isTileAvailable(childLevel, 2 * x + 1, 2 * y + 1) ? 2 : 0;
mask |= this.isTileAvailable(childLevel, 2 * x, 2 * y) ? 4 : 0;
mask |= this.isTileAvailable(childLevel, 2 * x + 1, 2 * y) ? 8 : 0;
return mask;
};
function QuadtreeNode(tilingScheme, parent, level, x, y) {
this.tilingScheme = tilingScheme;
this.parent = parent;
this.level = level;
this.x = x;
this.y = y;
this.extent = tilingScheme.tileXYToRectangle(x, y, level);
this.rectangles = [];
this._sw = undefined;
this._se = undefined;
this._nw = undefined;
this._ne = undefined;
}
Object.defineProperties(QuadtreeNode.prototype, {
nw: {
get: function () {
if (!this._nw) {
this._nw = new QuadtreeNode(
this.tilingScheme,
this,
this.level + 1,
this.x * 2,
this.y * 2,
);
}
return this._nw;
},
},
ne: {
get: function () {
if (!this._ne) {
this._ne = new QuadtreeNode(
this.tilingScheme,
this,
this.level + 1,
this.x * 2 + 1,
this.y * 2,
);
}
return this._ne;
},
},
sw: {
get: function () {
if (!this._sw) {
this._sw = new QuadtreeNode(
this.tilingScheme,
this,
this.level + 1,
this.x * 2,
this.y * 2 + 1,
);
}
return this._sw;
},
},
se: {
get: function () {
if (!this._se) {
this._se = new QuadtreeNode(
this.tilingScheme,
this,
this.level + 1,
this.x * 2 + 1,
this.y * 2 + 1,
);
}
return this._se;
},
},
});
function RectangleWithLevel(level, west, south, east, north) {
this.level = level;
this.west = west;
this.south = south;
this.east = east;
this.north = north;
}
function rectanglesOverlap(rectangle1, rectangle2) {
const west = Math.max(rectangle1.west, rectangle2.west);
const south = Math.max(rectangle1.south, rectangle2.south);
const east = Math.min(rectangle1.east, rectangle2.east);
const north = Math.min(rectangle1.north, rectangle2.north);
return south < north && west < east;
}
function putRectangleInQuadtree(maxDepth, node, rectangle) {
while (node.level < maxDepth) {
if (rectangleFullyContainsRectangle(node.nw.extent, rectangle)) {
node = node.nw;
} else if (rectangleFullyContainsRectangle(node.ne.extent, rectangle)) {
node = node.ne;
} else if (rectangleFullyContainsRectangle(node.sw.extent, rectangle)) {
node = node.sw;
} else if (rectangleFullyContainsRectangle(node.se.extent, rectangle)) {
node = node.se;
} else {
break;
}
}
if (
node.rectangles.length === 0 ||
node.rectangles[node.rectangles.length - 1].level <= rectangle.level
) {
node.rectangles.push(rectangle);
} else {
// Maintain ordering by level when inserting.
let index = binarySearch(
node.rectangles,
rectangle.level,
rectangleLevelComparator,
);
Iif (index < 0) {
index = ~index;
}
node.rectangles.splice(index, 0, rectangle);
}
}
function rectangleLevelComparator(a, b) {
return a.level - b;
}
function rectangleFullyContainsRectangle(potentialContainer, rectangleToTest) {
return (
rectangleToTest.west >= potentialContainer.west &&
rectangleToTest.east <= potentialContainer.east &&
rectangleToTest.south >= potentialContainer.south &&
rectangleToTest.north <= potentialContainer.north
);
}
function rectangleContainsPosition(potentialContainer, positionToTest) {
return (
positionToTest.longitude >= potentialContainer.west &&
positionToTest.longitude <= potentialContainer.east &&
positionToTest.latitude >= potentialContainer.south &&
positionToTest.latitude <= potentialContainer.north
);
}
function findMaxLevelFromNode(stopNode, node, position) {
let maxLevel = 0;
// Find the deepest quadtree node containing this point.
let found = false;
while (!found) {
const nw = node._nw && rectangleContainsPosition(node._nw.extent, position);
const ne = node._ne && rectangleContainsPosition(node._ne.extent, position);
const sw = node._sw && rectangleContainsPosition(node._sw.extent, position);
const se = node._se && rectangleContainsPosition(node._se.extent, position);
// The common scenario is that the point is in only one quadrant and we can simply
// iterate down the tree. But if the point is on a boundary between tiles, it is
// in multiple tiles and we need to check all of them, so use recursion.
if (nw + ne + sw + se > 1) {
if (nw) {
maxLevel = Math.max(
maxLevel,
findMaxLevelFromNode(node, node._nw, position),
);
}
Eif (ne) {
maxLevel = Math.max(
maxLevel,
findMaxLevelFromNode(node, node._ne, position),
);
}
if (sw) {
maxLevel = Math.max(
maxLevel,
findMaxLevelFromNode(node, node._sw, position),
);
}
Eif (se) {
maxLevel = Math.max(
maxLevel,
findMaxLevelFromNode(node, node._se, position),
);
}
break;
} else if (nw) {
node = node._nw;
} else if (ne) {
node = node._ne;
} else if (sw) {
node = node._sw;
} else if (se) {
node = node._se;
} else {
found = true;
}
}
// Work up the tree until we find a rectangle that contains this point.
while (node !== stopNode) {
const rectangles = node.rectangles;
// Rectangles are sorted by level, lowest first.
for (
let i = rectangles.length - 1;
i >= 0 && rectangles[i].level > maxLevel;
--i
) {
const rectangle = rectangles[i];
if (rectangleContainsPosition(rectangle, position)) {
maxLevel = rectangle.level;
}
}
node = node.parent;
}
return maxLevel;
}
function updateCoverageWithNode(
remainingToCoverByLevel,
node,
rectanglesToCover,
) {
if (!node) {
return;
}
let i;
let anyOverlap = false;
for (i = 0; i < rectanglesToCover.length; ++i) {
anyOverlap =
anyOverlap || rectanglesOverlap(node.extent, rectanglesToCover[i]);
}
if (!anyOverlap) {
// This node is not applicable to the rectangle(s).
return;
}
const rectangles = node.rectangles;
for (i = 0; i < rectangles.length; ++i) {
const rectangle = rectangles[i];
if (!remainingToCoverByLevel[rectangle.level]) {
remainingToCoverByLevel[rectangle.level] = rectanglesToCover;
}
remainingToCoverByLevel[rectangle.level] = subtractRectangle(
remainingToCoverByLevel[rectangle.level],
rectangle,
);
}
// Update with child nodes.
updateCoverageWithNode(remainingToCoverByLevel, node._nw, rectanglesToCover);
updateCoverageWithNode(remainingToCoverByLevel, node._ne, rectanglesToCover);
updateCoverageWithNode(remainingToCoverByLevel, node._sw, rectanglesToCover);
updateCoverageWithNode(remainingToCoverByLevel, node._se, rectanglesToCover);
}
function subtractRectangle(rectangleList, rectangleToSubtract) {
const result = [];
for (let i = 0; i < rectangleList.length; ++i) {
const rectangle = rectangleList[i];
if (!rectanglesOverlap(rectangle, rectangleToSubtract)) {
// Disjoint rectangles. Original rectangle is unmodified.
result.push(rectangle);
} else {
// rectangleToSubtract partially or completely overlaps rectangle.
if (rectangle.west < rectangleToSubtract.west) {
result.push(
new Rectangle(
rectangle.west,
rectangle.south,
rectangleToSubtract.west,
rectangle.north,
),
);
}
if (rectangle.east > rectangleToSubtract.east) {
result.push(
new Rectangle(
rectangleToSubtract.east,
rectangle.south,
rectangle.east,
rectangle.north,
),
);
}
if (rectangle.south < rectangleToSubtract.south) {
result.push(
new Rectangle(
Math.max(rectangleToSubtract.west, rectangle.west),
rectangle.south,
Math.min(rectangleToSubtract.east, rectangle.east),
rectangleToSubtract.south,
),
);
}
if (rectangle.north > rectangleToSubtract.north) {
result.push(
new Rectangle(
Math.max(rectangleToSubtract.west, rectangle.west),
rectangleToSubtract.north,
Math.min(rectangleToSubtract.east, rectangle.east),
rectangle.north,
),
);
}
}
}
return result;
}
export default TileAvailability;
|