- Boost-users - lists.preview.boost.org

[bccl] how to use predefined concepts to restrict a template argument via sfinae
by Nick Stokes 13 May '15

13 May '15

The use case is from Boost Graph, but my question is a general one about Boost Concept Check Library: How to "restrict" a template class/function argument based on concepts. For instance, I want to overload functions based on Graph or VertexListGraph or similar refinement. template<class VertexListGraph, XXX > void foo( VertexListGraph& g ) {...} where XXX is somekind of SFINAE that leverages boost::VertexListGraphConcept. Thanks, Nick

2 1

[BGL] pull requests?
by Mads Jensen 13 May '15

13 May '15

Hi, I don't know if this is the right list to send this to. However, there is a fair amount of trivial pull requests for the Boost Graph Library. Most of which address small errors in the documentation. There hasn't been any activity in that repository since August last year. Can someone with write access please have a look at it? -- Med venlig hilsen / Kind regards, Mads Jensen Life holds no terrors when you have embraced the philosophy of flipism! -- Carl Barks (Walt Disney Comics & Stories 149)

1 0

Boost.Coroutine Debian package
by Konrad Zemek 13 May '15

13 May '15

Hey everyone, I have asked this question the person who introduced Boost.Coroutine in the Debian package (control files can be found in debian svn repository [1]) a few days ago but have not received a reply: Does anyone happen to know why - for Debian package - Boost.Coroutine is built as a static library only? Our project prefers dynamic linking, and we also need -fPIC since we're building shared libraries as well, yet Boost.Coroutine is one of two libraries (the other one being Boost.Exception) built only as a non-fPIC static version. I have modified the control files to enable building libboost_coroutine.so, and we're currently using it for our project seemingly without any problem, but it worries me that there must have been a reason for the special treatment of Boost.Coroutine package. And a "by the way" question if anyone happens to know, I'm curious why Debian unstable still provides Boost 1.55 as the newest version? [1] svn://anonscm.debian.org/pkg-boost/boost Konrad

1 0

[Geometry] warnings
by PB 12 May '15

12 May '15

