- Boost - lists.preview.boost.org

[gsoc-2013] Boost.uBLAS
by Jignesh Jain 17 Apr '13

17 Apr '13

I am interested in this project for Gsoc, which involves unification of vector and matrix libraries. I have been browsing boost ublas code, but have no idea about how should I begin as I am totally new to Boost. Can Someone please guide me some approach for getting started in this project. Thank you.

2 1

[log] Segfault in "rotating_file" example
by Jason 16 Apr '13

16 Apr '13

I'm working from SVN trunk revision 83923. I've been experiencing segfaults when trying to set up a file sink that has date/time format specifiers in its file name. I thought I was doing something wrong, but I found that the "rotating_file" example also illustrates the same behavior. Here is a sample backtrace: #0 0x000000000077c0b8 in ?? () #1 0x0000000000415d25 in boost::date_time::microsec_clock<boost::posix_time::ptime>::create_time (converter=0x77c0b8) at /code/env/include/boost/date_time/microsec_time_clock.hpp:100 #2 0x00000000004d628b in boost::log::v2s_mt_posix::sinks::(anonymous namespace)::date_and_time_formatter::operator()(std::string const&, unsigned int) const [clone .isra.401] () #3 0x00000000004d639a in boost::log::v2s_mt_posix::aux::light_function<std::string (unsigned int)>::impl<boost::_bi::bind_t<boost::_bi::unspecified, boost::log::v2s_mt_posix::sinks::(anonymous namespace)::date_and_time_formatter, boost::_bi::list2<boost::_bi::bind_t<boost::_bi::unspecified, boost::log::v2s_mt_posix::sinks::(anonymous namespace)::file_counter_formatter, boost::_bi::list2<boost::_bi::value<std::string>, boost::arg<1> > >, boost::arg<1> > > >::invoke_impl(boost::log::v2s_mt_posix::aux::light_function<std::string (unsigned int)>::impl_base*, unsigned int) () #4 0x00000000004d3c90 in boost::log::v2s_mt_posix::sinks::text_file_backend::consume(boost::log::v2s_mt_posix::record_view const&, std::string const&) () #5 0x00000000004206c6 in boost::log::v2s_mt_posix::sinks::basic_formatting_sink_frontend<char>::feed_record<boost::log::v2s_mt_posix::aux::fake_mutex, boost::log::v2s_mt_posix::sinks::text_file_backend> (this=this@entry=0x783600, rec=..., backend_mutex=..., backend=...) at /code/env/include/boost/log/sinks/basic_sink_frontend.hpp:445 #6 0x000000000042082f in boost::log::v2s_mt_posix::sinks::basic_formatting_sink_frontend<char>::try_feed_record<boost::mutex, boost::log::v2s_mt_posix::sinks::text_file_backend> (this=0x783600, rec=..., backend_mutex=..., backend=...) at /code/env/include/boost/log/sinks/basic_sink_frontend.hpp:489 #7 0x00000000004c1475 in boost::log::v2s_mt_posix::core::push_record_move(boost::log::v2s_mt_posix::record&) () #8 0x000000000040dff1 in push_record (this=<optimized out>, rec=...) at /code/env/include/boost/log/core/core.hpp:308 #9 push_record_unlocked (rec=..., this=<optimized out>) at /code/env/include/boost/log/sources/basic_logger.hpp:268 #10 push_record (rec=..., this=<optimized out>) at /code/env/include/boost/log/sources/basic_logger.hpp:582 #11 ~record_pump (this=0x7fffffffddc0, __in_chrg=<optimized out>) at /code/env/include/boost/log/sources/record_ostream.hpp:279 #12 main (argc=<optimized out>, argv=<optimized out>) at main.cpp:84 Looking at the disassembly of where the segfault happens, it seems to have gone off the rails and is executing invalid code. Specifically, the function pointer "converter" inside the date_time::microsec_clock<>:create_time() function seems to be invalid. Any ideas? I'm using gcc 4.7.2 on Ubuntu 12.10. Jason -- View this message in context: http://boost.2283326.n4.nabble.com/log-Segfault-in-rotating-file-example-tp… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 4

[smart_ptr] No more shared_ptr<T>::value_type?
by Andrew Hundt 16 Apr '13

16 Apr '13

I updated from boost 1.52 to 1.53 and it appears that the typedefs have been removed, I couldn't find any mention of it in the release notes, and I searched the list for shared_ptr value_type and saw no mention of the change there. Was this a deliberate change? This breaks a *lot* of code for me, and will make more difficult for me to convince my team to continue to use boost or upgrade in the future because they are very apprehensive of breaking changes. I understand if it has been removed to be C++11 compliant but I expected some warning before breaking changes like this. boost::thread and boost::filesystem are good examples of changes that were made with solid advance notice. This caught me completely by surprise, did I miss something obvious? Could someone point me to the recommended alternative as well? 1.52 has typedef T value_type: http://www.boost.org/doc/libs/1_52_0/boost/smart_ptr/shared_ptr.hpp 1.53 does not: http://www.boost.org/doc/libs/1_53_0/boost/smart_ptr/shared_ptr.hpp Thanks for your help! Cheers! Andrew Hundt

