rect_t Class Reference

Proxy of C++ rect_t class.

Inheritance diagram for rect_t:

Public Member Functions
	__init__ (self, *args)
	init(self) -> rect_t init(self, l, t, r, b) -> rect_t
"int"	width (self, *args)
	width(self) -> int
"int"	height (self, *args)
	height(self) -> int
"void"	move_to (self, *args)
	move_to(self, p)
"void"	move_by (self, *args)
	move_by(self, p)
"point_t"	center (self, *args)
	center(self) -> point_t
"point_t"	topleft (self, *args)
	topleft(self) -> point_t
"point_t"	bottomright (self, *args)
	bottomright(self) -> point_t
"void"	grow (self, *args)
	grow(self, delta)
"void"	intersect (self, *args)
	intersect(self, r)
"void"	make_union (self, *args)
	make_union(self, r)
"bool"	empty (self, *args)
	empty(self) -> bool
"bool"	is_intersection_empty (self, *args)
	is_intersection_empty(self, r) -> bool
"bool"	contains (self, *args)
	contains(self, p) -> bool
"int"	area (self, *args)
	area(self) -> int
"bool"	__eq__ (self, *args)
	eq(self, r) -> bool
"bool"	__ne__ (self, *args)
	ne(self, r) -> bool

Properties
	thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")
	left = property(_ida_graph.rect_t_left_get, _ida_graph.rect_t_left_set, doc=)
	top = property(_ida_graph.rect_t_top_get, _ida_graph.rect_t_top_set, doc=)
	right = property(_ida_graph.rect_t_right_get, _ida_graph.rect_t_right_set, doc=)
	bottom = property(_ida_graph.rect_t_bottom_get, _ida_graph.rect_t_bottom_set, doc=)

Constructor & Destructor Documentation

__init__()

__init__	(		self,
		*	args )

Parameters

l	int
t	int
r	int
b	int

init(self, p0, p1) -> rect_t

Parameters

p0	point_t const &
p1	point_t const &

Member Function Documentation

__eq__()

"bool" __eq__	(		self,
		*	args )

Parameters

r	rect_t const &

__ne__()

"bool" __ne__	(		self,
		*	args )

Parameters

r	rect_t const &

area()

"int" area	(		self,
		*	args )

bottomright()

"point_t" bottomright	(		self,
		*	args )

center()

"point_t" center	(		self,
		*	args )

contains()

"bool" contains	(		self,
		*	args )

Parameters

p	point_t const &

empty()

"bool" empty	(		self,
		*	args )

grow()

"void" grow	(		self,
		*	args )

Parameters

delta

int

height()

"int" height	(		self,
		*	args )

intersect()

"void" intersect	(		self,
		*	args )

Parameters

r	rect_t const &

is_intersection_empty()

"bool" is_intersection_empty	(		self,
		*	args )

Parameters

r	rect_t const &

make_union()

"void" make_union	(		self,
		*	args )

Parameters

r	rect_t const &

move_by()

"void" move_by	(		self,
		*	args )

Parameters

p	point_t const &

move_to()

"void" move_to	(		self,
		*	args )

Parameters

p	point_t const &

topleft()

"point_t" topleft	(		self,
		*	args )

width()

"int" width	(		self,
		*	args )

Property Documentation

bottom

bottom = property(_ida_graph.rect_t_bottom_get, _ida_graph.rect_t_bottom_set, doc=)

static

left

left = property(_ida_graph.rect_t_left_get, _ida_graph.rect_t_left_set, doc=)

static

right

right = property(_ida_graph.rect_t_right_get, _ida_graph.rect_t_right_set, doc=)

static

thisown

thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag")

static

top

top = property(_ida_graph.rect_t_top_get, _ida_graph.rect_t_top_set, doc=)

static

---

The documentation for this class was generated from the following file:

• ida_graph.py