#ifndef SEEN_LIVAROT_SWEEP_EVENT_QUEUE_H #define SEEN_LIVAROT_SWEEP_EVENT_QUEUE_H /** \file * A container of intersection events. */ #include <libnr/nr-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. */ 00018 class SweepEventQueue { public: SweepEventQueue(int s); ~SweepEventQueue(); int size() const { return nbEvt; } /// Look for the topmost intersection in the heap bool peek(SweepTree * &iLeft, SweepTree * &iRight, NR::Point &oPt, double &itl, double &itr); /// Extract the topmost intersection from the heap bool extract(SweepTree * &iLeft, SweepTree * &iRight, NR::Point &oPt, double &itl, double &itr); /// Add one intersection in the binary heap SweepEvent *add(SweepTree *iLeft, SweepTree *iRight, NR::Point &iPt, double itl, double itr); void remove(SweepEvent *e); void relocate(SweepEvent *e, int to); private: 00037 int nbEvt; ///< Number of events currently in the heap. 00038 int maxEvt; ///< Allocated size of the heap. 00039 int *inds; ///< Indices. 00040 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:encoding=utf-8:textwidth=99 :