scann-core 0.2.1

Rust bindings for scann-core: ScaNN's approximate nearest-neighbour vector search core as a standalone library (derived from Google's ScaNN; not an official Google product)
Documentation
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
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
// Copyright 2026 The Google Research Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

#include "scann/utils/reordering_helper.h"

#include <stddef.h>

#include <algorithm>
#include <atomic>
#include <cmath>
#include <cstdint>
#include <functional>
#include <limits>
#include <memory>
#include <utility>
#include <vector>

#include "absl/base/optimization.h"
#include "absl/base/prefetch.h"
#include "absl/log/check.h"
#include "absl/status/status.h"
#include "absl/status/statusor.h"
#include "absl/synchronization/mutex.h"
#include "absl/types/span.h"
#include "scann/brute_force/bfloat16_brute_force.h"
#include "scann/brute_force/brute_force.h"
#include "scann/brute_force/scalar_quantized_brute_force.h"
#include "scann/data_format/datapoint.h"
#include "scann/data_format/dataset.h"
#include "scann/distance_measures/one_to_many/one_to_many.h"
#include "scann/distance_measures/one_to_one/dot_product.h"
#include "scann/distance_measures/one_to_one/l2_distance.h"
#include "scann/oss_wrappers/scann_down_cast.h"
#include "scann/oss_wrappers/scann_status.h"
#include "scann/utils/bfloat16_helpers.h"
#include "scann/utils/common.h"
#include "scann/utils/datapoint_utils.h"
#include "scann/utils/scalar_quantization_helpers.h"
#include "scann/utils/types.h"

namespace research_scann {
namespace one_to_many_low_level {

using NeighborResult = std::pair<DatapointIndex, float>;

class SetCosineDistanceFunctor {
 public:
  explicit SetCosineDistanceFunctor(MutableSpan<NeighborResult> result_span)
      : result_(result_span) {}

  template <typename ValueT>
  SCANN_INLINE void invoke(size_t index, ValueT val) {
    SetDistance(result_, index, val + 1);
  }

  SCANN_INLINE void prefetch(size_t index) {}

 private:
  MutableSpan<NeighborResult> result_;
};

class SetCosineTop1Functor {
 public:
  SCANN_INLINE void invoke(size_t index, float val) {
    val += 1;

    if (val > smallest_.load(std::memory_order_relaxed)) return;
    absl::MutexLock lock(&mutex_);
    if (!is_smaller(index, val)) return;
    smallest_.store(val, std::memory_order_relaxed);
    nn_result_index_ = index;
  }

  SCANN_INLINE void prefetch(size_t index) {}

  NeighborResult Top1Pair(const NNResultsVector& nn_result) {
    return std::make_pair(nn_result[nn_result_index_].first,
                          smallest_.load(std::memory_order_relaxed));
  }

 private:
  SCANN_INLINE bool is_smaller(size_t index, float val) {
    float smallest = smallest_.load(std::memory_order_relaxed);
    const bool is_eq_or_nan =
        smallest == val || std::isunordered(smallest, val);
    if (ABSL_PREDICT_FALSE(is_eq_or_nan)) {
      return index < nn_result_index_;
    }
    return val < smallest;
  }

  mutable absl::Mutex mutex_;
  std::atomic<float> smallest_{std::numeric_limits<float>::max()};
  DatapointIndex nn_result_index_ = kInvalidDatapointIndex;
};

class SetSquaredL2DistanceFunctor {
 public:
  explicit SetSquaredL2DistanceFunctor(MutableSpan<NeighborResult> result_span,
                                       ConstSpan<float> dp_squared_l2_norms,
                                       float query_norm)
      : result_(result_span),
        dp_squared_l2_norms_(dp_squared_l2_norms),
        query_norm_(query_norm) {}

  template <typename ValueT>
  SCANN_INLINE void invoke(size_t index, ValueT val) {
    SetDistance(
        result_, index,
        query_norm_ + dp_squared_l2_norms_[result_[index].first] + 2.0f * val);
  }

  SCANN_INLINE void prefetch(size_t index) {
    absl::PrefetchToLocalCache(&dp_squared_l2_norms_[index]);
  }

 private:
  MutableSpan<NeighborResult> result_;
  ConstSpan<float> dp_squared_l2_norms_;
  const float query_norm_;
};

class SetSquaredL2Top1Functor {
 public:
  explicit SetSquaredL2Top1Functor(ConstSpan<NeighborResult> result_span,
                                   ConstSpan<float> dp_squared_l2_norms,
                                   float query_norm)
      : result_(result_span),
        dp_squared_l2_norms_(dp_squared_l2_norms),
        query_norm_(query_norm) {}

