range_query.h

Go to the documentation of this file.

#pragma once
 
#include <concepts>
#include <cstddef>
#include <cstdint>
#include <utility>
#include <vector>
 
#include "clustering/math/thread.h"
#include "clustering/ndarray.h"
 
namespace clustering::index {

struct CoreAdjacency {
  std::vector<std::vector<std::int32_t>> rows; 
  std::vector<std::uint8_t> isCore;            
  std::vector<std::pair<std::int32_t, std::int32_t>> extraEdges;
};

template <class Q, class T>
concept RangeIndex = std::constructible_from<Q, const NDArray<T, 2> &> &&
                     requires(const Q &q, T radius, std::size_t minPts, math::Pool pool) {
                       { q.query(radius, minPts, pool) } -> std::same_as<CoreAdjacency>;
                     };
 
} // namespace clustering::index