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

Boost.Compute v0.1 Released
by Kyle Lutz 20 Mar '14

20 Mar '14

I'm proud to announce the initial release (version 0.1) of Boost.Compute! It is available on GitHub [1] and instructions for using the library can be found in the documentation [2]. Boost.Compute is a GPGPU and parallel-programming library based on OpenCL. It provides an STL-like API and implements many common containers (e.g. vector<T>, array<T, N>) as well as many common algorithms (e.g. sort(), accumulate(), transform()). A full list can be found in the header reference [3]. I hope to propose Boost.Compute for review in the next few months but for I'm looking for more wide-spread testing and feedback from the Boost community (please note the FAQ [4] and design rationale [5] where I hope to have answered some common questions). Thanks, Kyle [1] https://github.com/kylelutz/compute [2] http://kylelutz.github.io/compute/ [3] http://kylelutz.github.io/compute/compute/reference.html [4] http://kylelutz.github.io/compute/boost_compute/faq.html [5] http://kylelutz.github.io/compute/boost_compute/design.html

7 8

Multiprecision support for serialization
by Michael Crawford 19 Mar '14

19 Mar '14

I noticed that the 1.55 documentation has a page regarding support for boost::serialization: http://www.boost.org/doc/libs/1_55_0/libs/multiprecision/doc/html/boost_mul… However, the page is broken at the moment. Can anyone fix this page or let me know what the status is for serialization of multiprecision types?

2 1

[ICL] Can't use an enum as map value
by Oodini 19 Mar '14

19 Mar '14