Hello, Using Boost 1.58 on VC9 (MSVC++ 2008) compiling a small program generates warnings in the Geometry headers in Release and Debug modes. Please let me know if this is a Boost.Geometry issue or something I'm not doing correctly. The program source ================= #include <boost/geometry.hpp> #include <boost/geometry/geometries/geometries.hpp> #include <boost/geometry/geometries/point_xy.hpp> #include <boost/geometry/geometries/polygon.hpp> typedef boost::geometry::model::d2::point_xy<double> point; typedef boost::geometry::model::polygon<point,false> polygon; typedef boost::geometry::model::linestring<point> polyline; int main() { polygon green, blue; green.outer().push_back(point(-1.0, 1.0)); green.outer().push_back(point(1.0, 1.0)); green.outer().push_back(point(1.0, -1.0)); green.outer().push_back(point(-1.0, -1.0)); blue.outer().push_back(point(0.5, 0.5)); blue.outer().push_back(point(0.5, 1.5)); blue.outer().push_back(point(1.5, 1.5)); blue.outer().push_back(point(1.5, 0.5)); std::vector<polygon> output; boost::geometry::intersection(blue, green, output); } Warning summary ============== Warning 1 warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 96 Warning 2 warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 97 Warning 3 warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 98 Warning 4 warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 99 Warning 5 warning C4244: 'argument' : conversion from '__int64' to 'const double', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\algorithms\detail\recalculate.hpp 51 Warning 6 warning C4244: 'argument' : conversion from '__int64' to 'const double', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\algorithms\detail\recalculate.hpp 51 Warning 7 warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 88 Warning 8 warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 89 Warning 9 warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 91 Warning 10 warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 92 Warning 11 warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 93 Warning 12 warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data c:\releases\lib\boost\boost_1_58_0\include\boost\geometry\strategies\cartesian\side_by_triangle.hpp 94 Warnings in more detail =============== 1>------ Build started: Project: boost_geom_warnings, Configuration: Release Win32 ------ 1>Compiling... 1>main.cpp 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(96) : warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(138) : see reference to function template instantiation 'PromotedType boost::geometry::strategy::side::side_by_triangle<>::side_value<CoordinateType,PromotedType,P1,P2,P,EpsPolicy>(const P1 &,const P2 &,const P &,EpsPolicy &)' being compiled 1> with 1> [ 1> PromotedType=promoted_type, 1> CoordinateType=coordinate_type, 1> P1=robust_point_type, 1> P2=robust_point_type, 1> P=robust_point_type, 1> EpsPolicy=boost::geometry::strategy::side::side_by_triangle<>::eps_policy<boost::geometry::math::detail::equals_factor_policy<promoted_type>> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(234) : see reference to function template instantiation 'PromotedType boost::geometry::strategy::side::side_by_triangle<>::compute_side_value<CoordinateType,PromotedType,AreAllIntegralCoordinates>::apply<P1,P2,P,boost::geometry::strategy::side::side_by_triangle<>::eps_policy<Policy>>(const P1 &,const P2 &,const P &,EpsPolicy &)' being compiled 1> with 1> [ 1> PromotedType=promoted_type, 1> CoordinateType=coordinate_type, 1> AreAllIntegralCoordinates=true, 1> P1=robust_point_type, 1> P2=robust_point_type, 1> P=robust_point_type, 1> Policy=boost::geometry::math::detail::equals_factor_policy<promoted_type>, 1> EpsPolicy=boost::geometry::strategy::side::side_by_triangle<>::eps_policy<boost::geometry::math::detail::equals_factor_policy<promoted_type>> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/point_is_spike_or_equal.hpp(51) : see reference to function template instantiation 'int boost::geometry::strategy::side::side_by_triangle<>::apply<Point1,Point2,Point3>(const P1 &,const P2 &,const P &)' being compiled 1> with 1> [ 1> Point1=robust_point_type, 1> Point2=robust_point_type, 1> Point3=robust_point_type, 1> P1=robust_point_type, 1> P2=robust_point_type, 1> P=robust_point_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/point_is_spike_or_equal.hpp(117) : see reference to function template instantiation 'bool boost::geometry::detail::point_is_spike_or_equal<robust_point_type,robust_point_type,robust_point_type>(const Point1 &,const Point2 &,const Point3 &)' being compiled 1> with 1> [ 1> Point1=robust_point_type, 1> Point2=robust_point_type, 1> Point3=robust_point_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/append_no_dups_or_spikes.hpp(95) : see reference to function template instantiation 'bool boost::geometry::detail::point_is_spike_or_equal<Point,boost::geometry::model::d2::point_xy<CoordinateType>,boost::geometry::model::d2::point_xy<CoordinateType>,RobustPolicy>(const Point1 &,const Point2 &,const Point3 &,const RobustPolicy &)' being compiled 1> with 1> [ 1> Point=point_type, 1> CoordinateType=double, 1> RobustPolicy=rescale_policy_type, 1> Point1=point_type, 1> Point2=boost::geometry::model::d2::point_xy<double>, 1> Point3=boost::geometry::model::d2::point_xy<double> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/traverse.hpp(289) : see reference to function template instantiation 'void boost::geometry::detail::overlay::append_no_dups_or_spikes<ring_type,Point,RobustPolicy>(Range &,const Point &,const RobustPolicy &)' being compiled 1> with 1> [ 1> Point=point_type, 1> RobustPolicy=rescale_policy_type, 1> Range=ring_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/overlay.hpp(232) : see reference to function template instantiation 'void boost::geometry::detail::overlay::traverse<Reverse1,Reverse2,Geometry1,Geometry2>::apply<RobustPolicy,container_type,ring_container_type>(const Geometry1 &,const Geometry2 &,boost::geometry::detail::overlay::operation_type,const RobustPolicy &,Turns &,Rings &)' being compiled 1> with 1> [ 1> Reverse1=true, 1> Reverse2=true, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> RobustPolicy=rescale_policy_type, 1> Turns=container_type, 1> Rings=ring_container_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/intersection/interface.hpp(57) : see reference to function template instantiation 'OutputIterator boost::geometry::detail::overlay::overlay<Geometry1,Geometry2,Reverse1,Reverse2,ReverseOut,GeometryOut,Direction>::apply<RobustPolicy,std::back_insert_iterator<_Container>,Strategy>(const Geometry1 &,const Geometry2 &,const RobustPolicy &,OutputIterator,const Strategy &)' being compiled 1> with 1> [ 1> OutputIterator=std::back_insert_iterator<std::vector<polygon>>, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> Reverse1=true, 1> Reverse2=true, 1> ReverseOut=true, 1> GeometryOut=OneOut, 1> Direction=overlay_intersection, 1> RobustPolicy=rescale_policy_type, 1> _Container=std::vector<polygon>, 1> Strategy=boost::geometry::strategy_intersection<boost::geometry::cartesian_tag,polygon,polygon,boost::geometry::model::d2::point_xy<double>,rescale_policy_type> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/intersection/interface.hpp(138) : see reference to function template instantiation 'bool boost::geometry::dispatch::intersection<Geometry1,Geometry2>::apply<rescale_policy_type,GeometryOut,boost::geometry::strategy_intersection<Tag,Geometry1,Geometry2,IntersectionPoint,RobustPolicy>>(const Geometry1 &,const Geometry2 &,const RobustPolicy &,GeometryOut &,const Strategy &)' being compiled 1> with 1> [ 1> Geometry1=polygon, 1> Geometry2=polygon, 1> GeometryOut=std::vector<polygon>, 1> Tag=boost::geometry::cartesian_tag, 1> IntersectionPoint=boost::geometry::model::d2::point_xy<double>, 1> RobustPolicy=rescale_policy_type, 1> Strategy=boost::geometry::strategy_intersection<boost::geometry::cartesian_tag,polygon,polygon,boost::geometry::model::d2::point_xy<double>,rescale_policy_type> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/intersection/interface.hpp(302) : see reference to function template instantiation 'bool boost::geometry::resolve_variant::intersection<Geometry1,Geometry2>::apply<GeometryOut>(const Geometry1 &,const Geometry2 &,GeometryOut &)' being compiled 1> with 1> [ 1> Geometry1=polygon, 1> Geometry2=polygon, 1> GeometryOut=std::vector<polygon> 1> ] 1> .\main.cpp(24) : see reference to function template instantiation 'bool boost::geometry::intersection<polygon,polygon,std::vector<_Ty>>(const Geometry1 &,const Geometry2 &,GeometryOut &)' being compiled 1> with 1> [ 1> _Ty=polygon, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> GeometryOut=std::vector<polygon> 1> ] 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(97) : warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(98) : warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(99) : warning C4244: 'initializing' : conversion from 'const coordinate_type' to 'const promoted_type', possible loss of data 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/recalculate.hpp(51) : warning C4244: 'argument' : conversion from '__int64' to 'const double', possible loss of data 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/recalculate.hpp(224) : see reference to function template instantiation 'void boost::geometry::detail::recalculate::recalculate_point<Dimension>::apply<Geometry1,Geometry2,Strategy>(Point1 &,const Point2 &,const Strategy &)' being compiled 1> with 1> [ 1> Dimension=2, 1> Geometry1=boost::geometry::model::d2::point_xy<double>, 1> Geometry2=boost::geometry::model::d2::point_xy<double>, 1> Strategy=rescale_policy_type, 1> Point1=boost::geometry::model::d2::point_xy<double>, 1> Point2=boost::geometry::model::d2::point_xy<double> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/handle_tangencies.hpp(109) : see reference to function template instantiation 'void boost::geometry::recalculate<boost::geometry::model::d2::point_xy<CoordinateType>,boost::geometry::model::d2::point_xy<CoordinateType>,const RobustPolicy>(Geometry1 &,const Geometry2 &,const Strategy &)' being compiled 1> with 1> [ 1> CoordinateType=double, 1> RobustPolicy=rescale_policy_type, 1> Geometry1=boost::geometry::model::d2::point_xy<double>, 1> Geometry2=boost::geometry::model::d2::point_xy<double>, 1> Strategy=rescale_policy_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/handle_tangencies.hpp(96) : while compiling class template member function 'void boost::geometry::detail::overlay::sort_in_cluster<TurnPoints,Indexed,Geometry1,Geometry2,RobustPolicy,Reverse1,Reverse2,Strategy>::get_situation_map(const Indexed &,const Indexed &,boost::geometry::model::d2::point_xy<CoordinateType> &,boost::geometry::model::d2::point_xy<CoordinateType> &,boost::geometry::model::d2::point_xy<CoordinateType> &,boost::geometry::model::d2::point_xy<CoordinateType> &,boost::geometry::model::d2::point_xy<CoordinateType> &,boost::geometry::model::d2::point_xy<CoordinateType> &) const' 1> with 1> [ 1> TurnPoints=container_type, 1> Indexed=indexed_turn_operation, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> RobustPolicy=const rescale_policy_type, 1> Reverse1=true, 1> Reverse2=true, 1> Strategy=boost::geometry::strategy::side::side_by_triangle<>, 1> CoordinateType=double 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/handle_tangencies.hpp(742) : see reference to class template instantiation 'boost::geometry::detail::overlay::sort_in_cluster<TurnPoints,Indexed,Geometry1,Geometry2,RobustPolicy,Reverse1,Reverse2,Strategy>' being compiled 1> with 1> [ 1> TurnPoints=container_type, 1> Indexed=indexed_turn_operation, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> RobustPolicy=const rescale_policy_type, 1> Reverse1=true, 1> Reverse2=true, 1> Strategy=boost::geometry::strategy::side::side_by_triangle<> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/enrich_intersection_points.hpp(290) : see reference to function template instantiation 'void boost::geometry::detail::overlay::handle_cluster<IndexType,true,true,nc_iterator,TurnPoints,Geometry1,Geometry2,const RobustPolicy,Strategy>(Iterator,Iterator,TurnPoints &,boost::geometry::detail::overlay::operation_type,const Geometry1 &,const Geometry2 &,RobustPolicy &,const Strategy &)' being compiled 1> with 1> [ 1> IndexType=indexed_turn_operation, 1> TurnPoints=container_type, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> RobustPolicy=rescale_policy_type, 1> Strategy=boost::geometry::strategy::side::side_by_triangle<>, 1> Iterator=nc_iterator 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/enrich_intersection_points.hpp(533) : see reference to function template instantiation 'void boost::geometry::detail::overlay::enrich_sort<indexed_turn_operation,true,true,_Ty2,TurnPoints,Geometry1,Geometry2,RobustPolicy,Strategy>(Container &,TurnPoints &,boost::geometry::detail::overlay::operation_type,const Geometry1 &,const Geometry2 &,const RobustPolicy &,const Strategy &)' being compiled 1> with 1> [ 1> _Ty2=std::vector<indexed_turn_operation>, 1> TurnPoints=container_type, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> RobustPolicy=rescale_policy_type, 1> Strategy=boost::geometry::strategy::side::side_by_triangle<>, 1> Container=std::vector<indexed_turn_operation> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/overlay.hpp(215) : see reference to function template instantiation 'void boost::geometry::enrich_intersection_points<true,true,container_type,Geometry1,Geometry2,RobustPolicy,boost::geometry::strategy::side::side_by_triangle<>>(TurnPoints &,boost::geometry::detail::overlay::operation_type,const Geometry1 &,const Geometry2 &,const RobustPolicy &,const Strategy &)' being compiled 1> with 1> [ 1> Geometry1=polygon, 1> Geometry2=polygon, 1> RobustPolicy=rescale_policy_type, 1> TurnPoints=container_type, 1> Strategy=boost::geometry::strategy::side::side_by_triangle<> 1> ] 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/recalculate.hpp(51) : warning C4244: 'argument' : conversion from '__int64' to 'const double', possible loss of data 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/recalculate.hpp(52) : see reference to function template instantiation 'void boost::geometry::detail::recalculate::recalculate_point<Dimension>::apply<Point1,Point2,Strategy>(Point1 &,const Point2 &,const Strategy &)' being compiled 1> with 1> [ 1> Dimension=1, 1> Point1=boost::geometry::model::d2::point_xy<double>, 1> Point2=boost::geometry::model::d2::point_xy<double>, 1> Strategy=rescale_policy_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/recalculate.hpp(224) : see reference to function template instantiation 'void boost::geometry::detail::recalculate::recalculate_point<Dimension>::apply<Geometry1,Geometry2,Strategy>(Point1 &,const Point2 &,const Strategy &)' being compiled 1> with 1> [ 1> Dimension=2, 1> Geometry1=boost::geometry::model::d2::point_xy<double>, 1> Geometry2=boost::geometry::model::d2::point_xy<double>, 1> Strategy=rescale_policy_type, 1> Point1=boost::geometry::model::d2::point_xy<double>, 1> Point2=boost::geometry::model::d2::point_xy<double> 1> ] 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(88) : warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(138) : see reference to function template instantiation 'PromotedType boost::geometry::strategy::side::side_by_triangle<CalculationType>::side_value<CoordinateType,PromotedType,P1,P2,P,EpsPolicy>(const P1 &,const P2 &,const P &,EpsPolicy &)' being compiled 1> with 1> [ 1> PromotedType=promoted_type, 1> CalculationType=coordinate_type, 1> CoordinateType=coordinate_type, 1> P1=robust_point_type, 1> P2=robust_point_type, 1> P=robust_point_type, 1> EpsPolicy=boost::geometry::strategy::side::side_by_triangle<coordinate_type>::eps_policy<boost::geometry::math::detail::equals_factor_policy<promoted_type>> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(234) : see reference to function template instantiation 'PromotedType boost::geometry::strategy::side::side_by_triangle<CalculationType>::compute_side_value<CoordinateType,PromotedType,AreAllIntegralCoordinates>::apply<P1,P2,P,boost::geometry::strategy::side::side_by_triangle<CalculationType>::eps_policy<Policy>>(const P1 &,const P2 &,const P &,EpsPolicy &)' being compiled 1> with 1> [ 1> PromotedType=promoted_type, 1> CalculationType=coordinate_type, 1> CoordinateType=coordinate_type, 1> AreAllIntegralCoordinates=true, 1> P1=robust_point_type, 1> P2=robust_point_type, 1> P=robust_point_type, 1> Policy=boost::geometry::math::detail::equals_factor_policy<promoted_type>, 1> EpsPolicy=boost::geometry::strategy::side::side_by_triangle<coordinate_type>::eps_policy<boost::geometry::math::detail::equals_factor_policy<promoted_type>> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/cart_intersect.hpp(140) : see reference to function template instantiation 'int boost::geometry::strategy::side::side_by_triangle<CalculationType>::apply<RobustPoint,RobustPoint,RobustPoint>(const P1 &,const P2 &,const P &)' being compiled 1> with 1> [ 1> CalculationType=coordinate_type, 1> RobustPoint=robust_point_type, 1> P1=robust_point_type, 1> P2=robust_point_type, 1> P=robust_point_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/cart_intersect.hpp(107) : see reference to function template instantiation 'boost::tuples::tuple<T0,T1> boost::geometry::strategy::intersection::relate_cartesian_segments<Policy,CalculationType>::apply<Segment1,Segment2,RobustPolicy,robust_point_type>(const Segment1 &,const Segment2 &,const RobustPolicy &,const RobustPoint &,const RobustPoint &,const RobustPoint &,const RobustPoint &)' being compiled 1> with 1> [ 1> T0=boost::geometry::segment_intersection_points<boost::geometry::model::d2::point_xy<double>,boost::geometry::segment_ratio_type<boost::geometry::model::d2::point_xy<double>,rescale_policy_type>::type>, 1> T1=boost::geometry::policies::relate::segments_direction::return_type, 1> Policy=boost::geometry::policies::relate::segments_tupled<boost::geometry::policies::relate::segments_intersection_points<boost::geometry::segment_intersection_points<boost::geometry::model::d2::point_xy<double>,boost::geometry::segment_ratio_type<boost::geometry::model::d2::point_xy<double>,rescale_policy_type>::type>>,boost::geometry::policies::relate::segments_direction>, 1> CalculationType=void, 1> Segment1=boost::geometry::model::referring_segment<const boost::geometry::model::d2::point_xy<double>>, 1> Segment2=boost::geometry::model::referring_segment<const boost::geometry::model::d2::point_xy<double>>, 1> RobustPolicy=rescale_policy_type, 1> RobustPoint=robust_point_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/get_turn_info_helpers.hpp(220) : see reference to function template instantiation 'boost::tuples::tuple<T0,T1> boost::geometry::strategy::intersection::relate_cartesian_segments<Policy,CalculationType>::apply<boost::geometry::model::referring_segment<ConstOrNonConstPoint>,boost::geometry::model::referring_segment<ConstOrNonConstPoint>,RobustPolicy>(const Segment1 &,const Segment2 &,const RobustPolicy &)' being compiled 1> with 1> [ 1> T0=boost::geometry::segment_intersection_points<boost::geometry::model::d2::point_xy<double>,boost::geometry::segment_ratio_type<boost::geometry::model::d2::point_xy<double>,rescale_policy_type>::type>, 1> T1=boost::geometry::policies::relate::segments_direction::return_type, 1> Policy=boost::geometry::policies::relate::segments_tupled<boost::geometry::policies::relate::segments_intersection_points<boost::geometry::segment_intersection_points<boost::geometry::model::d2::point_xy<double>,boost::geometry::segment_ratio_type<boost::geometry::model::d2::point_xy<double>,rescale_policy_type>::type>>,boost::geometry::policies::relate::segments_direction>, 1> CalculationType=void, 1> ConstOrNonConstPoint=const boost::geometry::model::d2::point_xy<double>, 1> RobustPolicy=rescale_policy_type, 1> Segment1=boost::geometry::model::referring_segment<const boost::geometry::model::d2::point_xy<double>>, 1> Segment2=boost::geometry::model::referring_segment<const boost::geometry::model::d2::point_xy<double>> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/get_turn_info_helpers.hpp(214) : while compiling class template member function 'boost::geometry::detail::overlay::intersection_info<Point1,Point2,TurnPoint,RobustPolicy>::intersection_info(const Point1 &,const Point1 &,const Point1 &,const Point2 &,const Point2 &,const Point2 &,const RobustPolicy &)' 1> with 1> [ 1> Point1=boost::geometry::model::d2::point_xy<double>, 1> Point2=boost::geometry::model::d2::point_xy<double>, 1> TurnPoint=boost::geometry::model::d2::point_xy<double>, 1> RobustPolicy=rescale_policy_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/get_turn_info.hpp(926) : see reference to class template instantiation 'boost::geometry::detail::overlay::intersection_info<Point1,Point2,TurnPoint,RobustPolicy>' being compiled 1> with 1> [ 1> Point1=boost::geometry::model::d2::point_xy<double>, 1> Point2=boost::geometry::model::d2::point_xy<double>, 1> TurnPoint=boost::geometry::model::d2::point_xy<double>, 1> RobustPolicy=rescale_policy_type 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/get_turns.hpp(297) : see reference to function template instantiation 'OutputIterator boost::geometry::detail::overlay::get_turn_info<AssignPolicy>::apply<boost::geometry::model::d2::point_xy<CoordinateType>,boost::geometry::model::d2::point_xy<CoordinateType>,turn_info,RobustPolicy,std::back_insert_iterator<_Container>>(const Point1 &,const Point1 &,const Point1 &,const Point2 &,const Point2 &,const Point2 &,bool,bool,bool,bool,const TurnInfo &,const RobustPolicy &,OutputIterator)' being compiled 1> with 1> [ 1> OutputIterator=std::back_insert_iterator<container_type>, 1> AssignPolicy=boost::geometry::detail::overlay::assign_null_policy, 1> CoordinateType=double, 1> RobustPolicy=rescale_policy_type, 1> _Container=container_type, 1> Point1=boost::geometry::model::d2::point_xy<double>, 1> Point2=boost::geometry::model::d2::point_xy<double>, 1> TurnInfo=turn_info 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/get_turns.hpp(426) : see reference to function template instantiation 'bool boost::geometry::detail::get_turns::get_turns_in_sections<Geometry1,Geometry2,Reverse1,Reverse2,Section1,Section2,TurnPolicy>::apply<Turns,RobustPolicy,InterruptPolicy>(int,const Geometry1 &,const Section1 &,int,const Geometry2 &,const Section2 &,bool,const RobustPolicy &,Turns &,InterruptPolicy &)' being compiled 1> with 1> [ 1> Geometry1=polygon, 1> Geometry2=polygon, 1> Reverse1=true, 1> Reverse2=true, 1> Section1=boost::geometry::section<box_type,2>, 1> Section2=boost::geometry::section<box_type,2>, 1> TurnPolicy=TurnPolicy, 1> Turns=container_type, 1> RobustPolicy=rescale_policy_type, 1> InterruptPolicy=boost::geometry::detail::get_turns::no_interrupt_policy 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/partition.hpp(641) : see reference to function template instantiation 'bool boost::geometry::detail::get_turns::section_visitor<Geometry1,Geometry2,Reverse1,Reverse2,Turns,TurnPolicy,RobustPolicy,InterruptPolicy>::apply<boost::geometry::section<Box,DimensionCount>>(const Section &,const Section &)' being compiled 1> with 1> [ 1> Geometry1=polygon, 1> Geometry2=polygon, 1> Reverse1=true, 1> Reverse2=true, 1> Turns=container_type, 1> TurnPolicy=TurnPolicy, 1> RobustPolicy=rescale_policy_type, 1> InterruptPolicy=boost::geometry::detail::get_turns::no_interrupt_policy, 1> Box=box_type, 1> DimensionCount=2, 1> Section=boost::geometry::section<box_type,2> 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/get_turns.hpp(485) : see reference to function template instantiation 'void boost::geometry::partition<Box,ExpandPolicy1,OverlapsPolicy1>::apply<sections_type,sections_type,boost::geometry::detail::get_turns::section_visitor<Geometry1,Geometry2,Reverse1,Reverse2,Turns,TurnPolicy,RobustPolicy,InterruptPolicy>>(const InputCollection1 &,const InputCollection2 &,VisitPolicy &,size_t,VisitBoxPolicy)' being compiled 1> with 1> [ 1> Box=box_type, 1> ExpandPolicy1=boost::geometry::detail::section::get_section_box, 1> OverlapsPolicy1=boost::geometry::detail::section::overlaps_section_box, 1> Geometry1=polygon, 1> Geometry2=polygon, 1> Reverse1=true, 1> Reverse2=true, 1> Turns=container_type, 1> TurnPolicy=TurnPolicy, 1> RobustPolicy=rescale_policy_type, 1> InterruptPolicy=boost::geometry::detail::get_turns::no_interrupt_policy, 1> InputCollection1=sections_type, 1> InputCollection2=sections_type, 1> VisitPolicy=boost::geometry::detail::get_turns::section_visitor<polygon,polygon,true,true,container_type,TurnPolicy,rescale_policy_type,boost::geometry::detail::get_turns::no_interrupt_policy>, 1> VisitBoxPolicy=boost::geometry::detail::partition::visit_no_policy 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/get_turns.hpp(1002) : see reference to function template instantiation 'void boost::geometry::detail::get_turns::get_turns_generic<Geometry1,Geometry2,Reverse1,Reverse2,TurnPolicy>::apply<RobustPolicy,Turns,InterruptPolicy>(int,const Geometry1 &,int,const Geometry2 &,const RobustPolicy &,Turns &,InterruptPolicy &)' being compiled 1> with 1> [ 1> Geometry1=polygon, 1> Geometry2=polygon, 1> Reverse1=true, 1> Reverse2=true, 1> TurnPolicy=TurnPolicy, 1> RobustPolicy=rescale_policy_type, 1> Turns=container_type, 1> InterruptPolicy=boost::geometry::detail::get_turns::no_interrupt_policy 1> ] 1> c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/algorithms/detail/overlay/overlay.hpp(203) : see reference to function template instantiation 'void boost::geometry::get_turns<true,true,boost::geometry::detail::overlay::assign_null_policy,Geometry1,Geometry2,RobustPolicy,container_type,boost::geometry::detail::get_turns::no_interrupt_policy>(const Geometry1 &,const Geometry2 &,const RobustPolicy &,Turns &,InterruptPolicy &)' being compiled 1> with 1> [ 1> Geometry1=polygon, 1> Geometry2=polygon, 1> RobustPolicy=rescale_policy_type, 1> Turns=container_type, 1> InterruptPolicy=boost::geometry::detail::get_turns::no_interrupt_policy 1> ] 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(89) : warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(91) : warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(92) : warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(93) : warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data 1>c:\releases\lib\boost\boost_1_58_0\include\boost/geometry/strategies/cartesian/side_by_triangle.hpp(94) : warning C4244: 'initializing' : conversion from '__int64' to 'const coordinate_type', possible loss of data 1>Build log was saved at "file://c:\cpp\boost_geom_warnings\Release\BuildLog.htm" 1>boost_geom_warnings - 0 error(s), 12 warning(s) ========== Build: 1 succeeded, 0 failed, 0 up-to-date, 0 skipped ==========

