Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 | import { PixelDataTypedArray } from '../types';
/**
* The RLERun specifies a contigous run of values for a row,
* where all indices (i only) from `[start,end)` have the specified
* value.
*/
export type RLERun<T> = {
value: T;
start: number;
end: number;
};
/**
* RLE based implementation of a voxel map.
* This can be used as single or multi-plane, as the underlying indexes are
* mapped to rows and hte rows are indexed started at 0 and continuing
* incrementing for all rows in the multi-plane voxel.
*/
export default class RLEVoxelMap<T> {
/**
* The rows for the voxel map is a map from the j index location (or for
* volumes, `j + k*height`) to a list of RLE runs. That is, each entry in
* the rows specifies the voxel data for a given row in the image.
* Then, the RLE runs themselves specify the pixel values for given rows as
* a pair of start/end indices, plus the value to apply.
*/
protected rows = new Map<number, RLERun<T>[]>();
/** The height of the images stored in the voxel map (eg the height of each plane) */
protected height = 1;
/** The width of the image planes */
protected width = 1;
/**
* The number of image planes stored (the depth of the indices), with the k
* index going from 0...depth.
*/
protected depth = 1;
/**
* A multiplier value to go from j values to overall index values.
*/
protected jMultiple = 1;
/**
* A multiplier value to go from k values to overall index values.
*/
protected kMultiple = 1;
/** Number of components in the value */
protected numComps = 1;
/**
* The default value returned for get.
* This allows treting the voxel map more like scalar data, returning the right
* default value for unset values.
* Set to 0 by default, but any maps where 0 not in T should update this value.
*/
public defaultValue: T = 0 as unknown as T;
/**
* The constructor for creating pixel data.
*/
public pixelDataConstructor = Uint8Array;
constructor(width: number, height: number, depth = 1) {
this.width = width;
this.height = height;
this.depth = depth;
this.jMultiple = width;
this.kMultiple = this.jMultiple * height;
}
/**
* Gets the value encoded in the map at the given index, which is
* an integer `[i,j,k]` voxel index, equal to `index=i+(j+k*height)*width`
* value (eg a standard ScalarData index for stack/volume single component
* indices.)
*
* Returns defaultValue if the RLE value is not found.
*/
public get = (index: number): T => {
const i = index % this.jMultiple;
const j = (index - i) / this.jMultiple;
const rle = this.getRLE(i, j);
return rle?.value || this.defaultValue;
};
/**
* Gets a list of RLERun values which specify the data on the row j
* This allows applying or modifying the run directly. See CanvasActor
* for an example in the RLE rendering.
*/
protected getRLE(i: number, j: number, k = 0): RLERun<T> {
const row = this.rows.get(j + k * this.height);
if (!row) {
return;
}
const index = this.findIndex(row, i);
const rle = row[index];
return i >= rle?.start ? rle : undefined;
}
/**
* Finds the index in the row that i is contained in, OR that i would be
* before. That is, the rle value for the returned index in that row
* has `i ε [start,end)` if a direct RLE is found, or `i ε [end_-1,start)` if
* in the prefix. If no RLE is found with that index, then
* `i ε [end_final,length)`
*/
protected findIndex(row: RLERun<T>[], i: number) {
for (let index = 0; index < row.length; index++) {
const { end: iEnd } = row[index];
if (i < iEnd) {
return index;
}
}
return row.length;
}
/**
* Gets the run for the given j,k indices. This is used to allow fast access
* to runs for data for things like rendering entire rows of data.
*/
public getRun = (j: number, k: number) => {
const runIndex = j + k * this.height;
return this.rows.get(runIndex);
};
/**
* Adds to the RLE at the given position. This is unfortunately fairly
* complex since it is desirable to minimize the number of runs, but to still
* allow it to be efficient.
*/
public set = (index: number, value: T) => {
if (value === undefined) {
throw new Error(`Can't set undefined at ${index % this.width}`);
}
const i = index % this.width;
const j = (index - i) / this.width;
const row = this.rows.get(j);
if (!row) {
this.rows.set(j, [{ start: i, end: i + 1, value }]);
return;
}
const rleIndex = this.findIndex(row, i);
const rle1 = row[rleIndex];
const rle0 = row[rleIndex - 1];
// Adding to the end of the row
if (!rle1) {
// We are at the end, check if the previous rle can be extended
if (!rle0 || rle0.value !== value || rle0.end !== i) {
row[rleIndex] = { start: i, end: i + 1, value };
// validateRow(row, i, rleIndex, value);
return;
}
// Just add it to the previous element.
rle0.end++;
return;
}
const { start, end, value: oldValue } = rle1;
// Handle the already in place case
if (value === oldValue && i >= start) {
// validateRow(row, i, rleIndex, value, start);
return;
}
const rleInsert = { start: i, end: i + 1, value };
const isAfter = i > start;
const insertIndex = isAfter ? rleIndex + 1 : rleIndex;
const rlePrev = isAfter ? rle1 : rle0;
let rleNext = isAfter ? row[rleIndex + 1] : rle1;
// Can merge with previous value, so no insert
if (rlePrev?.value === value && rlePrev?.end === i) {
rlePrev.end++;
if (rleNext?.value === value && rleNext.start === i + 1) {
rlePrev.end = rleNext.end;
row.splice(rleIndex, 1);
// validateRow(row, i, rleIndex, value);
} else if (rleNext?.start === i) {
rleNext.start++;
if (rleNext.start === rleNext.end) {
row.splice(rleIndex, 1);
rleNext = row[rleIndex];
// Check if we can merge twice
if (rleNext?.start === i + 1 && rleNext.value === value) {
rlePrev.end = rleNext.end;
row.splice(rleIndex, 1);
}
}
// validateRow(row, i, rleIndex, value);
}
return;
}
// Can merge with next, so no insert
if (rleNext?.value === value && rleNext.start === i + 1) {
rleNext.start--;
if (rlePrev?.end > i) {
rlePrev.end = i;
if (rlePrev.end === rlePrev.start) {
row.splice(rleIndex, 1);
}
}
// validateRow(row, i, rleIndex, value);
return;
}
// Can't merge, need to see if we can replace
if (rleNext?.start === i && rleNext.end === i + 1) {
rleNext.value = value;
const nextnext = row[rleIndex + 1];
if (nextnext?.start == i + 1 && nextnext.value === value) {
row.splice(rleIndex + 1, 1);
rleNext.end = nextnext.end;
}
// validateRow(row, i, rleIndex, value);
return;
}
// Need to fix the next start value
if (i === rleNext?.start) {
rleNext.start++;
}
if (isAfter && end > i + 1) {
// Insert two items, to split the existing into three
row.splice(insertIndex, 0, rleInsert, {
start: i + 1,
end: rlePrev.end,
value: rlePrev.value,
});
} else {
row.splice(insertIndex, 0, rleInsert);
}
if (rlePrev?.end > i) {
rlePrev.end = i;
}
// validateRow(row, i, rleIndex, value, insertIndex);
};
/**
* Clears all entries.
*/
public clear() {
this.rows.clear();
}
/**
* Gets the set of key entries - that is j values. This may include
* `j>=height`, where `j = key % height`, and `k = Math.floor(j / height)`
*/
public keys(): number[] {
return [...this.rows.keys()];
}
/**
* Gets the pixel data into the provided pixel data array, or creates one
* according to the assigned type.
*/
public getPixelData(
k = 0,
pixelData?: PixelDataTypedArray
): PixelDataTypedArray {
if (!pixelData) {
pixelData = new this.pixelDataConstructor(
this.width * this.height * this.numComps
);
} else {
pixelData.fill(0);
}
const { width, height, numComps } = this;
for (let j = 0; j < height; j++) {
const row = this.getRun(j, k);
if (!row) {
continue;
}
if (numComps === 1) {
for (const rle of row) {
const rowOffset = j * width;
const { start, end, value } = rle;
for (let i = start; i < end; i++) {
pixelData[rowOffset + i] = value as unknown as number;
}
}
} else {
for (const rle of row) {
const rowOffset = j * width * numComps;
const { start, end, value } = rle;
for (let i = start; i < end; i += numComps) {
for (let comp = 0; comp < numComps; comp++) {
pixelData[rowOffset + i + comp] = value[comp];
}
}
}
}
}
return pixelData;
}
}
// This is some code to allow debugging RLE maps
// To be deleted along with references once RLE is better tested.
// Might move to testing code at that point
// function validateRow(row, ...inputs) {
// if (!row) {
// return;
// }
// let lastRle;
// for (const rle of row) {
// const { start, end, value } = rle;
// if (start < 0 || end > 1920 || start >= end) {
// console.log('Wrong order', ...inputs);
// debugger;
// }
// if (!lastRle) {
// lastRle = rle;
// continue;
// }
// const { start: lastStart, end: lastEnd, value: lastValue } = lastRle;
// lastRle = rle;
// if (start < lastEnd) {
// console.log('inputs for wrong overlap', ...inputs);
// debugger;
// }
// if (start === lastEnd && value === lastValue) {
// console.log('inputs for two in a row same', ...inputs);
// debugger;
// }
// }
// }
|