Priority-queue structures.

## Classes | |

struct | integral< FP > |

Data for a single integral. More... | |

struct | less_abs< FP > |

Absolute error comparison relation for integral structs. More... | |

struct | less_rel< FP > |

Relative error comparison relation for integral structs. More... | |

class | integralblock< FP > |

Data block for subdivided region. More... |

The structures implemented for the adaptive refinement algorithm in the source file fltadapt02.cpp improve some aspects of the implementation adapt01_h:

- All data for a subregion -- the interval boundaries, the integral value, the error estimate data -- are bundled into one integral structure instead of two separate key-data pairs.
- The integralblock structure provides memory management for the underlying data arrays needed by all "subregions" for one level of the divide and conquer algorithm. Methods are provided for initializing the boundary data and interfacing the underlying arrays to the objects (integral) used by the sorting algorithm.

Generated by 1.7.4