3 3

Windows Binary Builds
by Tom Kent 16 Apr '13

16 Apr '13

A couple months ago some of us got an e-mail from Dave Abrams saying that since BoostPro was going to be shutting down, there wouldn't be anyone maintaining the windows binary installer that they had been offering. Since I have been making windows binaries available on my site for the last several releases [http://boost.teeks99.com] he suggested that I take this over. I currently have a simple zip file (self extracting though) that just grabs all the 32 bit or 64 bit binaries...and they're huge, 6-8GB installed. So going forward I've built a system to make one installer for each tool/architecture: msvc-8.0-32, msvc-9.0-32, msvc-10.0-32, msvc-11.0-32, msvc-8.0-64, msvc-9.0-64, msvc-10.0-64, msvc-11.0-64. In addition to the binaries for that architecture, I would also include the boost release inside the installer. This way it is a single download/single install for everything an end-user developer would need (for each architecture). If a user wants multiple architectures, he/she can run multiple installers and they will instill on top of each other (with seperate lib directories for each set of binaries...for example: boost_1_53_0/lib_32-msvc-8.0 and boost_1_53_0/lib_64-msvc-11.0). All the scripts I use to build these (assume visual studio pro 8.0, 9.0, 10.0, and 11.0) are on my github account at: https://github.com/teeks99/boost-build If you want to see for yourself, I have the 1.53 installers on my website at: http://boost.teeks99.com/bin/boost_1_53_0-msvc-8.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-9.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-10.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-11.0-32.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-8.0-64.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-9.0-64.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-10.0-64.exe http://boost.teeks99.com/bin/boost_1_53_0-msvc-11.0-64.exe If we like this going forward, I'd be happy to upload these to sourceforge for each release, instead of having to go to my site for them. Thoughts? Tom Kent

5 9

Reading uBLAS Documentation
by Yosef Hamza 16 Apr '13

16 Apr '13

i'm little confused here ... should i read the documentation in the same sequence they are written ?(i started that way and i'm having a hard time but still on it) or should i start from (Storage and Special Containers) and down? Thanks in advance!

1 0

Google Summer of Code 2013 - Boost.org - Boost.Multiprecision
by Saurav 16 Apr '13

16 Apr '13

Hi! I am a CS undergraduate student and I really want to work on Boost.Multiprecision<https://svn.boost.org/trac/boost/wiki/SoC2013#Boost.Multiprecision>. C++ has been my favorite programming language and I find GSoC 2013 a wonderful opportunity to create something valuable with it, while getting some 'value' out of it for myself. I like learning new things and trying to find out better ways of doing existing things. I like coding and listening to music (sometimes simultaneously too). Greetings to the entire Boost community. And Thank you! I really appreciate the great work Boost is doing for the rest of us, and I want to be on the other side now, and do something for the rest of them. That's all from my side. I wish to get through to Christopher Kormanyo, the mentor for the project I am interested in, to discuss more specifically about the further steps. Thanking you all once again, Best regards, Saurav

3 4

What Should we do About Boost.Test?
by Dave Abrahams 16 Apr '13

16 Apr '13

