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
50
51
52
53
54
55
56
57
58
59
60
|
// SPDX-License-Identifier: GPL-2.0-or-later
/** @file
* A container of intersection events.
*//*
* Authors: see git history
*
* Copyright (C) 2010 Authors
* Released under GNU GPL v2+, read the file 'COPYING' for more information.
*/
#ifndef SEEN_LIVAROT_SWEEP_EVENT_QUEUE_H
#define SEEN_LIVAROT_SWEEP_EVENT_QUEUE_H
#include <2geom/forward.h>
class SweepEvent;
class SweepTree;
/**
* The structure to hold the intersections events encountered during the sweep. It's an array of
* SweepEvent (not allocated with "new SweepEvent[n]" but with a malloc). There's a list of
* indices because it's a binary heap: inds[i] tell that events[inds[i]] has position i in the
* heap. Each SweepEvent has a field to store its index in the heap, too.
*/
class SweepEventQueue
{
public:
SweepEventQueue(int s);
virtual ~SweepEventQueue();
int size() const { return nbEvt; }
/// Look for the topmost intersection in the heap
bool peek(SweepTree * &iLeft, SweepTree * &iRight, Geom::Point &oPt, double &itl, double &itr);
/// Extract the topmost intersection from the heap
bool extract(SweepTree * &iLeft, SweepTree * &iRight, Geom::Point &oPt, double &itl, double &itr);
/// Add one intersection in the binary heap
SweepEvent *add(SweepTree *iLeft, SweepTree *iRight, Geom::Point &iPt, double itl, double itr);
void remove(SweepEvent *e);
void relocate(SweepEvent *e, int to);
private:
int nbEvt; ///< Number of events currently in the heap.
int maxEvt; ///< Allocated size of the heap.
int *inds; ///< Indices.
SweepEvent *events; ///< Sweep events.
};
#endif /* !SEEN_LIVAROT_SWEEP_EVENT_QUEUE_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 :
|
