- Boost - lists.boost.org

Re: [boost] [gsoc17]The implement of Programming competency test From Ruoyun Jing
by Ruoyun Jing 28 Mar '17

28 Mar '17

Hi Adam and Vissarion, During these days I discussed the ideas of project 1 and begin to write my proposal. Here are what I learn about these project. 1.For the approach of compute the 3D cartesian distances first and if these numbers are not "far enough" then fall back to expensive geographic distance calculation otherwise return the result by comparing those numbers obtained by less expensive cartesian compuation. The main problems is declare the "far enough". To figure out this problem, I would implement the method, test the result between function compare_distance and this method, then adjust parameter to limit deviation in an acceptable range(maybe it would be 1e-6 correapongs, the accurate value should be discussed by specific condition) 2.For the approach of perform a local spheroid approximation and return the 2D distance. The main problem is to test the acceptable range of using spheroid approximation. The solution is same as answer above. 3.For the approach of getting 2 intersections of plane (which would be ellipse) with the help given points and compute the respective distances using those ellipses. In my understand of these approach, it means we need to get cross-section through the center of ellipsoid and the geodesic segments. But I am not sure that the geodesic segments of two points whether can get a cross-section through the center of ellipsoid, and whether the cross-section is ellipse that we can calculate the sectorial area easy to compare. After check out the geodesic knowledge from differential geometry for a long time. I got some prove, but I think it isn't very reliable. 4.I have an reliable approach is that we could use the algorithms in "map projection" just like Lambert Conformal Conic, Gauss–Krüger projection, Mercator projection...etc, Those projections make the point on 3D to 2D with reliable functions, although most of these projections use longitude and latitude, we could transform our cartisian coordinate into Spherical coordinate then transform them into longitude and latitude then use the projection to approximately calculate. All of above is what I discussed during these days, Could you please provide me some advise about them so I can strenthen my proposal?And if there has any problems about my poor English description please tell me, I will try my best to explain more clearly:) Thanks all for your reading! Looking forward from you.:) Ruoyun -- Northwest University of China Software Engineering jingry0321(a)gmail.com <jingry0321(a)163.com>

2 3

My Proposal for GSoC
by Mukund Chandra 28 Mar '17

28 Mar '17

Dear Sir, I want you to review the draft of my proposal and suggest me what I should do so that I can work with this project. The project is Project 1 for Boost.Geometry about filtering of compare distance predicates. Here is the link for my Proposal Draft : https://github.com/MukundChandra/Programs-For-GSoC/blob/MukundChandra-patch…

2 1

[gsoc2017] Applying for Boost.Geometry Project 1
by NowhereMan 28 Mar '17

28 Mar '17

Hello, I wish to pursue a path in GSOC 2017 with boost, specifically Project 1 which involves optimization of compare distance predicates. My name is Cody Glassman, a first-year student at my local Community College in Southern California, on a path to obtaining my BS in Computer Science from the University of California system. I am currently working hard developing a concise, yet thorough competency test and am hoping to establish contact with a mentor. Thank you! Cody -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc2017-Applying-for-Boost-Geometry-Pro… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

small_vector alignment
by Tobias Loew 28 Mar '17

28 Mar '17

Hi, I wanted to use a boost::container::small_vector for 64-bit aligned doubles (to be used with SSE): But it seems that the "small-buffer" has a fixed calculated alignment which only depends on the value-type and does not consider the alignment of the (dynamic) allocator. Is this intended or is it a bug in the implementation? best regards Tobias -- View this message in context: http://boost.2283326.n4.nabble.com/small-vector-alignment-tp4692694.html Sent from the Boost - Dev mailing list archive at Nabble.com.

4 5

[geometry] Documentation garbage (Re: [Boost-announce] [release] Boost 1.64.0 Beta 1)
by Mateusz Loskot 28 Mar '17

28 Mar '17

On 23 March 2017 at 15:11, Rene Rivera <boost(a)lists.boost.org> wrote: > Boost release 1.64.0 beta 1 is now available at: > [...] > Please download the beta, give it a try, and report any problems you > encounter. I noticed, the package consists of intermediate files from docs generation process of Boost.Geometry: /libs/geometry/doc/doxy/doxygen_output/html_by_doxygen /libs/geometry/doc/doxy/doxygen_output/xml May I ask how documentation of individual library makes it into the package? /libs/geometry/doc/Jamfile.v2 calls our custom make_qbk.py script which is known to not to do any post-generation clean-ups of intermediate files. Shall we add such cleanup to make_qbk.py or it is not relevant for release process? Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

2 3

[gsoc17]Dynamic Shortest Path Computation
by A.I 28 Mar '17

28 Mar '17