Hi All, I was just going through Boost.Test to try to figure out how to teach it, and while it looks to have substantial value, it is also in quite a mess. It contains loads of features that are exercised in the examples/ directory but neither included in any of the tests nor documented. There are facilities for command-line argument parsing! There are "decorators" that turn on/off features for test cases. There is support for mock objects! These are cool and sometimes necessary features, but who knew? The third tutorial page (http://www.boost.org/doc/libs/1_51_0/libs/test/doc/html/tutorials/new-year-…) has a glaring typo in the code examples: "BOOST_AUTO_EST_CASE". There's no reference manual at all. There are nearly-identical files in the examples/ directory called "est_example1.cpp" and "test_example1.cpp" (Did the "t" key on someone's keyboard break?) I could go on, but where would I stop? I don't know what to do about this. Because of the lack of redundancy (i.e. tests and documentation), it's hard to tell whether this library is correct or even to define what "correct" should mean. It seems like, as long as the code is incompletely / incorrectly documented and tested, it's just someone's personal coding project that we happen to keep shipping with Boost, and not really a library for general use. This situation reflects poorly on Boost as a whole and the fact that it centers around a _testing_ library, which is concerned with robustness... well, let's just say that the irony isn't lost on me. I don't mean this posting as an attack on Gennadiy in any way, but I think the situation is unacceptable and therefore am opening a discussion about what should happen. As a straw man, I'll make this suggestion: - Boost.Test is officially deprecated in the next release - Its documentation, such as it is, is removed from the release after that - Meanwhile, other tests in Boost that use this library are rewritten to use a different mechanism - The code is removed from Boost thereafter I am not at all attached to removing Boost.Test from Boost, but IMO rescuing it would require a significant new investment of time and energy from people who are committed to bringing the library up to par with the rest of what we do. (I seriously thought about volunteering for this myself, but realistically speaking, I don't have the time, and volunteering for something you can't actually do is worse than not volunteering at all.) Even if volunteers show up, I'd suggest proceeding with the plan above, subject to reversal at any time the work actually gets done. Thoughts? -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

34 85

[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

[preprocessor] BOOST_PP_OVERLOAD not defined if variadic macros not supported.
by Mostafa 14 Apr '13

14 Apr '13

I just found out the hard way that BOOST_PP_OVERLOAD is "silently" not defined if variadic macros are not supported , ie in c++03. This led to quite a frustrating session of debugging on the premise that there's something wrong with my include paths/environment variables. It would be very nice if BOOST_PP_OVERLOAD errored explicitly if variadic macros were not supported by the compiler, or at lease have a gentle reminder to the reader in BOOST_PP_OVERLOAD documentation (and, where appropriate, in other places) that variadic macros are only standard in c++11 and may not be supported on all compilers, hence one might get a BOOST_PP_OVERLOAD undeclared error. Mostafa

4 10

GSOC 2013 . BOOST GLB
by Niranjan Singh 14 Apr '13

14 Apr '13

@antoshk Hello sir, As I go through the graph library of boost, everything seems to be done like all major algorithms for graphs. That's pretty good however we can use it to implement a structure of methods which deals with problems like Chinese postman problem, Decision making poblem , Project management.,Graph partitioning and clustering , Distribution of Eigen values and compression e.t.c With graph we can solve friend-of-friend problems and also implement a simple command line social network based on c++ with the help of graphs. This would be really interesting. However shortest path algorithms can be implemented from one cutting plane algorithm , and Ant algorithm. It would be better if we can change the input and output display by using graphics so that user gets an interactive output of graph. With these graph techniques and algorithms can be use for calculating polynomials time verification via hamiltonian cycles and NP problems. May be useful in Boost uBLabs. with many thanks and regards Niranjan Singh

1 0

GSOC 2013
by Niranjan Singh 14 Apr '13

14 Apr '13

@antoshk Hello sir, As I go through the graph library of boost, everything seems to be done like all major algorithms for graphs. That's pretty good however we can use it to implement a structure of methods which deals with problems like Chinese postman problem, Decision making poblem , Project management.,Graph partitioning and clustering , Distribution of Eigen values and compression e.t.c With graph we can solve friend-of-friend problems and also implement a simple command line social network based on c++ with the help of graphs. This would be really interesting. However shortest path algorithms can be implemented from one cutting plane algorithm , and Ant algorithm. It would be better if we can change the input and output display by using graphics so that user gets an interactive output of graph. With these graph techniques and algorithms can be use for calculating polynomials time verification via hamiltonian cycles and NP problems. May be useful in Boost uBLabs.

1 0

GSOC 2013
by Niranjan Singh 13 Apr '13

13 Apr '13

Hello, My name is Niranjan , It was really a pleasure seeing a poject like this, and the ideas were also very good. I like to contribute to the vector ,making new matrix class. I would like to propose you my idea as below As *Graph theory* as a subject also and is becoming increasingly significant as it is applied to other areas of mathematics, science and technology. It is being actively used in fields as varied as *biochemistry (genomics), electrical engineering (communication networks and coding theory), computer science (algorithms and computation) and operations research (scheduling).* The powerful *combinatorial methods* found in graph theory have also been used to prove fundamental results in other areas of pure mathematics. And so is becoming an important subject in mathematics and algorithms also. So I was thinking to make a library to implement all the graph functions and its various properties and applications in it so that it can be used by student to understand the concept and it can also be used to solve problems like *Travelling Salesman problem, finding chromatic number, edge colouring. * Finding *shortest path , face colouring* e.t.c. With the help of small functions user can create a program which tackles the big problem. Lots of data-structures can also be implemented. Thanks. P.S. Sir, As my end semester are exams are on .. so its possible that i couldn't reply you fast but I do want to do this project. Exams will over on 30 april.. Thanks for you concern.

4 3

Niranjan Singh has invited you to open a Google mail account
by Niranjan Singh 13 Apr '13

13 Apr '13

I've been using Gmail and thought you might like to try it out. Here's an invitation to create an account. You're Invited to Google Mail! Niranjan Singh has invited you to open a Google Mail account. Google Mail is Google's free email service, built on the idea that email can be intuitive, efficient and fun. Google Mail has: *Less spam* Keep unwanted messages out of your inbox with Google's innovative technology. *Lots of space* Enough storage so that you'll never have to delete another message. *Built-in chat* Text or video chat with Niranjan Singh and other friends in real time. *Mobile access* Get your email anywhere with Google Mail on your mobile phone. You can even import your contacts and email from Yahoo!, Hotmail, AOL or any other web mail or POP accounts. Once you create your account, Niranjan Singh will be notified of your new Google Mail address so you can stay in touch. Learn more<http://mail.google.com/mail/help/intl/en/about.html>or get started<http://mail.google.com/mail/a-b2df9a7699-186fc6feff-CUGUbjU3pJUkhZ0HbL1w6xE…> ! Sign up<http://mail.google.com/mail/a-b2df9a7699-186fc6feff-CUGUbjU3pJUkhZ0HbL1w6xE…> Google Inc. | 1600 Amphitheatre Parkway | Mountain View, California 94043

1 0

JSON Parser GSoC 2013
by Stephan Bourgeois 13 Apr '13

13 Apr '13

Hi everybody, I am studying for an MSc in Computer Science at Oxford Brookes University. I have taken a compiler construction course this year and I am therefore interested in the JSON Parser idea for the Boost library. Open Source JSON parsers have already been implemented in C++ and in Java. Examples of Java libraries are: Gson, quick-json. Even if other libraries already exist, developers who are using Boost for their project will appreciate having a JSON parser within Boost. >From a compiler construction background, writing a JSON parser is not difficult. The JSON grammar is simple and the specification is easy to find. Potential difficulties can exist with robustness of error handling and recovery. The question is what data structure we should use to represent JSON objects, and how the user can access key/value pairs in those objects. (examples: Boost.PropertyTree, pre-existing C++ object, ...) Ideally we should offer validating and non-validating implementations. We should also offer JSON generation as well as parsing. Let me know what you think. Kind regards, Stephan.

10 14

Regarding proposal for GSOC
by Niranjan Singh 12 Apr '13

12 Apr '13

If I have to send my proposal for the poject in GSOC then whom should I mail. This link only or is there some other email. Thanks

2 1

JSON Parser GSoC 2013 (part 2)
by Stephan Bourgeois 12 Apr '13

12 Apr '13

Hi everybody, thank you for all your replies. I will try to summarize my impressions so far: 1. Although there is a solution in Boost.PropertyTree, a majority of users consider it to be incomplete, and quite a few developers are using external libraries at present. 2. As Bjorn Reese pointed out, a solution should offer several different interfaces. Some being already implemented in the protoc library. Michael Marcin suggested that something similar to JsonFX in C# be added to Bjorn's list. 3. There is already a Lexer implementation as part of the tokenizer API in protoc. This is how I imagine I could contribute to the project: 1. Collect requirements for functionality and interfaces. 2. review existing Java, C++, C#, Android library solutions. 3. Write a Parser with error recovery using the Lexer from the protoc library. Or adapt an existing parser if there is a good reason for doing so. 4. review JSON specific issues like type casting and how to deserialize arrays with multiple types. (see posts by Arindam Mukherjee and Michael Marcin on deserialization) 5. With the help of my mentor, implement the different interfaces, preferably in a modular way. (I know an example of this in compiler design using the visitor pattern for code generation) Please don't be offended as I only had the time to have a quick look at a single library. I understand that I need to look at a wider code base from other libraries and familiarize myself with general issues related to JSON and serialization. Bjorn Reese offered to mentor this project, please let us know if someone more "officially involved" with Boost needs to approve this. Please let me know what you think. Stephan

1 0

[gsoc-2013] Physics Library Abstraction Layer
by Preston Hamlin 12 Apr '13

12 Apr '13

Hello, my name is Preston Hamlin and I am a current CS undergraduate at the Florida State University. I was reading over the list of ideas provided and then referenced the source code libraries to get a feel for what was being asked for. I found the prospect of writing an abstraction layer for PhysX or related libraries to be interesting. I am somewhat familiar with THREE.js which is an abstraction of WebGL. In THREE.js there is a heavy amount of abstraction to the degree of providing geometric primitives, particles effect presets, simple materials and basic data structures (matrices, vectors, etc...). Given the platform that THREE.js operates on, such a degree is understandable. How much of the physics library is to be abstracted away in generic structures and functions? I would think that having a few simple primitives (cube, low-poly sphere, etc...) would be required since they are commonly used. However more advanced meshes like a torus might be better produced through using modifiers on said primitives rather than a built-in preset. I think the degree of abstraction is most important for modifiers, and I desire to get a feel for what is being looked for. I assume the end goal is to be able to produce Blender/Unity/3dsMax usable code as well as standalone utilities. Many thanks, -Preston

4 7