April 2013 - Boost - lists.preview.boost.org

Re: [boost] What Should we do About Boost.Test?
by legalize+jeeves＠mail.xmission.com 16 Apr '13

16 Apr '13

[Please do not mail me a copy of your followup] Sorry to come late to this party, I usually do not read the developers group on gmane because.... well.... I'm not a boost developer. However, I am a heavy proponent of Boost.Test and a heavy user of it. boost(a)lists.boost.org spake the secret code <m24nmai27z.fsf(a)pluto.luannocracy.com> thusly: >Look, I teach classes on Boost. If Boost.Test is not learnable and >teachable, I have to tell my students to stay away from it. That's >embarrassing for me, and bad for Boost. I wrote the 5-part tutorial on using Boost.Test for TDD: <http://legalizeadulthood.wordpress.com/2009/07/04/c-unit-tests-with-boost-t…> <http://legalizeadulthood.wordpress.com/2009/07/05/c-unit-tests-with-boost-t…> <http://legalizeadulthood.wordpress.com/2009/07/05/c-unit-tests-with-boost-t…> <http://legalizeadulthood.wordpress.com/2009/07/05/c-unit-tests-with-boost-t…> <http://legalizeadulthood.wordpress.com/2009/07/05/c-unit-tests-with-boost-t…> >From the URLs you can see that I wrote those tutorials in the summer of 2009 and it's been one of the most popular articles on my blog. I routinely share them in the C++ newsgroup and in the boost user's gmane newsgroup/list. I wrote them because I thought the documentation made it very difficult to get what you needed from it. At some point after posting this on newsgroups, Gennadiy said he was going to include links to it in the Boost.Test documentation. As far as I know, that never happened. I would be happy to start working on improving the documentation; I always found it to be the weakest part of the library. It works for Gennadiy, but IMO he's too close to the library to see how the documentation doesn't work for newcomers. I've written large technical documents myself (500+ pages on Microsoft's Direct3D which you can read from the link in my signature) and it is difficult to step away from your own expertise and present material in a manner that makes sense to newcomers. I generally recommend people use google mock or some other mocking library in conjunction with Boost.Test. While browsing around in the code I did come across source files mentioning "mocks", but it was so unlike every other approach to mock objects I've seen that I concluded it was only for some sort of internal use to Boost.Test itself. Now I see that it was intended for general use, but even from reading the example source file, I can't say I'd recommend it over google mock or turtle mock from what I understand at this point. Reading this thread, I get the impression that Gennadiy is a little defensive of the library. I guess who wouldn't be, if the thread opened up with a statement to the effect of "let's dump this stuff because it's junk". It is very much the product of one person and maybe that's why it is suffering with so much impedence mismatch with other people's brains. Even though I like Boost.Test, I have gotten mixed signals about contirbutions towards improving it. I asked in the user's group if Gennadiy would accept a patch that would allow me to write my own assertions that supplied file/line information at the point the assertion was invoked instead of at the point the assertion was implemented. I asked on 23 Oct 2012 and didn't get an answer. I asked again a week later and didn't get an answer then, either. This left me without the feeling of "patches are welcome" that boost usually gives me. -- "The Direct3D Graphics Pipeline" free book <http://tinyurl.com/d3d-pipeline> The Computer Graphics Museum <http://computergraphicsmuseum.org> The Terminals Wiki <http://terminals.classiccmp.org> Legalize Adulthood! (my blog) <http://legalizeadulthood.wordpress.com>

2 2

[any] last commit breaks program_options
by Jürgen Hunold 15 Apr '13

15 Apr '13

Hi! It seems that introducing move semantics to Boot.Any in r 83901 breaks compilation of program_options. /home/hunold/src/devel/boost/boost/program_options/variables_map.hpp:58:38: note: no known conversion for argument 1 from ‘boost::program_options::variable_value’ to ‘boost::program_options::variable_value&’ Full build log attached. Any Ideas? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

5 6

GSOC 2013 Parallelized Backend
by Muhammad Junaid Muzammil 15 Apr '13

15 Apr '13

Hello, This is Junaid form National University of Sciences and Technology. I have gone through the GSOC 2013 idea listing. I am pretty much interested in extension of odeint. I am more interested for the parallelization over the GPUs preferably NVIDIA. From the details listed there, it seems that Boost community is more interested in parallelization over the CPUs i.e. much preference is given to OpenMP and MPI. Is that the case here? Regards, Junaid.

2 1

GSOC 2013: Boost.Math Bernoulli Numbers and Applications to Special Functions
by Shubham Gupta 15 Apr '13

15 Apr '13

I am a fourth year Dual Degree (B.Tech+M.Tech) student of Computer Science and Engineering at IIT, Delhi, and would like to express my interest in the project concerned with extending the Boost.Math library to include implementation for Bernoulli numbers. I have read the Wikipedia page for Bernoulli numbers and also some of their applications and definitions. As suggested in the Projects page, I have implemented the Akiyama–Tanigawa algorithm for second Bernoulli numbers and also tested my implementation for the first 10 second Bernoulli numbers using Boost.Test library. Even though I have been using C++ in algorithmic coding competitions for over 2 years, I am still comparatively new to the Boost libraries. I am currently browsing through the capabilities provided by Boost.Math, and also their implementations I would request the concerned mentors and the community to advise me on how to proceed from here, and point out additional things which I can do. -- Shubham Gupta Undergraduate Student Computer Science and Engineering Indian Institute of Technology, Delhi