Hello, I declared an interval_map : interval_map<uint16_t, SomeEnumType> myMap; Later, I do : SomeEnumType enumValue = SOME_ENUM_VALUE; myMap.add(std::make_pair(disxrete_interval<uint16_t>(10,17), SOME_ENUM_VALUE); But that doesn't compile. It seems that ICL wants the += operator must eb defined for value type (why ???). What can I do ? Thanks.

3 4

[ICL] Map & insertion
by Oodini 19 Mar '14

19 Mar '14

Hello, I declared an interval_map : interval_map<uint16_t, SomeEnumType> myMap; and two intervals : discrete_interval<uint16_t>( 0,10) interval_1; discrete_interval<uint16_t>(10,17) interval_2; Later, I do : myMap.insert(std::make_pair(interval_1, SOME_ENUM_VALUE_1); myMap.insert(std::make_pair(interval_2, SOME_ENUM_VALUE_2); The second insertion hasn't any effect. I tought that by default, the upper bound was excluded. If so, there isn't any overlapping. So why does that failt ? By debugging, I cna see that somewhere in the ICL code, the second value is tested as "absorbable"... Thanks for help.

1 1

ICL & time intervals
by Oodini 19 Mar '14

19 Mar '14

Hello, Is it possible to define with ICL the time range [23:00 -> 05:00] with only one interval ? Thanks.

2 2

Boost InterProcess Shared Memory: Grow()
by Sunanda Chowdhary 19 Mar '14

19 Mar '14

> > Hi, > > I am new to Shared memory functionality. I have a question related to > grow(). > > 1. For growing a memory we need to first un-map the memory and then map it > again. Suppose before un-map base address of shared memory is X then after > growing will the base address be changed or extra segment of memory will be > added to existing memory keeping base address same? > > More specifically, will the entire memory (original + extra grow memory) > be reallocated as one chunk or mere addition of an extra chunk is done? > > 2. If entire memory (original + extra grow memory) is reallocated after > growing then how to manage previously allocated memory that is the shared > memory which was being used before grow was called (original)? Does grow > takes care of deleting it? > > By posing this query I am more concerned about memory leaks. Please help. Thanks >

1 0

[ICL] Search for an interval in a map
by Oodini 18 Mar '14

18 Mar '14

Hello, Let's suppose I have a map with 3 intervals : [0,5), [5,10), [10,15) If I want to apply the "find" function by giving as argument the interval [7,12), the documentation says I'll get an iterator to the first intervall overlapping with the given interval. So the result should be [5,10). Isn't there any way to have a pair of iterators (begin and end), as std::multimap::equal_range() ?

1 0

[ANN] Registration for CppCon 2014 is Open
by Boris Kolpackov 18 Mar '14

18 Mar '14

CppCon, The C++ Conference Opening Keynote by Bjarne Stroustrup September 7–12, 2014 Bellevue, Washington, USA Registration is now open for CppCon 2014 to be held September 7–12, 2014 at the Meydenbauer Center in Bellevue, Washington, USA. This year the conference starts with the keynote by Bjarne Stroustrup titled "Make Simple Tasks Simple!" CppCon is the annual, week-long face-to-face gathering for the entire C++ community. The conference is organized by the C++ community for the community. You will enjoy inspirational talks and a friendly atmosphere designed to help attendees learn from each other, meet interesting people, and generally have a stimulating experience. Taking place this year in the beautiful Seattle neighborhood and including multiple diverse tracks, the conference will appeal to anyone from C++ novices to experts. What you can expect at CppCon: * Invited talks and panels: CppCon keynote by Bjarne Stroustrup will start off a week full of insight from some of the world’s leading experts in C++. Still have questions? Ask them at one of CppCon's panels featuring those at the cutting edge of the language. * Presentations by the C++ community: What do embedded systems, game development, high frequency trading, and particle accelerators have in common? C++, of course! Expect talks from a broad range of domains focused on practical C++ techniques, libraries, and tools. * Lightning talks: Get informed at a fast pace during special sessions of short, informal talks. Never presented at a conference before? This is your chance to share your thoughts on a C++-related topic in an informal setting. * Evening events and "unconference" time: Relax, socialize, or start an impromptu coding session. CppCon’s goal is to encourage the best use of C++ while preserving the diversity of viewpoints and experiences, but other than that it is non-partisan and has no agenda. The conference is a project of the Standard C++ Foundation, a not-for-profit organization whose purpose is to support the C++ software developer community and promote the understanding and use of modern, standard C++ on all compilers and platforms. For more information about the conference and to register, visit: http://cppcon.org

1 0

[Boost.polygon.voronoi] [Boost.multiprecision] higher precision voronoi
by Weatherby,Gerard 17 Mar '14

17 Mar '14

I'm attempting to following the http://www.boost.org/doc/libs/1_53_0_beta1/libs/polygon/doc/voronoi_advance… to compile boost::polygon::voronoi using 64 bit integer input. I'm using the boost::multiprecision library to do so. Using boost version 1.53 and Microsoft Visual Studio 2012. The error message is: 1>d:\workspace\movingboundary\boost_1_53_0\boost\polygon\detail\voronoi_robust_fpt.hpp(60): error C2665: 'sqrt' : none of the 3 overloads could convert all the argument types 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\math.h(588): could be 'long double sqrt(long double)' 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\math.h(540): or 'float sqrt(float)' 1> C:\Program Files (x86)\Microsoft Visual Studio 11.0\VC\include\math.h(127): or 'double sqrt(double)' 1> while trying to match the argument list '(const boost::multiprecision::detail::expression<tag,Arg1,Arg2,Arg3,Arg4>)' 1> with 1> [ 1> tag=boost::multiprecision::detail::multiplies, 1> Arg1=boost::multiprecision::detail::expression<boost::multiprecision::detail::multiplies,boost::multiprecision::detail::expression<boost::multiprecision::detail::plus,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::plus,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,void,void>,void,void>, 1> Arg2=boost::multiprecision::detail::expression<boost::multiprecision::detail::plus,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,boost::multiprecision::detail::expression<boost::multiprecision::detail::multiply_immediates,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<48>>,void,void>,void,void>, 1> Arg3=void, 1> Arg4=void == reference line is template <typename T> T get_sqrt(const T& that) { return (std::sqrt)(that); //<-- line 60 } == code == #pragma warning (disable: 4996 4267) #include <cmath> #include <boost/multiprecision/cpp_int.hpp> #include <boost/multiprecision/cpp_dec_float.hpp> #include <boost/polygon/voronoi.hpp> #include <limits> #include <gtest/gtest.h> #include <iostream> using namespace boost::polygon; namespace vcellVoronoiImpl { typedef boost::multiprecision::number<boost::multiprecision::cpp_dec_float<48>> floatingType; struct FloatingConverter { template <typename T> floatingType operator( )(T x) const { return static_cast<floatingType>(x); } }; struct compareFloatingType { enum Result { LESS = -1, EQUAL = 0, MORE = 1 }; Result operator()(floatingType a, floatingType b, unsigned int maxUlps) const { if (a > b) { return a - b <= maxUlps ? EQUAL : LESS; } return b - a <= maxUlps ? EQUAL : MORE; } }; struct voronoi_ctype_traits { typedef boost::int64_t int_type; typedef boost::multiprecision::int128_t int_x2_type; typedef boost::multiprecision::uint128_t uint_x2_type; typedef boost::multiprecision::int512_t big_int_type; typedef floatingType fpt_type; typedef floatingType efpt_type; typedef compareFloatingType ulp_cmp_type; typedef FloatingConverter to_fpt_converter_type; typedef FloatingConverter to_efpt_converter_type; }; struct vcell_vd_traits{ typedef voronoi_ctype_traits::fpt_type coordinate_type; typedef voronoi_cell<coordinate_type> cell_type; typedef voronoi_vertex<coordinate_type> vertex_type; typedef voronoi_edge<coordinate_type> edge_type; typedef struct { public: enum { ULPS = 128 }; bool operator()(const vertex_type &v1, const vertex_type &v2) const { return (ulp_cmp(v1.x(), v2.x(), ULPS) == compareFloatingType::EQUAL && ulp_cmp(v1.y(), v2.y(), ULPS) == compareFloatingType::EQUAL); } private: compareFloatingType ulp_cmp; } vertex_equality_predicate_type; }; } using namespace vcellVoronoiImpl; TEST(highv,build) { voronoi_builder<boost::int64_t, vcellVoronoiImpl::voronoi_ctype_traits> vb; voronoi_diagram<boost::int64_t,vcell_vd_traits> vd; vb.construct(&vd); } Gerard Weatherby Appllication Architect Virtual Cell, Center for Cell Analysis and Modeling (CCAM) University of Connecticut Health Center 860-679-2065

3 4

Re: [Boost-users] boost::geometry::index::rtree with CoordinateSystem
by Ola Martin Lykkja 16 Mar '14

16 Mar '14

>> Hi, >> >> I am trying to build a rtree index with a collection of waypoint >> (about 30.000) each represented by longitude and latitude. When I use >> Cartesian coordinates rtree.query works as expected. However the >> results are slightly wrong because of my use of longitude,latitude in >> the cartesian domain. >> >> I then tried to refine the datatypes to use spherical_equatorial and >> geographic CoordinateSystem. Now I encounter two problems: >> a)With geographic, it does not compile. >> b)With spherical_equatorial query(nearest) gives clearly wrong results. >> >> Do you have any clues on what I am doing wrong? > >Everything you're doing is ok. > >The support for coordinate systems other than cartesian is limited for now. As you noticed the nearest query gives >wrong results. Also the internal structure of the rtree may be not-optimal. At least the nearest query for spherical >CS should be fixed in upcoming Boost 1.56. Do you need some quick workaround? > >As for geographic CS, it fails to compile because the default distance strategy isn't defined for this CS. It >probable that distance() is just not implemented yet for geographic CS but I must confirm it. > >Could you please create tickets for those issues? > >Regards, >Adam First: I am pretty impressed with the index::rtree template. It is *VERY* useful in my current project! Thanks for your reply! For my application, I am ok, for the moment, with the relatively small errors that using the cartesian domain gives me. I have created two tickets (9758 and 9759) What is the difference between spherical_equatorial and geographic and spherical? The documentation is rather unclear. Kind regards, Ola Martin

2 1