`#include <sweep-event-queue.h>`

Definition at line 18 of file sweep-event-queue.h.

## Public Member Functions | |

SweepEvent * | add (SweepTree *iLeft, SweepTree *iRight, Geom::Point &iPt, double itl, double itr) |

Add one intersection in the binary heap. | |

bool | extract (SweepTree *&iLeft, SweepTree *&iRight, Geom::Point &oPt, double &itl, double &itr) |

Extract the topmost intersection from the heap. | |

bool | peek (SweepTree *&iLeft, SweepTree *&iRight, Geom::Point &oPt, double &itl, double &itr) |

Look for the topmost intersection in the heap. | |

void | relocate (SweepEvent *e, int to) |

void | remove (SweepEvent *e) |

int | size () const |

SweepEventQueue (int s) | |

## Private Attributes | |

SweepEvent * | events |

Sweep events. | |

int * | inds |

Indices. | |

int | maxEvt |

Allocated size of the heap. | |

int | nbEvt |

Number of events currently in the heap. |

The documentation for this class was generated from the following files:

- inkscape-0.47pre0/src/livarot/sweep-event-queue.h
- inkscape-0.47pre0/src/livarot/sweep-event.cpp

Generated by Doxygen 1.6.0 Back to index