Searched refs:SweepEvent (Results 1 - 5 of 5) sorted by relevance
| /inkscape/src/livarot/ |
| H A D | sweep-event.h | 12 class SweepEvent class
22 SweepEvent(); // not used.
23 virtual ~SweepEvent(); // not used.
25 /// Initialize a SweepEvent structure.
29 /// Void a SweepEvent structure.
|
| H A D | sweep-event-queue.h | 8 class SweepEvent;
14 * SweepEvent (not allocated with "new SweepEvent[n]" but with a malloc). There's a list of
16 * heap. Each SweepEvent has a field to store its index in the heap, too.
31 SweepEvent *add(SweepTree *iLeft, SweepTree *iRight, Geom::Point &iPt, double itl, double itr);
33 void remove(SweepEvent *e);
34 void relocate(SweepEvent *e, int to);
40 SweepEvent *events; ///< Sweep events.
|
| H A D | sweep-event.cpp | 10 ** calls the SweepEvent destructors.
12 events = (SweepEvent *) g_malloc(maxEvt * sizeof(SweepEvent));
22 SweepEvent *SweepEventQueue::add(SweepTree *iLeft, SweepTree *iRight, Geom::Point &px, double itl, double itr)
71 SweepEvent const &e = events[inds[0]];
88 SweepEvent &e = events[inds[0]];
101 void SweepEventQueue::remove(SweepEvent *e)
207 void SweepEventQueue::relocate(SweepEvent *e, int to)
228 SweepEvent::SweepEvent() function in class:SweepEvent
[all...] |
| H A D | sweep-tree.h | 8 class SweepEvent;
20 SweepEvent *evt[2]; ///< Intersection with the edge on the left and right (if any).
|
| H A D | Shape.h | 385 friend class SweepEvent;
|
Completed in 19 milliseconds