1 /******************************************************************************
2 * Copyright (c) 2018, Howard Butler (howard@hobu.co)
3 *
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following
8 * conditions are met:
9 *
10 * * Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * * Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in
14 * the documentation and/or other materials provided
15 * with the distribution.
16 * * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the
17 * names of its contributors may be used to endorse or promote
18 * products derived from this software without specific prior
19 * written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
28 * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
32 * OF SUCH DAMAGE.
33 ****************************************************************************/
34
35 #include <pdal/pdal_test_main.hpp>
36
37 #include <random>
38
39 #include <pdal/compression/ZstdCompression.hpp>
40
41 using namespace pdal;
42
TEST(Compression,zstd)43 TEST(Compression, zstd)
44 {
45 std::default_random_engine generator;
46 std::uniform_int_distribution<int> dist((std::numeric_limits<int>::min)());
47
48 // Choosing a size that isn't a multiple of the internal buffer.
49 // Trying to make something that compresses reasonably well.
50 std::vector<int> orig(1000357);
51 int val = dist(generator);
52 for (size_t i = 0; i < orig.size(); ++i)
53 {
54 orig[i] = val++;
55 if (i % 100 == 0)
56 val = dist(generator);
57 }
58
59 std::vector<char> compressed;
60 auto cb = [&compressed](char *buf, size_t bufsize)
61 {
62 static size_t total = 0;
63 compressed.insert(compressed.end(), buf, buf + bufsize);
64 total += bufsize;
65 };
66
67 size_t s = orig.size() * sizeof(int);
68 char *sp = reinterpret_cast<char *>(orig.data());
69 ZstdCompressor compressor(cb);
70 compressor.compress(sp, s);
71 compressor.done();
72
73 auto verifier = [&sp](char *buf, size_t bufsize)
74 {
75 EXPECT_EQ(memcmp(buf, sp, bufsize), 0);
76 sp += bufsize;
77 };
78
79 ZstdDecompressor decompressor(verifier);
80 decompressor.decompress(compressed.data(), compressed.size());
81 decompressor.done();
82 }
83
84