  SCANN_INLINE void invoke(size_t index, float val) {
    val = query_norm_ + dp_squared_l2_norms_[result_[index].first] + 2.0 * val;

    if (val > smallest_.load(std::memory_order_relaxed)) return;
    absl::MutexLock lock(&mutex_);
    if (!is_smaller(index, val)) return;
    smallest_.store(val, std::memory_order_relaxed);
    dp_index_ = result_[index].first;
  }

  SCANN_INLINE void prefetch(size_t index) {
    absl::PrefetchToLocalCache(&dp_squared_l2_norms_[index]);
  }

  std::pair<DatapointIndex, float> Top1Pair() {
    return std::make_pair(dp_index_, smallest_.load(std::memory_order_relaxed));
  }

 private:
  SCANN_INLINE bool is_smaller(size_t index, float val) {
    float smallest = smallest_.load(std::memory_order_relaxed);
    const bool is_eq_or_nan =
        smallest == val || std::isunordered(smallest, val);
    if (ABSL_PREDICT_FALSE(is_eq_or_nan)) {
      return index < dp_index_;
    }
    return val < smallest;
  }

  mutable absl::Mutex mutex_;
  std::atomic<float> smallest_{std::numeric_limits<float>::max()};
  DatapointIndex dp_index_ = kInvalidDatapointIndex;
  ConstSpan<NeighborResult> result_;
  ConstSpan<float> dp_squared_l2_norms_;
  const float query_norm_;
};

class SetLimitedInnerDistanceFunctor {
 public:
  explicit SetLimitedInnerDistanceFunctor(
      MutableSpan<NeighborResult> result_span,
      ConstSpan<float> inverse_database_l2_norms, float inverse_query_norm)
      : result_(result_span),
        inverse_database_l2_norms_(inverse_database_l2_norms),
        inverse_query_norm_(inverse_query_norm) {}

  template <typename ValueT>
  SCANN_INLINE void invoke(size_t index, ValueT val) {
    val *= inverse_query_norm_ *
           std::min(inverse_database_l2_norms_[result_[index].first],
                    inverse_query_norm_);
    SetDistance(result_, index, val);
  }

  SCANN_INLINE void prefetch(size_t index) {
    absl::PrefetchToLocalCache(&inverse_database_l2_norms_[index]);
  }

 private:
  MutableSpan<NeighborResult> result_;
  ConstSpan<float> inverse_database_l2_norms_;
  const float inverse_query_norm_;
};

class SetLimitedInnerTop1Functor {
 public:
  explicit SetLimitedInnerTop1Functor(
      ConstSpan<NeighborResult> result_span,
      ConstSpan<float> inverse_database_l2_norms, float inverse_query_norm)
      : result_(result_span),
        inverse_database_l2_norms_(inverse_database_l2_norms),
        inverse_query_norm_(inverse_query_norm) {}

  SCANN_INLINE void invoke(size_t index, float val) {
    val *= inverse_query_norm_ *
           std::min(inverse_database_l2_norms_[result_[index].first],
                    inverse_query_norm_);

    if (val > smallest_.load(std::memory_order_relaxed)) return;
    absl::MutexLock lock(&mutex_);
    if (!is_smaller(index, val)) return;
    smallest_.store(val, std::memory_order_relaxed);
    dp_index_ = result_[index].first;
  }

  SCANN_INLINE void prefetch(size_t index) {
    absl::PrefetchToLocalCache(&inverse_database_l2_norms_[index]);
  }

  std::pair<DatapointIndex, float> Top1Pair() {
    return std::make_pair(dp_index_, smallest_.load(std::memory_order_relaxed));
  }

 private:
  SCANN_INLINE bool is_smaller(size_t index, float val) {
    float smallest = smallest_.load(std::memory_order_relaxed);
    const bool is_eq_or_nan =
        smallest == val || std::isunordered(smallest, val);
    if (ABSL_PREDICT_FALSE(is_eq_or_nan)) {
      return index < dp_index_;
    }
    return val < smallest;
  }

