/***************************************************************************** * * This file is part of Mapnik (c++ mapping toolkit) * * Copyright (C) 2011 Artem Pavlenko * * 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, * but WITHOUT ANY WARRANTY; without even the implied warranty of * 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 * *****************************************************************************/ // stl #include // mapnik #include // boost #include #include #include "shape_index_featureset.hpp" using mapnik::feature_factory; using mapnik::geometry_type; template shape_index_featureset::shape_index_featureset(const filterT& filter, shape_io& shape, const std::set& attribute_names, std::string const& encoding, std::string const& shape_name, int row_limit) : filter_(filter), //shape_type_(0), shape_(shape), tr_(new transcoder(encoding)), count_(0), row_limit_(row_limit) { ctx_ = boost::make_shared(); shape_.shp().skip(100); boost::shared_ptr index = shape_.index(); if (index) { #ifdef SHAPE_MEMORY_MAPPED_FILE //shp_index >::query(filter, index->file(), ids_); shp_index::query(filter, index->file(), ids_); #else shp_index::query(filter, index->file(), ids_); #endif } std::sort(ids_.begin(), ids_.end()); #ifdef MAPNIK_DEBUG std::clog << "Shape Plugin: query size=" << ids_.size() << std::endl; #endif itr_ = ids_.begin(); // deal with attributes std::set::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) { ctx_->push(*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 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; } } template feature_ptr shape_index_featureset::next() { if (row_limit_ && count_ > row_limit_) { return feature_ptr(); } if (itr_ != ids_.end()) { int pos = *itr_++; shape_.move_to(pos); int type = shape_.type(); feature_ptr feature(feature_factory::create(ctx_,shape_.id_)); if (type == shape_io::shape_point) { double x = shape_.shp().read_double(); 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(); // skip m shape_.shp().skip(8); geometry_type* point = new geometry_type(mapnik::Point); point->move_to(x, y); feature->add_geometry(point); ++count_; } 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_; } else { while(! filter_.pass(shape_.current_extent()) && itr_ != ids_.end()) { if (shape_.type() != shape_io::shape_null) { pos = *itr_++; shape_.move_to(pos); } else { return feature_ptr(); } } switch (type) { 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); point->move_to(x, y); feature->add_geometry(point); } // ignore m and z for now ++count_; break; } case shape_io::shape_polyline: case shape_io::shape_polylinem: case shape_io::shape_polylinez: { shape_.read_polyline(feature->paths()); ++count_; break; } case shape_io::shape_polygon: case shape_io::shape_polygonm: case shape_io::shape_polygonz: { shape_.read_polygon(feature->paths()); ++count_; break; } } } // FIXME feature->set_id(shape_.id_); if (attr_ids_.size()) { shape_.dbf().move_to(shape_.id_); std::set::const_iterator itr = attr_ids_.begin(); std::set::const_iterator end = attr_ids_.end(); try { for (; itr!=end; ++itr) { shape_.dbf().add_attribute(*itr, *tr_, *feature); } } catch (...) { std::cerr << "Shape Plugin: error processing attributes" << std::endl; } } return feature; } else { #ifdef MAPNIK_DEBUG std::clog << "Shape Plugin: " << count_ << " features" << std::endl; #endif return feature_ptr(); } } template shape_index_featureset::~shape_index_featureset() {} template class shape_index_featureset; template class shape_index_featureset;