mapnik/plugins/input/shape/shp_index.hpp

104 lines
3 KiB
C++
Raw Normal View History

2006-03-31 12:32:02 +02:00
/*****************************************************************************
*
* This file is part of Mapnik (c++ mapping toolkit)
2005-06-14 17:06:59 +02:00
*
* Copyright (C) 2011 Artem Pavlenko
2005-06-14 17:06:59 +02:00
*
2006-03-31 12:32:02 +02:00
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
2005-06-14 17:06:59 +02:00
* but WITHOUT ANY WARRANTY; without even the implied warranty of
2006-03-31 12:32:02 +02:00
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
2005-06-14 17:06:59 +02:00
*
2006-03-31 12:32:02 +02:00
*****************************************************************************/
2005-06-14 17:06:59 +02:00
#ifndef SHP_INDEX_HH
#define SHP_INDEX_HH
// stl
2005-06-14 17:06:59 +02:00
#include <fstream>
#include <vector>
// mapnik
2009-12-16 21:02:06 +01:00
#include <mapnik/box2d.hpp>
#include <mapnik/query.hpp>
2005-06-14 17:06:59 +02:00
2009-12-16 21:02:06 +01:00
using mapnik::box2d;
using mapnik::query;
2005-06-14 17:06:59 +02:00
template <typename filterT, typename IStream = std::ifstream>
2005-06-14 17:06:59 +02:00
class shp_index
{
public:
static void query(const filterT& filter, IStream& file,std::vector<int>& pos);
2005-06-14 17:06:59 +02:00
private:
shp_index();
~shp_index();
shp_index(const shp_index&);
shp_index& operator=(const shp_index&);
static int read_ndr_integer(IStream& in);
static void read_envelope(IStream& in, box2d<double>& envelope);
static void query_node(const filterT& filter, IStream& in, std::vector<int>& pos);
2005-06-14 17:06:59 +02:00
};
template <typename filterT, typename IStream>
void shp_index<filterT, IStream>::query(const filterT& filter, IStream& file, std::vector<int>& pos)
{
file.seekg(16, std::ios::beg);
query_node(filter, file, pos);
}
template <typename filterT, typename IStream>
void shp_index<filterT, IStream>::query_node(const filterT& filter, IStream& file, std::vector<int>& ids)
{
int offset = read_ndr_integer(file);
2009-12-16 21:02:06 +01:00
box2d<double> node_ext;
read_envelope(file, node_ext);
int num_shapes = read_ndr_integer(file);
if (! filter.pass(node_ext))
{
file.seekg(offset + num_shapes * 4 + 4, std::ios::cur);
return;
}
for (int i = 0; i < num_shapes; ++i)
{
int id = read_ndr_integer(file);
ids.push_back(id);
}
int children = read_ndr_integer(file);
for (int j = 0; j < children; ++j)
{
query_node(filter, file, ids);
}
}
template <typename filterT, typename IStream>
int shp_index<filterT, IStream>::read_ndr_integer(IStream& file)
{
char b[4];
file.read(b, 4);
return (b[0] & 0xff) | (b[1] & 0xff) << 8 | (b[2] & 0xff) << 16 | (b[3] & 0xff) << 24;
}
template <typename filterT, typename IStream>
void shp_index<filterT, IStream>::read_envelope(IStream& file, box2d<double>& envelope)
{
file.read(reinterpret_cast<char*>(&envelope), sizeof(envelope));
}
#endif // SHP_INDEX_HH