2010-05-27 Jb Evain <jbevain@novell.com>
[mcs.git] / class / Mono.Cairo / Mono.Cairo / LinearGradient.cs
blob58d8e21ab8a8024a50362e0a461ce926b339b776
1 //
2 // Mono.Cairo.LinearGradient.cs
3 //
4 // Author: Jordi Mas (jordi@ximian.com)
5 // Hisham Mardam Bey (hisham.mardambey@gmail.com)
6 // (C) Ximian Inc, 2004.
7 //
8 // Copyright (C) 2004 Novell, Inc (http://www.novell.com)
9 //
10 // Permission is hereby granted, free of charge, to any person obtaining
11 // a copy of this software and associated documentation files (the
12 // "Software"), to deal in the Software without restriction, including
13 // without limitation the rights to use, copy, modify, merge, publish,
14 // distribute, sublicense, and/or sell copies of the Software, and to
15 // permit persons to whom the Software is furnished to do so, subject to
16 // the following conditions:
17 //
18 // The above copyright notice and this permission notice shall be
19 // included in all copies or substantial portions of the Software.
20 //
21 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
22 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
23 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
24 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
25 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
26 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
27 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
30 using System;
32 namespace Cairo {
34 public class LinearGradient : Gradient
36 internal LinearGradient (IntPtr handle) : base (handle)
40 public LinearGradient (double x0, double y0, double x1, double y1)
42 pattern = NativeMethods.cairo_pattern_create_linear (x0, y0, x1, y1);
45 public PointD[] LinearPoints {
46 get {
47 double x0, y0, x1, y1;
48 PointD[] points = new PointD [2];
50 NativeMethods.cairo_pattern_get_linear_points (pattern, out x0, out y0, out x1, out y1);
52 points[0] = new PointD (x0, y0);
53 points[1] = new PointD (x1, y1);
54 return points;