sij/mapnik
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

use std::sort over boost::sort

Browse source
This commit is contained in:
Dane Springmeyer 2014-08-04 14:13:33 -07:00
parent a73440496a
commit 5134fdc0d3
1 changed files with 2 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
include/mapnik/hextree.hpp
View file

@ -28,9 +28,6 @@
#include <mapnik/palette.hpp>
#include <mapnik/noncopyable.hpp>
// boost
#include <boost/range/algorithm.hpp>
// stl
#include <vector>
#include <cstring>
@ -261,7 +258,7 @@ public:
// find closest match based on mean of r,g,b,a
std::vector<rgba>::const_iterator pit =
boost::lower_bound(sorted_pal_, c, rgba::mean_sort_cmp());
std::lower_bound(sorted_pal_, c, rgba::mean_sort_cmp());
ind = pit-sorted_pal_.begin();
if (ind == sorted_pal_.size())
ind--;
@ -334,7 +331,7 @@ public:
create_palette_rek(sorted_pal_, root_.get());
// sort palette for binary searching in quantization
boost::sort(sorted_pal_, rgba::mean_sort_cmp());
std::sort(sorted_pal_, rgba::mean_sort_cmp());
// returned palette is rearanged, so that colors with a<255 are at the begining
pal_remap_.resize(sorted_pal_.size());
palette.clear();