Hi, everyone, I am Donghyuk Kim, a Ph.D. Student at KAIST(Korea Advanced Institute of Science and Technology) in South Korea. I've been studying motion/path planning algorithm and I'd like to contribute to a specific algorithm, "Dynamic Shortest Path Computation" in Boost graph library as a google summer code project. It is a tree-based data structure for maintaining single-source to all destination shortest path. It is also known that it outperforms the recomputation of Dijkstra or A* where insertion and deletion of vertex/edge can frequently happen. Here you can check my brief CV including educational/programming background and my interests. https://www.linkedin.com/in/donghyuk-kim-54223355/ Most of my source codes (research/project-purpose things) are in a private repository by our policy, for this reason, the only thing I can share is the below one: https://github.com/aidyk/SGMP The concept of "Dynamic Shortest Path Computation" was originally introduced in [Fully Dynamic Algorithms for Maintaining Shortest Paths Trees] by D. Frigioni, et al. (http://dl.acm.org/citation.cfm?id=338900) I've already implemented a prototype for my research, but testing, coding style unification and much more c++ style modification are required for general purpose. I hope someone find it interesting and be a mentor in this journey. Thanks in advance! Best Regards, Donghyuk Kim a.i(a)acm.org -- View this message in context: http://boost.2283326.n4.nabble.com/gsoc17-Dynamic-Shortest-Path-Computation… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

GSOC Project
by Umar Ali 28 Mar '17

28 Mar '17

I am a Computer Science student trying to apply with MariaDB in GSOC. I have a basic knowledge of SQL and a deeper understanding of C++, and was wondering whether I would have to come up with a project idea inorder to file a proposal or can i submit a proposal inorder to learn without any deeper understanding of programming languages

3 2

[review queue] Beast Review Date - Request
by Michael Caisse 28 Mar '17

28 Mar '17

Hello Wizards! We would like to schedule the Beast review (already in the queue) for the week of July 1 - July 8. Thanks! michhael -- Michael Caisse Ciere Consulting ciere.com

2 1

[release] Boost 1.64.0 Beta 1
by Rene Rivera 27 Mar '17

27 Mar '17

Boost release 1.64.0 beta 1 is now available at: <https://dl.bintray.com/boostorg/beta/1.64.0.beta.1/source/> The SHA256 checksums are as follows: 8f0ba6b73fad15115049f9b3e7e27eae43be10a94b51a57142f3a27e55ef4beb boost_1_64_0_b1.7z b5c5abf127a3f723dafcc7cf55876c1bda9f014fb1b117f6a7f769e3cc407c4f boost_1_64_0_b1.tar.bz2 a7fe98a9a9f615f6fa68d8ea09ce725d19e3a4fe4719c21c9db29dff88b3b6e3 boost_1_64_0_b1.tar.gz 593005661af8dfe132b2b16bc2cd41339e6acd58456913f353d765090d7868f7 boost_1_64_0_b1.zip For details of what's in the release, see < http://www.boost.org/users/history/version_1_64_0.html>. Note that the links to files on this web page are for the final release - use the link above to get the beta files. There are also pre-built libraries provided by Tom Kent here: <https://dl.bintray.com/boostorg/beta/1.64.0.beta.1/binaries/> Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

11 26

Going insane trying to build boost for android
by Robert Dailey 26 Mar '17

26 Mar '17

How many months has it been of lost google searching, trying to beat b2 into submission. I have no idea at this point how to build boost for Android. Really hoping I get some help here... So to start, here are the versions I'm using: - Android NDK r14b - Boost 1.63.0 I'm doing all of this on Windows 10, through command prompt. I want to use clang and libc++ to build boost for API 15. I figure the easiest way is to generate a standalone toolchain using the NDK, so I did that first: > %ANDROID_NDK%\build\tools\make_standalone_toolchain.py --arch arm --api 15 --stl libc++ "C:\android\_toolchains\arm-api-15" This generated the appropriate toolchain (I think). I then temporarily added this location to PATH: > set PATH=C:\android\_toolchains\arm-api-15\bin;%PATH% Then I ran bootstrap: > bootstrap.bat --with-toolset=clang Then I tried to build boost itself: > b2 --toolset=clang cxxflags="-stdlib=libc++ -std=c++14" threadapi=pthread --prefix=..\boost_android_arm --builddir=./ target-os=linux define=BOOST_FILESYSTEM_VERSION=3 --without-python link=static runtime-link=shared threading=multi variant=release install -j8 However I get failures when it tries to run the clang command: 'C:\code\_third_party\boost_1_63_0\\clang38++.exe' is not recognized as an internal or external command I'm not sure why it's appending that absolute path (that's where my current directory is set to, and where boost source is). It should just be trying to use "clang++" but doesn't look like it is. >From the output, it looks like it's trying to use clang correctly I think: "clang++" -c -x c++ -stdlib=libc++ -std=c++14 -O3 -Wno-inline -Wall -pthread -stdlib=libc++ -std=c++14 -DBOOST_ALL_NO_LIB=1 -DBOOST_FILESYSTEM_VERSION=3 -DBOOST_THREAD_USE_LIB=1 -DNDEBUG -I"." -o "bin.v2\libs\wave\build\clang-linux-android\release\link-static\target-os-linux\threadapi-pthread\threading-multi\cpplexer\re2clex\aq.o" "libs\wave\src\cpplexer\re2clex\aq.cpp" Am I going about this all wrong? How in the heck can I build boost for android using the settings I specified above?

2 4