Given the result of a pair-distance kvector query, build a table of stars to other stars that appeared with it in the query. More...
Public Attributes | |
| std::vector< int32_t > | offsets |
| std::vector< int16_t > | values |
Given the result of a pair-distance kvector query, build a table of stars to other stars that appeared with it in the query.
The table is constructed by counting sort in O(pairs + catalogSize) with zero hashing. The partners of catalog star c are m->values[i] for m->offsets[c] <= i < m->offsets[c+1].
The table is "symmetrical" in the sense that if a star B is in the map for star A, then star A is also in the map for star B.
*m is fully overwritten so that the same FlatPairMap can be reused across calls.
Definition at line 529 of file star-id.cpp.
| std::vector<int32_t> lost::FlatPairMap::offsets |
Definition at line 530 of file star-id.cpp.
| std::vector<int16_t> lost::FlatPairMap::values |
Definition at line 531 of file star-id.cpp.