42 lines
1.4 KiB
C++
42 lines
1.4 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_SEGMENT_HPP
|
|
#define MAPNIK_SEGMENT_HPP
|
|
|
|
#include <boost/tuple/tuple.hpp>
|
|
|
|
namespace mapnik
|
|
{
|
|
|
|
typedef boost::tuple<double,double,double,double> segment_t;
|
|
|
|
static bool y_order(segment_t const& first,segment_t const& second)
|
|
{
|
|
double miny0 = std::min(first.get<1>(),first.get<3>());
|
|
double miny1 = std::min(second.get<1>(),second.get<3>());
|
|
return miny0 > miny1;
|
|
}
|
|
|
|
}
|
|
|
|
#endif // MAPNIK_SEGMENT_HPP
|