- Boost - lists.preview.boost.org

[interprocess] [container] Can iterator hold raw-pointer instead of offset_ptr?
by TONGARI 29 Apr '13

29 Apr '13

Hi there, When putting containers in shared memory, offset_ptr is used internally, and IIUC, the iterator of the container will also use offset_ptr. But it seems to me that in most cases we only use iterator locally rather than putting those iterators in shared memory as well, so the plain-old-raw-pointer is sufficient and hopefully more efficient for iterator's usage. What do you think?

3 4

[gsoc 2013] Approximate string matching
by Jan Strnad 29 Apr '13

29 Apr '13

Hi, I'm Jan Strnad, currently a Master's student at CTU in Prague, Czech Republic. This summer, I would like to participate in GSOC and I believe that approximate string matching is a good match for me, since my background i this area is quite strong. Now more specifically. I would like to implement approximate string matching algorithm(s) based on the NFA. I would like to support various approximate distances, such as Hamming distance [1], Levenstein distance [2], Damerau-Levenstein distance [3], Delta distance, Gamma distance and finally (delta, gamma) distance. Sorry no explanation of the last three found on the Web, but I can provide one if interested. In the matter of NFA implementation, I would probably choose dynamic programming approach, but I'm thinking of shift-or algorithm as well. Can I ask you for any kind of thoughts or feedback regarding this topic? Best regards, Jan Strnad [1] http://en.wikipedia.org/wiki/Hamming_distance [2] http://en.wikipedia.org/wiki/Levenstein_distance [3] http://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance

7 19

[Property Map] put_get_helper, keys are passed by value
by ilker 29 Apr '13

29 Apr '13

Hello, I require a pm which returns passed key (itself or a 'part' of it) as mapped value. For this purpose I wrote another helper since boost::put_get_helper's put function passes keys by value. // Pasted as a reminder template <class PropertyMap, class Reference, class K, class V> inline void put(const put_get_helper<Reference, PropertyMap>& pa, K k, const V& v) { static_cast<const PropertyMap&>(pa)[k] = v; } Is there any way to accomplish this by not introducing another custom helper ? (may be there already something similar exists in boost) Thanks. -- View this message in context: http://boost.2283326.n4.nabble.com/Property-Map-put-get-helper-keys-are-pas… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[operators] What is the correct overload set for a binary operator?
by Daniel Frey 28 Apr '13

28 Apr '13

Hi, after some more experiments, I convinced myself that I should explore the option of returning an rvalue (not an rvalue reference) in all cases when implementing operator+ based on operator+= (as an example). But I wonder what the most efficient overload set would look like. With this post I'll concentrate on same-type operations (T+T). Given a class T with operator+= like this: T& T::operator+=( const T& ); T& T::operator+=( T&& ); // if useful the class provides it and it should be used if applicable I think the following is currently the best overload set for operators: T operator+( T lhs, const T& rhs ) { lhs += rhs; return lhs; // no std::move needed } T operator+( T&& lhs, T&& rhs ) { lhs += std::move( rhs ); return std::move( lhs ); } T operator+( const T& lhs, T&& rhs ) { #ifdef COMMUTATIVE rhs += lhs; return std::move( rhs ); #else T nrv( lhs ); nrv += std::move( rhs ); return nrv; #endif } I tested this with the following expressions with both COMMUTATIVE defined and not defined: T a, b, c; // initialized to something T r1 = a + b + c; T r2 = a + ( b + c ); T r3 = ( a + b ) + ( b + c ); and with both GCC 4.7.3 and Clang 3.2. Could someone please test this with VC++? (complete code below) Generally: Any thoughts? Examples of expressions where and how it could be improved? Theoretical improvements are also welcome, but please mark them as such and always test your code to prevent pessimizations in practice! One remarks about the proposed full version of operators2.hpp: Andrew, I really appreciate your work and enthusiasm, but please understand that IMHO this needs to be done step-by-step and much more slowly than you probably hope for. Let's figure out the proper overload set for T+T first, then T+U/U+T (again both commutative and non-commutative), noexpect-specifier for all overloads, etc. After that, we need to decide on whether or not to improve the existing operator library or to provide an independent V2. This might include rethinking the grouped templates. Using Boost.Move might help with the implementation or not, depending on what overload set we want/need. It all needs tests and documentation and it will be quite some work… hope you and others are still with me on this :) Best regards, Daniel Here's the complete test code I used: #include <iostream> #include <utility> struct MyClass { MyClass() { std::cout << "MyClass::MyClass()" << std::endl; } MyClass( const MyClass& ) { std::cout << "MyClass::MyClass( const MyClass& ) COPY" << std::endl; } MyClass( MyClass&& ) { std::cout << "MyClass::MyClass( MyClass&& ) move" << std::endl; } ~MyClass() { std::cout << "MyClass::~MyClass()" << std::endl; } MyClass& operator+=( const MyClass& ) { std::cout << "MyClass::operator+=( const MyClass& ) +=" << std::endl; return *this; } MyClass& operator+=( MyClass&& ) { std::cout << "MyClass::operator+=( MyClass&& ) += &&" << std::endl; return *this; } }; MyClass operator+( MyClass lhs, const MyClass& rhs ) { lhs += rhs; return lhs; } MyClass operator+( MyClass&& lhs, MyClass&& rhs ) { lhs += std::move( rhs ); return std::move( lhs ); } // #define COMMUTATIVE MyClass operator+( const MyClass& lhs, MyClass&& rhs ) { #ifdef COMMUTATIVE rhs += lhs; return std::move( rhs ); #else MyClass nrv( lhs ); nrv += std::move( rhs ); return nrv; #endif } int main() { MyClass a, b, c; std::cout << "--- r1" << std::endl; MyClass r1 = a + b + c; std::cout << "--- r2" << std::endl; MyClass r2 = a + ( b + c ); std::cout << "--- r3" << std::endl; MyClass r3 = ( a + b ) + ( b + c ); std::cout << "--- done" << std::endl; }

3 8

GSOC 2013
by Dmitriy 28 Apr '13

28 Apr '13

Hi folks! I am Dmitriy Gorbel, a computer science student at the Kharkiv Polytechnic University from Ukraine. I browsed Boost C++ Libraries home page for GSoC and I want to propose a project to implement of a Fixed Point library. I read open standard on open-std.org http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3352.html and tried implementation by Vicente J. Botet Escriba at the https://svn.boost.org/svn/boost/sandbox/fixed_point/ Now I prepare my proposal. So I will take implementation by Vicente J. Botet Escriba in the first place, and I found few more simple implementations, but can anyone advise me other implementations of Fixed Point arithmetic, which I must pay attention? Not necessarily in C++, pure C also would be good. Thanks

5 29

Re: [boost] [GSOC] XML library of Boost
by Amos Ji 28 Apr '13

28 Apr '13

On Apr 28, 2013, at 12:11 PM, Andrey Semashev <andrey.semashev(a)gmail.com> wrote: > On Monday 29 April 2013 02:08:01 Amos Ji wrote: >> Hi All, >> >> I'm a graduate student from Fudan University in China. And I hope to >> contribute some code to Boost during the GSOC. >> >> I've scanned the idea page. The ideas in the page are all very interesting >> and challenging. But what I'm interested in most is XML library, which is >> at the bottom of page. I think the XML format is the most popular standard >> for storing information so it's important for Boost to have a good XML >> library. > > Agreed, a good and fast XML library would be most useful. >> In my opinion, an XML parser must be able to do these things: >> >> 1. To Iterate over DOM nodes tree; >> 2. To access the values of nodes and their attributes quickly; >> 3. To insert or delete nodes or attribute of an exact node easily; >> 4. To generate new XML from the structure which stores XML in the >> library. > > IMHO, support for SAX is also mandatory. I would even say that SAX should be > the first and the primary thing to be implemented in Boost.XML, as DOM can be > added later on top of it if the time for GSOC allows. > I agree. SAX parser will use less memory than DOM parser. I'll add it into my proposal. > You also listed support for encodings in the optional features. I agree with > it being optional with exception for Unicode. At least UTF-8 should be > supported from the very start. But that should not be a problem now that we > have Boost.Locale. I know little about Boost.Locale. I'll see how it can help support other encodings when I need. Thanks a lot for your suggestions. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Google Summer of Code 2013
by sskytyba＠gmail.com 28 Apr '13

28 Apr '13

I’m student from Ukraine. My name is Skytyba Sergij. I want to get some information. I’m interested in such projects as Boost.uBLAS, Boost.Math Bernoulli Numbers and Applications to Special Functions (very) , Boost.Multiprecision (very) , Boost.Thread/SyncQueue, Moving Boost to Boost.Move. To whom can I send my proposal and how can I contact with mentors of these projects?

2 1

[GSoC] Boost.Multiprecision project
by Віталій Мельник 28 Apr '13

28 Apr '13

Hi! I am a second year student in Computer Science and I`m very interested in Boost.Multiprecision project on GSoC. What can I do to be invited to this project? I have some achievements in sport programming, so I can tell you that I know algorithms and I like to solve algorithmic problems. -- Vitalii Melnyk

2 1

Re: [boost] GSoC Boost.Multiprecision project
by Jyotesh Choudhari 28 Apr '13

28 Apr '13

> 2013/4/21 Jyotesh Choudhari <jyoteshrc_at_[hidden]>: > <...> >> Looking at the project description, I think I have understood what needs to >> be implemented in this project. I have also gone through the current code >> cpp_bin_float.hpp and I have understood some part of it. I want to know how >> detailed should my proposal be? What details should I include in my >> proposal? What should be the deliverables for the project? > Hi, and welcome! > Start from writing a proposal according to this link > https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate<https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate>. > This link may also help https://svn.boost.org/trac/boost/wiki/SoCHints I have attached my proposal with this mail. Please have a look at it and let me know your feedback. Thanks and regards, Jyotesh Choudhari > After it is done, mail it ti this mailing list with title starting > from [boost] GSOC. > I also recommend to read this mailing list first, because there is a > lot of interesting discussions and useful information about GSOC and > some comments about Boost.Multiprecision. > One more advice: there are already two or three students that want to > work on Boost.Multiprecision. Try to describe in your proposal why do > you suit for that task better than others. > -- > Best regards, > Antony Polukhin

2 1

[GSOC-2013]-boost.odeint implicit routines
by preethamsreenivas 28 Apr '13

28 Apr '13

Hi all, I am preetham sreenivas, a sophomore at computer science and engineering, IIT Bombay(Indian Institute of Technology, Bombay). I am very much interested in the project of adding support to implicit routines to the boost.odeint library. I have recently completed a course on numerical analysis and i've used all the common numerical methods as part of the course including euler methods , runge-kutta routines etc. I've also used the boost.odeint for algorithmic analysis assignments for this course. I've gone through the articles linked from the project description and also snippets of odeint code at codeproject.com I would like to get through to mario mulansky or Karsten Ahnert , the mentors for this project to provide me with further pointers and any assignments they would like to give me. I am sorry that i couldn't start on it earlier as i've just completed my exams for the spring semester. please reply as soon as possible. kindly oblige, regards, preetham sreenivas, sophomore, CSE IIT Bombay -- View this message in context: http://boost.2283326.n4.nabble.com/GSOC-2013-boost-odeint-implicit-routines… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1