1 /* 2 * This file is part of gtkD. 3 * 4 * gtkD is free software; you can redistribute it and/or modify 5 * it under the terms of the GNU Lesser General Public License 6 * as published by the Free Software Foundation; either version 3 7 * of the License, or (at your option) any later version, with 8 * some exceptions, please read the COPYING file. 9 * 10 * gtkD is distributed in the hope that it will be useful, 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * GNU Lesser General Public License for more details. 14 * 15 * You should have received a copy of the GNU Lesser General Public License 16 * along with gtkD; if not, write to the Free Software 17 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110, USA 18 */ 19 20 // generated automatically - do not change 21 // find conversion definition on APILookup.txt 22 // implement new conversion functionalities on the wrap.utils pakage 23 24 /* 25 * Conversion parameters: 26 * inFile = gdk3-Points-Rectangles-and-Regions.html 27 * outPack = gdk 28 * outFile = Rectangle 29 * strct = 30 * realStrct= 31 * ctorStrct= 32 * clss = 33 * interf = 34 * class Code: No 35 * interface Code: No 36 * template for: 37 * extend = 38 * implements: 39 * prefixes: 40 * - gdk_rectangle_ 41 * omit structs: 42 * omit prefixes: 43 * omit code: 44 * omit signals: 45 * imports: 46 * structWrap: 47 * module aliases: 48 * local aliases: 49 * overrides: 50 */ 51 52 module gdk.Rectangle; 53 54 public import gtkc.gdktypes; 55 56 private import gtkc.gdk; 57 private import glib.ConstructionException; 58 private import gobject.ObjectG; 59 60 61 62 63 64 65 /** 66 */ 67 68 /** 69 * Calculates the intersection of two rectangles. It is allowed for 70 * dest to be the same as either src1 or src2. If the rectangles 71 * do not intersect, dest's width and height is set to 0 and its x 72 * and y values are undefined. If you are only interested in whether 73 * the rectangles intersect, but not in the intersecting area itself, 74 * pass NULL for dest. 75 * Params: 76 * src1 = a GdkRectangle 77 * src2 = a GdkRectangle 78 * dest = return location for the 79 * intersection of src1 and src2, or NULL. [out caller-allocates][allow-none] 80 * Returns: TRUE if the rectangles intersect. 81 */ 82 public static int intersect(ref Rectangle src1, ref Rectangle src2, out Rectangle dest) 83 { 84 // gboolean gdk_rectangle_intersect (const GdkRectangle *src1, const GdkRectangle *src2, GdkRectangle *dest); 85 return gdk_rectangle_intersect(&src1, &src2, &dest); 86 } 87 88 /** 89 * Calculates the union of two rectangles. 90 * The union of rectangles src1 and src2 is the smallest rectangle which 91 * includes both src1 and src2 within it. 92 * It is allowed for dest to be the same as either src1 or src2. 93 * Params: 94 * src1 = a GdkRectangle 95 * src2 = a GdkRectangle 96 * dest = return location for the union of src1 and src2. [out] 97 */ 98 public static void unio(ref Rectangle src1, ref Rectangle src2, out Rectangle dest) 99 { 100 // void gdk_rectangle_union (const GdkRectangle *src1, const GdkRectangle *src2, GdkRectangle *dest); 101 gdk_rectangle_union(&src1, &src2, &dest); 102 } 103