320 lines
8 KiB
C++
320 lines
8 KiB
C++
/*****************************************************************************
|
|
*
|
|
* 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
|
|
*
|
|
*****************************************************************************/
|
|
|
|
#ifndef MAPNIK_FEATURE_HPP
|
|
#define MAPNIK_FEATURE_HPP
|
|
|
|
// mapnik
|
|
#include <mapnik/config.hpp>
|
|
#include <mapnik/value.hpp>
|
|
#include <mapnik/geometry.hpp>
|
|
#include <mapnik/raster.hpp>
|
|
#include <mapnik/feature_kv_iterator.hpp>
|
|
#include <mapnik/noncopyable.hpp>
|
|
|
|
// boost
|
|
#include <boost/version.hpp>
|
|
#if BOOST_VERSION >= 104000
|
|
#include <boost/property_map/property_map.hpp>
|
|
#else
|
|
#include <boost/property_map.hpp>
|
|
#endif
|
|
|
|
#include <boost/shared_ptr.hpp>
|
|
#include <boost/scoped_ptr.hpp>
|
|
|
|
// stl
|
|
#include <vector>
|
|
#include <map>
|
|
#include <stdexcept>
|
|
|
|
namespace mapnik {
|
|
|
|
typedef boost::shared_ptr<raster> raster_ptr;
|
|
|
|
class feature_impl;
|
|
|
|
template <typename T>
|
|
class context : private mapnik::noncopyable,
|
|
public boost::associative_property_map<T>
|
|
|
|
{
|
|
friend class feature_impl;
|
|
public:
|
|
typedef T map_type;
|
|
typedef typename boost::associative_property_map<map_type> base_type;
|
|
typedef typename map_type::value_type value_type;
|
|
typedef typename map_type::key_type key_type;
|
|
typedef typename map_type::size_type size_type;
|
|
typedef typename map_type::difference_type difference_type;
|
|
typedef typename map_type::iterator iterator;
|
|
typedef typename map_type::const_iterator const_iterator;
|
|
|
|
context()
|
|
: base_type(mapping_) {}
|
|
|
|
size_type push(key_type const& name)
|
|
{
|
|
size_type index = mapping_.size();
|
|
mapping_.insert(std::make_pair(name, index));
|
|
return index;
|
|
}
|
|
|
|
void add(key_type const& name, size_type index)
|
|
{
|
|
mapping_.insert(std::make_pair(name, index));
|
|
}
|
|
|
|
size_type size() const { return mapping_.size(); }
|
|
const_iterator begin() const { return mapping_.begin();}
|
|
const_iterator end() const { return mapping_.end();}
|
|
|
|
private:
|
|
map_type mapping_;
|
|
};
|
|
|
|
typedef MAPNIK_DECL context<std::map<std::string,std::size_t> > context_type;
|
|
typedef MAPNIK_DECL boost::shared_ptr<context_type> context_ptr;
|
|
|
|
static const value default_value;
|
|
|
|
class MAPNIK_DECL feature_impl : private mapnik::noncopyable
|
|
{
|
|
friend class feature_kv_iterator;
|
|
public:
|
|
|
|
typedef mapnik::value value_type;
|
|
typedef std::vector<value_type> cont_type;
|
|
typedef feature_kv_iterator iterator;
|
|
|
|
feature_impl(context_ptr const& ctx, mapnik::value_integer id)
|
|
: id_(id),
|
|
ctx_(ctx),
|
|
data_(ctx_->mapping_.size()),
|
|
geom_cont_(),
|
|
raster_()
|
|
{}
|
|
|
|
inline mapnik::value_integer id() const { return id_;}
|
|
|
|
inline void set_id(mapnik::value_integer id) { id_ = id;}
|
|
|
|
template <typename T>
|
|
void put(context_type::key_type const& key, T const& val)
|
|
{
|
|
put(key,value(val));
|
|
}
|
|
|
|
template <typename T>
|
|
void put_new(context_type::key_type const& key, T const& val)
|
|
{
|
|
put_new(key,value(val));
|
|
}
|
|
|
|
void put(context_type::key_type const& key, value const& val)
|
|
{
|
|
context_type::map_type::const_iterator itr = ctx_->mapping_.find(key);
|
|
if (itr != ctx_->mapping_.end()
|
|
&& itr->second < data_.size())
|
|
{
|
|
data_[itr->second] = val;
|
|
}
|
|
else
|
|
{
|
|
throw std::out_of_range(std::string("Key does not exist: '") + key + "'");
|
|
}
|
|
}
|
|
|
|
void put_new(context_type::key_type const& key, value const& val)
|
|
{
|
|
context_type::map_type::const_iterator itr = ctx_->mapping_.find(key);
|
|
if (itr != ctx_->mapping_.end()
|
|
&& itr->second < data_.size())
|
|
{
|
|
data_[itr->second] = val;
|
|
}
|
|
else
|
|
{
|
|
cont_type::size_type index = ctx_->push(key);
|
|
if (index == data_.size())
|
|
data_.push_back(val);
|
|
}
|
|
}
|
|
|
|
bool has_key(context_type::key_type const& key) const
|
|
{
|
|
return (ctx_->mapping_.find(key) != ctx_->mapping_.end());
|
|
}
|
|
|
|
value_type const& get(context_type::key_type const& key) const
|
|
{
|
|
context_type::map_type::const_iterator itr = ctx_->mapping_.find(key);
|
|
if (itr != ctx_->mapping_.end())
|
|
return get(itr->second);
|
|
else
|
|
return default_value;
|
|
}
|
|
|
|
value_type const& get(std::size_t index) const
|
|
{
|
|
if (index < data_.size())
|
|
return data_[index];
|
|
return default_value;
|
|
}
|
|
|
|
std::size_t size() const
|
|
{
|
|
return data_.size();
|
|
}
|
|
|
|
cont_type const& get_data() const
|
|
{
|
|
return data_;
|
|
}
|
|
|
|
void set_data(cont_type const& data)
|
|
{
|
|
data_ = data;
|
|
}
|
|
|
|
context_ptr context()
|
|
{
|
|
return ctx_;
|
|
}
|
|
|
|
boost::ptr_vector<geometry_type> const& paths() const
|
|
{
|
|
return geom_cont_;
|
|
}
|
|
|
|
boost::ptr_vector<geometry_type> & paths()
|
|
{
|
|
return geom_cont_;
|
|
}
|
|
|
|
void add_geometry(geometry_type * geom)
|
|
{
|
|
geom_cont_.push_back(geom);
|
|
}
|
|
|
|
unsigned num_geometries() const
|
|
{
|
|
return geom_cont_.size();
|
|
}
|
|
|
|
geometry_type const& get_geometry(unsigned index) const
|
|
{
|
|
return geom_cont_[index];
|
|
}
|
|
|
|
geometry_type& get_geometry(unsigned index)
|
|
{
|
|
return geom_cont_[index];
|
|
}
|
|
|
|
box2d<double> envelope() const
|
|
{
|
|
// TODO - cache this
|
|
box2d<double> result;
|
|
for (unsigned i=0;i<num_geometries();++i)
|
|
{
|
|
geometry_type const& geom = get_geometry(i);
|
|
if (i==0)
|
|
{
|
|
box2d<double> const& box = geom.envelope();
|
|
result.init(box.minx(),box.miny(),box.maxx(),box.maxy());
|
|
}
|
|
else
|
|
{
|
|
result.expand_to_include(geom.envelope());
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
raster_ptr const& get_raster() const
|
|
{
|
|
return raster_;
|
|
}
|
|
|
|
void set_raster(raster_ptr const& raster)
|
|
{
|
|
raster_ = raster;
|
|
}
|
|
|
|
feature_kv_iterator begin() const
|
|
{
|
|
return feature_kv_iterator(*this,true);
|
|
}
|
|
|
|
feature_kv_iterator end() const
|
|
{
|
|
return feature_kv_iterator(*this);
|
|
}
|
|
|
|
std::string to_string() const
|
|
{
|
|
std::stringstream ss;
|
|
ss << "Feature ( id=" << id_ << std::endl;
|
|
context_type::map_type::const_iterator itr = ctx_->mapping_.begin();
|
|
context_type::map_type::const_iterator end = ctx_->mapping_.end();
|
|
for ( ;itr!=end; ++itr)
|
|
{
|
|
std::size_t index = itr->second;
|
|
if (index < data_.size())
|
|
{
|
|
if (data_[itr->second] == mapnik::value_null())
|
|
{
|
|
ss << " " << itr->first << ":null" << std::endl;
|
|
}
|
|
else
|
|
{
|
|
ss << " " << itr->first << ":" << data_[itr->second] << std::endl;
|
|
}
|
|
}
|
|
}
|
|
ss << ")" << std::endl;
|
|
return ss.str();
|
|
}
|
|
|
|
private:
|
|
mapnik::value_integer id_;
|
|
context_ptr ctx_;
|
|
cont_type data_;
|
|
boost::ptr_vector<geometry_type> geom_cont_;
|
|
raster_ptr raster_;
|
|
};
|
|
|
|
|
|
inline std::ostream& operator<< (std::ostream & out,feature_impl const& f)
|
|
{
|
|
out << f.to_string();
|
|
return out;
|
|
}
|
|
|
|
typedef feature_impl Feature;
|
|
|
|
typedef MAPNIK_DECL boost::shared_ptr<Feature> feature_ptr;
|
|
|
|
}
|
|
|
|
#endif // MAPNIK_FEATURE_HPP
|