@@ -438,12 +438,14 @@ public struct S2Loop: S2Region, Comparable {
438
438
// a general polygon. A future optimization could also take advantage of
439
439
// the fact than an S2Cell is convex.
440
440
441
- let cellBound = cell. rectBound
442
- if !bound. contains ( other: cellBound) {
443
- return false
444
- }
445
- let cellLoop = S2Loop ( cell: cell, bound: cellBound)
446
- return contains ( cellLoop)
441
+ // let cellBound = cell.rectBound
442
+ // if !bound.contains(other: cellBound) {
443
+ // return false
444
+ // }
445
+ // let cellLoop = S2Loop(cell: cell, bound: cellBound)
446
+ // return contains(cellLoop)
447
+
448
+ return false
447
449
}
448
450
449
451
/**
@@ -456,12 +458,14 @@ public struct S2Loop: S2Region, Comparable {
456
458
// a general polygon. A future optimization could also take advantage of
457
459
// the fact than an S2Cell is convex.
458
460
459
- let cellBound = cell. rectBound
460
- if !bound. intersects ( with: cellBound) {
461
- return false
462
- }
463
- let cellLoop = S2Loop ( cell: cell, bound: cellBound)
464
- return cellLoop. intersects ( with: self )
461
+ // let cellBound = cell.rectBound
462
+ // if !bound.intersects(with: cellBound) {
463
+ // return false
464
+ // }
465
+ // let cellLoop = S2Loop(cell: cell, bound: cellBound)
466
+ // return cellLoop.intersects(with: self)
467
+
468
+ return false
465
469
}
466
470
467
471
}
0 commit comments