2 1

[gsoc 2013] What about projects without a mentor?
by Hardy Huang 15 Apr '13

15 Apr '13

Hi! In the boost home page for GSOC 2013, there are some ideas without details and mentors on the bottom of the page, such as some project about algorithms and data structure. Since I am good at algorithm and data structure, knowing that there are some idea projects relative with algorithm and data structure, like radix sort, trie, I want to know something detail about the plan to develop algorithm and data structure. Are these projects involved in gsoc 2013? Can anyone tell me about it, if they were, how can I get more information about them? Thanks very much, I am expecting to receive some useful replies. Best Regards Huang Zhe

1 0

library for uBLabs.. GSOC 2013
by Niranjan Singh 15 Apr '13

15 Apr '13

Hello david, First of all thank you for your kind concern to my proposal. For uBLabs, As I go through the ideas and page, then i see that many challenges are quite interesting projects, and can be done. I would like to work in matrix and vector handling Regarding this here is what I understand and my thought. As its true linear algebra so we have to go as in maths so if we have to multiply two vectors then as it can be represented in matrix (row matrix or column matrix ) form so first of all we have to convert into one form then we have to multiply both the matrix and then convert back to vector form. Simmilarly * can be done with two matrices or one matrix and one vector. For implementing this in c++ we would be needing classes for defining various properties and methods for matrix and vectors. I can be more specific if I know what developments in this have been done, so that we can start with that. with many thanks and regards, Niranjan Singh

1 1

Re: [boost] JSON Parser GSoC 2013
by Stephan Bourgeois 15 Apr '13

15 Apr '13

Michael Marcin wrote: I find the most useful interface is to just provide a datatype you're > expecting and let the json parser try its best to do the right thing. > For example: > string raw_json = R"({ > data:{ > a:"hello", > b:"world", > c:3, > widget:3.5 > } > })"; > [...] > struct my_type5 > { > struct my_data > { > string a; > string b; > int c; > float widget; > } data; > }; > // these should all just work, with maybe a little bit of > // metaprogramming to describe the types to the json library > json::deserialize<my_type5>( json ); I agree. This is, by far, the most intuitive interface. I understand how this can be implemented for data types like map or even Boost.Fusion vector in case of JSON multiple type arrays. However, I have no idea how to implement this in the example above with a struct! Unless of course there is no field name check nor type checking, and the JSON values are just copied sequentially into the struct regardless of field names. Btw I don't even know how to do this without using C++0x extended initializer lists. Otherwise we require some form of reflection in C++. I imagine I should look into Boost.Serialization...? I looked at Boost.Fusion adapt_struct, but that looks quite complicated. Am I missing something? Please let me know what you think. Kind regards, Stephan.

2 1

gsoc project
by Shamsher Siddiqui 14 Apr '13

14 Apr '13

i know c++ well and i like algorithm very much .So I have chosen 1)Algorithms 2)Boost.Chrono/Date I would like to work on this project this summer . I have read https://svn.boost.org/svn/boost/sandbox/chrono_date/libs/date/doc/date.html this plz give me how to start developing. I have completed the Algorithm course in my major and pretty good at it .help me in this project so that i can on this project

2 3

[gsoc 2013] Boost.odeint project
by Artemy Margaritov 14 Apr '13

14 Apr '13

Hello. My name is Artemy Margaritov. I am a third year student of Moscow Institute of Physics and Technology and I'd like to participate in Gsoc this year. I have some questions to start with. 1. Are the parts "Implicit Routines" and "Parallelized Backends" of Boost.odeint project separate tasks? 2. Is it possible for two students to be enrolled in Boost.odeint (one student to "Implicit Routines", another to "Parallelized Backends")? -- Best regards, Artemy Margaritov

2 1

Re: [boost] GSOC 2013
by Antony Polukhin 14 Apr '13

14 Apr '13

2013/4/14 Niranjan Singh <niranjan32331(a)gmail.com>: > Hello sir, > > Sorry for not being clear in my previous message , here I want to propose > you two ideas..which we can work on > > 1. Implementing a graphical interface for problems so that all outputs can > be viewed by user in a good way. Algorithms will be the same like Dijkstra's > , Bellman ford , Kruskul e.t.c as they are already present in BGL. BGL can output to DOT format (the one that is used by graphviz to visualize graphs). Are you going to improve that output or proposing something absolutely different? > 2. Implementing algorithms for Travelling Salesman problem or Chinese > postman problem, Job scheduling or Edge colouring. This sounds interesting. Can you write code using same approaches as in Boost.Graph? See some sources of BGL, get the idea of how it works. > P.S: Actually Sir I have many ideas in my mind, that's why I tell them > whichever be the best or worth full. :)) > > with many thanks > Niranjan Singh See this link https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate and fill a proposal. This link may also help https://svn.boost.org/trac/boost/wiki/SoCHints -- Best regards, Antony Polukhin

1 0