-
Notifications
You must be signed in to change notification settings - Fork 710
/
iterator.h
1738 lines (1414 loc) · 59.4 KB
/
iterator.h
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
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT license.
#pragma once
#include "seal/ciphertext.h"
#include "seal/plaintext.h"
#include "seal/util/common.h"
#include "seal/util/defines.h"
#include "seal/util/pointer.h"
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iterator>
#include <stdexcept>
#include <type_traits>
#include <utility>
#include <vector>
namespace seal
{
namespace util
{
/**
In this file we define a set of custom iterator classes ("SEAL iterators") that are used throughout Microsoft
SEAL for easier iteration over ciphertext polynomials, their RNS components, and the coefficients in the RNS
components. All SEAL iterators satisfy the C++ LegacyBidirectionalIterator requirements. Please note that they
are *not* random access iterators. The SEAL iterators are very helpful when used with std::for_each_n in C++17.
For C++14 compilers we have defined our own implementation of for_each_n below.
The SEAL iterator classes behave as illustrated by the following diagram:
+-------------------+
| Pointer & Size | Construct +-----------------+
| or Ciphertext +------------>+ (Const)PolyIter | Iterates over RNS polynomials in a ciphertext
+-------------------+ +-----------------+ (coeff_modulus_size-many RNS components)
|
|
| Dereference
|
|
v
+----------------+ Construct +----------------+
| Pointer & Size +------------->+ (Const)RNSIter | Iterates over RNS components in an RNS polynomial
+----------------+ +----------------+ (poly_modulus_degree-many coefficients)
|
|
| Dereference
|
|
v
+----------------+ Construct +------------------+
| Pointer & Size +------------>+ (Const)CoeffIter | Iterates over coefficients (std::uint64_t) in a single
+----------------+ +------------------+ RNS polynomial component
|
|
| Dereference
|
|
v
+------------------------+ Construct +---------------+
| (const) std::uint64_t* +------------>+ PtrIter<PtrT> | Simple wrapper
+------------------------+ +---------------+ for raw pointers
^ |
+---------+ Construct | |
| MyType* +-----------------------------------------+ | Dereference
+---------+ |
|
v
+------+
| PtrT | Unusual dereference to PtrT
+------+
In addition to the types above, we define a ReverseIter<SEALIter> that reverses the direction of iteration.
However, ReverseIter<SEALIter> dereferences to the same type as SEALIter: for example, dereferencing
ReverseIter<RNSIter> results in CoeffIter, not ReverseIter<CoeffIter>.
An extremely useful template class is the (variadic) IterTuple<...> that allows multiple SEAL iterators to be
zipped together. An IterTuple is itself a SEAL iterator and nested IterTuple types are used commonly in the
library. Dereferencing an IterTuple always yields another valid IterTuple, with each component dereferenced
individually. An IterTuple can in fact also hold raw pointers as its components, but such an IterTuple cannot
be dereferenced. Instead, the raw pointer must be first wrapped into a PtrIter object. Dereferencing a PtrIter
yields the wrapped raw pointer; hence, an IterTuple holding PtrIter objects can be dereferenced only once.
The individual components of an IterTuple can be accessed with the seal::util::get<i>(...) functions. The
behavior of IterTuple is summarized in the following diagram:
+-----------------------------------------+
| IterTuple<PolyIter, RNSIter, CoeffIter> |
+--------------------+--------------------+
|
|
| Dereference
|
|
v
+-----------------------------+--------------------------+
| IterTuple<RNSIter, CoeffIter, PtrIter<std::uint64_t*>> |
+------+----------------------+----------------------+---+
| | |
| | |
| get<0> | get<1> | get<2>
| | |
| | |
v v v
+------+------+ +-------+-------+ +-------------------------+
| RNSIter | | CoeffIter | | PtrIter<std::uint64_t*> |
+-------------+ +---------------+ +-------------------------+
As an example, the following snippet from Evaluator::negate_inplace iterates over the polynomials in an input
ciphertext, and for each polynomial iterates over the RNS components, and for each RNS component negates the
polynomial coefficients modulo a Modulus element corresponding to the RNS component:
for_each_n(PolyIter(encrypted), encrypted_size, [&](auto I) {
for_each_n(
IterTuple<RNSIter, PtrIter<const Modulus *>>(I, coeff_modulus), coeff_modulus_size,
[&](auto J) { negate_poly_coeffmod(get<0>(J), coeff_count, *get<1>(J), get<0>(J)); });
});
Here coeff_modulus is a std::vector<Modulus>, and PtrIter<const Modulus *> was constructed directly
from it. PtrIter provides a similar constructor from a seal::util::Pointer type. Note also how we had to
dereference get<1>(J) in the innermost lambda function to access the value (NTTTables). This is because
get<1>(J) is const NTTTables *, as was discussed above.
There are two important coding conventions in the above code snippet that are to be observed:
1. Always explicitly write the class template arguments. This is important for C++14 compatibility, and can
help avoid confusing bugs resulting from mistakes in iterator types in nested for_each_n calls.
2. Use I, J, K, ... for the lambda function parameters representing SEAL iterators. This is compact and
makes it very clear that the objects in question are SEAL iterators since such variable names should not
be used in SEAL in any other context.
3. Always pass SEAL iterators by value to the lambda function.
It is not unusual to have multiple nested for_each_n calls operating on multiple/nested IterTuple objects.
It can become very difficult to keep track of what exactly the different iterators are pointing to, and what
their types are (the above convention of using I, J, K, ... does not reveal the type). Hence we sometimes
annotate the code and check that the types match what we expect them to be using the SEAL_ASSERT_TYPE macro.
For example, the above code snippet would be annotated as follows:
for_each_n(PolyIter(encrypted), encrypted_size, [&](auto I) {
SEAL_ASSERT_TYPE(I, RNSIter, "encrypted");
for_each_n(
IterTuple<RNSIter, PtrIter<const Modulus *>>(I, coeff_modulus), coeff_modulus_size, [&](auto J) {
SEAL_ASSERT_TYPE(get<0>(J), CoeffIter, "encrypted");
SEAL_ASSERT_TYPE(get<1>(J), const Modulus *, "coeff_modulus");
negate_poly_coeffmod(get<0>(J), coeff_count, *get<1>(J), get<0>(J));
});
});
Note how SEAL_ASSERT_TYPE makes it explicit what type the different iterators are, and includes a string that
describes what object is iterated over. We use this convention in particularly complex functions to make the
code easier to follow and less error-prone. The code will fail to compile if the type of the object in the first
parameter does not match the type in the second parameter of the macro.
In the future we hope to use the parallel version of std::for_each_n, introduced in C++17. For this to work,
be mindful of how you use heap allocations in the lambda functions. Specifically, in heavy lambda functions it
is probably a good idea to call seal::util::allocate inside the lambda function for any allocations needed,
rather than using allocations captured from outside the lambda function.
*/
#ifndef SEAL_USE_STD_FOR_EACH_N
// C++14 does not have for_each_n so we define a custom version here.
template <typename ForwardIt, typename Size, typename Func>
ForwardIt for_each_n(ForwardIt first, Size size, Func func)
{
for (; size--; (void)++first)
{
func(*first);
}
return first;
}
#endif
class CoeffIter;
class ConstCoeffIter;
class RNSIter;
class ConstRNSIter;
class PolyIter;
class ConstPolyIter;
class CoeffIter
{
public:
friend class RNSIter;
friend class PolyIter;
using self_type = CoeffIter;
// Standard iterator typedefs
using value_type = std::uint64_t *;
using pointer = void;
using reference = const value_type &;
using iterator_category = std::random_access_iterator_tag;
using difference_type = std::ptrdiff_t;
CoeffIter() : ptr_(nullptr)
{}
CoeffIter(value_type ptr) : ptr_(ptr)
{}
CoeffIter(const self_type ©) = default;
self_type &operator=(const self_type &assign) = default;
CoeffIter(self_type &&source) = default;
self_type &operator=(self_type &&assign) = default;
SEAL_NODISCARD inline reference operator*() const noexcept
{
return ptr_;
}
template <typename SizeT>
SEAL_NODISCARD inline value_type operator[](SizeT n) const noexcept
{
return ptr_ + n;
}
inline self_type &operator++() noexcept
{
ptr_++;
return *this;
}
inline self_type operator++(int) noexcept
{
self_type result(ptr_);
ptr_++;
return result;
}
inline self_type &operator--() noexcept
{
ptr_--;
return *this;
}
inline self_type operator--(int) noexcept
{
self_type result(ptr_);
ptr_--;
return result;
}
template <typename SizeT>
inline self_type &operator+=(SizeT n) noexcept
{
ptr_ += n;
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator+(SizeT n) const noexcept
{
return ptr_ + n;
}
template <typename SizeT>
inline self_type &operator-=(SizeT n) noexcept
{
ptr_ -= n;
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator-(SizeT n) const noexcept
{
return ptr_ - n;
}
SEAL_NODISCARD inline difference_type operator-(const self_type &b) const noexcept
{
return ptr_ - b.ptr_;
}
SEAL_NODISCARD inline bool operator==(const self_type &compare) const noexcept
{
return ptr_ == compare.ptr_;
}
SEAL_NODISCARD inline bool operator!=(const self_type &compare) const noexcept
{
return !(*this == compare);
}
SEAL_NODISCARD inline bool operator<(const self_type &compare) const noexcept
{
return ptr_ < compare.ptr_;
}
SEAL_NODISCARD inline bool operator>(const self_type &compare) const noexcept
{
return ptr_ > compare.ptr_;
}
SEAL_NODISCARD inline bool operator<=(const self_type &compare) const noexcept
{
return !(ptr_ > compare.ptr_);
}
SEAL_NODISCARD inline bool operator>=(const self_type &compare) const noexcept
{
return !(ptr_ < compare.ptr_);
}
SEAL_NODISCARD inline operator std::uint64_t *() const noexcept
{
return ptr_;
}
SEAL_NODISCARD explicit inline operator bool() const noexcept
{
return nullptr != ptr_;
}
private:
value_type ptr_;
};
// Out-of-class definitions
template <typename SizeT>
SEAL_NODISCARD inline CoeffIter operator+(SizeT n, const CoeffIter &it) noexcept
{
return it + n;
}
class ConstCoeffIter
{
public:
friend class ConstRNSIter;
friend class ConstPolyIter;
using self_type = ConstCoeffIter;
// Standard iterator typedefs
using value_type = const std::uint64_t *;
using pointer = void;
using reference = const value_type &;
using iterator_category = std::random_access_iterator_tag;
using difference_type = std::ptrdiff_t;
ConstCoeffIter() : ptr_(nullptr)
{}
ConstCoeffIter(value_type ptr) : ptr_(ptr)
{}
ConstCoeffIter(const self_type ©) = default;
self_type &operator=(const self_type &assign) = default;
ConstCoeffIter(self_type &&source) = default;
self_type &operator=(self_type &&assign) = default;
ConstCoeffIter(const CoeffIter ©) : ptr_(static_cast<const std::uint64_t *>(copy))
{}
SEAL_NODISCARD inline reference operator*() const noexcept
{
return ptr_;
}
template <typename SizeT>
SEAL_NODISCARD inline value_type operator[](SizeT n) const noexcept
{
return ptr_ + n;
}
inline self_type &operator++() noexcept
{
ptr_++;
return *this;
}
inline self_type operator++(int) noexcept
{
self_type result(ptr_);
ptr_++;
return result;
}
inline self_type &operator--() noexcept
{
ptr_--;
return *this;
}
inline self_type operator--(int) noexcept
{
self_type result(ptr_);
ptr_--;
return result;
}
template <typename SizeT>
inline self_type &operator+=(SizeT n) noexcept
{
ptr_ += n;
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator+(SizeT n) const noexcept
{
return ptr_ + n;
}
template <typename SizeT>
inline self_type &operator-=(SizeT n) noexcept
{
ptr_ -= n;
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator-(SizeT n) const noexcept
{
return ptr_ - n;
}
SEAL_NODISCARD inline difference_type operator-(const self_type &b) const noexcept
{
return ptr_ - b.ptr_;
}
SEAL_NODISCARD inline bool operator==(const self_type &compare) const noexcept
{
return ptr_ == compare.ptr_;
}
SEAL_NODISCARD inline bool operator!=(const self_type &compare) const noexcept
{
return !(*this == compare);
}
SEAL_NODISCARD inline bool operator<(const self_type &compare) const noexcept
{
return ptr_ < compare.ptr_;
}
SEAL_NODISCARD inline bool operator>(const self_type &compare) const noexcept
{
return ptr_ > compare.ptr_;
}
SEAL_NODISCARD inline bool operator<=(const self_type &compare) const noexcept
{
return !(ptr_ > compare.ptr_);
}
SEAL_NODISCARD inline bool operator>=(const self_type &compare) const noexcept
{
return !(ptr_ < compare.ptr_);
}
SEAL_NODISCARD inline operator const std::uint64_t *() const noexcept
{
return ptr_;
}
SEAL_NODISCARD explicit inline operator bool() const noexcept
{
return nullptr != ptr_;
}
private:
value_type ptr_;
};
// Out-of-class definitions
template <typename SizeT>
SEAL_NODISCARD inline ConstCoeffIter operator+(SizeT n, const ConstCoeffIter &it) noexcept
{
return it + n;
}
class RNSIter
{
public:
friend class PolyIter;
using self_type = RNSIter;
// Standard iterator typedefs
using value_type = CoeffIter;
using pointer = void;
using reference = const value_type &;
using iterator_category = std::random_access_iterator_tag;
using difference_type = std::ptrdiff_t;
RNSIter() : coeff_it_(nullptr), step_size_(0)
{}
RNSIter(std::uint64_t *ptr, std::size_t poly_modulus_degree)
: coeff_it_(ptr), step_size_(poly_modulus_degree)
{}
RNSIter(const self_type ©) = default;
self_type &operator=(const self_type &assign) = default;
RNSIter(self_type &&source) = default;
self_type &operator=(self_type &&assign) = default;
SEAL_NODISCARD inline reference operator*() const noexcept
{
return coeff_it_;
}
template <typename SizeT>
SEAL_NODISCARD inline value_type operator[](SizeT n) const noexcept
{
self_type result(*this);
result += static_cast<difference_type>(n);
return *result;
}
inline self_type &operator++() noexcept
{
coeff_it_ += static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
inline self_type operator++(int) noexcept
{
self_type result(*this);
coeff_it_ += static_cast<std::ptrdiff_t>(step_size_);
return result;
}
inline self_type &operator--() noexcept
{
coeff_it_ -= static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
inline self_type operator--(int) noexcept
{
self_type result(*this);
coeff_it_ -= static_cast<std::ptrdiff_t>(step_size_);
return result;
}
template <typename SizeT>
inline self_type &operator+=(SizeT n) noexcept
{
coeff_it_ += n * static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator+(SizeT n) const noexcept
{
self_type result(*this);
result.coeff_it_ += static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return result;
}
template <typename SizeT>
inline self_type &operator-=(SizeT n) noexcept
{
coeff_it_ -= static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator-(SizeT n) const noexcept
{
return *this + (-static_cast<difference_type>(n));
}
SEAL_NODISCARD inline difference_type operator-(const self_type &b) const
{
#ifdef SEAL_DEBUG
if (!step_size_)
{
throw std::logic_error("step_size cannot be zero");
}
if (step_size_ != b.step_size_)
{
throw std::invalid_argument("incompatible iterators");
}
#endif
return (coeff_it_ - b.coeff_it_) / static_cast<std::ptrdiff_t>(step_size_);
}
SEAL_NODISCARD inline bool operator==(const self_type &compare) const noexcept
{
return coeff_it_ == compare.coeff_it_;
}
SEAL_NODISCARD inline bool operator!=(const self_type &compare) const noexcept
{
return !(*this == compare);
}
SEAL_NODISCARD inline bool operator<(const self_type &compare) const noexcept
{
return coeff_it_ < compare.coeff_it_;
}
SEAL_NODISCARD inline bool operator>(const self_type &compare) const noexcept
{
return coeff_it_ > compare.coeff_it_;
}
SEAL_NODISCARD inline bool operator<=(const self_type &compare) const noexcept
{
return !(coeff_it_ > compare.coeff_it_);
}
SEAL_NODISCARD inline bool operator>=(const self_type &compare) const noexcept
{
return !(coeff_it_ < compare.coeff_it_);
}
SEAL_NODISCARD inline operator std::uint64_t *() const noexcept
{
return static_cast<std::uint64_t *>(coeff_it_);
}
SEAL_NODISCARD explicit inline operator bool() const noexcept
{
return static_cast<bool>(coeff_it_);
}
SEAL_NODISCARD inline value_type operator->() const noexcept
{
return **this;
}
SEAL_NODISCARD inline std::size_t poly_modulus_degree() const noexcept
{
return step_size_;
}
private:
CoeffIter coeff_it_;
std::size_t step_size_;
};
// Out-of-class definitions
template <typename SizeT>
SEAL_NODISCARD inline RNSIter operator+(SizeT n, RNSIter it) noexcept
{
return it + n;
}
class ConstRNSIter
{
public:
friend class ConstPolyIter;
using self_type = ConstRNSIter;
// Standard iterator typedefs
using value_type = ConstCoeffIter;
using pointer = void;
using reference = const value_type &;
using iterator_category = std::bidirectional_iterator_tag;
using difference_type = std::ptrdiff_t;
ConstRNSIter() : coeff_it_(nullptr), step_size_(0)
{}
ConstRNSIter(const std::uint64_t *ptr, std::size_t poly_modulus_degree)
: coeff_it_(ptr), step_size_(poly_modulus_degree)
{}
ConstRNSIter(const self_type ©) = default;
self_type &operator=(const self_type &assign) = default;
ConstRNSIter(self_type &&source) = default;
self_type &operator=(self_type &&assign) = default;
ConstRNSIter(const RNSIter ©)
: coeff_it_(static_cast<const std::uint64_t *>(copy)), step_size_(copy.poly_modulus_degree())
{}
SEAL_NODISCARD inline reference operator*() const noexcept
{
return coeff_it_;
}
template <typename SizeT>
SEAL_NODISCARD inline value_type operator[](SizeT n) const noexcept
{
self_type result(*this);
result += static_cast<difference_type>(n);
return *result;
}
inline self_type &operator++() noexcept
{
coeff_it_ += static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
inline self_type operator++(int) noexcept
{
self_type result(*this);
coeff_it_ += static_cast<std::ptrdiff_t>(step_size_);
return result;
}
inline self_type &operator--() noexcept
{
coeff_it_ -= static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
inline self_type operator--(int) noexcept
{
self_type result(*this);
coeff_it_ -= static_cast<std::ptrdiff_t>(step_size_);
return result;
}
template <typename SizeT>
inline self_type &operator+=(SizeT n) noexcept
{
coeff_it_ += static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator+(SizeT n) const noexcept
{
self_type result(*this);
result.coeff_it_ += static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return result;
}
template <typename SizeT>
inline self_type &operator-=(SizeT n) noexcept
{
coeff_it_ -= static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator-(SizeT n) const noexcept
{
return *this + (-static_cast<difference_type>(n));
}
SEAL_NODISCARD inline difference_type operator-(const self_type &b) const
{
#ifdef SEAL_DEBUG
if (!step_size_)
{
throw std::logic_error("step_size cannot be zero");
}
if (step_size_ != b.step_size_)
{
throw std::invalid_argument("incompatible iterators");
}
#endif
return (coeff_it_ - b.coeff_it_) / static_cast<std::ptrdiff_t>(step_size_);
}
SEAL_NODISCARD inline bool operator==(const self_type &compare) const noexcept
{
return coeff_it_ == compare.coeff_it_;
}
SEAL_NODISCARD inline bool operator!=(const self_type &compare) const noexcept
{
return !(*this == compare);
}
SEAL_NODISCARD inline bool operator<(const self_type &compare) const noexcept
{
return coeff_it_ < compare.coeff_it_;
}
SEAL_NODISCARD inline bool operator>(const self_type &compare) const noexcept
{
return coeff_it_ > compare.coeff_it_;
}
SEAL_NODISCARD inline bool operator<=(const self_type &compare) const noexcept
{
return !(coeff_it_ > compare.coeff_it_);
}
SEAL_NODISCARD inline bool operator>=(const self_type &compare) const noexcept
{
return !(coeff_it_ < compare.coeff_it_);
}
SEAL_NODISCARD inline operator const std::uint64_t *() const noexcept
{
return static_cast<const std::uint64_t *>(coeff_it_);
}
SEAL_NODISCARD explicit inline operator bool() const noexcept
{
return static_cast<bool>(coeff_it_);
}
SEAL_NODISCARD inline value_type operator->() const noexcept
{
return **this;
}
SEAL_NODISCARD inline std::size_t poly_modulus_degree() const noexcept
{
return step_size_;
}
private:
ConstCoeffIter coeff_it_;
std::size_t step_size_;
};
// Out-of-class definitions
template <typename SizeT>
SEAL_NODISCARD inline ConstRNSIter operator+(SizeT n, ConstRNSIter it) noexcept
{
return it + n;
}
class PolyIter
{
public:
using self_type = PolyIter;
// Standard iterator typedefs
using value_type = RNSIter;
using pointer = void;
using reference = const value_type &;
using iterator_category = std::random_access_iterator_tag;
using difference_type = std::ptrdiff_t;
PolyIter() : rns_it_(nullptr, 0), coeff_modulus_size_(0), step_size_(0)
{}
PolyIter(std::uint64_t *ptr, std::size_t poly_modulus_degree, std::size_t coeff_modulus_size)
: rns_it_(ptr, poly_modulus_degree), coeff_modulus_size_(coeff_modulus_size),
step_size_(mul_safe(poly_modulus_degree, coeff_modulus_size_))
{}
PolyIter(Ciphertext &ct) : self_type(ct.data(), ct.poly_modulus_degree(), ct.coeff_modulus_size())
{}
PolyIter(const self_type ©) = default;
self_type &operator=(const self_type &assign) = default;
PolyIter(self_type &&source) = default;
self_type &operator=(self_type &&assign) = default;
SEAL_NODISCARD inline reference operator*() const noexcept
{
return rns_it_;
}
template <typename SizeT>
SEAL_NODISCARD inline value_type operator[](SizeT n) const noexcept
{
self_type result(*this);
result += static_cast<difference_type>(n);
return *result;
}
inline self_type &operator++() noexcept
{
rns_it_.coeff_it_.ptr_ += step_size_;
return *this;
}
inline self_type operator++(int) noexcept
{
self_type result(*this);
rns_it_.coeff_it_.ptr_ += step_size_;
return result;
}
inline self_type &operator--() noexcept
{
rns_it_.coeff_it_.ptr_ -= step_size_;
return *this;
}
inline self_type operator--(int) noexcept
{
self_type result(*this);
rns_it_.coeff_it_.ptr_ -= step_size_;
return result;
}
template <typename SizeT>
inline self_type &operator+=(SizeT n) noexcept
{
rns_it_.coeff_it_ += static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator+(SizeT n) const noexcept
{
self_type result(*this);
result.rns_it_.coeff_it_ += static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return result;
}
template <typename SizeT>
inline self_type &operator-=(SizeT n) noexcept
{
rns_it_.coeff_it_ -= static_cast<difference_type>(n) * static_cast<std::ptrdiff_t>(step_size_);
return *this;
}
template <typename SizeT>
SEAL_NODISCARD inline self_type operator-(SizeT n) const noexcept
{
return *this + (-static_cast<difference_type>(n));
}
SEAL_NODISCARD inline difference_type operator-(const self_type &b) const
{
#ifdef SEAL_DEBUG
if (!step_size_)
{
throw std::logic_error("step_size cannot be zero");
}
if (step_size_ != b.step_size_)
{
throw std::invalid_argument("incompatible iterators");
}
if (coeff_modulus_size_ != b.coeff_modulus_size_)
{
throw std::invalid_argument("incompatible iterators");
}
#endif
return (rns_it_.coeff_it_ - b.rns_it_.coeff_it_) / static_cast<std::ptrdiff_t>(step_size_);
}
SEAL_NODISCARD inline bool operator==(const self_type &compare) const noexcept
{
return rns_it_ == compare.rns_it_;
}
SEAL_NODISCARD inline bool operator!=(const self_type &compare) const noexcept
{
return !(*this == compare);
}
SEAL_NODISCARD inline bool operator<(const self_type &compare) const noexcept
{
return rns_it_ < compare.rns_it_;
}
SEAL_NODISCARD inline bool operator>(const self_type &compare) const noexcept
{
return rns_it_ > compare.rns_it_;
}
SEAL_NODISCARD inline bool operator<=(const self_type &compare) const noexcept
{
return !(rns_it_ > compare.rns_it_);
}
SEAL_NODISCARD inline bool operator>=(const self_type &compare) const noexcept
{
return !(rns_it_ < compare.rns_it_);
}
SEAL_NODISCARD inline operator std::uint64_t *() const noexcept
{
return rns_it_;
}
SEAL_NODISCARD explicit inline operator bool() const noexcept
{
return static_cast<bool>(rns_it_);
}
SEAL_NODISCARD inline value_type operator->() const noexcept
{
return **this;
}
SEAL_NODISCARD inline std::size_t poly_modulus_degree() const noexcept
{
return rns_it_.step_size_;
}