kdu_range_set

This structure is used to keep track of a set of indices. The set is represented as a union of (potentially sub-sampled) ranges, i.e. as a union of kdu_sampled_ranges. The lower bounds of the ranges are arranged in order, from smallest to largest, but the ranges might still overlap.

A range which contains a negative from index is treated as though the first index were not actually known, except that all ranges with the same negative from index are guaranteed to have the same first index once the negative value gets resolved. This allows negative values to be used as placeholders for tokens such as the "now" token defined by the JPIP standard as a valid code-stream index. When the object attempts to merge ranges, it takes into account the fact that the negative indices have unknown values.

kdu_range_set {Java: Kdu_range_set}

~kdu_range_set {Java: Native_destroy}

copy_from {Java: Copy_from}

is_empty {Java: Is_empty}

operator!

contains {Java: Contains}

equals {Java: Equals}

operator==

operator!=

init {Java: Init}

add (3 forms) {Java: Add}

get_range {Java: Get_range}

test {Java: Test}