@@ -396,10 +396,10 @@ function findMaxLevelFromNode(stopNode, node, position) {
396
396
// Find the deepest quadtree node containing this point.
397
397
let found = false ;
398
398
while ( ! found ) {
399
- const nw = node . _nw && rectangleContainsPosition ( node . _nw . extent , position ) ;
400
- const ne = node . _ne && rectangleContainsPosition ( node . _ne . extent , position ) ;
401
- const sw = node . _sw && rectangleContainsPosition ( node . _sw . extent , position ) ;
402
- const se = node . _se && rectangleContainsPosition ( node . _se . extent , position ) ;
399
+ const nw = node . nw && rectangleContainsPosition ( node . nw . extent , position ) ;
400
+ const ne = node . ne && rectangleContainsPosition ( node . ne . extent , position ) ;
401
+ const sw = node . sw && rectangleContainsPosition ( node . sw . extent , position ) ;
402
+ const se = node . se && rectangleContainsPosition ( node . se . extent , position ) ;
403
403
404
404
// The common scenario is that the point is in only one quadrant and we can simply
405
405
// iterate down the tree. But if the point is on a boundary between tiles, it is
@@ -408,36 +408,36 @@ function findMaxLevelFromNode(stopNode, node, position) {
408
408
if ( nw ) {
409
409
maxLevel = Math . max (
410
410
maxLevel ,
411
- findMaxLevelFromNode ( node , node . _nw , position )
411
+ findMaxLevelFromNode ( node , node . nw , position )
412
412
) ;
413
413
}
414
414
if ( ne ) {
415
415
maxLevel = Math . max (
416
416
maxLevel ,
417
- findMaxLevelFromNode ( node , node . _ne , position )
417
+ findMaxLevelFromNode ( node , node . ne , position )
418
418
) ;
419
419
}
420
420
if ( sw ) {
421
421
maxLevel = Math . max (
422
422
maxLevel ,
423
- findMaxLevelFromNode ( node , node . _sw , position )
423
+ findMaxLevelFromNode ( node , node . sw , position )
424
424
) ;
425
425
}
426
426
if ( se ) {
427
427
maxLevel = Math . max (
428
428
maxLevel ,
429
- findMaxLevelFromNode ( node , node . _se , position )
429
+ findMaxLevelFromNode ( node , node . se , position )
430
430
) ;
431
431
}
432
432
break ;
433
433
} else if ( nw ) {
434
- node = node . _nw ;
434
+ node = node . nw ;
435
435
} else if ( ne ) {
436
- node = node . _ne ;
436
+ node = node . ne ;
437
437
} else if ( sw ) {
438
- node = node . _sw ;
438
+ node = node . sw ;
439
439
} else if ( se ) {
440
- node = node . _se ;
440
+ node = node . se ;
441
441
} else {
442
442
found = true ;
443
443
}
@@ -501,10 +501,10 @@ function updateCoverageWithNode(
501
501
}
502
502
503
503
// Update with child nodes.
504
- updateCoverageWithNode ( remainingToCoverByLevel , node . _nw , rectanglesToCover ) ;
505
- updateCoverageWithNode ( remainingToCoverByLevel , node . _ne , rectanglesToCover ) ;
506
- updateCoverageWithNode ( remainingToCoverByLevel , node . _sw , rectanglesToCover ) ;
507
- updateCoverageWithNode ( remainingToCoverByLevel , node . _se , rectanglesToCover ) ;
504
+ updateCoverageWithNode ( remainingToCoverByLevel , node . nw , rectanglesToCover ) ;
505
+ updateCoverageWithNode ( remainingToCoverByLevel , node . ne , rectanglesToCover ) ;
506
+ updateCoverageWithNode ( remainingToCoverByLevel , node . sw , rectanglesToCover ) ;
507
+ updateCoverageWithNode ( remainingToCoverByLevel , node . se , rectanglesToCover ) ;
508
508
}
509
509
510
510
function subtractRectangle ( rectangleList , rectangleToSubtract ) {
0 commit comments