1 | /*
|
---|
2 | * SVG Salamander
|
---|
3 | * Copyright (c) 2004, Mark McKay
|
---|
4 | * All rights reserved.
|
---|
5 | *
|
---|
6 | * Redistribution and use in source and binary forms, with or
|
---|
7 | * without modification, are permitted provided that the following
|
---|
8 | * conditions are met:
|
---|
9 | *
|
---|
10 | * - Redistributions of source code must retain the above
|
---|
11 | * copyright notice, this list of conditions and the following
|
---|
12 | * disclaimer.
|
---|
13 | * - Redistributions in binary form must reproduce the above
|
---|
14 | * copyright notice, this list of conditions and the following
|
---|
15 | * disclaimer in the documentation and/or other materials
|
---|
16 | * provided with the distribution.
|
---|
17 | *
|
---|
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
---|
19 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
---|
20 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
---|
21 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
---|
22 | * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
---|
23 | * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
---|
24 | * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
---|
25 | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
---|
26 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
---|
27 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
---|
28 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
---|
29 | * OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
30 | *
|
---|
31 | * Mark McKay can be contacted at mark@kitfox.com. Salamander and other
|
---|
32 | * projects can be found at http://www.kitfox.com
|
---|
33 | *
|
---|
34 | * Created on January 26, 2004, 9:18 PM
|
---|
35 | */
|
---|
36 | package com.kitfox.svg.pathcmd;
|
---|
37 |
|
---|
38 | import java.awt.geom.Point2D;
|
---|
39 |
|
---|
40 | /**
|
---|
41 | * When building a path from command segments, most need to cache information
|
---|
42 | * (such as the point finished at) for future commands. This structure allows
|
---|
43 | * that
|
---|
44 | *
|
---|
45 | * @author Mark McKay
|
---|
46 | * @author <a href="mailto:mark@kitfox.com">Mark McKay</a>
|
---|
47 | */
|
---|
48 | public class BuildHistory
|
---|
49 | {
|
---|
50 |
|
---|
51 | // Point2D.Float[] history = new Point2D.Float[2];
|
---|
52 | // Point2D.Float[] history = {new Point2D.Float(), new Point2D.Float()};
|
---|
53 | // Point2D.Float start = new Point2D.Float();
|
---|
54 | Point2D.Float startPoint = new Point2D.Float();
|
---|
55 | Point2D.Float lastPoint = new Point2D.Float();
|
---|
56 | Point2D.Float lastKnot = new Point2D.Float();
|
---|
57 | boolean init;
|
---|
58 | //int length = 0;
|
---|
59 |
|
---|
60 | /**
|
---|
61 | * Creates a new instance of BuildHistory
|
---|
62 | */
|
---|
63 | public BuildHistory()
|
---|
64 | {
|
---|
65 | }
|
---|
66 |
|
---|
67 | public void setStartPoint(float x, float y)
|
---|
68 | {
|
---|
69 | startPoint.setLocation(x, y);
|
---|
70 | }
|
---|
71 |
|
---|
72 | public void setLastPoint(float x, float y)
|
---|
73 | {
|
---|
74 | lastPoint.setLocation(x, y);
|
---|
75 | }
|
---|
76 |
|
---|
77 | public void setLastKnot(float x, float y)
|
---|
78 | {
|
---|
79 | lastKnot.setLocation(x, y);
|
---|
80 | }
|
---|
81 | // public void setPoint(float x, float y)
|
---|
82 | // {
|
---|
83 | // history[0].setLocation(x, y);
|
---|
84 | // length = 1;
|
---|
85 | // }
|
---|
86 | // public void setStart(float x, float y)
|
---|
87 | // {
|
---|
88 | // start.setLocation(x, y);
|
---|
89 | // }
|
---|
90 | // public void setPointAndKnot(float x, float y, float kx, float ky)
|
---|
91 | // {
|
---|
92 | // history[0].setLocation(x, y);
|
---|
93 | // history[1].setLocation(kx, ky);
|
---|
94 | // length = 2;
|
---|
95 | // }
|
---|
96 | }
|
---|