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

'Hashable' concept for type erasure
by Samuel Christie 25 Mar '14

25 Mar '14

Hello, I've been trying to add a 'hashable' concept to one of my type erasure requirements, but I haven't been getting anywhere and I still don't understand the voluminous error messages enough to make any progress. Here's approximately what I tried so far: namespace mpl = boost::mpl; namespace te = boost::type_erasure; template<class T> struct hashable { static size_t apply(const T& obj) { return std::hash<T>()(obj); } }; namespace std { template<> class hash<t>{ public : size_t operator()(const test &t ) const { return te::call(hashable<test>(), t); } }; }; typedef mpl::vector< ... hashable<te::_self>, ... > requirements typedef any<requirements> test; namespace std { template<> class hash<test>{ public : size_t operator()(const test&h ) const { return te::call(hashable<test>(), h); } }; }; I also tried something else, similar to the following: template<class C> struct hashable { static std::size_t apply(const C& c) { return c.hash(); } }; namespace boost { namespace type_erasure { template<class C, class Base> struct concept_interface<hashable<C>, Base, C> : Base { std::size_t hash() const { return call(hashable<C>(), *this); } }; } } // ... similar requirements / typedef as above namespace std { template<> class hash<test>{ public : size_t operator()(const test &t ) const { return t.hash(); } }; }; The first one is probably just wrong, and for the second one I'm getting some failed assertions when I try to use it with an implementation of hash that is: size_t hash() const { //coord is a member std::vector<int> return boost::hash_range(coord.begin(), coord.end()); } Any help would be most useful. -sc

2 9

[ANN] CppCon 2014 Call for Submissions
by Boris Kolpackov 25 Mar '14

25 Mar '14

Hi, 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 and so we invite you to present. Have you learned something interesting about C++, maybe a new technique possible in C++11? Or perhaps you have implemented something cool related to C++, maybe a new C++ library? If so, consider sharing it with other C++ enthusiasts by giving a talk at CppCon 2014. Submissions deadline is May 15 with decisions sent by June 13. For topic ideas, possible formats, and submission instructions, see the Submissions page: http://cppcon.org/submissions/ Hope to hear you speak! Boris

1 0

[GSoC 14] Request community to rank proposals
by Niall Douglas 24 Mar '14

24 Mar '14

Dear Boost Community, The Google Summer of Code 2014 proposals for Boost are in, and we would deeply appreciate the community's help in ranking the proposals according to merit before the 1st of April. To vote, the process is easy: 1. Go to this page https://www.google-melange.com/gsoc/homepage/google/gsoc2014 and click the "Log in" button under Mentors and Administrators. 2. Now click "Create Profile" on the same page. Note that even if you registered last year, you must register again in 2014. Fill in the form. Note that after submitting it drops you at "Edit Profile", which is confusing. 3. Click "My Dashboard", then "Connect with organisations". 4. Choose "Boost C++ Libraries". 5. In the message box, write this: "I am a member of the Boost community and the email(s) I normally post to boost mailing lists with is <email>" filling in the email address(es) you normally use to post to boost mailing lists. This lets us verify that you are indeed a long standing member of the Boost community. 6. Once we approve your request, you will get an email with the subject "Welcome as organisation member". You can now return to the Dashboard on the GSoC website where there will be a new item "Proposals". 7. Work your way through as many of the 42 proposals as you can. You can score them using the stars at the bottom of each proposal page, taking care to read any comments by the mentors and students if present. PLEASE try to rank some of the lowest scored proposals, every year we get a lot of people who only rank the top five and don't bother with the rest. Try to score on the basis of (i) proposal quality and your best estimate of the student's capability (ii) if the student came early to the mailing lists to ask for help writing the proposal (the mentors who helped them with their proposals have usually indicated this in the private comments) (iii) usefulness/appropriateness of the feature or work being proposed. Remember a good GSoC is more about getting promising new engineers into Boost and C++ than necessarily getting code to pass Boost peer review in a single summer. 8. Optional: If a proposal looks especially great to you and you feel able to mentor a student this year, please slide the "wish to mentor" button. Just because a proposal already has willing mentors does NOT mean you should not add yourself - we have at least two mentors with many attached very highly ranked proposals and we really don't want to have to reject an outstanding proposal just because we can't find the mentors for it as no mentor can realistically mentor more than two projects simultaneously. As you know, Google Summer of Code is usually worth $35,000 - $50,000 to Boost each year, and a successful GSoC raises our visibility and reputation in the wider open source community. Our thanks to you in advance for taking the time to vote. Niall Douglas Boris Schäling --- Boost C++ Libraries Google Summer of Code 2014 admin https://svn.boost.org/trac/boost/wiki/SoC2014

