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
|
// $Id$
//
// (C) Copyright Mateusz Loskot 2008, mateusz@loskot.net
// Distributed under the BSD License
// (See accompanying file LICENSE.txt or copy at
// http://www.opensource.org/licenses/bsd-license.php)
//
#include <liblas/cstdint.hpp>
#include <liblas/iterator.hpp>
#include <liblas/laspoint.hpp>
#include <liblas/lasreader.hpp>
#include <liblas/detail/utility.hpp>
#include <tut/tut.hpp>
#include <algorithm>
#include <fstream>
#include <iterator>
#include <list>
#include "liblas_test.hpp"
#include "common.hpp"
using namespace liblas;
namespace tut
{
struct lasreader_iterator_data
{
std::string file10_;
std::ifstream ifs_;
LASReader reader_;
lasreader_iterator_data() :
file10_(g_test_data_path + "//TO_core_last_clip.las"),
ifs_(file10_.c_str(), std::ios::in | std::ios::binary),
reader_(ifs_)
{}
};
typedef test_group<lasreader_iterator_data> tg;
typedef tg::object to;
tg test_group_lasreader_iterator("liblas::lasreader_iterator");
// Test default constructor
template<>
template<>
void to::test<1>()
{
lasreader_iterator it;
}
// Test user-defined constructor
template<>
template<>
void to::test<2>()
{
lasreader_iterator it(reader_);
}
// Test copy constructor with default initialized iterator
template<>
template<>
void to::test<3>()
{
lasreader_iterator it1;
lasreader_iterator it2(it1);
ensure(it1 == it2);
}
// Test copy constructor with initialized iterator
template<>
template<>
void to::test<4>()
{
lasreader_iterator it1(reader_);
lasreader_iterator it2(it1);
ensure(it1 == it2);
}
// Test assignment operator with default initialized iterator
template<>
template<>
void to::test<5>()
{
lasreader_iterator it1;
lasreader_iterator it2;
it1 = it2;
ensure(it1 == it2);
}
// Test assignment operator with initialized iterator
template<>
template<>
void to::test<6>()
{
lasreader_iterator it1(reader_);
lasreader_iterator it2;
it1 = it2;
ensure(it1 == it2);
}
// Test dereference operator
template<>
template<>
void to::test<7>()
{
lasreader_iterator it(reader_);
test_file10_point1(*it);
}
// Test pointer-to-member operator
template<>
template<>
void to::test<8>()
{
lasreader_iterator it(reader_);
// test 1st point data record
ensure_distance(it->GetX(), double(630262.30), 0.0001);
ensure_distance(it->GetY(), double(4834500), 0.0001);
ensure_distance(it->GetZ(), double(51.53), 0.0001);
ensure_equals(it->GetIntensity(), 670);
ensure_equals(it->GetClassification(), liblas::uint8_t(1));
ensure_equals(it->GetScanAngleRank(), 0);
ensure_equals(it->GetUserData(), 3);
ensure_equals(it->GetScanFlags(), 9);
ensure_distance(it->GetTime(), double(413665.23360000004), 0.0001);
}
// Test pre-increment operator
template<>
template<>
void to::test<9>()
{
lasreader_iterator it(reader_); // move to 1st point
++it; // move to 2nd record
test_file10_point2(*it);
}
// Test post-increment operator
template<>
template<>
void to::test<10>()
{
lasreader_iterator it(reader_); // move to 1st point
it++; // move to 2nd record
test_file10_point2(*it);
}
// Test equal-to operator
template<>
template<>
void to::test<11>()
{
lasreader_iterator it(reader_); // move to 1st point
lasreader_iterator end;
ensure_not(end == it);
}
// Test not-equal-to operator
template<>
template<>
void to::test<12>()
{
lasreader_iterator it(reader_); // move to 1st point
lasreader_iterator end;
ensure(end != it);
}
// Test iteration
template<>
template<>
void to::test<13>()
{
liblas::uint32_t const cnt = reader_.GetHeader().GetPointRecordsCount();
lasreader_iterator it(reader_); // move to 1st point
lasreader_iterator end;
liblas::uint32_t s = 0;
while (end != it)
{
s++;
++it;
}
ensure_equals(cnt, s);
}
// Test std::distance operation
template<>
template<>
void to::test<14>()
{
liblas::uint32_t const cnt = reader_.GetHeader().GetPointRecordsCount();
lasreader_iterator it(reader_); // move to 1st point
lasreader_iterator end;
lasreader_iterator::difference_type const d = std::distance(it, end);
ensure_equals(d, cnt);
}
// Test std::distance operation
template<>
template<>
void to::test<15>()
{
std::size_t a = std::distance(lasreader_iterator(reader_), lasreader_iterator());
// Reader state is set to "past-the-end-of-file"
// So, reset is needed
reader_.Reset();
std::size_t b = std::distance(lasreader_iterator(reader_), lasreader_iterator());
ensure_equals(a, b);
}
// Test std::advance operation
template<>
template<>
void to::test<16>()
{
lasreader_iterator it(reader_); // move to 1st point
std::advance(it, 1); // move to 2nd record
test_file10_point2(*it);
std::advance(it, 2); // move to 4th record
test_file10_point4(*it);
}
// Test std::copy algorithm
template<>
template<>
void to::test<17>()
{
liblas::uint32_t const size = reader_.GetHeader().GetPointRecordsCount();
lasreader_iterator it(reader_);
lasreader_iterator end;
typedef std::list<LASPoint> list_t;
typedef std::back_insert_iterator<list_t> inserter_t;
list_t cache;
// Test copying LAS records to std::list based cache
std::copy(it, end, inserter_t(cache));
ensure_equals(cache.size(), size);
// Test copied data
list_t::const_iterator cit = cache.begin(); // 1st element
std::advance(cit, 1); // move to 2nd element in cache
test_file10_point2(*cit);
std::advance(cit, 2); // move to 4th element in cache
test_file10_point4(*cit);
}
// Test std::count algorithm
template<>
template<>
void to::test<18>()
{
// Construct copy of 2nd point record from tested file
LASPoint pt;
pt.SetCoordinates(630282.45, 4834500, 51.63);
pt.SetIntensity(350);
pt.SetClassification(1);
pt.SetScanAngleRank(0);
pt.SetUserData(3);
pt.SetScanFlags(9);
pt.SetTime(413665.52880000003);
ensure(pt.IsValid());
test_file10_point2(pt);
lasreader_iterator it(reader_);
lasreader_iterator end;
// Count records equal to given point object
lasreader_iterator::difference_type const expected = 1;
lasreader_iterator::difference_type n = std::count(it, end, pt);
ensure_equals(n, expected);
}
// Test std::equal algorithm
template<>
template<>
void to::test<19>()
{
std::ifstream ifs(file10_.c_str(), std::ios::in | std::ios::binary);
LASReader reader(ifs);
// Copy LAS records to std::list based cache
typedef std::list<LASPoint> list_t;
typedef std::back_insert_iterator<list_t> inserter_t;
list_t cache;
{
lasreader_iterator it(reader);
lasreader_iterator end;
ensure(it != end);
std::copy(it, end, inserter_t(cache));
ensure_equals(cache.size(), reader.GetHeader().GetPointRecordsCount());
}
// Reset reader to the beginning of LAS file
reader.Reset();
// Compare LAS file with cache
{
lasreader_iterator it(reader);
lasreader_iterator end;
ensure(it != end);
bool eq = std::equal(it, end, cache.begin());
ensure(eq);
}
}
// Test std::find algorithm
template<>
template<>
void to::test<20>()
{
// Construct copy of 2nd point record from tested file
LASPoint pt;
pt.SetCoordinates(630282.45, 4834500, 51.63);
pt.SetIntensity(350);
pt.SetClassification(1);
pt.SetScanAngleRank(0);
pt.SetUserData(3);
pt.SetScanFlags(9);
pt.SetTime(413665.52880000003);
ensure(pt.IsValid());
test_file10_point2(pt);
lasreader_iterator it(reader_);
lasreader_iterator end;
// find 2nd point data record
lasreader_iterator fit;
fit = std::find(it, end, pt);
ensure(fit != end);
test_file10_point2(*fit);
}
// Test std::find_if algorithm
template<>
template<>
void to::test<21>()
{
lasreader_iterator it(reader_);
lasreader_iterator end;
// find 2nd point data record comparing XY coordinates
lasreader_iterator fit;
fit = std::find_if(it, end, is_xy(630282.45, 4834500, 0.0001));
ensure(fit != end);
test_file10_point2(*fit);
}
// Test std::for_each algorithm
template<>
template<>
void to::test<22>()
{
lasreader_iterator it(reader_);
lasreader_iterator end;
typedef liblas::detail::Point<double> point_t;
typedef liblas::detail::Extents<double> bbox_t;
LASHeader const& h = reader_.GetHeader();
bbox_t lasbbox(point_t(h.GetMinX(), h.GetMinY(), h.GetMinZ()),
point_t(h.GetMaxX(), h.GetMaxY(), h.GetMaxZ()));
// Accumulate points extents to common bounding box
bbox_t bbox;
std::for_each(it, end, bbox_calculator(bbox));
ensure(lasbbox == bbox);
}
}
|