rect_t Struct Reference

A rectangle in a graph view. More...

#include <graph.hpp>

Public Member Functions
	rect_t ()
	rect_t (int l, int t, int r, int b)
	rect_t (const point_t &p0, const point_t &p1)
void	verify (void)
int	width (void) const
int	height (void) const
void	move_to (const point_t &p)
void	move_by (const point_t &p)
point_t	center (void) const
point_t	topleft (void) const
point_t	bottomright (void) const
void	grow (int delta)
void	intersect (const rect_t &r)
void	make_union (const rect_t &r)
bool	empty (void) const
bool	is_intersection_empty (const rect_t &r) const
bool	contains (const point_t &p) const
int	area (void) const
bool idaapi	operator== (const rect_t &r) const
bool idaapi	operator!= (const rect_t &r) const
bool idaapi	operator< (const rect_t &r) const
const TRect &	operator() (void) const
TRect &	operator() (void)
	rect_t (const TRect &r)

Public Attributes
int	left = 0
int	top = 0
int	right = 0
int	bottom = 0

Detailed Description

A rectangle in a graph view.

Please note that a correct rectangle has left < right and top < bottom. NB: top less than bottom, which means that the vertical axis grows to the bottom, a bigger value means verically lower.

Constructor & Destructor Documentation

rect_t() [1/4]

rect_t::rect_t ( )

inline

rect_t() [2/4]

rect_t::rect_t ( int l, int t, int r, int b )

inline

rect_t() [3/4]

rect_t::rect_t ( const point_t & p0, const point_t & p1 )

inline

rect_t() [4/4]

rect_t::rect_t ( const TRect & r )

inline

Member Function Documentation

verify()

void rect_t::verify ( void )

inline

width()

int rect_t::width ( void ) const

inline

height()

int rect_t::height ( void ) const

inline

move_to()

void rect_t::move_to ( const point_t & p )

inline

move_by()

void rect_t::move_by ( const point_t & p )

inline

center()

point_t rect_t::center ( void ) const

inline

topleft()

point_t rect_t::topleft ( void ) const

inline

bottomright()

point_t rect_t::bottomright ( void ) const

inline

grow()

void rect_t::grow ( int delta )

inline

intersect()

void rect_t::intersect ( const rect_t & r )

inline

make_union()

void rect_t::make_union ( const rect_t & r )

inline

empty()

bool rect_t::empty ( void ) const

inline

is_intersection_empty()

bool rect_t::is_intersection_empty ( const rect_t & r ) const

inline

contains()

bool rect_t::contains ( const point_t & p ) const

inline

area()

int rect_t::area ( void ) const

inline

operator==()

bool idaapi rect_t::operator== ( const rect_t & r ) const

inline

operator!=()

bool idaapi rect_t::operator!= ( const rect_t & r ) const

inline

operator<()

bool idaapi rect_t::operator<

(

const rect_t &

r

)

const

operator()() [1/2]

const TRect & rect_t::operator() ( void ) const

inline

operator()() [2/2]

TRect & rect_t::operator() ( void )

inline

Member Data Documentation

left

int rect_t::left = 0

top

int rect_t::top = 0

right

int rect_t::right = 0

bottom

int rect_t::bottom = 0

---

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

• ida-sdk/src/include/graph.hpp