/* This file is part of Mapnik (c++ mapping toolkit) * Copyright (C) 2005 Artem Pavlenko * * Mapnik is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or any later version. * * This program 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ //$Id: shape_index_featureset.cc 36 2005-04-05 14:32:18Z pavlenko $ #include "shape_index_featureset.hpp" template shape_index_featureset::shape_index_featureset(const filterT& filter, const std::string& shape_file, const std::set& attribute_names) : filter_(filter), shape_type_(0), shape_(shape_file), count_(0) { shape_.shp().skip(100); std::string indexname(shape_file + ".index"); std::ifstream file(indexname.c_str(),std::ios::in|std::ios::binary); if (file) { shp_index::query(filter,file,ids_); file.close(); } std::cout<< "query size=" << ids_.size() << "\n"; itr_ = ids_.begin(); // deal with attributes std::set::const_iterator pos=attribute_names.begin(); while (pos!=attribute_names.end()) { for (int i=0;i Feature* shape_index_featureset::next() { Feature *f=0; if (itr_!=ids_.end()) { int pos=*itr_++; shape_.move_to(pos); int type=shape_.type(); if (type==shape_io::shape_point) { double x=shape_.shp().read_double(); double y=shape_.shp().read_double(); geometry_ptr point(new point_impl(-1)); point->move_to(x,y); f=new Feature(shape_.id_,point); ++count_; } else if (type == shape_io::shape_pointm) { double x=shape_.shp().read_double(); double y=shape_.shp().read_double(); shape_.shp().read_double();// m geometry_ptr point(new point_impl(-1)); point->move_to(x,y); f=new Feature(shape_.id_,point); ++count_; } else if (type == shape_io::shape_pointz) { double x=shape_.shp().read_double(); double y=shape_.shp().read_double(); shape_.shp().read_double();// z shape_.shp().read_double();// m geometry_ptr point(new point_impl(-1)); point->move_to(x,y); f=new Feature(shape_.id_,point); ++count_; } else { while(!filter_.pass(shape_.current_extent()) && itr_!=ids_.end()) { pos=*itr_++; shape_.move_to(pos); } switch (type) { case shape_io::shape_polyline: { geometry_ptr line = shape_.read_polyline(); f=new Feature(shape_.id_,line); ++count_; break; } case shape_io::shape_polylinem: { geometry_ptr line = shape_.read_polylinem(); f=new Feature(shape_.id_,line); ++count_; break; } case shape_io::shape_polylinez: { geometry_ptr line = shape_.read_polylinez(); f=new Feature(shape_.id_,line); ++count_; break; } case shape_io::shape_polygon: { geometry_ptr poly = shape_.read_polygon(); f=new Feature(shape_.id_,poly); ++count_; break; } case shape_io::shape_polygonm: { geometry_ptr poly = shape_.read_polygonm(); f=new Feature(shape_.id_,poly); ++count_; break; } case shape_io::shape_polygonz: { geometry_ptr poly = shape_.read_polygonz(); f=new Feature(shape_.id_,poly); ++count_; break; } } if (attr_ids_.size()) { shape_.dbf().move_to(shape_.id_); std::vector::const_iterator pos=attr_ids_.begin(); while (pos!=attr_ids_.end()) { try { shape_.dbf().add_attribute(*pos,f);//TODO optimize!!! } catch (...) { std::cerr<<"exception caught\n"; } ++pos; } } } } if (!f) std::cout< shape_index_featureset::~shape_index_featureset() {} template class shape_index_featureset;