VIPS_RECT_RIGHT()

#define VIPS_RECT_RIGHT(R) ((R)->left + (R)->width)

VIPS_RECT_BOTTOM()

#define VIPS_RECT_BOTTOM(R) ((R)->top + (R)->height)

VIPS_RECT_HCENTRE()

#define VIPS_RECT_HCENTRE(R) ((R)->left + (R)->width / 2)

VIPS_RECT_VCENTRE()

#define VIPS_RECT_VCENTRE(R) ((R)->top + (R)->height / 2)

vips_rect_isempty ()

gbooleanvips_rect_isempty (constVipsRect *r);

Isr empty? ie. zero width or height.

vips_rect_includespoint ()

gbooleanvips_rect_includespoint (constVipsRect *r,int x,int y);

Doesr contain point (x,y)?

vips_rect_includesrect ()

gbooleanvips_rect_includesrect (constVipsRect *r1,constVipsRect *r2);

Isr2 a subset ofr1?

vips_rect_equalsrect ()

gbooleanvips_rect_equalsrect (constVipsRect *r1,constVipsRect *r2);

Isr1 equal tor2?

vips_rect_overlapsrect ()

gbooleanvips_rect_overlapsrect (constVipsRect *r1,constVipsRect *r2);

Dor1 andr2 have a non-empty intersection?

vips_rect_marginadjust ()

voidvips_rect_marginadjust (VipsRect *r,int n);

Enlarger byn. +1 means out one pixel.

vips_rect_intersectrect ()

voidvips_rect_intersectrect (constVipsRect *r1,constVipsRect *r2,VipsRect *out);

Fillout with the intersection ofr1 andr2.out can equalr1 orr2.

vips_rect_unionrect ()

voidvips_rect_unionrect (constVipsRect *r1,constVipsRect *r2,VipsRect *out);

Fillout with the bounding box ofr1 andr2.out can equalr1 orr2.

vips_rect_dup ()

VipsRect *vips_rect_dup (constVipsRect *r);

Duplicate a rect to the heap. You need to free the result withg_free().

[skip]

vips_rect_normalise ()

voidvips_rect_normalise (VipsRect *r);

Make sure width and height are >0 by moving the origin and flipping therect.

VipsRect

typedef struct {int left;int top;int width;int height;} VipsRect;

AVipsRect is a rectangular area of pixels. This is a struct forperforming simple rectangle algebra.