Class: PickHitList
Experimental
Reusable output of gatherPickHits: parallel arrays of pick ids and CSS distances, sorted by distance (ties by id). Only the first count entries are valid.
Constructors
Constructor
ts
new PickHitList(): PickHitList;Experimental
Returns
PickHitList
Properties
| Property | Modifier | Type | Default value | Description |
|---|---|---|---|---|
count | public | number | 0 | Experimental |
distances | readonly | number[] | [] | Experimental |
ids | readonly | number[] | [] | Experimental |
Methods
add()
ts
add(id, distance): void;Experimental
Record id at distance, keeping the minimum distance per id.
Parameters
| Parameter | Type |
|---|---|
id | number |
distance | number |
Returns
void
clear()
ts
clear(): void;Experimental
Returns
void
sort()
ts
sort(): void;Experimental
Sort the valid entries by distance, then id (deterministic for equal distances).
Returns
void