2 2

Re: [Boost-users] boost::intrusive::slist push_back() => error: static assertion failed:
by Jonas Printzén 11 May '15

11 May '15

Mail-list failed to send me the reply from Ion, attempting a reply anyways... *(mail-list owner, what i do wrong?)* Thanx Ion. I got it to work as you suggested. Found old gtest - loggs that confirmed that the cache_last option wasn't needed in old code so this must be a change . Oh, and yes. uint64_t... :-) .. yes I modified the code after cut-paste. The docs for 1.55 intrusive slist under "Using base hooks <http://www.boost.org/doc/libs/1_55_0/doc/html/intrusive/usage.html#intrusiv…>" shows example with push_back() without mentioning cache_last. Mabey it should be push_front() in that example? Nifty to get to pick and choose level of overhead :-) /Jonas

2 1

[range] no matching function for call to make_begin_strided_iterator?
by Oliver Kowalke 11 May '15

11 May '15

Hi, if the test app below does not use adaptor strided in the for-range loop it works. If the adaptors is used the app fails with: ../../../../../boost/range/adaptor/strided.hpp: In instantiation of ‘boost::range_detail::strided_range<Rng, Category>::strided_range(Difference, Rng&) [with Difference = int; Rng = foo::X<int>; Category = boost::iterators::single_pass_traversal_tag]’: ../../../../../boost/range/adaptor/strided.hpp:656:54: required from ‘boost::range_detail::strided_range<Rng> boost::range_detail::operator|(Rng&, const boost::range_detail::strided_holder<Difference>&) [with Rng = foo::X<int>; Difference = int; typename boost::iterators::pure_iterator_traversal<typename boost::range_iterator<C>::type>::type = boost::iterators::single_pass_traversal_tag]’ fibonacci.cpp:188:50: required from here ../../../../../boost/range/adaptor/strided.hpp:631:34: error: no matching function for call to ‘make_begin_strided_iterator(foo::X<int>&, int&, boost::mpl::eval_if<boost::is_convertible<std::input_iterator_tag, boost::iterators::incrementable_traversal_tag>, boost::mpl::identity<std::input_iterator_tag>, boost::iterators::detail::old_category_to_traversal<std::input_iterator_tag> >::type)’ >::type()), Could you give me a hint what is missing? thx, Oliver #include <iostream> #include <iterator> #include <vector> #include <boost/range.hpp> #include <boost/range/adaptor/strided.hpp> namespace foo { template< typename T > class X { private: typedef std::vector< T > vec_t; vec_t vec_; public: X( vec_t const& vec) : vec_( vec) { } class iterator : public std::iterator< std::input_iterator_tag, T > { private: X * x_; typename vec_t::iterator i_; public: typedef typename iterator::pointer pointer_t; typedef typename iterator::reference reference_t; iterator() : x_( 0), i_() {} explicit iterator( X * x) : x_( x), i_( x_->vec_.begin() ) {} iterator( iterator const& other) : x_( other.x_), i_( other.i_) {} iterator & operator=( iterator const& other) { if ( this == & other) return * this; x_ = other.x_; i_ = other.i_; return * this; } bool operator==( iterator const& other) const { return other.x_ == x_ && other.i_ == i_; } bool operator!=( iterator const& other) const { return other.x_ != x_ || other.i_ != i_; } iterator & operator++() { ++i_; return * this; } iterator operator++( int) { i_++; return * this; } reference_t operator*() const { return * i_; } pointer_t operator->() const { return & ( * i_); } }; class const_iterator : public std::iterator< std::input_iterator_tag, const T > { private: X * x_; typename vec_t::const_iterator i_; public: typedef typename iterator::pointer pointer_t; typedef typename iterator::reference reference_t; const_iterator() : x_( 0), i_() {} explicit const_iterator( X * x) : x_( x), i_( x_->vec_.begin() ) {} const_iterator( const_iterator const& other) : x_( other.x_), i_( other.i_) {} const_iterator & operator=( const_iterator const& other) { if ( this == & other) return * this; x_ = other.x_; i_ = other.i_; return * this; } bool operator==( const_iterator const& other) const { return other.x_ == x_ && other.i_ == i_; } bool operator!=( const_iterator const& other) const { return other.x_ != x_ || other.i_ != i_; } const_iterator & operator++() { ++i_; return * this; } const_iterator operator++( int) { i_++; return * this; } reference_t operator*() const { return * i_; } pointer_t operator->() const { return & ( * i_); } }; friend class iterator; friend class const_iterator; }; template< typename T > typename X< T >::iterator range_begin( X< T > & c) { return typename X< T >::iterator( & c); } template< typename T > typename X< T >::const_iterator range_begin( X< T > const& c) { return typename X< T >::const_iterator( & c); } template< typename T > typename X< T >::iterator range_end( X< T > &) { return typename X< T >::iterator(); } template< typename T > typename X< T >::const_iterator range_end( X< T > const&) { return typename X< T >::const_iterator(); } template< typename T > typename X< T >::iterator begin( X< T > & c) { return boost::begin( c); } template< typename T > typename X< T >::const_iterator begin( X< T > const& c) { return boost::begin( c); } template< typename T > typename X< T >::iterator end( X< T > & c) { return boost::end( c); } template< typename T > typename X< T >::const_iterator end( X< T > const& c) { return boost::end( c); } } namespace boost { template< typename T > struct range_mutable_iterator< foo::X< T > > { typedef typename foo::X< T >::iterator type; }; template< typename T > struct range_const_iterator< foo::X< T > > { typedef typename foo::X< T >::const_iterator type; }; } int main() { std::vector< int > vec = { 1,2,3,4,5,6,7,8,9,10 }; auto x = foo::X< int >( vec); for (auto i : x | boost::adaptors::strided( 2) ) std::cout << i << " "; std::cout << '\n'; }

