Package com.google.common.geometry
Class S2Loop.ContainsRelation
java.lang.Object
com.google.common.geometry.S2Loop.ContainsRelation
- All Implemented Interfaces:
S2Loop.LoopRelation
- Enclosing class:
S2Loop
Loop relation for contains().
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionint
If A.contains(P) == false invalid input: '&'invalid input: '&' B.contains(P) == true, it is equivalent to having an edge crossing (i.e., contains() returns false).int
boolean
boolean
Given a vertexab1
that is shared between the two loops, returns true if the two associated wedges (a0, ab1, b2) and (b0, ab1, b2) are equivalent to an edge crossing.
-
Field Details
-
Constructor Details
-
ContainsRelation
private ContainsRelation()
-
-
Method Details
-
aCrossingTarget
public int aCrossingTarget()If A.contains(P) == false invalid input: '&'invalid input: '&' B.contains(P) == true, it is equivalent to having an edge crossing (i.e., contains() returns false).- Specified by:
aCrossingTarget
in interfaceS2Loop.LoopRelation
-
bCrossingTarget
public int bCrossingTarget()- Specified by:
bCrossingTarget
in interfaceS2Loop.LoopRelation
-
wedgesCross
Description copied from interface:S2Loop.LoopRelation
Given a vertexab1
that is shared between the two loops, returns true if the two associated wedges (a0, ab1, b2) and (b0, ab1, b2) are equivalent to an edge crossing. The loop relation is also allowed to maintain its own internal state, and can return true if it observes any sequence of wedges that are equivalent to an edge crossing.- Specified by:
wedgesCross
in interfaceS2Loop.LoopRelation