Internal data structure for a node of the tree.
More...
|
def | __init__ (s, begin, end, data=None, left=None, right=None) |
|
def | __str__ (s) |
|
def | IsInternal (s) |
| True if the node is not a leaf, but an internal tree node. More...
|
|
def | IsLeaf (s) |
| True if the node is a leaf and therefore a stored interval. More...
|
|
def | Covers (s, pos) |
| Does the interval cover this position? More...
|
|
def | Overlaps (s, begin, end) |
| Does the interval cover this position? More...
|
|
Internal data structure for a node of the tree.
◆ __init__()
def cls.StaticRTree._CNode.__init__ |
( |
|
s, |
|
|
|
begin, |
|
|
|
end, |
|
|
|
data = None , |
|
|
|
left = None , |
|
|
|
right = None |
|
) |
| |
◆ __str__()
def cls.StaticRTree._CNode.__str__ |
( |
|
s | ) |
|
◆ Covers()
def cls.StaticRTree._CNode.Covers |
( |
|
s, |
|
|
|
pos |
|
) |
| |
Does the interval cover this position?
@param pos Position to be queried.
@return @c True, if the position is contained in this closed interval.
◆ IsInternal()
def cls.StaticRTree._CNode.IsInternal |
( |
|
s | ) |
|
True
if the node is not a leaf, but an internal tree node.
◆ IsLeaf()
def cls.StaticRTree._CNode.IsLeaf |
( |
|
s | ) |
|
True
if the node is a leaf and therefore a stored interval.
◆ Overlaps()
def cls.StaticRTree._CNode.Overlaps |
( |
|
s, |
|
|
|
begin, |
|
|
|
end |
|
) |
| |
Does the interval cover this position?
@param begin Start position of the closed interval to be queried.
@param end End position of the closed interval to be queried.
@return @c True, if the intersection between this and the query
borders is not empty.
The documentation for this class was generated from the following file: