diff options
author | bubnikv <bubnikv@gmail.com> | 2018-09-25 13:26:14 +0300 |
---|---|---|
committer | bubnikv <bubnikv@gmail.com> | 2018-09-25 13:26:14 +0300 |
commit | d00fc9a0a8e94893006619cb6c0c499524421aaa (patch) | |
tree | be070f4269bedd910c2168dadc3a342986231c07 /src/libslic3r/MotionPlanner.cpp | |
parent | 9a3db200a56b926ba464795e1e95568ab47eccfb (diff) |
Fixed compilation on Linxu
Diffstat (limited to 'src/libslic3r/MotionPlanner.cpp')
-rw-r--r-- | src/libslic3r/MotionPlanner.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libslic3r/MotionPlanner.cpp b/src/libslic3r/MotionPlanner.cpp index ff3475ed8..198c39f31 100644 --- a/src/libslic3r/MotionPlanner.cpp +++ b/src/libslic3r/MotionPlanner.cpp @@ -297,7 +297,7 @@ void MotionPlannerGraph::add_edge(size_t from, size_t to, double weight) // Extend adjacency list until this start node. if (m_adjacency_list.size() < from + 1) { // Reserve in powers of two to avoid repeated reallocation. - m_adjacency_list.reserve(std::max<size_t>(8, next_highest_power_of_2(from + 1))); + m_adjacency_list.reserve(std::max<uint32_t>(8, next_highest_power_of_2((uint32_t)(from + 1)))); // Allocate new empty adjacency vectors. m_adjacency_list.resize(from + 1); } |