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 | 65x 65x 65x 65x 65x 65x 65x 65x 64x 61x 1x 4x 64x 64x 64x 64x 64x 64x 64x 64x 3x 3x 3x 3x 3x 64x 54x 3x 3x 3x 3x 3x 54x 54x 54x 271x 271x 54x 64x 3x 3x 3x 3x 3x 64x 64x 148x 148x 148x 145x 145x 61x 61x 61x 356x 356x 356x 61x 61x 61x 61x 61x 61x 61x 61x 145x 145x 10x 10x 145x 1x 61x 61x 61x 61x 61x 351x 805x 805x 805x 805x 805x 805x 805x 1x 804x 2x 802x 802x 802x 802x 542x 542x 454x 793x 1x 1x 1x 122x 122x 122x 122x 122x 122x 122x 122x 122x 122x 122x 122x 195x 195x 4x 191x 191x 190x 85x 105x 105x 105x 78x 78x 74x 18x 18x 19x 19x 14x 5x 5x 5x 140x 140x 140x 140x 122x 18x 1x 20x 35x 35x 35x 14x 20x 1x 9x 9x 9x 17x 17x 5x 4x 1x 3x 3x 3x 11x 11x 11x 13x 13x 11x 3x 1x 103x 142x 142x 142x 142x 142x 76x 20x 56x 20x 20x 20x 10x 10x 1x 11x 17x 17x 17x 17x 17x 8x 1x 7x 4x 3x 7x 10x 4x 4x 4x 2x 2x 1x 3x 5x 5x 5x 2x 3x 1x 7x 7x 7x | import AttributeType from "./AttributeType.js";
import Check from "../Core/Check.js";
import clone from "../Core/clone.js";
import combine from "../Core/combine.js";
import ComponentDatatype from "../Core/ComponentDatatype.js";
import defined from "../Core/defined.js";
import DeveloperError from "../Core/DeveloperError.js";
import getBinaryAccessor from "./getBinaryAccessor.js";
import Cesium3DTileBatchTable from "./Cesium3DTileBatchTable.js";
/**
* Object for handling the <code>3DTILES_batch_table_hierarchy</code> extension
*
* @param {object} options Object with the following properties:
* @param {object} options.extension The <code>3DTILES_batch_table_hierarchy</code> extension object.
* @param {Uint8Array} [options.binaryBody] The binary body of the batch table
*
* @alias BatchTableHierarchy
* @constructor
*
* @private
*/
function BatchTableHierarchy(options) {
this._classes = undefined;
this._classIds = undefined;
this._classIndexes = undefined;
this._parentCounts = undefined;
this._parentIndexes = undefined;
this._parentIds = undefined;
// Total memory used by the typed arrays
this._byteLength = 0;
//>>includeStart('debug', pragmas.debug);
Check.typeOf.object("options.extension", options.extension);
//>>includeEnd('debug');
initialize(this, options.extension, options.binaryBody);
//>>includeStart('debug', pragmas.debug);
validateHierarchy(this);
//>>includeEnd('debug');
}
Object.defineProperties(BatchTableHierarchy.prototype, {
byteLength: {
get: function () {
return this._byteLength;
},
},
});
/**
* Parse the batch table hierarchy from the
* <code>3DTILES_batch_table_hierarchy</code> extension.
*
* @param {BatchTableHierarchy} hierarchy The hierarchy instance
* @param {object} hierarchyJson The JSON of the extension
* @param {Uint8Array} [binaryBody] The binary body of the batch table for accessing binary properties
* @private
*/
function initialize(hierarchy, hierarchyJson, binaryBody) {
let i;
let classId;
let binaryAccessor;
const instancesLength = hierarchyJson.instancesLength;
const classes = hierarchyJson.classes;
let classIds = hierarchyJson.classIds;
let parentCounts = hierarchyJson.parentCounts;
let parentIds = hierarchyJson.parentIds;
let parentIdsLength = instancesLength;
let byteLength = 0;
if (defined(classIds.byteOffset)) {
classIds.componentType =
classIds.componentType ?? ComponentDatatype.UNSIGNED_SHORT;
classIds.type = AttributeType.SCALAR;
binaryAccessor = getBinaryAccessor(classIds);
classIds = binaryAccessor.createArrayBufferView(
binaryBody.buffer,
binaryBody.byteOffset + classIds.byteOffset,
instancesLength,
);
byteLength += classIds.byteLength;
}
let parentIndexes;
if (defined(parentCounts)) {
if (defined(parentCounts.byteOffset)) {
parentCounts.componentType =
parentCounts.componentType ?? ComponentDatatype.UNSIGNED_SHORT;
parentCounts.type = AttributeType.SCALAR;
binaryAccessor = getBinaryAccessor(parentCounts);
parentCounts = binaryAccessor.createArrayBufferView(
binaryBody.buffer,
binaryBody.byteOffset + parentCounts.byteOffset,
instancesLength,
);
byteLength += parentCounts.byteLength;
}
parentIndexes = new Uint16Array(instancesLength);
parentIdsLength = 0;
for (i = 0; i < instancesLength; ++i) {
parentIndexes[i] = parentIdsLength;
parentIdsLength += parentCounts[i];
}
byteLength += parentIndexes.byteLength;
}
if (defined(parentIds) && defined(parentIds.byteOffset)) {
parentIds.componentType =
parentIds.componentType ?? ComponentDatatype.UNSIGNED_SHORT;
parentIds.type = AttributeType.SCALAR;
binaryAccessor = getBinaryAccessor(parentIds);
parentIds = binaryAccessor.createArrayBufferView(
binaryBody.buffer,
binaryBody.byteOffset + parentIds.byteOffset,
parentIdsLength,
);
byteLength += parentIds.byteLength;
}
const classesLength = classes.length;
for (i = 0; i < classesLength; ++i) {
const classInstancesLength = classes[i].length;
const properties = classes[i].instances;
const binaryProperties = Cesium3DTileBatchTable.getBinaryProperties(
classInstancesLength,
properties,
binaryBody,
);
byteLength += countBinaryPropertyMemory(binaryProperties);
classes[i].instances = combine(binaryProperties, properties);
}
const classCounts = new Array(classesLength).fill(0);
const classIndexes = new Uint16Array(instancesLength);
for (i = 0; i < instancesLength; ++i) {
classId = classIds[i];
classIndexes[i] = classCounts[classId];
++classCounts[classId];
}
byteLength += classIndexes.byteLength;
hierarchy._classes = classes;
hierarchy._classIds = classIds;
hierarchy._classIndexes = classIndexes;
hierarchy._parentCounts = parentCounts;
hierarchy._parentIndexes = parentIndexes;
hierarchy._parentIds = parentIds;
hierarchy._byteLength = byteLength;
}
function countBinaryPropertyMemory(binaryProperties) {
let byteLength = 0;
for (const name in binaryProperties) {
Eif (binaryProperties.hasOwnProperty(name)) {
byteLength += binaryProperties[name].typedArray.byteLength;
}
}
return byteLength;
}
//>>includeStart('debug', pragmas.debug);
const scratchValidateStack = [];
function validateHierarchy(hierarchy) {
const stack = scratchValidateStack;
stack.length = 0;
const classIds = hierarchy._classIds;
const instancesLength = classIds.length;
for (let i = 0; i < instancesLength; ++i) {
validateInstance(hierarchy, i, stack);
}
}
function validateInstance(hierarchy, instanceIndex, stack) {
const parentCounts = hierarchy._parentCounts;
const parentIds = hierarchy._parentIds;
const parentIndexes = hierarchy._parentIndexes;
const classIds = hierarchy._classIds;
const instancesLength = classIds.length;
Iif (!defined(parentIds)) {
// No need to validate if there are no parents
return;
}
if (instanceIndex >= instancesLength) {
throw new DeveloperError(
`Parent index ${instanceIndex} exceeds the total number of instances: ${instancesLength}`,
);
}
if (stack.indexOf(instanceIndex) > -1) {
throw new DeveloperError(
"Circular dependency detected in the batch table hierarchy.",
);
}
stack.push(instanceIndex);
const parentCount = defined(parentCounts) ? parentCounts[instanceIndex] : 1;
const parentIndex = defined(parentCounts)
? parentIndexes[instanceIndex]
: instanceIndex;
for (let i = 0; i < parentCount; ++i) {
const parentId = parentIds[parentIndex + i];
// Stop the traversal when the instance has no parent (its parentId equals itself), else continue the traversal.
if (parentId !== instanceIndex) {
validateInstance(hierarchy, parentId, stack);
}
}
stack.pop(instanceIndex);
}
//>>includeEnd('debug');
// The size of this array equals the maximum instance count among all loaded tiles, which has the potential to be large.
const scratchVisited = [];
const scratchStack = [];
let marker = 0;
function traverseHierarchyMultipleParents(
hierarchy,
instanceIndex,
endConditionCallback,
) {
const classIds = hierarchy._classIds;
const parentCounts = hierarchy._parentCounts;
const parentIds = hierarchy._parentIds;
const parentIndexes = hierarchy._parentIndexes;
const instancesLength = classIds.length;
// Ignore instances that have already been visited. This occurs in diamond inheritance situations.
// Use a marker value to indicate that an instance has been visited, which increments with each run.
// This is more efficient than clearing the visited array every time.
const visited = scratchVisited;
visited.length = Math.max(visited.length, instancesLength);
const visitedMarker = ++marker;
const stack = scratchStack;
stack.length = 0;
stack.push(instanceIndex);
while (stack.length > 0) {
instanceIndex = stack.pop();
if (visited[instanceIndex] === visitedMarker) {
// This instance has already been visited, stop traversal
continue;
}
visited[instanceIndex] = visitedMarker;
const result = endConditionCallback(hierarchy, instanceIndex);
if (defined(result)) {
// The end condition was met, stop the traversal and return the result
return result;
}
const parentCount = parentCounts[instanceIndex];
const parentIndex = parentIndexes[instanceIndex];
for (let i = 0; i < parentCount; ++i) {
const parentId = parentIds[parentIndex + i];
// Stop the traversal when the instance has no parent (its parentId equals itself)
// else add the parent to the stack to continue the traversal.
if (parentId !== instanceIndex) {
stack.push(parentId);
}
}
}
}
function traverseHierarchySingleParent(
hierarchy,
instanceIndex,
endConditionCallback,
) {
let hasParent = true;
while (hasParent) {
const result = endConditionCallback(hierarchy, instanceIndex);
if (defined(result)) {
// The end condition was met, stop the traversal and return the result
return result;
}
const parentId = hierarchy._parentIds[instanceIndex];
hasParent = parentId !== instanceIndex;
instanceIndex = parentId;
}
}
function traverseHierarchy(hierarchy, instanceIndex, endConditionCallback) {
// Traverse over the hierarchy and process each instance with the endConditionCallback.
// When the endConditionCallback returns a value, the traversal stops and that value is returned.
const parentCounts = hierarchy._parentCounts;
const parentIds = hierarchy._parentIds;
Iif (!defined(parentIds)) {
return endConditionCallback(hierarchy, instanceIndex);
} else if (defined(parentCounts)) {
return traverseHierarchyMultipleParents(
hierarchy,
instanceIndex,
endConditionCallback,
);
}
return traverseHierarchySingleParent(
hierarchy,
instanceIndex,
endConditionCallback,
);
}
/**
* Returns whether the feature has this property.
*
* @param {number} batchId the batch ID of the feature
* @param {string} propertyId The case-sensitive ID of the property.
* @returns {boolean} Whether the feature has this property.
* @private
*/
BatchTableHierarchy.prototype.hasProperty = function (batchId, propertyId) {
const result = traverseHierarchy(
this,
batchId,
function (hierarchy, instanceIndex) {
const classId = hierarchy._classIds[instanceIndex];
const instances = hierarchy._classes[classId].instances;
if (defined(instances[propertyId])) {
return true;
}
},
);
return defined(result);
};
/**
* Returns whether any feature has this property.
*
* @param {string} propertyId The case-sensitive ID of the property.
* @returns {boolean} Whether any feature has this property.
* @private
*/
BatchTableHierarchy.prototype.propertyExists = function (propertyId) {
const classes = this._classes;
const classesLength = classes.length;
for (let i = 0; i < classesLength; ++i) {
const instances = classes[i].instances;
if (defined(instances[propertyId])) {
return true;
}
}
return false;
};
/**
* Returns an array of property IDs.
*
* @param {number} batchId the batch ID of the feature
* @param {number} index The index of the entity.
* @param {string[]} [results] An array into which to store the results.
* @returns {string[]} The property IDs.
* @private
*/
BatchTableHierarchy.prototype.getPropertyIds = function (batchId, results) {
results = defined(results) ? results : [];
results.length = 0;
traverseHierarchy(this, batchId, function (hierarchy, instanceIndex) {
const classId = hierarchy._classIds[instanceIndex];
const instances = hierarchy._classes[classId].instances;
for (const name in instances) {
Eif (instances.hasOwnProperty(name)) {
if (results.indexOf(name) === -1) {
results.push(name);
}
}
}
});
return results;
};
/**
* Returns a copy of the value of the property with the given ID.
*
* @param {number} batchId the batch ID of the feature
* @param {string} propertyId The case-sensitive ID of the property.
* @returns {*} The value of the property or <code>undefined</code> if the feature does not have this property.
* @private
*/
BatchTableHierarchy.prototype.getProperty = function (batchId, propertyId) {
return traverseHierarchy(this, batchId, function (hierarchy, instanceIndex) {
const classId = hierarchy._classIds[instanceIndex];
const instanceClass = hierarchy._classes[classId];
const indexInClass = hierarchy._classIndexes[instanceIndex];
const propertyValues = instanceClass.instances[propertyId];
if (defined(propertyValues)) {
if (defined(propertyValues.typedArray)) {
return getBinaryProperty(propertyValues, indexInClass);
}
return clone(propertyValues[indexInClass], true);
}
});
};
function getBinaryProperty(binaryProperty, index) {
const typedArray = binaryProperty.typedArray;
const componentCount = binaryProperty.componentCount;
if (componentCount === 1) {
return typedArray[index];
}
return binaryProperty.type.unpack(typedArray, index * componentCount);
}
/**
* Sets the value of the property with the given ID. Only properties of the
* instance may be set; parent properties may not be set.
*
* @param {number} batchId The batchId of the feature
* @param {string} propertyId The case-sensitive ID of the property.
* @param {*} value The value of the property that will be copied.
* @returns {boolean} <code>true</code> if the property was set, <code>false</code> otherwise.
*
* @exception {DeveloperError} when setting an inherited property
* @private
*/
BatchTableHierarchy.prototype.setProperty = function (
batchId,
propertyId,
value,
) {
const result = traverseHierarchy(
this,
batchId,
function (hierarchy, instanceIndex) {
const classId = hierarchy._classIds[instanceIndex];
const instanceClass = hierarchy._classes[classId];
const indexInClass = hierarchy._classIndexes[instanceIndex];
const propertyValues = instanceClass.instances[propertyId];
if (defined(propertyValues)) {
//>>includeStart('debug', pragmas.debug);
if (instanceIndex !== batchId) {
throw new DeveloperError(
`Inherited property "${propertyId}" is read-only.`,
);
}
//>>includeEnd('debug');
if (defined(propertyValues.typedArray)) {
setBinaryProperty(propertyValues, indexInClass, value);
} else {
propertyValues[indexInClass] = clone(value, true);
}
return true;
}
},
);
return defined(result);
};
function setBinaryProperty(binaryProperty, index, value) {
const typedArray = binaryProperty.typedArray;
const componentCount = binaryProperty.componentCount;
if (componentCount === 1) {
typedArray[index] = value;
} else {
binaryProperty.type.pack(value, typedArray, index * componentCount);
}
}
/**
* Check if a feature belongs to a class with the given name
*
* @param {number} batchId The batch ID of the feature
* @param {string} className The name of the class
* @return {boolean} <code>true</code> if the feature belongs to the class given by className, or <code>false</code> otherwise
* @private
*/
BatchTableHierarchy.prototype.isClass = function (batchId, className) {
// PERFORMANCE_IDEA : cache results in the ancestor classes to speed up this check if this area becomes a hotspot
// PERFORMANCE_IDEA : treat class names as integers for faster comparisons
const result = traverseHierarchy(
this,
batchId,
function (hierarchy, instanceIndex) {
const classId = hierarchy._classIds[instanceIndex];
const instanceClass = hierarchy._classes[classId];
if (instanceClass.name === className) {
return true;
}
},
);
return defined(result);
};
/**
* Get the name of the class a given feature belongs to
*
* @param {number} batchId The batch ID of the feature
* @return {string} The name of the class this feature belongs to
*/
BatchTableHierarchy.prototype.getClassName = function (batchId) {
const classId = this._classIds[batchId];
const instanceClass = this._classes[classId];
return instanceClass.name;
};
export default BatchTableHierarchy;
|