public class RectangleStrategy extends CacheStrategy
Planes closest to the current position are loaded first, with axes prioritized according to the cache strategy's priority settings.
To illustrate the rectangle strategy, here is a diagram showing a case in 2D with 35 dimensional positions (5Z x 7T). For both Z and T, order is centered, range is 2, and priority is normal. The numbers indicate the order planes will be cached, with "0" corresponding to the current dimensional position (Z2-T3).
T 0 1 2 3 4 5 6 Z /--------------------- 0 | 24 20 6 14 22 1 | 18 12 2 10 16 2 | 8 4 0 3 7 3 | 17 11 1 9 15 4 | 23 19 5 13 21
DEFAULT_RANGE, lengths, listeners, order, priorities, range
BACKWARD_ORDER, CENTERED_ORDER, FORWARD_ORDER, HIGH_PRIORITY, LOW_PRIORITY, MAX_PRIORITY, MIN_PRIORITY, NORMAL_PRIORITY
Constructor and Description |
---|
RectangleStrategy(int[] lengths)
Constructs a rectangle strategy.
|
Modifier and Type | Method and Description |
---|---|
protected int[][] |
getPossiblePositions()
Gets positions to consider for possible inclusion in the cache,
assuming a current position at the origin (0).
|
addCacheListener, compare, distance, getCacheListeners, getLengths, getLoadList, getOrder, getPriorities, getRange, length, notifyListeners, pos, pos, raster, removeCacheListener, setOrder, setPriority, setRange
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
comparing, comparing, comparingDouble, comparingInt, comparingLong, equals, naturalOrder, nullsFirst, nullsLast, reversed, reverseOrder, thenComparing, thenComparing, thenComparing, thenComparingDouble, thenComparingInt, thenComparingLong
public RectangleStrategy(int[] lengths)
protected int[][] getPossiblePositions()
CacheStrategy
getPossiblePositions
in class CacheStrategy
Copyright © 2017 Open Microscopy Environment