1 0

[boost-build] building dependencies that use makefiles
by Mauricio Carneiro 24 Mar '14

24 Mar '14

I am using boost-build to build my project, but I have added a static library as a dependency that is built using GNU make. If I build this library manually, I can link it to my project in boost build using this simple Jamfile: lib hts : : <link>static <file>lib/lib.a : : <include>lib_headers ; Is there a way to tell boost-build to run make on the directory if the lib/lib.a is not present there? Thank you, Mauricio Carneiro, Ph.D. http://www.broadinstitute.org/~carneiro/

2 4

lexical_cast between double and string slow in Visual Studio 2013
by David Roberts 24 Mar '14

24 Mar '14

In Boost 1.54 I have noticed that lexical_cast from double to string and back is much slower in Visual Studio 2013 (Visual C++ 12) than it was in Visual Studio 2010 (Visual C++ 10). The following test program demonstrates the problem: #include <boost/lexical_cast.hpp> #include <string> int main (int, char **) { for (double count = 0.0; count < 1000000.0; count += 1.41) { std::string result(boost::lexical_cast<std::string>(count)); count = boost::lexical_cast<double>(result); } return 0; } It can be built at the Visual Studio command prompt using: cl /O2 /EHsc /DNDEBUG /I\some\path\boost-1_54 lexcast.cpp to give the program lexcast.exe. When built with Visual Studio 2013 this program takes about 10 seconds to run on my machine. When built with Visual Studio 2010 it takes about 3 seconds. Is this already a known issue? If not I can do a bit more investigation to narrow down why it's so much slower, but I don't want to waste my time if this has already been done. Thanks, David

2 1

About log example in visual studio 2008
by Xiande Cao 24 Mar '14

24 Mar '14

Hi, Experts, I was trying to run the log basic usage (libs/log/example/basic_usage/main.cpp) example in visual studio. And it crashed at line logging::add_console_log(std::clog, keywords::format = "%TimeStamp%: %Message%"); Stopped at // For compatibility with Boost.Log v1 we recognize %_% as the message attribute name const std::size_t len = end - begin; if (std::char_traits< char_type >::length(constants::message_text_keyword()) == len && std::char_traits< char_type >::compare(constants::message_text_keyword(), begin, len) == 0) { m_AttrName = log::aux::default_attribute_names::message(); } else { m_AttrName = attribute_name(log::aux::to_narrow(string_type(begin, end))); } Anybody has successfully run the example? Thanks! Regards, Triston

2 6

Boost and Android NDK
by Philipp Kraus 24 Mar '14

24 Mar '14

Hello, I would like to use Boost on Nexus tablets. I have used Boost at the moment on desktop systems (OSX, Linux, Windows), so my question can I use Boost e.g. random, asio, ublas, … on a Nexus? I would like to build Boost myself, so imho I must build Boost with the NDK compilers and linker, is this correct? Can I build Boost libs in "one shot"? So the NDK has got tools for arm-linux, mipsel-linux and so on. Does anybody can tell me any hopeful tips to use Boost with Android Thanks Phil

6 6

Fwd: Reg: named group finding using boost..
by swati upadhyaya 24 Mar '14

24 Mar '14

---------- Forwarded message ---------- From: swati upadhyaya <swatiupadhyaya(a)gmail.com> Date: Mon, Mar 24, 2014 at 11:33 AM Subject: Reg: named group finding using boost.. To: Boost...(a)lists.boost.org Hi @all, I have write a piece of code where I have a patter and a message and I have to fined the group name as well as match. With boost I am able to find the matches but *Is there a way to get a list or whatever of named captures/groups? * *I have check with re2 its present there but boost is much faster than re2.With glib also we dont have option for capturing group.. *

