blob: 84939c47772f4ea61d8a04b1dc24b65f6b997c10 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
// SPDX-License-Identifier: GPL-2.0-or-later
/** @file
* TODO: insert short description here
*//*
* Authors: see git history
*
* Copyright (C) 2010 Authors
* Released under GNU GPL v2+, read the file 'COPYING' for more information.
*/
/** @file
* @brief SweepTreeList definition
*/
#ifndef INKSCAPE_LIVAROT_SWEEP_TREE_LIST_H
#define INKSCAPE_LIVAROT_SWEEP_TREE_LIST_H
class Shape;
class SweepTree;
/**
* The sweepline: a set of edges intersecting the current sweepline
* stored as an AVL tree.
*/
class SweepTreeList {
public:
int nbTree; ///< Number of nodes in the tree.
int const maxTree; ///< Max number of nodes in the tree.
SweepTree *trees; ///< The array of nodes.
SweepTree *racine; ///< Root of the tree.
SweepTreeList(int s);
virtual ~SweepTreeList();
SweepTree *add(Shape *iSrc, int iBord, int iWeight, int iStartPoint, Shape *iDst);
};
#endif /* !INKSCAPE_LIVAROT_SWEEP_TREE_LIST_H */
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 :
|
