mapnik/utils/shapeindex/shapeindex.cpp

254 lines
7.9 KiB
C++
Raw Normal View History

2006-03-31 12:32:02 +02:00
/*****************************************************************************
2011-11-14 04:54:32 +01:00
*
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
*
2015-06-16 12:49:16 +02:00
* Copyright (C) 2015 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.
2005-06-14 17:06:59 +02:00
*
2006-03-31 12:32:02 +02:00
* 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
#include <iostream>
#include <vector>
#include <string>
#include <mapnik/util/fs.hpp>
#include "quadtree.hpp"
#include "shapefile.hpp"
#include "shape_io.hpp"
2014-10-22 01:37:27 +02:00
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#pragma GCC diagnostic ignored "-Wunused-local-typedef"
#include <boost/algorithm/string.hpp>
#include <boost/program_options.hpp>
#pragma GCC diagnostic pop
const int DEFAULT_DEPTH = 8;
2005-06-14 17:06:59 +02:00
const double DEFAULT_RATIO=0.55;
2011-11-14 04:54:32 +01:00
int main (int argc,char** argv)
{
using namespace mapnik;
namespace po = boost::program_options;
using std::string;
using std::vector;
using std::clog;
using std::endl;
2011-11-14 04:54:32 +01:00
bool verbose=false;
unsigned int depth=DEFAULT_DEPTH;
double ratio=DEFAULT_RATIO;
vector<string> shape_files;
2011-11-14 04:54:32 +01:00
try
2005-06-14 17:06:59 +02:00
{
2006-05-12 18:35:36 +02:00
po::options_description desc("shapeindex utility");
desc.add_options()
("help,h", "produce usage message")
("version,V","print version string")
("verbose,v","verbose output")
2011-11-14 04:54:32 +01:00
("depth,d", po::value<unsigned int>(), "max tree depth\n(default 8)")
2006-05-12 18:35:36 +02:00
("ratio,r",po::value<double>(),"split ratio (default 0.55)")
2007-06-05 11:10:40 +02:00
("shape_files",po::value<vector<string> >(),"shape files to index: file1 file2 ...fileN")
2006-05-12 18:35:36 +02:00
;
2011-11-14 04:54:32 +01:00
2006-05-12 18:35:36 +02:00
po::positional_options_description p;
p.add("shape_files",-1);
2011-11-14 04:54:32 +01:00
po::variables_map vm;
2006-05-12 18:35:36 +02:00
po::store(po::command_line_parser(argc, argv).options(desc).positional(p).run(), vm);
po::notify(vm);
2011-11-14 04:54:32 +01:00
2006-05-12 18:35:36 +02:00
if (vm.count("version"))
{
2007-02-08 01:36:14 +01:00
clog<<"version 0.3.0" <<std::endl;
2006-05-12 18:35:36 +02:00
return 1;
}
2005-06-14 17:06:59 +02:00
2011-11-14 04:54:32 +01:00
if (vm.count("help"))
2006-05-12 18:35:36 +02:00
{
clog << desc << endl;
2006-05-12 18:35:36 +02:00
return 1;
}
2011-11-14 04:54:32 +01:00
if (vm.count("verbose"))
2010-11-10 12:55:22 +01:00
{
verbose = true;
}
2006-05-12 18:35:36 +02:00
if (vm.count("depth"))
{
depth = vm["depth"].as<unsigned int>();
}
if (vm.count("ratio"))
{
ratio = vm["ratio"].as<double>();
}
2011-11-14 04:54:32 +01:00
if (vm.count("shape_files"))
2006-05-12 18:35:36 +02:00
{
shape_files=vm["shape_files"].as< vector<string> >();
}
}
2014-05-11 21:40:24 +02:00
catch (std::exception const& ex)
{
clog << "Error: " << ex.what() << endl;
2006-05-12 18:35:36 +02:00
return -1;
2005-06-14 17:06:59 +02:00
}
2011-11-14 04:54:32 +01:00
clog << "max tree depth:" << depth << endl;
clog << "split ratio:" << ratio << endl;
2011-11-14 04:54:32 +01:00
//vector<string>::const_iterator itr = shape_files.begin();
if (shape_files.size() == 0)
{
clog << "no shape files to index" << endl;
2006-05-12 18:35:36 +02:00
return 0;
}
for (auto const& filename : shape_files)
{
clog << "processing " << filename << endl;
std::string shapename (filename);
boost::algorithm::ireplace_last(shapename,".shp","");
std::string shapename_full (shapename + ".shp");
if (! mapnik::util::exists (shapename_full))
{
clog << "Error : file " << shapename_full << " does not exist" << endl;
continue;
}
shape_file shp (shapename_full);
if (! shp.is_open()) {
clog << "Error : cannot open " << shapename_full << endl;
2006-05-12 18:35:36 +02:00
continue;
}
2011-11-14 04:54:32 +01:00
int code = shp.read_xdr_integer(); //file_code == 9994
clog << code << endl;
2011-11-14 04:54:32 +01:00
shp.skip(5*4);
2006-05-12 18:35:36 +02:00
int file_length=shp.read_xdr_integer();
int version=shp.read_ndr_integer();
int shape_type=shp.read_ndr_integer();
2009-12-16 21:02:06 +01:00
box2d<double> extent;
2006-05-12 18:35:36 +02:00
shp.read_envelope(extent);
2011-11-14 04:54:32 +01:00
clog << "length=" << file_length << endl;
clog << "version=" << version << endl;
clog << "type=" << shape_type << endl;
clog << "extent:" << extent << endl;
2011-11-14 04:54:32 +01:00
2006-05-12 18:35:36 +02:00
int pos=50;
2011-11-14 04:54:32 +01:00
shp.seek(pos*2);
2006-05-12 18:35:36 +02:00
quadtree<int> tree(extent,depth,ratio);
int count=0;
while (true) {
2011-11-14 04:54:32 +01:00
2006-05-12 18:35:36 +02:00
long offset=shp.pos();
int record_number=shp.read_xdr_integer();
int content_length=shp.read_xdr_integer();
2011-11-14 04:54:32 +01:00
shape_type = shp.read_ndr_integer();
2009-12-16 21:02:06 +01:00
box2d<double> item_ext;
2011-08-12 18:43:12 +02:00
if (shape_type==shape_io::shape_null)
{
if (pos >= file_length)
{
break;
}
else
{
// still need to increment pos, or the pos counter
// won't indicate EOF until too late.
pos+=4+content_length;
continue;
}
2011-08-12 18:43:12 +02:00
}
else if (shape_type==shape_io::shape_point)
2006-05-12 18:35:36 +02:00
{
double x=shp.read_double();
double y=shp.read_double();
2009-12-16 21:02:06 +01:00
item_ext=box2d<double>(x,y,x,y);
2006-05-12 18:35:36 +02:00
}
else if (shape_type==shape_io::shape_pointm)
{
double x=shp.read_double();
double y=shp.read_double();
2010-01-30 02:02:04 +01:00
// skip m
2006-05-12 18:35:36 +02:00
shp.read_double();
2009-12-16 21:02:06 +01:00
item_ext=box2d<double>(x,y,x,y);
2006-05-12 18:35:36 +02:00
}
else if (shape_type==shape_io::shape_pointz)
{
double x=shp.read_double();
double y=shp.read_double();
2010-01-30 02:02:04 +01:00
// skip z
2006-05-12 18:35:36 +02:00
shp.read_double();
// According to ESRI shapefile doc
// A PointZ consists of a triplet of double-precision coordinates in the order X, Y, Z plus a
// measure.
// PointZ
// {
// Double X // X coordinate
// Double Y // Y coordinate
// Double Z // Z coordinate
// Double M // Measure
// }
// But OGR creates shapefiles with M missing so we need to skip M only if present
// NOTE: content_length is in 16-bit words
if ( content_length == 18)
2010-01-30 02:02:04 +01:00
{
shp.read_double();
}
2009-12-16 21:02:06 +01:00
item_ext=box2d<double>(x,y,x,y);
}
2011-11-14 04:54:32 +01:00
else
{
2006-05-12 18:35:36 +02:00
shp.read_envelope(item_ext);
shp.skip(2*content_length-4*8-4);
}
tree.insert(offset,item_ext);
if (verbose)
{
clog << "record number " << record_number << " box=" << item_ext << endl;
2006-05-12 18:35:36 +02:00
}
2005-06-14 17:06:59 +02:00
2006-05-12 18:35:36 +02:00
pos+=4+content_length;
++count;
2005-06-14 17:06:59 +02:00
if (pos >= file_length) break;
2011-11-14 04:54:32 +01:00
}
clog << " number shapes=" << count << endl;
2006-05-12 18:35:36 +02:00
std::fstream file((shapename+".index").c_str(),
std::ios::in | std::ios::out | std::ios::trunc | std::ios::binary);
if (!file) {
2011-11-14 04:54:32 +01:00
clog << "cannot open index file for writing file \""
<< (shapename+".index") << "\"" << endl;
2006-05-12 18:35:36 +02:00
} else {
tree.trim();
std::clog<<" number nodes="<<tree.count()<<std::endl;
2008-02-20 10:57:37 +01:00
file.exceptions(std::ios::failbit | std::ios::badbit);
2006-05-12 18:35:36 +02:00
tree.write(file);
2008-02-20 10:34:48 +01:00
file.flush();
2006-05-12 18:35:36 +02:00
file.close();
}
2005-06-14 17:06:59 +02:00
}
2011-11-14 04:54:32 +01:00
clog << "done!" << endl;
2005-06-14 17:06:59 +02:00
return 0;
}