mapnik/plugins/input/shape/shape_index_featureset.cpp

268 lines
8.4 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
*
2006-03-31 12:32:02 +02:00
* Copyright (C) 2006 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
//$Id: shape_index_featureset.cc 36 2005-04-05 14:32:18Z pavlenko $
// mapnik
#include <mapnik/feature_factory.hpp>
// boost
#include <boost/algorithm/string.hpp>
#include <boost/interprocess/streams/bufferstream.hpp>
// stl
2011-04-07 17:09:20 +02:00
#include <fstream>
#include "shape_index_featureset.hpp"
using mapnik::feature_factory;
using mapnik::geometry_type;
2005-06-14 17:06:59 +02:00
template <typename filterT>
shape_index_featureset<filterT>::shape_index_featureset(const filterT& filter,
shape_io& shape,
const std::set<std::string>& attribute_names,
std::string const& encoding,
std::string const& shape_name)
2005-06-14 17:06:59 +02:00
: filter_(filter),
//shape_type_(0),
shape_(shape),
tr_(new transcoder(encoding)),
2005-06-14 17:06:59 +02:00
count_(0)
{
shape_.shp().skip(100);
2010-09-06 21:20:59 +02:00
boost::shared_ptr<shape_file> index = shape_.index();
if (index)
2005-06-14 17:06:59 +02:00
{
#ifdef SHAPE_MEMORY_MAPPED_FILE
//shp_index<filterT,stream<mapped_file_source> >::query(filter,index->file(),ids_);
shp_index<filterT,boost::interprocess::ibufferstream>::query(filter,index->file(),ids_);
#else
2011-04-07 17:09:20 +02:00
shp_index<filterT,std::ifstream>::query(filter,index->file(),ids_);
#endif
2005-06-14 17:06:59 +02:00
}
std::sort(ids_.begin(),ids_.end());
2008-02-04 12:14:34 +01:00
#ifdef MAPNIK_DEBUG
2010-11-19 00:46:01 +01:00
std::clog << "Shape Plugin: query size=" << ids_.size() << std::endl;
2008-02-04 12:14:34 +01:00
#endif
2005-06-14 17:06:59 +02:00
itr_ = ids_.begin();
// deal with attributes
std::set<std::string>::const_iterator pos=attribute_names.begin();
while (pos!=attribute_names.end())
{
bool found_name = false;
for (int i=0;i<shape_.dbf().num_fields();++i)
{
if (shape_.dbf().descriptor(i).name_ == *pos)
{
attr_ids_.insert(i);
found_name = true;
break;
}
}
if (!found_name)
{
std::ostringstream s;
s << "no attribute '" << *pos << "' in '"
<< shape_name << "'. Valid attributes are: ";
std::vector<std::string> list;
for (int i=0;i<shape_.dbf().num_fields();++i)
{
list.push_back(shape_.dbf().descriptor(i).name_);
}
s << boost::algorithm::join(list, ",") << ".";
throw mapnik::datasource_exception( "Shape Plugin: " + s.str() );
}
++pos;
2005-06-14 17:06:59 +02:00
}
}
template <typename filterT>
feature_ptr shape_index_featureset<filterT>::next()
{
if (itr_!=ids_.end())
2005-06-14 17:06:59 +02:00
{
int pos=*itr_++;
shape_.move_to(pos);
2005-06-14 17:06:59 +02:00
int type=shape_.type();
feature_ptr feature(feature_factory::create(shape_.id_));
if (type == shape_io::shape_point)
2010-07-25 21:55:40 +02:00
{
2005-06-14 17:06:59 +02:00
double x=shape_.shp().read_double();
2010-07-25 21:55:40 +02:00
double y=shape_.shp().read_double();
geometry_type * point = new geometry_type(mapnik::Point);
point->move_to(x,y);
feature->add_geometry(point);
++count_;
}
else if (type == shape_io::shape_pointm)
{
double x=shape_.shp().read_double();
double y=shape_.shp().read_double();
shape_.shp().skip(8);// skip m
geometry_type * point = new geometry_type(mapnik::Point);
point->move_to(x,y);
feature->add_geometry(point);
++count_;
2005-06-14 17:06:59 +02:00
}
else if (type == shape_io::shape_pointz)
{
double x=shape_.shp().read_double();
double y=shape_.shp().read_double();
// skip z
shape_.shp().skip(8);
//skip m if exists
if ( shape_.reclength_ == 8 + 36)
{
shape_.shp().skip(8);
}
geometry_type * point = new geometry_type(mapnik::Point);
point->move_to(x,y);
feature->add_geometry(point);
++count_;
2010-07-25 21:55:40 +02:00
}
2005-06-14 17:06:59 +02:00
else
{
while(!filter_.pass(shape_.current_extent()) &&
2010-07-25 21:55:40 +02:00
itr_!=ids_.end())
{
if (shape_.type() != shape_io::shape_null)
{
pos=*itr_++;
shape_.move_to(pos);
}
else
{
return feature_ptr();
}
}
2010-07-25 21:55:40 +02:00
2005-06-14 17:06:59 +02:00
switch (type)
{
2010-07-25 21:55:40 +02:00
case shape_io::shape_multipoint:
case shape_io::shape_multipointm:
case shape_io::shape_multipointz:
{
int num_points = shape_.shp().read_ndr_integer();
for (int i=0; i< num_points;++i)
{
double x=shape_.shp().read_double();
double y=shape_.shp().read_double();
geometry_type * point = new geometry_type(mapnik::Point);
2010-07-25 21:55:40 +02:00
point->move_to(x,y);
feature->add_geometry(point);
}
// ignore m and z for now
++count_;
break;
}
case shape_io::shape_polyline:
{
geometry_type * line = shape_.read_polyline();
2010-07-25 21:55:40 +02:00
feature->add_geometry(line);
++count_;
break;
}
case shape_io::shape_polylinem:
{
geometry_type * line = shape_.read_polylinem();
2010-07-25 21:55:40 +02:00
feature->add_geometry(line);
++count_;
break;
}
case shape_io::shape_polylinez:
{
geometry_type * line = shape_.read_polylinez();
2010-07-25 21:55:40 +02:00
feature->add_geometry(line);
++count_;
break;
}
case shape_io::shape_polygon:
{
geometry_type * poly = shape_.read_polygon();
2010-07-25 21:55:40 +02:00
feature->add_geometry(poly);
++count_;
break;
}
case shape_io::shape_polygonm:
{
geometry_type * poly = shape_.read_polygonm();
2010-07-25 21:55:40 +02:00
feature->add_geometry(poly);
++count_;
break;
}
case shape_io::shape_polygonz:
{
geometry_type * poly = shape_.read_polygonz();
2010-07-25 21:55:40 +02:00
feature->add_geometry(poly);
++count_;
break;
}
2005-06-14 17:06:59 +02:00
}
}
feature->set_id(shape_.id_);
if (attr_ids_.size())
{
shape_.dbf().move_to(shape_.id_);
std::set<int>::const_iterator itr=attr_ids_.begin();
std::set<int>::const_iterator end=attr_ids_.end();
try
{
for ( ; itr!=end; ++itr)
{
shape_.dbf().add_attribute(*itr,*tr_,*feature);
}
}
catch (...)
{
std::clog << "Shape Plugin: error processing attributes" << std::endl;
}
}
return feature;
}
else
{
#ifdef MAPNIK_DEBUG
2010-11-19 00:46:01 +01:00
std::clog << "Shape Plugin: " << count_ << " features" << std::endl;
#endif
return feature_ptr();
2005-06-14 17:06:59 +02:00
}
}
template <typename filterT>
shape_index_featureset<filterT>::~shape_index_featureset() {}
template class shape_index_featureset<mapnik::filter_in_box>;
template class shape_index_featureset<mapnik::filter_at_point>;
2005-06-14 17:06:59 +02:00