  mutable absl::Mutex mutex_;
  std::atomic<float> smallest_{std::numeric_limits<float>::max()};
  DatapointIndex dp_index_ = kInvalidDatapointIndex;
  ConstSpan<NeighborResult> result_;
  ConstSpan<float> inverse_database_l2_norms_;
  const float inverse_query_norm_;
};

}  // namespace one_to_many_low_level

template <typename T>
Status ExactReorderingHelper<T>::ComputeDistancesForReordering(
    const DatapointPtr<T>& query, NNResultsVector* result) const {
  DCHECK(exact_reordering_dataset_);

  if (query.IsDense() && exact_reordering_dataset_->IsDense()) {
    const auto& dense_dataset =
        *down_cast<const DenseDataset<T>*>(exact_reordering_dataset_.get());
    DenseDistanceOneToMany<T, pair<DatapointIndex, float>>(
        *exact_reordering_distance_, query, dense_dataset,
        MakeMutableSpan(*result));
  } else if (query.IsSparse() && exact_reordering_dataset_->IsSparse()) {
    const auto& sparse_dataset =
        *down_cast<const SparseDataset<T>*>(exact_reordering_dataset_.get());
    for (auto& elem : *result) {
      elem.second = exact_reordering_distance_->GetDistanceSparse(
          query, sparse_dataset[elem.first]);
    }
  } else {
    for (auto& elem : *result) {
      elem.second = exact_reordering_distance_->GetDistanceHybrid(
          query, (*exact_reordering_dataset_)[elem.first]);
    }
  }

  return OkStatus();
}

template <typename T>
StatusOrPtr<SingleMachineSearcherBase<T>>
ExactReorderingHelper<T>::CreateBruteForceSearcher(int32_t num_neighbors,
                                                   float epsilon) const {
  return std::make_unique<BruteForceSearcher<T>>(exact_reordering_distance_,
                                                 exact_reordering_dataset_,
                                                 num_neighbors, epsilon);
}

template <typename T>
absl::StatusOr<std::pair<DatapointIndex, float>>
ExactReorderingHelper<T>::ComputeTop1ReorderingDistance(
    const DatapointPtr<T>& query, NNResultsVector* result) const {
  if (query.IsDense() && exact_reordering_dataset_->IsDense()) {
    const auto& dense_dataset =
        *down_cast<const DenseDataset<T>*>(exact_reordering_dataset_.get());
    return DenseDistanceOneToManyTop1<T, float, pair<DatapointIndex, float>>(
        *exact_reordering_distance_, query, dense_dataset,
        MakeMutableSpan(*result));
  }
  if (query.IsSparse() && exact_reordering_dataset_->IsSparse()) {
    const auto& sparse_dataset =
        *down_cast<const SparseDataset<T>*>(exact_reordering_dataset_.get());
    float smallest = std::numeric_limits<float>::max();
    DatapointIndex idx = kInvalidDatapointIndex;
    for (auto& elem : *result) {
      float dist = exact_reordering_distance_->GetDistanceSparse(
          query, sparse_dataset[elem.first]);
      idx = dist < smallest ? elem.first : idx;
      smallest = std::min(smallest, dist);
    }
    return std::make_pair(idx, smallest);
  }
  float smallest = std::numeric_limits<float>::max();
  DatapointIndex idx = kInvalidDatapointIndex;
  for (auto& elem : *result) {
    float dist = exact_reordering_distance_->GetDistanceHybrid(
        query, (*exact_reordering_dataset_)[elem.first]);
    idx = dist < smallest ? elem.first : idx;
    smallest = std::min(smallest, dist);
  }
  return std::make_pair(idx, smallest);
}

class FixedPointFloatDenseDotProductReorderingHelper::Mutator final
    : public ReorderingInterface<float>::Mutator {
 public:
  explicit Mutator(FixedPointFloatDenseDotProductReorderingHelper* helper)
      : helper_(helper),
        multipliers_(helper->inverse_multipliers_->size()),
        dataset_mutator_(helper_->fixed_point_dataset_->GetMutator().value()) {
    ConstSpan<float> inv_multipliers = *helper->inverse_multipliers_;
    for (size_t i : IndicesOf(inv_multipliers)) {
      multipliers_[i] = 1.0 / inv_multipliers[i];
    }
  }

  StatusOr<DatapointIndex> AddDatapoint(const DatapointPtr<float>& dptr) final {
    vector<int8_t> storage(dptr.dimensionality());
    DatapointPtr<int8_t> quantized =
        std::isfinite(helper_->noise_shaping_threshold_)
            ? ScalarQuantizeFloatDatapointWithNoiseShaping(
                  dptr, multipliers_, helper_->noise_shaping_threshold_,
                  &storage)
            : ScalarQuantizeFloatDatapoint(dptr, multipliers_, &storage);
    SCANN_RETURN_IF_ERROR(dataset_mutator_->AddDatapoint(quantized, ""));
    return helper_->fixed_point_dataset_->size() - 1;
  }
  StatusOr<DatapointIndex> RemoveDatapoint(DatapointIndex idx) final {
    SCANN_RETURN_IF_ERROR(dataset_mutator_->RemoveDatapoint(idx));
    return helper_->fixed_point_dataset_->size();
  }
  Status UpdateDatapoint(const DatapointPtr<float>& dptr,
                         DatapointIndex idx) final {
    vector<int8_t> storage(dptr.dimensionality());
    DatapointPtr<int8_t> quantized =
        std::isfinite(helper_->noise_shaping_threshold_)
            ? ScalarQuantizeFloatDatapointWithNoiseShaping(
                  dptr, multipliers_, helper_->noise_shaping_threshold_,
                  &storage)
            : ScalarQuantizeFloatDatapoint(dptr, multipliers_, &storage);
    return dataset_mutator_->UpdateDatapoint(quantized, idx);
  }
  void Reserve(DatapointIndex num_datapoints) final {
    dataset_mutator_->Reserve(num_datapoints);
  }

  Status Reconstruct(DatapointIndex idx, MutableSpan<float> output) const {
    return helper_->Reconstruct(idx, output);
  }

  shared_ptr<const Dataset> dataset() const { return helper_->dataset(); }

 private:
  FixedPointFloatDenseDotProductReorderingHelper* helper_ = nullptr;
  vector<float> multipliers_;
  TypedDataset<int8_t>::Mutator* dataset_mutator_;
};

FixedPointFloatDenseDotProductReorderingHelper::
    FixedPointFloatDenseDotProductReorderingHelper(
        const DenseDataset<float>& exact_reordering_dataset,
        float fixed_point_multiplier_quantile, float noise_shaping_threshold,
        ThreadPool* pool)
    : noise_shaping_threshold_(noise_shaping_threshold) {
  ScalarQuantizationResults quantization_results = ScalarQuantizeFloatDataset(
      exact_reordering_dataset, fixed_point_multiplier_quantile,
      noise_shaping_threshold_, pool);
  fixed_point_dataset_ = std::make_shared<DenseDataset<int8_t>>(
      std::move(quantization_results.quantized_dataset));
  inverse_multipliers_ = make_shared<vector<float>>(
      std::move(quantization_results.inverse_multiplier_by_dimension));
}

FixedPointFloatDenseDotProductReorderingHelper::
    FixedPointFloatDenseDotProductReorderingHelper(
        shared_ptr<DenseDataset<int8_t>> fixed_point_dataset,
        absl::Span<const float> multiplier_by_dimension,
        float noise_shaping_threshold)
    : fixed_point_dataset_(std::move(fixed_point_dataset)),
      noise_shaping_threshold_(noise_shaping_threshold) {
  DCHECK(fixed_point_dataset_ != nullptr);
  DCHECK_EQ(multiplier_by_dimension.size(),
            fixed_point_dataset_->dimensionality());
  vector<float> inverse_multipliers(multiplier_by_dimension.size());
  for (size_t i = 0; i < multiplier_by_dimension.size(); ++i) {
    inverse_multipliers[i] = 1.0f / multiplier_by_dimension[i];
  }
  inverse_multipliers_ =
      make_shared<vector<float>>(std::move(inverse_multipliers));
}

FixedPointFloatDenseDotProductReorderingHelper::
    ~FixedPointFloatDenseDotProductReorderingHelper() = default;

StatusOrPtr<SingleMachineSearcherBase<float>>
FixedPointFloatDenseDotProductReorderingHelper::CreateBruteForceSearcher(
    int32_t num_neighbors, float epsilon) const {
  return ScalarQuantizedBruteForceSearcher::
      CreateFromQuantizedDatasetAndInverseMultipliers(
          std::make_unique<DotProductDistance>(), fixed_point_dataset_,
          inverse_multipliers_, nullptr, num_neighbors, epsilon);
}

Status
FixedPointFloatDenseDotProductReorderingHelper::ComputeDistancesForReordering(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  auto preprocessed = PrepareForAsymmetricScalarQuantizedDotProduct(
      query, *inverse_multipliers_);
  DenseDotProductDistanceOneToManyInt8Float(
      MakeDatapointPtr(preprocessed.get(), query.nonzero_entries()),
      *fixed_point_dataset_, MakeMutableSpan(*result));

  return OkStatus();
}

template <typename CallbackFunctor>
Status
FixedPointFloatDenseDotProductReorderingHelper::ComputeDistancesForReordering(
    const DatapointPtr<float>& query, NNResultsVector* result,
    CallbackFunctor* __restrict__ callback) const {
  auto preprocessed = PrepareForAsymmetricScalarQuantizedDotProduct(
      query, *inverse_multipliers_);
  auto view = DefaultDenseDatasetView<int8_t>(*fixed_point_dataset_);
  one_to_many_low_level::DenseDotProductDistanceOneToManyInt8FloatLowLevel<
      DenseDatasetView<int8_t>, false, DatapointIndex>(
      preprocessed.get(), &view, nullptr, MakeMutableSpan(*result), callback);
  return OkStatus();
}

absl::StatusOr<std::pair<DatapointIndex, float>>
FixedPointFloatDenseDotProductReorderingHelper::ComputeTop1ReorderingDistance(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  one_to_many_low_level::SetTop1Functor<std::pair<DatapointIndex, float>, float>
      set_top1_functor;
  SCANN_RETURN_IF_ERROR(
      ComputeDistancesForReordering(query, result, &set_top1_functor));
  return set_top1_functor.Top1Pair(MakeMutableSpan(*result));
}

Status FixedPointFloatDenseDotProductReorderingHelper::Reconstruct(
    DatapointIndex i, MutableSpan<float> output) const {
  if (i >= fixed_point_dataset_->size())
    return InvalidArgumentError(
        "The datapoint index %d is >= the dataset size %d", i,
        fixed_point_dataset_->size());

  const auto* dp_start = (*fixed_point_dataset_)[i].values();
  std::transform(dp_start, dp_start + dimensionality(),
                 inverse_multipliers_->begin(), output.begin(),
                 std::multiplies<float>());
  return OkStatus();
}

StatusOr<ReorderingInterface<float>::Mutator*>
FixedPointFloatDenseDotProductReorderingHelper::GetMutator() const {
  if (!mutator_) {
    mutator_ = std::make_unique<Mutator>(
        const_cast<FixedPointFloatDenseDotProductReorderingHelper*>(this));
  }
  return mutator_.get();
}

class FixedPointFloatDenseCosineReorderingHelper::Mutator final
    : public ReorderingInterface<float>::Mutator {
 public:
  explicit Mutator(FixedPointFloatDenseCosineReorderingHelper* helper)
      : dot_mut_(helper->dot_product_helper_.GetMutator().value()) {}

  StatusOr<DatapointIndex> AddDatapoint(const DatapointPtr<float>& dptr) final {
    auto normalized = Normalize(dptr);
    return dot_mut_->AddDatapoint(normalized.ToPtr());
  }
  StatusOr<DatapointIndex> RemoveDatapoint(DatapointIndex idx) final {
    return dot_mut_->RemoveDatapoint(idx);
  }
  Status UpdateDatapoint(const DatapointPtr<float>& dptr,
                         DatapointIndex idx) final {
    auto normalized = Normalize(dptr);
    return dot_mut_->UpdateDatapoint(normalized.ToPtr(), idx);
  }
  void Reserve(DatapointIndex num_datapoints) final {
    dot_mut_->Reserve(num_datapoints);
  }

 private:
  Datapoint<float> Normalize(const DatapointPtr<float>& dptr) {
    Datapoint<float> result;
    CopyToDatapoint(dptr, &result);
    NormalizeUnitL2(&result);
    return result;
  }

  ReorderingInterface<float>::Mutator* dot_mut_ = nullptr;
};

FixedPointFloatDenseCosineReorderingHelper::
    FixedPointFloatDenseCosineReorderingHelper(
        const DenseDataset<float>& exact_reordering_dataset,
        float fixed_point_multiplier_quantile, float noise_shaping_threshold,
        ThreadPool* pool)
    : dot_product_helper_(exact_reordering_dataset,
                          fixed_point_multiplier_quantile,
                          noise_shaping_threshold, pool) {
  DCHECK_EQ(exact_reordering_dataset.normalization(), UNITL2NORM);
}

FixedPointFloatDenseCosineReorderingHelper::
    FixedPointFloatDenseCosineReorderingHelper(
        shared_ptr<DenseDataset<int8_t>> fixed_point_dataset,
        absl::Span<const float> multiplier_by_dimension,
        float noise_shaping_threshold)
    : dot_product_helper_(std::move(fixed_point_dataset),
                          multiplier_by_dimension, noise_shaping_threshold) {}

FixedPointFloatDenseCosineReorderingHelper::
    ~FixedPointFloatDenseCosineReorderingHelper() = default;

Status
FixedPointFloatDenseCosineReorderingHelper::ComputeDistancesForReordering(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  one_to_many_low_level::SetCosineDistanceFunctor set_cosine_dist_functor(
      MakeMutableSpan(*result));
  return dot_product_helper_.ComputeDistancesForReordering(
      query, result, &set_cosine_dist_functor);
}

absl::StatusOr<std::pair<DatapointIndex, float>>
FixedPointFloatDenseCosineReorderingHelper::ComputeTop1ReorderingDistance(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  one_to_many_low_level::SetCosineTop1Functor set_cosine_top1_functor;
  SCANN_RETURN_IF_ERROR(dot_product_helper_.ComputeDistancesForReordering(
      query, result, &set_cosine_top1_functor));
  return set_cosine_top1_functor.Top1Pair(*result);
}

StatusOrPtr<SingleMachineSearcherBase<float>>
FixedPointFloatDenseCosineReorderingHelper::CreateBruteForceSearcher(
    int32_t num_neighbors, float epsilon) const {
  return ScalarQuantizedBruteForceSearcher::
      CreateFromQuantizedDatasetAndInverseMultipliers(
          std::make_unique<CosineDistance>(),
          dot_product_helper_.fixed_point_dataset_,
          dot_product_helper_.inverse_multipliers_, nullptr, num_neighbors,
          epsilon);
}

StatusOr<ReorderingInterface<float>::Mutator*>
FixedPointFloatDenseCosineReorderingHelper::GetMutator() const {
  if (!mutator_) {
    mutator_ = std::make_unique<Mutator>(
        const_cast<FixedPointFloatDenseCosineReorderingHelper*>(this));
  }
  return mutator_.get();
}

FixedPointFloatDenseSquaredL2ReorderingHelper::
    FixedPointFloatDenseSquaredL2ReorderingHelper(
        const DenseDataset<float>& exact_reordering_dataset,
        float fixed_point_multiplier_quantile)
    : dot_product_helper_(exact_reordering_dataset,
                          fixed_point_multiplier_quantile) {
  vector<float> database_squared_l2_norms;
  database_squared_l2_norms.reserve(exact_reordering_dataset.size());
  for (DatapointIndex i = 0; i < exact_reordering_dataset.size(); ++i) {
    database_squared_l2_norms.push_back(
        SquaredL2Norm(exact_reordering_dataset[i]));
  }
  database_squared_l2_norms_ =
      std::make_shared<vector<float>>(std::move(database_squared_l2_norms));
}

FixedPointFloatDenseSquaredL2ReorderingHelper::
    FixedPointFloatDenseSquaredL2ReorderingHelper(
        shared_ptr<DenseDataset<int8_t>> fixed_point_dataset,
        absl::Span<const float> multiplier_by_dimension,
        shared_ptr<const vector<float>> squared_l2_norm_by_datapoint)
    : dot_product_helper_(std::move(fixed_point_dataset),
                          multiplier_by_dimension),
      database_squared_l2_norms_(std::move(squared_l2_norm_by_datapoint)) {
  DCHECK_EQ(database_squared_l2_norms_->size(),
            dot_product_helper_.fixed_point_dataset_->size());
}

Status
FixedPointFloatDenseSquaredL2ReorderingHelper::ComputeDistancesForReordering(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  const float query_norm = SquaredL2Norm(query);
  one_to_many_low_level::SetSquaredL2DistanceFunctor set_sql2_dist(
      MakeMutableSpan(*result), *database_squared_l2_norms_, query_norm);
  return dot_product_helper_.ComputeDistancesForReordering(query, result,
                                                           &set_sql2_dist);
}

absl::StatusOr<std::pair<DatapointIndex, float>>
FixedPointFloatDenseSquaredL2ReorderingHelper::ComputeTop1ReorderingDistance(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  const float query_norm = SquaredL2Norm(query);
  one_to_many_low_level::SetSquaredL2Top1Functor set_sql2_top1(
      *result, *database_squared_l2_norms_, query_norm);
  SCANN_RETURN_IF_ERROR(dot_product_helper_.ComputeDistancesForReordering(
      query, result, &set_sql2_top1));
  return set_sql2_top1.Top1Pair();
}

StatusOrPtr<SingleMachineSearcherBase<float>>
FixedPointFloatDenseSquaredL2ReorderingHelper::CreateBruteForceSearcher(
    int32_t num_neighbors, float epsilon) const {
  return ScalarQuantizedBruteForceSearcher::
      CreateFromQuantizedDatasetAndInverseMultipliers(
          std::make_unique<SquaredL2Distance>(),
          dot_product_helper_.fixed_point_dataset_,
          dot_product_helper_.inverse_multipliers_,
          std::const_pointer_cast<vector<float>>(database_squared_l2_norms_),
          num_neighbors, epsilon);
}

FixedPointFloatDenseLimitedInnerReorderingHelper::
    FixedPointFloatDenseLimitedInnerReorderingHelper(
        const DenseDataset<float>& exact_reordering_dataset,
        float fixed_point_multiplier_quantile)
    : dot_product_helper_(exact_reordering_dataset,
                          fixed_point_multiplier_quantile) {
  vector<float> inverse_database_l2_norms;
  inverse_database_l2_norms.reserve(exact_reordering_dataset.size());
  for (DatapointIndex i = 0; i < exact_reordering_dataset.size(); ++i) {
    inverse_database_l2_norms.push_back(
        1.0 / std::sqrt(SquaredL2Norm(exact_reordering_dataset[i])));
  }
  inverse_database_l2_norms_ = std::move(inverse_database_l2_norms);
}

Status
FixedPointFloatDenseLimitedInnerReorderingHelper::ComputeDistancesForReordering(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  const float inverse_query_norm = 1.0 / std::sqrt(SquaredL2Norm(query));
  one_to_many_low_level::SetLimitedInnerDistanceFunctor set_limited_dist(
      MakeMutableSpan(*result), inverse_database_l2_norms_, inverse_query_norm);
  return dot_product_helper_.ComputeDistancesForReordering(query, result,
                                                           &set_limited_dist);
}

absl::StatusOr<std::pair<DatapointIndex, float>>
FixedPointFloatDenseLimitedInnerReorderingHelper::ComputeTop1ReorderingDistance(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  const float inverse_query_norm = 1.0 / std::sqrt(SquaredL2Norm(query));
  one_to_many_low_level::SetLimitedInnerTop1Functor top1_functor(
      *result, inverse_database_l2_norms_, inverse_query_norm);
  SCANN_RETURN_IF_ERROR(dot_product_helper_.ComputeDistancesForReordering(
      query, result, &top1_functor));
  return top1_functor.Top1Pair();
}

template <bool kIsDotProduct>
class Bfloat16ReorderingHelper<kIsDotProduct>::Mutator final
    : public ReorderingInterface<float>::Mutator {
 public:
  explicit Mutator(Bfloat16ReorderingHelper<kIsDotProduct>* helper)
      : helper_(helper),
        dataset_mutator_(helper_->bfloat16_dataset_->GetMutator().value()) {}

  StatusOr<DatapointIndex> AddDatapoint(const DatapointPtr<float>& dptr) final {
    vector<int16_t> storage(dptr.dimensionality());
    DatapointPtr<int16_t> quantized =
        std::isfinite(helper_->noise_shaping_threshold_)
            ? Bfloat16QuantizeFloatDatapointWithNoiseShaping(
                  dptr, helper_->noise_shaping_threshold_, &storage)
            : Bfloat16QuantizeFloatDatapoint(dptr, &storage);
    SCANN_RETURN_IF_ERROR(dataset_mutator_->AddDatapoint(quantized, ""));
    return helper_->bfloat16_dataset_->size() - 1;
  }
  StatusOr<DatapointIndex> RemoveDatapoint(DatapointIndex idx) final {
    SCANN_RETURN_IF_ERROR(dataset_mutator_->RemoveDatapoint(idx));
    return helper_->bfloat16_dataset_->size();
  }
  Status UpdateDatapoint(const DatapointPtr<float>& dptr,
                         DatapointIndex idx) final {
    vector<int16_t> storage(dptr.dimensionality());
    DatapointPtr<int16_t> quantized =
        std::isfinite(helper_->noise_shaping_threshold_)
            ? Bfloat16QuantizeFloatDatapointWithNoiseShaping(
                  dptr, helper_->noise_shaping_threshold_, &storage)
            : Bfloat16QuantizeFloatDatapoint(dptr, &storage);
    return dataset_mutator_->UpdateDatapoint(quantized, idx);
  }
  void Reserve(DatapointIndex num_datapoints) final {
    dataset_mutator_->Reserve(num_datapoints);
  }

 private:
  Bfloat16ReorderingHelper<kIsDotProduct>* helper_ = nullptr;
  TypedDataset<int16_t>::Mutator* dataset_mutator_;
};

template <bool kIsDotProduct>
Bfloat16ReorderingHelper<kIsDotProduct>::Bfloat16ReorderingHelper(
    const DenseDataset<float>& exact_reordering_dataset,
    float noise_shaping_threshold, ThreadPool* pool)
    : noise_shaping_threshold_(noise_shaping_threshold) {
  if (std::isfinite(noise_shaping_threshold)) {
    bfloat16_dataset_ = std::make_shared<DenseDataset<int16_t>>(
        Bfloat16QuantizeFloatDatasetWithNoiseShaping(
            exact_reordering_dataset, noise_shaping_threshold, pool));
  } else {
    bfloat16_dataset_ = std::make_shared<DenseDataset<int16_t>>(
        Bfloat16QuantizeFloatDataset(exact_reordering_dataset));
  }
}

template <bool kIsDotProduct>
Bfloat16ReorderingHelper<kIsDotProduct>::Bfloat16ReorderingHelper(
    shared_ptr<DenseDataset<int16_t>> bfloat16_dataset,
    float noise_shaping_threshold)
    : bfloat16_dataset_(bfloat16_dataset),
      noise_shaping_threshold_(noise_shaping_threshold) {}

template <bool kIsDotProduct>
Bfloat16ReorderingHelper<kIsDotProduct>::~Bfloat16ReorderingHelper() = default;

template <bool kIsDotProduct>
Status Bfloat16ReorderingHelper<kIsDotProduct>::ComputeDistancesForReordering(
    const DatapointPtr<float>& query, NNResultsVector* result) const {
  auto view = DefaultDenseDatasetView<int16_t>(*bfloat16_dataset_);
  if constexpr (kIsDotProduct) {
    DenseDotProductDistanceOneToManyBf16Float(query, view,
                                              MakeMutableSpan(*result));
  } else {
    OneToManyBf16FloatSquaredL2(query, view, MakeMutableSpan(*result));
  }
  return OkStatus();
}

template <bool kIsDotProduct>
StatusOrPtr<SingleMachineSearcherBase<float>>
Bfloat16ReorderingHelper<kIsDotProduct>::CreateBruteForceSearcher(
    int32_t num_neighbors, float epsilon) const {
  unique_ptr<const DistanceMeasure> distance;
  if constexpr (kIsDotProduct) {
    distance = std::make_unique<DotProductDistance>();
  } else {
    distance = std::make_unique<SquaredL2Distance>();
  }
  return std::make_unique<Bfloat16BruteForceSearcher>(
      std::move(distance), bfloat16_dataset_, num_neighbors, epsilon,
      noise_shaping_threshold_);
}

template <bool kIsDotProduct>
StatusOr<ReorderingInterface<float>::Mutator*>
Bfloat16ReorderingHelper<kIsDotProduct>::GetMutator() const {
  if (!mutator_) {
    mutator_ = std::make_unique<Mutator>(
        const_cast<Bfloat16ReorderingHelper<kIsDotProduct>*>(this));
  }
  return mutator_.get();
}

template <bool kIsDotProduct>
Status Bfloat16ReorderingHelper<kIsDotProduct>::Reconstruct(
    DatapointIndex i, MutableSpan<float> output) const {
  DatapointPtr<int16_t> db_dptr = bfloat16_dataset_->at(i);
  for (int j : Seq(db_dptr.dimensionality()))
    output[j] = Bfloat16Decompress(db_dptr.values()[j]);
  return OkStatus();
}

template <bool kIsDotProduct>
shared_ptr<const Dataset> Bfloat16ReorderingHelper<kIsDotProduct>::dataset()
    const {
  return bfloat16_dataset_;
}

template class Bfloat16ReorderingHelper<true>;
template class Bfloat16ReorderingHelper<false>;

SCANN_INSTANTIATE_TYPED_CLASS(, ExactReorderingHelper);

template <typename T>
StatusOrPtr<SingleMachineSearcherBase<T>>
ReorderingHelper<T>::CreateBruteForceSearcher(int32_t num_neighbors,
                                              float epsilon) const {
  return UnimplementedError(
      "CreateBruteForceSearcher not implemented for reordering helper of type "
      "%s",
      typeid(*this).name());
}

SCANN_INSTANTIATE_TYPED_CLASS(, ReorderingHelper);

}  // namespace research_scann