/
ZipPoint.hpp
93 lines (76 loc) · 3 KB
/
ZipPoint.hpp
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
/******************************************************************************
* Copyright (c) 2011, Michael P. Gerlek (mpg@flaxen.com)
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following
* conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided
* with the distribution.
* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the
* names of its contributors may be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
* OF SUCH DAMAGE.
****************************************************************************/
#pragma once
#ifdef PDAL_HAVE_LASZIP
#include <laszip/laszip.hpp>
#include <laszip/lasunzipper.hpp>
#include <laszip/laszipper.hpp>
#endif
#include <pdal/drivers/las/Header.hpp>
#include <boost/scoped_array.hpp>
#include <vector>
namespace pdal {
namespace drivers {
namespace las {
#ifdef PDAL_HAVE_LASZIP
class VariableLengthRecord;
class ZipPoint
{
public:
ZipPoint(PointFormat, const LasHeader& lasHeader, bool isReadMode);
~ZipPoint();
VariableLengthRecord ConstructVLR() const;
bool IsZipVLR(const VariableLengthRecord& vlr) const;
LASzip* GetZipper() const { return m_zip.get(); }
private:
void ConstructItems();
public: // for now
// LASzip::pack() allocates/sets vlr_data and vlr_num for us, and deletes it for us ["his"]
// LASzip::unpack() just reads from the vlr_data we give it (we allocate and delete) ["our"]
bool m_readMode;
int his_vlr_num;
unsigned char* his_vlr_data;
std::unique_ptr<LASzip> m_zip;
unsigned char** m_lz_point;
boost::scoped_array<boost::uint8_t> m_lz_point_data;
unsigned int m_lz_point_size;
};
#else // PDAL_HAVE_LASZIP
typedef void LASzipper;
typedef void LASunzipper;
typedef void ZipPoint;
#endif
} // namespace las
} // namespace drivers
} // namespace pdal