/usr/include/pdal/util/Uuid.hpp is in libpdal-dev 1.4.0-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /******************************************************************************
* Copyright (c) 2014, Hobu Inc., hobu@hobu.co
*
* 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. Consulting nor the
* names of its contributors may be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* Copyright (C) 1996, 1997 Theodore Ts'o.
*
* %Begin-Header%
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, and the entire permission notice in its entirety,
* including the disclaimer of warranties.
* 2. 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.
* 3. The name of the author may not be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ALL OF
* WHICH ARE HEREBY DISCLAIMED. IN NO EVENT SHALL THE AUTHOR 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 NOT ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
* %End-Header%
****************************************************************************/
// This is a C++ification of the libuuid code, less the code that actually
// creates UUIDs, which is most of it and we don't need at this time.
#pragma once
#include <cstdint>
#include <string>
#include "pdal_util_export.hpp"
#include "Inserter.hpp"
#include "Extractor.hpp"
#ifdef PDAL_COMPILER_MSVC
# pragma warning(push)
# pragma warning(disable: 4267 4244) // ignore conversion warnings
#endif
namespace pdal
{
#pragma pack(push)
#pragma pack(1)
struct uuid
{
uint32_t time_low;
uint16_t time_mid;
uint16_t time_hi_and_version;
uint16_t clock_seq;
uint8_t node[6];
};
#pragma pack(pop)
inline bool operator < (const uuid& u1, const uuid& u2)
{
if (u1.time_low != u2.time_low)
return u1.time_low < u2.time_low;
if (u1.time_mid != u2.time_mid)
return u1.time_mid < u2.time_mid;
if (u1.time_hi_and_version != u2.time_hi_and_version)
return u1.time_hi_and_version < u2.time_hi_and_version;
for (size_t i = 0; i < sizeof(u1.node); ++i)
if (u1.node[i] != u2.node[i])
return u1.node[i] < u2.node[i];
return false;
}
class PDAL_DLL Uuid
{
friend inline bool operator < (const Uuid& u1, const Uuid& u2);
public:
Uuid()
{ clear(); }
Uuid(const char *c)
{ unpack(c); }
Uuid(const std::string& s)
{ parse(s); }
void clear()
{ memset(&m_data, 0, sizeof(m_data)); }
void unpack(const char *c)
{
BeExtractor e(c, 10);
e >> m_data.time_low >> m_data.time_mid >>
m_data.time_hi_and_version >> m_data.clock_seq;
c += 10;
std::copy(c, c + 6, m_data.node);
}
void pack(char *c) const
{
BeInserter i(c, 10);
i << m_data.time_low << m_data.time_mid <<
m_data.time_hi_and_version << m_data.clock_seq;
c += 10;
std::copy(m_data.node, m_data.node + 6, c);
}
bool parse(const std::string& s)
{
if (s.length() != 36)
return false;
// Format validation.
const char *cp = s.data();
for (size_t i = 0; i < 36; i++) {
if ((i == 8) || (i == 13) || (i == 18) || (i == 23))
{
if (*cp != '-')
return false;
}
else if (!isxdigit(*cp))
return false;
++cp;
}
cp = s.data();
m_data.time_low = strtoul(cp, NULL, 16);
m_data.time_mid = (uint16_t)strtoul(cp + 9, NULL, 16);
m_data.time_hi_and_version = (uint16_t)strtoul(cp + 14, NULL, 16);
m_data.clock_seq = (uint16_t)strtoul(cp + 19, NULL, 16);
// Extract bytes as pairs of hex digits.
cp = s.data() + 24;
char buf[3];
buf[2] = 0;
for (size_t i = 0; i < 6; i++) {
buf[0] = *cp++;
buf[1] = *cp++;
m_data.node[i] = (uint8_t)strtoul(buf, NULL, 16);
}
return true;
}
std::string unparse() const
{
std::vector<char> buf(36 + 1);
const char fmt[] = "%08X-%04X-%04X-%02X%02X-%02X%02X%02X%02X%02X%02X";
// TODO: use snprintf after switch to C++11
sprintf(buf.data(), fmt,
m_data.time_low, m_data.time_mid, m_data.time_hi_and_version,
m_data.clock_seq >> 8, m_data.clock_seq & 0xFF,
m_data.node[0], m_data.node[1], m_data.node[2],
m_data.node[3], m_data.node[4], m_data.node[5]);
return std::string(buf.data());
}
std::string toString() const
{ return unparse(); }
bool empty() const
{ return isNull(); }
bool isNull() const
{
const char *c = (const char *)&m_data;
for (size_t i = 0; i < sizeof(m_data); ++i)
if (*c++ != 0)
return false;
return true;
}
/**
// Sadly, MS doesn't do constexpr.
static constexpr size_t size()
{ return sizeof(m_data); }
**/
static const int size = sizeof(uuid);
private:
uuid m_data;
};
inline bool operator == (const Uuid& u1, const Uuid& u2)
{
return !(u1 < u2) && !(u2 < u1);
}
inline bool operator < (const Uuid& u1, const Uuid& u2)
{
return u1.m_data < u2.m_data;
}
inline std::ostream& operator << (std::ostream& out, const Uuid& u)
{
out << u.toString();
return out;
}
inline std::istream& operator >> (std::istream& in, Uuid& u)
{
std::string s;
in >> s;
if (!u.parse(s))
in.setstate(std::ios::failbit);
return in;
}
} // namespace pdal
#ifdef PDAL_COMPILER_MSVC
# pragma warning(pop)
#endif
|