1 0

Re: [Boost-users] [Boost][Range] Immutable range
by Albert Yiamakis 22 Mar '14

22 Mar '14

Hello, Thanks for reply. However, the second method of extending a range: http://www.boost.org/doc/libs/1_55_0/libs/range/doc/html/range/reference/ex… states that specializing both metafunctions is necessary. In particular this: https://gist.github.com/Kojirion/9714131 fails to compile. It will compile - and produce correct result - by commenting out all lines (ie defining a mutable iterator, which really isn't...) Albert

1 0

[Boost][Range] Immutable range
by Albert Yiamakis 22 Mar '14

22 Mar '14

Hello, As far as I can tell from the documentation, it is not possible to create a range with const iterators only. Is this correct? Would it not make sense to have such a range that can be used with non-mutating algorithms only? Albert

2 1

Bind to a member's class method.
by Konrad Rybacki 21 Mar '14

21 Mar '14

Hi, I am rather beginner at boost - I am trying to achieve functionality similiar to property getter/setter from managed languages like C#. I have written the following code: #include "boost\lambda\bind.hpp" #include "boost\variant.hpp" #include "boost\optional.hpp" #include <iostream> #include <map> class Test { public: boost::optional<boost::variant<int, std::string>> m_value; }; int _tmain(int argc, _TCHAR* argv[]) { Test t1, t2; auto b1 = boost::lambda::bind(&Test::m_value, boost::lambda::_1); auto b2 = boost::lambda::bind(Test::m_value::get_value_or, boost::lambda::_1, "empty"); b1(t1) = "Test value"; std::cout << b2(t1); // "Test value" std::cout << b2(t2); // Should be "empty" return 0; } Unfortunately the compilers says: boost_tests.cpp(32): error C3083: 'm_value': the symbol to the left of a '::' must be a type boost_tests.cpp(32): error C2039: 'get_value_or' : is not a member of 'Test' boost_tests.cpp(22) : see declaration of 'Test' boost_tests.cpp(32): error C2065: 'get_value_or' : undeclared identifier boost_tests.cpp(32): fatal error C1903: unable to recover from previous error(s); stopping compilation I'd like to create a bind to Test::m_value.get_value_or() function with the first parameter set to "empty" - any ideas how to achieve that? Regards, Konrad.

2 4

passing pointer as function arg using boost::bind
by Lane 21 Mar '14

21 Mar '14

I'm having a problem passing a pointer as an arg via boost::bind and was hoping anyone could help out. I was able to pass 'a' just fine, but the second arg 'b' I'm having a problem with. Here is what I have. -- namespace NS { class MyThread { int doIt(NS::A a, B *b); // ... A a; B *b = new B(); NS::MyThread f_thread; boost::thread workerThread(boost::bind(&NS::MyThread::doIt, &f_thread, boost::ref(a), boost::ref(b))); Any help much appreciated.

3 2

[lockfree] spsc_queue unqiue_ptr
by Michael Marcin 21 Mar '14

21 Mar '14

Can you store unique_ptrs in a spsc_queue?

2 1

[log] BOOST_LOG_GLOBAL_LOGGER_* in DLL
by Michael Marcin 21 Mar '14

21 Mar '14

I'm trying to use BOOST_LOG_GLOBAL_LOGGER_DEFAULT( my_logger, boost::log::sources::severity_logger_mt<boost::log::trivial::severity_level> ) In a dll but it doesn't appear to be getting initialized. The first BOOST_LOG_SEV results in a crash due to core being null. How do I initialize a global logger in a DLL?

3 6

[Fusion] Issue with map and c++11 (ticket 9455)
by Chris Crickmar 20 Mar '14

20 Mar '14

https://svn.boost.org/trac/boost/ticket/9455 I posted this bug report a few months ago and thought I'd follow up on the mailing list to highlight it. To summarise, in-place construction of a class containing a fusion map is broken since 1.55 with gcc 4.8/4.7 in c++11 mode. The problem is not present with c++11 mode disabled or when using previous boost versions (tested with 1.51 & 1.54). I re-tested this issue today using git master and the issue is still present. Chris Crickmar

2 1

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