Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion example/fibonacci_heap.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,7 @@ int main()
ICmp cmp(&w[0], std::less< float >());
fibonacci_heap< int, ICmp > Q(N, cmp);

for (int c = 0; c < w.size(); ++c)
for (std::size_t c = 0; c < w.size(); ++c)
w[c] = c;
#ifndef BOOST_NO_CXX98_RANDOM_SHUFFLE
std::random_shuffle(w.begin(), w.end());
Expand Down
4 changes: 2 additions & 2 deletions include/boost/pending/detail/disjoint_sets.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -55,8 +55,8 @@ namespace detail
template < class ParentPA, class RankPA, class Vertex>
inline void link_sets(ParentPA p, RankPA rank, Vertex i, Vertex j)
{
assert(i == get(p, i));
assert(j == get(p, j));
assert(i == static_cast< Vertex >(get(p, i)));
assert(j == static_cast< Vertex >(get(p, j)));
if (i == j)
return;
if (get(rank, i) > get(rank, j))
Expand Down
2 changes: 1 addition & 1 deletion test/min_degree_empty.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ int main(int argc, char** argv)

for (size_t k = 0; k < n; ++k)
{
BOOST_TEST(o[io[k]] == k);
BOOST_TEST(o[io[k]] == static_cast< int >(k));
}

return boost::report_errors();
Expand Down
Loading