1/*
2 * Poly2Tri Copyright (c) 2009-2010, Poly2Tri Contributors
3 * http://code.google.com/p/poly2tri/
4 *
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without modification,
8 * are permitted provided that the following conditions are met:
9 *
10 * * Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 * * Redistributions in binary form must reproduce the above copyright notice,
13 * this list of conditions and the following disclaimer in the documentation
14 * and/or other materials provided with the distribution.
15 * * Neither the name of Poly2Tri nor the names of its contributors may be
16 * used to endorse or promote products derived from this software without specific
17 * prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
26 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
27 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
28 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
29 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 */
31
32#ifndef ADVANCED_FRONT_H
33#define ADVANCED_FRONT_H
34
35#include "../common/shapes.h"
36
37namespace p2t {
38
39struct Node;
40
41// Advancing front node
42struct Node {
43 Point* point;
44 Triangle* triangle;
45
46 Node* next;
47 Node* prev;
48
49 double value;
50
51 Node(Point& p) : point(&p), triangle(NULL), next(NULL), prev(NULL), value(p.x)
52 {
53 }
54
55 Node(Point& p, Triangle& t) : point(&p), triangle(&t), next(NULL), prev(NULL), value(p.x)
56 {
57 }
58
59};
60
61// Advancing front
62class AdvancingFront {
63public:
64
65AdvancingFront(Node& head, Node& tail);
66// Destructor
67~AdvancingFront();
68
69Node* head();
70void set_head(Node* node);
71Node* tail();
72void set_tail(Node* node);
73Node* search();
74void set_search(Node* node);
75
76/// Locate insertion point along advancing front
77Node* LocateNode(const double& x);
78
79Node* LocatePoint(const Point* point);
80
81private:
82
83Node* head_, *tail_, *search_node_;
84
85Node* FindSearchNode(const double& x);
86};
87
88inline Node* AdvancingFront::head()
89{
90 return head_;
91}
92inline void AdvancingFront::set_head(Node* node)
93{
94 head_ = node;
95}
96
97inline Node* AdvancingFront::tail()
98{
99 return tail_;
100}
101inline void AdvancingFront::set_tail(Node* node)
102{
103 tail_ = node;
104}
105
106inline Node* AdvancingFront::search()
107{
108 return search_node_;
109}
110
111inline void AdvancingFront::set_search(Node* node)
112{
113 search_node_ = node;
114}
115
116}
117
118#endif
119

source code of qtlocation/src/3rdparty/poly2tri/sweep/advancing_front.h