2 1

boost::intrusive::slist push_back() => error: static assertion failed: (cache_last)
by Jonas Printzén 09 May '15

09 May '15

Hi All! First post... Attempt switching to intrusive slist for efficiency, the following example is simply cut-paste from docs. Won't compile! g++ 4.9.1 complains as inlined in code below. #include <boost/intrusive/slist.hpp> using namespace boost::intrusive; struct point : slist_base_hook<> { int64_t x,y; }; using points = slist<point>; int main() { points plist; point p1,p2,p3; ACCEPT( 0U == plist.size() ); plist.push_back( p1 ); // => error: static assertion failed: (cache_last) ACCEPT( 1U == plist.size() ); } The code is from the docs of my version (1.55) and im pretty sure this or similar worked before. (1.54 i think) Please help, what am I missing?

2 1

Re: [Boost-users] lexical_cast between double and string slow in Visual Studio 2013
by David Roberts 07 May '15

07 May '15

> That issue is unknown. I'd really appreciate the investigation. I have done some more investigation, and there are two factors that only cause the slowness when they both occur together. > Try excluding the lexical_cast from test, I have a feeling that this is only MSVC related issue: > > #include <sstream> > #include <string> > > int main (int, char **) > { > for (double count = 0.0; count < 1000000.0; count += 1.41) > { > std::stringstream ss; > ss << count; > std::string result = std::move(ss.str()); > ss.str(std::string()); > > ss << result; > ss >> count; > } > > return 0; > } > Running your test program does not exhibit the problem. It runs in around 3 seconds on my machine when built with either Visual Studio 2010 or Visual Studio 2013. However, changing it very slightly to match more closely what lexical_cast does internally does recreate the problem: #include <sstream> #include <string> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; ss >> count; } return 0; } The effect of setting the precision to 17 is that lots of 9s appear in the string representations. (The number 17 is what boost::detail::lcast_get_precision(double*) chooses.) Without the precision call the contents of the string called result start off like this: 0 1.41 2.82 4.23 5.64 7.05 8.46 9.87 11.28 12.69 With precision set to 17 they start off like this: 0 1.4099999999999999 2.8199999999999998 4.2299999999999995 5.6399999999999997 7.0499999999999998 8.4599999999999991 9.8699999999999992 11.279999999999999 12.69 This happens for both Visual Studio 2010 and Visual Studio 2013. Then the next difference is that Visual Studio 2013 spends a lot longer handling all the extra 9s. Changing the program so that the double is converted to a string using std::stringstream without a precision call and then back to double using lexical_cast takes about 3 seconds for both Visual Studio 2010 and Visual Studio 2013. It is the combination of having all the extra 9s to parse and using Visual Studio 2013 that makes the test using lexical_cast to go both ways slow. Both Visual Studio 2010 and Visual Studio 2013 do the conversion by calling std::num_get<char,std::istreambuf_iterator<char,std::char_traits<char> > >::do_get() which then calls a function called _Stodx() which is implemented in xstod.c. This function is very different for the two versions. In Visual Studio 2010 it's a relatively thin wrapper around the C function strtod(). In Visual Studio 2013 _Stodx() has got a completely new implementation that's generated by #including xxstod.h with some macros defined. The original C function strtod() is much faster than the new _Stodx() when there are lots of 9s at the end of the strings being parsed. This modification to the program: #include <sstream> #include <string> #include <stdlib.h> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::stringstream ss; ss.unsetf(std::ios::skipws); ss.precision(17); ss << count; std::string result = std::move(ss.str()); ss.str(std::string()); ss << result; char *endptr; count = strtod(ss.str().c_str(), &endptr); } return 0; } has a runtime of about 3 seconds even though it's got to cope with all the 9s. I guess only someone from Microsoft or Dinkumware could comment on why _Stodx() was reimplemented. But the other thing is that by setting precision to 17 lexical_cast is bloating the string representations of the doubles with lots of 9s in both Visual Studio 2010 and Visual Studio 2013. Setting precision to 15 instead prevents this, and makes the original test run faster even with Visual Studio 2013 (about 4 seconds rather than 10). Regards, David

5 4

[MultiIndex] getting the index from set::lower_bound() iterator (or a replacement/extension)
by U.Mutlu 07 May '15

07 May '15

Hi, I need a container like std::set which delivers also the index when using the member function lower_bound(). IMO std::set lacks this important functionality. I cannot use std::distance(myset.begin(), it), because that is very slow as it walks again all the items from the beginning. Can boost MultiIndex be used for this, or any other alternatives/workarounds? Here's a demonstration of what I need: struct TS { /*...*/ }; set<TS> myset; TS S(/*...*/); auto it = myset.lower_bound(S); if (it != myset.end()) { size_t ix = ...howto get the index, ie. the rank?... //... } -- Thx Uenal

3 2

boost container help
by Uthpal Urubail 07 May '15

07 May '15

Experts, I am looking for help on a container where I could group the objects having similar properties Ex: struct phyProp { unsigned int color; double height; double weight; std::string location; }; Can I use boost for grouping the objects having same property? [With tolerance?] Any help is highly appreciated. Regards, UJ

3 2