kdu_serve::augment_cache_model

This form of the overloaded augment_cache_model function has the same interpretation as the first, except in the following two respects: 1) it applies only to precinct data-bins; and 2) the relevant precincts are identified through their explicit coordinates: their tile, component, resolution and precinct indices. The actual values assumed by the indices are controlled by lower and upper bounds. For example, cmin and cmax identify lower and upper bounds (inclusive) on the image components being referenced. Tile and precinct indices are treated somewhat differently, since both refer to 2D grids. In this case, a range of tiles or precincts refers to the rectangular region whose upper left hand corner has the index supplied by the lower bound and whose lower right hand corner has the index supplied by the upper bound of the range.

The upper bound of any range may, of course, be equal to the lower bound, in which case we refer to it as a "simple range". If the upper bound is larger than the lower bound, the range is said to be "complex". If the lower bound is negative, the range refers to all values of the relevant coordinate, and is also said to be complex.

Importantly, if any of the ranges is complex, the effect of the function is restricted exclusively to those precincts which actually contribute to the current window (as specified via the most recent set_window call, but possibly modified by the server — modifications may be determined by calling get_window).

Due to the potential for ambiguous interpretation, it is expected that complex ranges will be allowed only in certain contexts by the JPIP standard.

stream_min [int]

stream_max [int]

tmin [int]

tmax [int]

cmin [int]

cmax [int]

rmin [int]

rmax [int]

pmin [int]

pmax [int]

available_bytes [int]

available_packets [int]