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
"void"	verify (self)
	verify(self)
"int"	width (self)
	width(self) -> int
"int"	height (self)
	height(self) -> int
"void"	move_to (self, "point_t" p)
	move_to(self, p)
"void"	move_by (self, "point_t" p)
	move_by(self, p)
"point_t"	center (self)
	center(self) -> point_t
"point_t"	topleft (self)
	topleft(self) -> point_t
"point_t"	bottomright (self)
	bottomright(self) -> point_t
"void"	grow (self, "int" delta)
	grow(self, delta)
"void"	intersect (self, "rect_t" r)
	intersect(self, r)
"void"	make_union (self, "rect_t" r)
	make_union(self, r)
"bool"	empty (self)
	empty(self) -> bool
"bool"	is_intersection_empty (self, "rect_t" r)
	is_intersection_empty(self, r) -> bool
"bool"	contains (self, "point_t" p)
	contains(self, p) -> bool
"int"	area (self)
	area(self) -> int
"bool"	__eq__ (self, "rect_t" r)
	eq(self, r) -> bool
"bool"	__ne__ (self, "rect_t" r)
	ne(self, r) -> bool

Static Public Attributes
str	left = property(_ida_graph.rect_t_left_get, _ida_graph.rect_t_left_set, doc=)
str	top = property(_ida_graph.rect_t_top_get, _ida_graph.rect_t_top_set, doc=)
str	right = property(_ida_graph.rect_t_right_get, _ida_graph.rect_t_right_set, doc=)
str	bottom = property(_ida_graph.rect_t_bottom_get, _ida_graph.rect_t_bottom_set, doc=)

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

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,
		"rect_t"	r )

Parameters

r	rect_t const &

__ne__()

"bool" __ne__	(		self,
		"rect_t"	r )

Parameters

r	rect_t const &

area()

"int" area

(

self

)

bottomright()

"point_t" bottomright

(

self

)

center()

"point_t" center

(

self

)

contains()

"bool" contains	(		self,
		"point_t"	p )

Parameters

p	point_t const &

empty()

"bool" empty

(

self

)

grow()

"void" grow	(		self,
		"int"	delta )

Parameters

delta

int

height()

"int" height

(

self

)

intersect()

"void" intersect	(		self,
		"rect_t"	r )

Parameters

r	rect_t const &

is_intersection_empty()

"bool" is_intersection_empty	(		self,
		"rect_t"	r )

Parameters

r	rect_t const &

make_union()

"void" make_union	(		self,
		"rect_t"	r )

Parameters

r	rect_t const &

move_by()

"void" move_by	(		self,
		"point_t"	p )

Parameters

p	point_t const &

move_to()

"void" move_to	(		self,
		"point_t"	p )

Parameters

p	point_t const &

topleft()

"point_t" topleft

(

self

)

verify()

"void" verify

(

self

)

width()

"int" width

(

self

)

Member Data Documentation

bottom

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

static

left

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

static

right

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

static

top

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

static

Property Documentation

thisown

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

static

---

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

• ida_graph.py