|
| __init__ (self, *args) |
|
None | verify (self) |
|
int | width (self) |
|
int | height (self) |
|
None | move_to (self, 'point_t' p) |
|
None | move_by (self, 'point_t' p) |
|
'point_t' | center (self) |
|
'point_t' | topleft (self) |
|
'point_t' | bottomright (self) |
|
None | grow (self, int delta) |
|
None | intersect (self, 'rect_t' r) |
|
None | make_union (self, 'rect_t' r) |
|
bool | empty (self) |
|
bool | is_intersection_empty (self, 'rect_t' r) |
|
bool | contains (self, 'point_t' p) |
|
int | area (self) |
|
bool | __eq__ (self, 'rect_t' r) |
|
bool | __ne__ (self, 'rect_t' r) |
|
|
str | left |
|
str | top = property(_ida_graph.rect_t_top_get, _ida_graph.rect_t_top_set) |
|
str | right |
|
str | bottom |
|
◆ __init__()
__init__ |
( |
| self, |
|
|
* | args ) |
◆ __eq__()
bool __eq__ |
( |
| self, |
|
|
'rect_t' | r ) |
◆ __ne__()
bool __ne__ |
( |
| self, |
|
|
'rect_t' | r ) |
◆ area()
◆ bottomright()
◆ center()
◆ contains()
bool contains |
( |
| self, |
|
|
'point_t' | p ) |
◆ empty()
◆ grow()
None grow |
( |
| self, |
|
|
int | delta ) |
◆ height()
◆ intersect()
None intersect |
( |
| self, |
|
|
'rect_t' | r ) |
◆ is_intersection_empty()
bool is_intersection_empty |
( |
| self, |
|
|
'rect_t' | r ) |
◆ make_union()
None make_union |
( |
| self, |
|
|
'rect_t' | r ) |
◆ move_by()
◆ move_to()
◆ topleft()
◆ verify()
◆ width()
◆ bottom
Initial value:= property(_ida_graph.rect_t_bottom_get, _ida_graph.
rect_t_bottom_set)
◆ left
Initial value:= property(_ida_graph.rect_t_left_get, _ida_graph.
rect_t_left_set)
◆ right
Initial value:= property(_ida_graph.rect_t_right_get, _ida_graph.
rect_t_right_set)
◆ top
str top = property(_ida_graph.rect_t_top_get, _ida_graph.rect_t_top_set) |
|
static |
◆ thisown
Initial value:= property(lambda x: x.this.own(), lambda x, v: x.this.own(v),
doc='The membership flag')
The documentation for this class was generated from the following file: