-
Notifications
You must be signed in to change notification settings - Fork 36
Expand file tree
/
Copy pathtest_field_encoders.cpp
More file actions
926 lines (799 loc) · 33.3 KB
/
Copy pathtest_field_encoders.cpp
File metadata and controls
926 lines (799 loc) · 33.3 KB
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
/*
* Copyright 2025 Davide Faconti
*
* 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 <gtest/gtest.h>
#include <algorithm>
#include <array>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <limits>
#include <random>
#include <stdexcept>
#include "cloudini_lib/cloudini.hpp"
#include "cloudini_lib/field_decoder.hpp"
#include "cloudini_lib/field_encoder.hpp"
TEST(FieldEncoders, IntField) {
const size_t kNumpoints = 100;
std::vector<uint32_t> input_data(kNumpoints);
std::vector<uint32_t> output_data(kNumpoints, 0);
const size_t kBufferSize = kNumpoints * sizeof(uint32_t);
// create a sequence of random numbers
std::generate(input_data.begin(), input_data.end(), []() { return std::rand() % 1000; });
using namespace Cloudini;
std::vector<uint8_t> buffer(kNumpoints * sizeof(uint32_t));
const int memory_offset = 0;
FieldEncoderInt<uint32_t> encoder(memory_offset);
FieldDecoderInt<uint32_t> decoder(memory_offset);
//------------- Encode -------------
{
ConstBufferView input_buffer(input_data.data(), kBufferSize);
BufferView buffer_data = {buffer.data(), buffer.size()};
size_t encoded_size = 0;
for (size_t i = 0; i < kNumpoints; ++i) {
encoded_size += encoder.encode(input_buffer, buffer_data);
input_buffer.trim_front(sizeof(uint32_t));
}
buffer.resize(encoded_size);
std::cout << "Original size: " << kBufferSize << " encoded size: " << encoded_size << std::endl;
}
//------------- Decode -------------
{
ConstBufferView buffer_data = {buffer.data(), buffer.size()};
BufferView output_buffer(output_data.data(), kBufferSize);
for (size_t i = 0; i < kNumpoints; ++i) {
decoder.decode(buffer_data, output_buffer);
ASSERT_EQ(input_data[i], output_data[i]) << "Mismatch at index " << i;
output_buffer.trim_front(sizeof(uint32_t));
}
}
}
TEST(FieldEncoders, FloatLossy) {
const size_t kNumpoints = 1000000;
const float kResolution = 0.01F;
std::vector<float> input_data(kNumpoints);
std::vector<float> output_data(kNumpoints, 0.0F);
const size_t kBufferSize = kNumpoints * sizeof(float);
// create a sequence of random numbers
std::generate(input_data.begin(), input_data.end(), []() { return 0.001 * static_cast<float>(std::rand() % 10000); });
const auto nan_value = std::numeric_limits<float>::quiet_NaN();
input_data[1] = nan_value;
input_data[15] = nan_value;
input_data[16] = nan_value;
using namespace Cloudini;
PointField field_info;
field_info.name = "the_float";
field_info.offset = 0;
field_info.type = FieldType::FLOAT32;
field_info.resolution = kResolution;
std::vector<uint8_t> buffer(kNumpoints * sizeof(float));
FieldEncoderFloat_Lossy encoder(0, kResolution);
FieldDecoderFloat_Lossy decoder(0, kResolution);
//------------- Encode -------------
{
ConstBufferView input_buffer(input_data.data(), kBufferSize);
BufferView buffer_data = {buffer.data(), buffer.size()};
size_t encoded_size = 0;
for (size_t i = 0; i < kNumpoints; ++i) {
encoded_size += encoder.encode(input_buffer, buffer_data);
input_buffer.trim_front(sizeof(float));
}
buffer.resize(encoded_size);
std::cout << "Original size: " << kBufferSize << " encoded size: " << encoded_size << std::endl;
}
//------------- Decode -------------
{
ConstBufferView buffer_data = {buffer.data(), buffer.size()};
BufferView output_buffer(output_data.data(), kBufferSize);
const float kTolerance = static_cast<float>(kResolution * 1.0001);
float max_difference = 0.0F;
for (size_t i = 0; i < kNumpoints; ++i) {
decoder.decode(buffer_data, output_buffer);
output_buffer.trim_front(sizeof(float));
auto diff = std::abs(input_data[i] - output_data[i]);
max_difference = std::max(max_difference, diff);
if (std::isnan(input_data[i])) {
ASSERT_TRUE(std::isnan(output_data[i])) << "Mismatch at index " << i;
continue;
}
ASSERT_NEAR(input_data[i], output_data[i], kTolerance) << "Mismatch at index " << i;
}
std::cout << "Max difference: " << max_difference << std::endl;
}
}
TEST(FieldEncoders, DecodeVarintRejectsTruncatedInputBeforeReadingPastBound) {
using namespace Cloudini;
const std::array<uint8_t, 2> bytes = {0x80u, 0x00u};
int64_t value = 0;
EXPECT_THROW(
{
// max_size intentionally exposes only the first continuation byte.
// A correct decoder must reject this without reading bytes[1].
(void)decodeVarint(bytes.data(), 1, value);
},
std::runtime_error);
}
namespace {
// Oracle: the pre-optimization, loop-only decodeVarint. Kept here verbatim so
// the optimized fast-path implementation can be differentially compared against
// it. Any divergence (value, byte count, or throw/no-throw) is a regression.
size_t decodeVarintOracle(const uint8_t* buf, size_t max_size, int64_t& val) {
if (max_size == 0) {
throw std::runtime_error("decodeVarint: empty input");
}
uint64_t uval = 0;
uint8_t shift = 0;
const uint8_t* ptr = buf;
while (true) {
if (static_cast<size_t>(ptr - buf) >= max_size) {
throw std::runtime_error("decodeVarint: truncated input");
}
uint8_t byte = *ptr;
ptr++;
const uint8_t payload = byte & 0x7f;
if (shift >= 64 || (shift == 63 && payload > 1)) {
throw std::runtime_error("decodeVarint: value overflow");
}
uval |= (static_cast<uint64_t>(payload) << shift);
if ((byte & 0x80) == 0) {
break;
}
if (shift >= 63) {
throw std::runtime_error("decodeVarint: value overflow");
}
shift = static_cast<uint8_t>(shift + 7);
}
if (uval == 0) {
throw std::runtime_error("decodeVarint: unexpected NaN marker");
}
uval--;
val = static_cast<int64_t>((uval >> 1) ^ static_cast<uint64_t>(-(static_cast<int64_t>(uval & 1))));
return static_cast<size_t>(ptr - buf);
}
// Compare the optimized decodeVarint against the oracle for one (buf, max_size)
// case: both must throw, or both must return identical (count, value).
void expectVarintMatchesOracle(const uint8_t* buf, size_t max_size) {
int64_t opt_val = 0;
size_t opt_count = 0;
bool opt_threw = false;
try {
opt_count = Cloudini::decodeVarint(buf, max_size, opt_val);
} catch (const std::exception&) {
opt_threw = true;
}
int64_t ref_val = 0;
size_t ref_count = 0;
bool ref_threw = false;
try {
ref_count = decodeVarintOracle(buf, max_size, ref_val);
} catch (const std::exception&) {
ref_threw = true;
}
ASSERT_EQ(opt_threw, ref_threw) << "throw mismatch at max_size=" << max_size;
if (!opt_threw) {
ASSERT_EQ(opt_count, ref_count) << "count mismatch at max_size=" << max_size;
ASSERT_EQ(opt_val, ref_val) << "value mismatch at max_size=" << max_size;
}
}
} // namespace
TEST(FieldEncoders, DecodeVarintMatchesOracleExhaustiveAndRandom) {
// Exhaustive over all 1- and 2-byte prefixes (the new fast paths and their
// boundary with the general path) with every truncation length in [0, len].
std::array<uint8_t, 16> buf{};
for (int b0 = 0; b0 < 256; ++b0) {
buf[0] = static_cast<uint8_t>(b0);
for (size_t ms = 0; ms <= 1; ++ms) {
expectVarintMatchesOracle(buf.data(), ms);
}
for (int b1 = 0; b1 < 256; ++b1) {
buf[1] = static_cast<uint8_t>(b1);
for (size_t ms = 0; ms <= 2; ++ms) {
expectVarintMatchesOracle(buf.data(), ms);
}
// 3-byte prefixes: sample b2 at the byte-value boundaries (the general
// path here is the original code verbatim, so full enumeration is
// unnecessary; the randomized sweep below covers the interior).
for (uint8_t b2 : {0x00u, 0x01u, 0x7eu, 0x7fu, 0x80u, 0x81u, 0xfeu, 0xffu}) {
buf[2] = b2;
expectVarintMatchesOracle(buf.data(), 3);
}
}
}
// Randomized sweep over the general (3+ byte) path and all truncation
// lengths, including malformed all-continuation and overflow-edge varints.
// The 1- and 2-byte fast paths are already proven exhaustively above and the
// 3+ byte path is the original code verbatim, so this sweep is supplementary
// coverage of the interior; 200k keeps the ASan/Debug ctest run fast.
std::mt19937_64 rng(0xC10D1217ULL);
for (int iter = 0; iter < 200'000; ++iter) {
const size_t len = 1 + (rng() % 12); // up to 12 bytes (varint64 worst case is 10)
for (size_t i = 0; i < len; ++i) {
// Bias toward continuation bytes so we exercise long/overflowing varints.
const uint32_t r = static_cast<uint32_t>(rng());
uint8_t byte = static_cast<uint8_t>(r);
if ((r >> 8) & 1) {
byte |= 0x80u; // force continuation ~50% of the time
}
buf[i] = byte;
}
const size_t max_size = rng() % (len + 1); // 0 .. len
expectVarintMatchesOracle(buf.data(), max_size);
}
}
namespace {
// Helper: round-trip a sequence of FloatType values through encoder/decoder,
// periodically flushing+resetting both at chunk boundaries to exercise the
// chunk-flush path (the classic bit-packer gotcha).
template <typename EncoderT, typename DecoderT, typename FloatType>
void runFieldRoundTrip(const std::vector<FloatType>& input, size_t chunk_points, size_t worst_case_bytes_per_value) {
using namespace Cloudini;
const size_t n = input.size();
std::vector<uint8_t> buffer(std::max<size_t>(n * worst_case_bytes_per_value + 16, 64));
BufferView buf_view(buffer.data(), buffer.size());
EncoderT encoder(0);
size_t encoded_bytes = 0;
size_t points_in_chunk = 0;
// Chunk boundaries: after every `chunk_points` we flush+reset the encoder,
// emulating what PointcloudEncoder does at chunk boundaries.
for (size_t i = 0; i < n; ++i) {
ConstBufferView point_view(reinterpret_cast<const uint8_t*>(&input[i]), sizeof(FloatType));
encoded_bytes += encoder.encode(point_view, buf_view);
points_in_chunk++;
if (points_in_chunk >= chunk_points || i + 1 == n) {
encoded_bytes += encoder.flush(buf_view);
encoder.reset();
points_in_chunk = 0;
}
}
// Decode
std::vector<FloatType> output(n, FloatType{0});
DecoderT decoder(0);
ConstBufferView enc_view(buffer.data(), encoded_bytes);
size_t chunk_remaining = 0;
size_t idx = 0;
while (idx < n) {
if (chunk_remaining == 0) {
chunk_remaining = std::min(chunk_points, n - idx);
decoder.reset();
}
BufferView point_view(reinterpret_cast<uint8_t*>(&output[idx]), sizeof(FloatType));
decoder.decode(enc_view, point_view);
idx++;
chunk_remaining--;
}
// Exact bit-for-bit equality for lossless
for (size_t i = 0; i < n; ++i) {
using IntT = std::conditional_t<std::is_same<FloatType, float>::value, uint32_t, uint64_t>;
IntT a_bits, b_bits;
std::memcpy(&a_bits, &input[i], sizeof(FloatType));
std::memcpy(&b_bits, &output[i], sizeof(FloatType));
ASSERT_EQ(a_bits, b_bits) << "Mismatch at index " << i << " input=" << input[i] << " output=" << output[i];
}
}
Cloudini::EncodingInfo makeV5IntOnlyInfo(
size_t points, Cloudini::FieldType type, Cloudini::CompressionOption compression) {
using namespace Cloudini;
EncodingInfo info;
info.version = 5;
info.width = static_cast<uint32_t>(points);
info.height = 1;
info.point_step = static_cast<uint32_t>(SizeOf(type));
info.encoding_opt = EncodingOptions::LOSSY;
info.compression_opt = compression;
info.use_threads = false;
info.fields.push_back({"value", 0, type, std::nullopt});
return info;
}
template <typename IntType>
std::vector<uint8_t> encodeV5IntOnly(
const std::vector<IntType>& values, Cloudini::FieldType type, Cloudini::CompressionOption compression) {
using namespace Cloudini;
const EncodingInfo info = makeV5IntOnlyInfo(values.size(), type, compression);
PointcloudEncoder encoder(info);
ConstBufferView in_view(reinterpret_cast<const uint8_t*>(values.data()), values.size() * sizeof(IntType));
std::vector<uint8_t> encoded;
encoder.encode(in_view, encoded);
return encoded;
}
template <typename IntType>
void expectV5IntOnlyRoundTrip(
const std::vector<IntType>& values, Cloudini::FieldType type, const std::vector<uint8_t>& encoded) {
using namespace Cloudini;
ConstBufferView encoded_view(encoded.data(), encoded.size());
const EncodingInfo decoded_info = DecodeHeader(encoded_view);
ASSERT_EQ(decoded_info.version, 5);
ASSERT_EQ(decoded_info.encoding_opt, EncodingOptions::LOSSY);
ASSERT_EQ(decoded_info.point_step, sizeof(IntType));
ASSERT_EQ(decoded_info.fields.size(), 1u);
ASSERT_EQ(decoded_info.fields[0].type, type);
std::vector<IntType> output(values.size(), 0);
PointcloudDecoder decoder;
BufferView out_view(reinterpret_cast<uint8_t*>(output.data()), output.size() * sizeof(IntType));
decoder.decode(decoded_info, encoded_view, out_view);
ASSERT_EQ(output, values);
}
std::vector<uint8_t> v5UncompressedChunkModes(const std::vector<uint8_t>& encoded) {
using namespace Cloudini;
ConstBufferView encoded_view(encoded.data(), encoded.size());
const EncodingInfo decoded_info = DecodeHeader(encoded_view);
if (decoded_info.version != 5 || decoded_info.compression_opt != CompressionOption::NONE) {
throw std::runtime_error("expected uncompressed V5 data");
}
std::vector<uint8_t> modes;
while (!encoded_view.empty()) {
if (encoded_view.size() < sizeof(uint32_t)) {
throw std::runtime_error("truncated V5 chunk size");
}
uint32_t chunk_size = 0;
std::memcpy(&chunk_size, encoded_view.data(), sizeof(chunk_size));
encoded_view.trim_front(sizeof(chunk_size));
if (chunk_size == 0 || chunk_size > encoded_view.size()) {
throw std::runtime_error("invalid V5 chunk size");
}
modes.push_back(encoded_view.data()[0]);
encoded_view.trim_front(chunk_size);
}
return modes;
}
template <typename IntType, typename Generator>
std::vector<IntType> makeIntSequence(size_t points, Generator generator) {
std::vector<IntType> values(points);
for (size_t i = 0; i < points; ++i) {
values[i] = static_cast<IntType>(generator(i));
}
return values;
}
} // namespace
TEST(FieldEncoders, FloatXOR_RoundTrip_Float32) {
// Multi-chunk test: ensures the chunk-boundary reset path is covered.
const size_t kChunkPoints = 32 * 1024; // must match Cloudini::detail::kPointsPerChunk
const size_t kNumpoints = kChunkPoints * 3 + 17; // cross chunk boundary several times
std::mt19937 rng(42);
std::uniform_real_distribution<float> dist(-1000.0f, 1000.0f);
std::vector<float> input(kNumpoints);
for (auto& v : input) {
v = dist(rng);
}
using namespace Cloudini;
runFieldRoundTrip<FieldEncoderFloat_XOR<float>, FieldDecoderFloat_XOR<float>, float>(
input, kChunkPoints, sizeof(float));
}
TEST(FieldEncoders, FloatXOR_RoundTrip_Float64) {
const size_t kChunkPoints = 32 * 1024;
const size_t kNumpoints = kChunkPoints * 2 + 99;
std::mt19937 rng(123);
std::uniform_real_distribution<double> dist(-1e6, 1e6);
std::vector<double> input(kNumpoints);
for (auto& v : input) {
v = dist(rng);
}
using namespace Cloudini;
runFieldRoundTrip<FieldEncoderFloat_XOR<double>, FieldDecoderFloat_XOR<double>, double>(
input, kChunkPoints, sizeof(double));
}
TEST(FieldEncoders, FloatGorilla_RoundTrip_Float32) {
const size_t kChunkPoints = 32 * 1024;
const size_t kNumpoints = kChunkPoints * 3 + 17;
std::mt19937 rng(7);
std::uniform_real_distribution<float> dist(-1000.0f, 1000.0f);
std::vector<float> input(kNumpoints);
for (auto& v : input) {
v = dist(rng);
}
// Also include some repeated values to exercise the "same as prev" 1-bit path.
for (size_t i = 100; i < 110; ++i) {
input[i] = 3.14159f;
}
// And values near chunk boundary
input[kChunkPoints - 1] = 1.0f;
input[kChunkPoints] = 1.0f;
input[kChunkPoints + 1] = 2.0f;
using namespace Cloudini;
runFieldRoundTrip<FieldEncoderFloat_Gorilla<float>, FieldDecoderFloat_Gorilla<float>, float>(input, kChunkPoints, 7);
}
TEST(FieldEncoders, FloatGorilla_RoundTrip_Float64) {
const size_t kChunkPoints = 32 * 1024;
const size_t kNumpoints = kChunkPoints * 2 + 123;
std::mt19937 rng(99);
std::uniform_real_distribution<double> dist(-1e6, 1e6);
std::vector<double> input(kNumpoints);
for (auto& v : input) {
v = dist(rng);
}
for (size_t i = 200; i < 220; ++i) {
input[i] = 2.718281828;
}
input[kChunkPoints - 1] = -0.5;
input[kChunkPoints] = -0.5;
using namespace Cloudini;
runFieldRoundTrip<FieldEncoderFloat_Gorilla<double>, FieldDecoderFloat_Gorilla<double>, double>(
input, kChunkPoints, 11);
}
TEST(FieldEncoders, FloatGorilla_EdgeCases_Float32) {
// Deterministic edge cases: first value, zero, repeats, big jump, near-zero.
std::vector<float> input = {
0.0f, // first value
0.0f, // same
0.0f, // same
1.0f, // big change
1.0000001f, // small change - tests window reuse
1.0f, // back
1e-20f, // tiny
1e20f, // huge
std::numeric_limits<float>::infinity(),
-std::numeric_limits<float>::infinity(),
};
using namespace Cloudini;
runFieldRoundTrip<FieldEncoderFloat_Gorilla<float>, FieldDecoderFloat_Gorilla<float>, float>(
input, /*chunk_points=*/input.size() + 1, 7);
}
// Full PointcloudEncoder/Decoder round-trip in LOSSLESS mode across multiple
// kPointsPerChunk-sized chunks; exercises the chunk-flush integration.
TEST(FieldEncoders, PointcloudLossless_Gorilla_MultiChunk) {
using namespace Cloudini;
struct PointXYZI {
float x = 0;
float y = 0;
float z = 0;
float i = 0;
};
const size_t kChunkPoints = 32 * 1024;
const size_t kNumpoints = kChunkPoints * 2 + 777; // multi-chunk
std::mt19937 rng(2025);
std::uniform_real_distribution<float> dist_pos(-500.0f, 500.0f);
std::uniform_real_distribution<float> dist_i(0.0f, 255.0f);
std::vector<PointXYZI> input(kNumpoints);
for (auto& p : input) {
p.x = dist_pos(rng);
p.y = dist_pos(rng);
p.z = dist_pos(rng);
p.i = dist_i(rng);
}
EncodingInfo info;
info.width = kNumpoints;
info.height = 1;
info.point_step = sizeof(PointXYZI);
info.encoding_opt = EncodingOptions::LOSSLESS;
info.compression_opt = CompressionOption::ZSTD;
info.fields.push_back({"x", 0, FieldType::FLOAT32, {}});
info.fields.push_back({"y", 4, FieldType::FLOAT32, {}});
info.fields.push_back({"z", 8, FieldType::FLOAT32, {}});
info.fields.push_back({"intensity", 12, FieldType::FLOAT32, {}});
std::vector<uint8_t> compressed;
{
PointcloudEncoder encoder(info);
ConstBufferView in_view(reinterpret_cast<const uint8_t*>(input.data()), input.size() * sizeof(PointXYZI));
encoder.encode(in_view, compressed);
}
ConstBufferView comp_view(compressed.data(), compressed.size());
auto decoded_info = DecodeHeader(comp_view);
ASSERT_EQ(decoded_info.version, kEncodingVersion);
ASSERT_EQ(decoded_info.encoding_opt, EncodingOptions::LOSSLESS);
std::vector<PointXYZI> output(kNumpoints);
{
PointcloudDecoder decoder;
BufferView out_view(reinterpret_cast<uint8_t*>(output.data()), output.size() * sizeof(PointXYZI));
decoder.decode(decoded_info, comp_view, out_view);
}
// Bit-exact equality for lossless.
for (size_t i = 0; i < kNumpoints; ++i) {
uint32_t a, b;
std::memcpy(&a, &input[i].x, 4);
std::memcpy(&b, &output[i].x, 4);
ASSERT_EQ(a, b) << "x at " << i;
std::memcpy(&a, &input[i].y, 4);
std::memcpy(&b, &output[i].y, 4);
ASSERT_EQ(a, b) << "y at " << i;
std::memcpy(&a, &input[i].z, 4);
std::memcpy(&b, &output[i].z, 4);
ASSERT_EQ(a, b) << "z at " << i;
std::memcpy(&a, &input[i].i, 4);
std::memcpy(&b, &output[i].i, 4);
ASSERT_EQ(a, b) << "intensity at " << i;
}
}
TEST(FieldEncoders, PointcloudV5_AdaptiveIntModes_RoundTripAndModeSelection) {
using namespace Cloudini;
constexpr size_t kPoints = 32 * 1024 + 19;
constexpr uint8_t kPaletteMode = 1;
constexpr uint8_t kRleMode = 2;
constexpr uint8_t kDeltaRleMode = 3;
{
const auto values = makeIntSequence<uint32_t>(kPoints, [](size_t i) { return 100000u + i * 3u; });
const std::vector<uint8_t> encoded_none =
encodeV5IntOnly(values, FieldType::UINT32, CompressionOption::NONE);
EXPECT_EQ(v5UncompressedChunkModes(encoded_none), std::vector<uint8_t>({kDeltaRleMode, kDeltaRleMode}));
expectV5IntOnlyRoundTrip(values, FieldType::UINT32, encoded_none);
const std::vector<uint8_t> encoded_zstd =
encodeV5IntOnly(values, FieldType::UINT32, CompressionOption::ZSTD);
expectV5IntOnlyRoundTrip(values, FieldType::UINT32, encoded_zstd);
}
{
const auto values = makeIntSequence<uint32_t>(kPoints, [](size_t i) { return static_cast<uint32_t>(i % 4); });
const std::vector<uint8_t> encoded_none =
encodeV5IntOnly(values, FieldType::UINT32, CompressionOption::NONE);
EXPECT_EQ(v5UncompressedChunkModes(encoded_none), std::vector<uint8_t>({kPaletteMode, kPaletteMode}));
expectV5IntOnlyRoundTrip(values, FieldType::UINT32, encoded_none);
const std::vector<uint8_t> encoded_zstd =
encodeV5IntOnly(values, FieldType::UINT32, CompressionOption::ZSTD);
expectV5IntOnlyRoundTrip(values, FieldType::UINT32, encoded_zstd);
}
{
const auto values = makeIntSequence<uint16_t>(kPoints, [](size_t i) { return static_cast<uint16_t>((i / 256) % 8); });
const std::vector<uint8_t> encoded_none =
encodeV5IntOnly(values, FieldType::UINT16, CompressionOption::NONE);
EXPECT_EQ(v5UncompressedChunkModes(encoded_none), std::vector<uint8_t>({kRleMode, kRleMode}));
expectV5IntOnlyRoundTrip(values, FieldType::UINT16, encoded_none);
const std::vector<uint8_t> encoded_zstd =
encodeV5IntOnly(values, FieldType::UINT16, CompressionOption::ZSTD);
expectV5IntOnlyRoundTrip(values, FieldType::UINT16, encoded_zstd);
}
{
std::vector<uint32_t> values(kPoints);
uint32_t value = 1000;
for (size_t i = 0; i < values.size(); ++i) {
const uint32_t diff = ((i / 64) % 2 == 0) ? 3u : 7u;
value += diff;
values[i] = value;
}
const std::vector<uint8_t> encoded_none =
encodeV5IntOnly(values, FieldType::UINT32, CompressionOption::NONE);
EXPECT_EQ(v5UncompressedChunkModes(encoded_none), std::vector<uint8_t>({kDeltaRleMode, kDeltaRleMode}));
expectV5IntOnlyRoundTrip(values, FieldType::UINT32, encoded_none);
}
{
const auto values = makeIntSequence<int32_t>(kPoints, [](size_t i) {
return 200000 - static_cast<int32_t>(i * 5);
});
const std::vector<uint8_t> encoded_none =
encodeV5IntOnly(values, FieldType::INT32, CompressionOption::NONE);
EXPECT_EQ(v5UncompressedChunkModes(encoded_none), std::vector<uint8_t>({kDeltaRleMode, kDeltaRleMode}));
expectV5IntOnlyRoundTrip(values, FieldType::INT32, encoded_none);
}
{
std::mt19937 rng(12345);
std::uniform_int_distribution<uint32_t> dist(0, 0xFFFFu);
std::vector<uint32_t> values(kPoints);
for (uint32_t& value : values) {
value = dist(rng);
}
const std::vector<uint8_t> encoded_none =
encodeV5IntOnly(values, FieldType::UINT32, CompressionOption::NONE);
const std::vector<uint8_t> modes = v5UncompressedChunkModes(encoded_none);
ASSERT_EQ(modes.size(), 2u);
for (uint8_t mode : modes) {
EXPECT_NE(mode, kDeltaRleMode);
}
expectV5IntOnlyRoundTrip(values, FieldType::UINT32, encoded_none);
}
}
TEST(FieldEncoders, PointcloudV5_AdaptiveProbeBoundaries_RoundTrip) {
using namespace Cloudini;
constexpr uint8_t kDeltaRleMode = 3;
const std::array<size_t, 5> point_counts = {4095, 4096, 4097, 32 * 1024, 32 * 1024 + 7};
for (size_t points : point_counts) {
const auto values = makeIntSequence<uint32_t>(points, [](size_t i) { return static_cast<uint32_t>(1000 + i * 3); });
const std::vector<uint8_t> encoded =
encodeV5IntOnly(values, FieldType::UINT32, CompressionOption::NONE);
const std::vector<uint8_t> modes = v5UncompressedChunkModes(encoded);
ASSERT_FALSE(modes.empty()) << "points=" << points;
for (uint8_t mode : modes) {
EXPECT_EQ(mode, kDeltaRleMode) << "points=" << points;
}
expectV5IntOnlyRoundTrip(values, FieldType::UINT32, encoded);
}
}
TEST(FieldEncoders, PointcloudV5_LossyFloatOnlyRoundTrip) {
using namespace Cloudini;
struct PointXYZI {
float x = 0.0F;
float y = 0.0F;
float z = 0.0F;
float intensity = 0.0F;
};
constexpr size_t kPoints = 4096 + 37;
std::vector<PointXYZI> input(kPoints);
for (size_t i = 0; i < input.size(); ++i) {
input[i].x = 0.001F * static_cast<float>(i);
input[i].y = -0.002F * static_cast<float>(i % 97);
input[i].z = 10.0F + 0.003F * static_cast<float>(i % 251);
input[i].intensity = 0.01F * static_cast<float>(i % 1024);
}
EncodingInfo info;
info.width = static_cast<uint32_t>(input.size());
info.height = 1;
info.point_step = sizeof(PointXYZI);
info.encoding_opt = EncodingOptions::LOSSY;
info.compression_opt = CompressionOption::NONE;
info.use_threads = false;
info.fields.push_back({"x", offsetof(PointXYZI, x), FieldType::FLOAT32, 0.001F});
info.fields.push_back({"y", offsetof(PointXYZI, y), FieldType::FLOAT32, 0.001F});
info.fields.push_back({"z", offsetof(PointXYZI, z), FieldType::FLOAT32, 0.001F});
info.fields.push_back({"intensity", offsetof(PointXYZI, intensity), FieldType::FLOAT32, 0.001F});
std::vector<uint8_t> encoded;
{
PointcloudEncoder encoder(info);
ConstBufferView in_view(reinterpret_cast<const uint8_t*>(input.data()), input.size() * sizeof(PointXYZI));
encoder.encode(in_view, encoded);
}
EncodingInfo v4_info = info;
v4_info.version = 4;
std::vector<uint8_t> encoded_v4;
{
PointcloudEncoder encoder(v4_info);
ConstBufferView in_view(reinterpret_cast<const uint8_t*>(input.data()), input.size() * sizeof(PointXYZI));
encoder.encode(in_view, encoded_v4);
}
ConstBufferView encoded_view(encoded.data(), encoded.size());
const EncodingInfo decoded_info = DecodeHeader(encoded_view);
ASSERT_EQ(decoded_info.version, kEncodingVersion);
ASSERT_EQ(decoded_info.encoding_opt, EncodingOptions::LOSSY);
ConstBufferView encoded_v4_view(encoded_v4.data(), encoded_v4.size());
const EncodingInfo decoded_v4_info = DecodeHeader(encoded_v4_view);
ASSERT_EQ(decoded_v4_info.version, 4);
ASSERT_EQ(encoded_view.size(), encoded_v4_view.size());
EXPECT_EQ(
std::vector<uint8_t>(encoded_view.data(), encoded_view.data() + encoded_view.size()),
std::vector<uint8_t>(encoded_v4_view.data(), encoded_v4_view.data() + encoded_v4_view.size()));
std::vector<PointXYZI> output(input.size());
{
PointcloudDecoder decoder;
BufferView out_view(reinterpret_cast<uint8_t*>(output.data()), output.size() * sizeof(PointXYZI));
decoder.decode(decoded_info, encoded_view, out_view);
}
constexpr float kTolerance = 0.0011F;
for (size_t i = 0; i < input.size(); ++i) {
ASSERT_NEAR(input[i].x, output[i].x, kTolerance) << "x @" << i;
ASSERT_NEAR(input[i].y, output[i].y, kTolerance) << "y @" << i;
ASSERT_NEAR(input[i].z, output[i].z, kTolerance) << "z @" << i;
ASSERT_NEAR(input[i].intensity, output[i].intensity, kTolerance) << "intensity @" << i;
}
}
TEST(FieldEncoders, PointcloudDecoderRejectsMissingChunksForDeclaredPoints) {
using namespace Cloudini;
EncodingInfo info;
info.version = 4;
info.width = 1;
info.height = 1;
info.point_step = sizeof(uint8_t);
info.encoding_opt = EncodingOptions::NONE;
info.compression_opt = CompressionOption::NONE;
info.use_threads = false;
info.fields.push_back({"value", 0, FieldType::UINT8, std::nullopt});
std::array<uint8_t, 1> output = {0};
std::vector<uint8_t> encoded;
ConstBufferView encoded_view(encoded.data(), encoded.size());
BufferView output_view(output.data(), output.size());
PointcloudDecoder decoder;
EXPECT_THROW(decoder.decode(info, encoded_view, output_view), std::runtime_error);
}
// TEST(FieldEncoders, XYZLossy) {
// const size_t kNumpoints = 1000000;
// const double kResolution = 0.01F;
// struct PointXYZ {
// float x = 0;
// float y = 0;
// float z = 0;
// };
// std::vector<PointXYZ> input_data(kNumpoints);
// std::vector<PointXYZ> output_data(kNumpoints);
// const size_t kBufferSize = kNumpoints * sizeof(PointXYZ);
// // create a sequence of random numbers
// std::generate(input_data.begin(), input_data.end(), []() -> PointXYZ {
// return {
// 0.001F * static_cast<float>(std::rand() % 10000), //
// 0.001F * static_cast<float>(std::rand() % 10000), //
// 0.001F * static_cast<float>(std::rand() % 10000)};
// });
// using namespace Cloudini;
// PointField field_info;
// field_info.name = "the_float";
// field_info.offset = 0;
// field_info.type = FieldType::FLOAT32;
// field_info.resolution = kResolution;
// std::vector<uint8_t> buffer(kNumpoints * sizeof(PointXYZ));
// FieldEncoderFloatN_Lossy encoder(sizeof(PointXYZ), kResolution);
// FieldDecoderXYZ_Lossy decoder(sizeof(PointXYZ), kResolution);
// //------------- Encode -------------
// {
// ConstBufferView input_buffer(input_data.data(), kBufferSize);
// BufferView buffer_data = {buffer.data(), buffer.size()};
// size_t encoded_size = 0;
// for (size_t i = 0; i < kNumpoints; ++i) {
// encoded_size += encoder.encode(input_buffer, buffer_data);
// }
// buffer.resize(encoded_size);
// std::cout << "Original size: " << kBufferSize << " encoded size: " << encoded_size << std::endl;
// }
// //------------- Decode -------------
// {
// ConstBufferView buffer_data = {buffer.data(), buffer.size()};
// BufferView output_buffer(output_data.data(), kBufferSize);
// const float kTolerance = static_cast<float>(kResolution * 1.0001);
// for (size_t i = 0; i < kNumpoints; ++i) {
// decoder.decode(buffer_data, output_buffer);
// ASSERT_NEAR(input_data[i].x, output_data[i].x, kTolerance) << "Mismatch at index " << i;
// ASSERT_NEAR(input_data[i].y, output_data[i].y, kTolerance) << "Mismatch at index " << i;
// ASSERT_NEAR(input_data[i].z, output_data[i].z, kTolerance) << "Mismatch at index " << i;
// }
// }
// }
// Regression guard for the Gorilla narrowing: when info.version = 3, a FLOAT64
// lossless field MUST go through FieldEncoderFloat_XOR (raw 8 bytes per value),
// not Gorilla. A v4 encode of the same data uses Gorilla and produces a
// different byte stream. This locks the dispatch narrowing in place.
TEST(FieldEncoders, Gorilla_DoesNotActivateForV3) {
using namespace Cloudini;
const size_t n = 1024;
std::vector<double> input(n);
// Monotonic-ish timestamps: Gorilla's best case (huge trailing-zero runs in XOR).
// If Gorilla were wrongly activated on v3, the v3 output would be much
// smaller than raw XOR bytes and would MATCH the v4 output.
for (size_t i = 0; i < n; ++i) {
input[i] = 1700000000.0 + 1e-6 * static_cast<double>(i);
}
auto make_info = [n](uint8_t version) {
EncodingInfo info;
info.version = version;
info.width = static_cast<uint32_t>(n);
info.height = 1;
info.point_step = sizeof(double);
info.encoding_opt = EncodingOptions::LOSSLESS;
info.compression_opt = CompressionOption::NONE; // inspect raw stage-1 bytes
info.use_threads = false;
info.fields.push_back({"v", 0, FieldType::FLOAT64, std::nullopt});
return info;
};
std::vector<uint8_t> out_v3, out_v4;
{
auto info3 = make_info(3);
PointcloudEncoder enc3(info3);
ConstBufferView in(reinterpret_cast<const uint8_t*>(input.data()), input.size() * sizeof(double));
enc3.encode(in, out_v3);
}
{
auto info4 = make_info(4);
PointcloudEncoder enc4(info4);
ConstBufferView in(reinterpret_cast<const uint8_t*>(input.data()), input.size() * sizeof(double));
enc4.encode(in, out_v4);
}
// v3 magic must start with CLOUDINI_V03; v4 with CLOUDINI_V04.
ASSERT_GE(out_v3.size(), 12u);
ASSERT_GE(out_v4.size(), 12u);
EXPECT_EQ(std::string(reinterpret_cast<const char*>(out_v3.data()), 12), "CLOUDINI_V03");
EXPECT_EQ(std::string(reinterpret_cast<const char*>(out_v4.data()), 12), "CLOUDINI_V04");
// The byte streams must differ: v3 uses raw 8-byte XOR residuals, v4 uses
// bit-packed Gorilla. For monotonic timestamps Gorilla is substantially
// smaller than XOR — so out_v4.size() must be STRICTLY less than out_v3.size().
EXPECT_LT(out_v4.size(), out_v3.size())
<< "Gorilla (v4) should compress monotonic FLOAT64 better than plain XOR (v3).";
// Both must still round-trip bit-exactly.
for (auto& blob : {std::cref(out_v3), std::cref(out_v4)}) {
ConstBufferView view(blob.get().data(), blob.get().size());
auto info_dec = DecodeHeader(view);
std::vector<double> output(n, 0.0);
PointcloudDecoder dec;
BufferView out_view(reinterpret_cast<uint8_t*>(output.data()), output.size() * sizeof(double));
dec.decode(info_dec, view, out_view);
for (size_t i = 0; i < n; ++i) {
uint64_t a, b;
std::memcpy(&a, &input[i], sizeof(double));
std::memcpy(&b, &output[i], sizeof(double));
ASSERT_EQ(a, b) << "Bit mismatch at " << i << " (version " << static_cast<int>(info_dec.version) << ")";
}
}
}