Skip to content

remove borland workaround #632

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Becheler merged 2 commits into from
Oct 8, 2026
Merged

remove borland workaround #632

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
62e0fd9
remove borland workaround
andreacassioli Oct 7, 2026
9790d46
revert include removal
andreacassioli Oct 7, 2026
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
9 changes: 0 additions & 9 deletions include/boost/graph/random.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -38,15 +38,11 @@ typename graph_traits< Graph >::vertex_descriptor random_vertex(
{
if (num_vertices(g) > 1)
{
#if BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x581))
std::size_t n = std::random(num_vertices(g));
#else
using vertices_size_type = typename graph_traits< Graph >::vertices_size_type;
uniform_int< vertices_size_type > distrib(0, num_vertices(g) - 1);
variate_generator< RandomNumGen&, uniform_int< vertices_size_type > > rand_gen(
gen, distrib);
std::size_t n = rand_gen();
#endif
typename graph_traits< Graph >::vertex_iterator i = vertices(g).first;
return *(boost::next(i, n));
}
Expand All @@ -60,16 +56,11 @@ typename graph_traits< Graph >::edge_descriptor random_edge(
{
if (num_edges(g) > 1)
{
#if BOOST_WORKAROUND(BOOST_BORLANDC, BOOST_TESTED_AT(0x581))
typename graph_traits< Graph >::edges_size_type n
= std::random(num_edges(g));
#else
using edges_size_type = typename graph_traits< Graph >::edges_size_type;
uniform_int< edges_size_type > distrib(0, num_edges(g) - 1);
variate_generator< RandomNumGen&, uniform_int< edges_size_type > > rand_gen(
gen, distrib);
edges_size_type n = rand_gen();
#endif
typename graph_traits< Graph >::edge_iterator i = edges(g).first;
return *(boost::next(i, n));
}
Expand Down
Loading