- Boost - lists.boost.org

Qustion about GSOC Project
by Hardy Huang 20 Apr '13

20 Apr '13

Hi, there. I am a graduate student in Peking University. I have known Boost library for long. And I used it for several times. This year I wanted to get involved in GSOC, and I was happy when I see Boost in the list, it is my dream and it will be honor to contribute to such a powerful library. 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. Thanks, I am expecting to receive some useful replies.

4 6

Re: [boost] [config][mpl][type_traits][integer] BOOST_STATIC_CONSTANT should use constexpr
by Vicente J. Botet Escriba 20 Apr '13

20 Apr '13

Le 20/04/13 14:33, Vicente J. Botet Escriba a écrit : > Le 20/04/13 13:18, Antony Polukhin a écrit : >> 2013/4/20 John Maddock<boost.regex(a)virgin.net>: >> <...> >>> No that's correct as is: >>> >>> * if BOOST_NO_INCLASS_MEMBER_INITIALIZATION is defined, then the constant is >>> really an enum and there should be no out-of-line definitions. >>> * if BOOST_NO_INCLASS_MEMBER_INITIALIZATION is *not* defined, then the >>> constant *should* have the out-of-line definition in case it's address is >>> taken/used. >> Oh, now I see, thanks. >> >>> As for the original question, this is such a pervasive breaking change, I >>> think a new macro is inevitable I'm afraid :-( >> New macro will do exactly what the old macro did, but using C++11 >> feature. Code in all Boost libraries will be changed to use new macro. >> So the old macro will be required only for users code that use macro >> and attempts to take address of constant... >> >> To me, it looks less obscuring to have one macro and a note for users >> to use BOOST_CONSTEXPR_OR_CONST for out-of-line definition; than two >> macro (which one shall be used by default?) that do the same thing but >> very slightly differ in details. >> > Just to add some information about some uses > > grep -r BOOST_NO_INCLASS_MEMBER_INITIALIZATION * | wc -l > 113 > grep -r BOOST_STATIC_CONST * | wc -l > 6598 > The figures are a little bit better :) grep -r BOOST_STATIC_CONSTANT * | grep -v svn | wc -l 3030 grep -r BOOST_NO_INCLASS_MEMBER_INITIALIZATION * | grep -v svn | wc -l 57 Best, Vicente

1 0

Trac: Add ref library
by Vicente J. Botet Escriba 20 Apr '13

20 Apr '13

Hi, Boost.Ref is not included as a library on the Trac system. Coul dit be added? Best, Vicente

1 0

[log] Permission to merge to trunk
by Andrey Semashev 20 Apr '13

20 Apr '13

Hi, I'd like to ask for permission to merge Boost.Log v2 to Boost trunk. The library has passed the review back in 2010 and was provisionally accepted [1]. It has been reworked since then, and in a few recent posts I described the changes [2][3]. [1] http://lists.boost.org/boost-announce/2010/03/0256.php [2] http://thread.gmane.org/gmane.comp.lib.boost.devel/237748 [3] http://thread.gmane.org/gmane.comp.lib.boost.devel/239313

16 43

Google Summer of Code - 2013: Boost C++ Libraries
by Ketan Akade 20 Apr '13

20 Apr '13

Hi, I am Ketan Akade, Graduate student at University of Southern California. I am majoring in Computer Science. I went through the project ideas of Boost C++ Libraries, and would like to work on it. I am particularly interested in the *Boost.uBLAS* project idea which is unifying representation of vector and matrices into a unique matrix class. Could you please let me know further details of the same? What steps should I take to start on this? PFA project proposal in which I have mentioned my academic and technical background. Thanks and regards, Ketan Akade Graduate Student, University of Southern California.

1 0

[gsoc 2013] chrono::date
by Anurag Kalia 19 Apr '13

19 Apr '13

I saw the chrono::date library proposal in the ideas page of gsoc 2013. It already seems quite solid and fleshed out; I am confident that I have understood it and can carry it out. Here it is for reference: <http://tinyurl.com/ct4tc3m> I have a few questions though. 1) Is this proposal in its final stages? The Boost chrono library docs mention in appendices that they intend to implement it in later releases. What I want to ask is if I am allowed to propose changes in the library if I want to. For example, the proposal proposes that adding a year to 'Feb 29' (leap year) should result in 'Feb 28 of next year' (non-leap year). I tend to think this is counter-intuitive. The author already gives the excellent idea of using a syntax like "last/february/2013" which also covers the case of anniversaries falling on 'Feb 29' pretty well. Moreover, it is a pretty big assumption that a person would want to celebrate the 'Feb 29' anniversaries on 'Feb 28' and not on 'Mar 1'. Moreover, adding a month to '31 January' results in an invalid date (31 February). Why shouldn't we mirror the behaviour for years? We can just make a library function to cover this issue. In short, am I allowed to propose such changes? 2) How should I apply for gsoc now that I have found my area of interest? What is the last date of application? Shall I post a draft of my application here first for review before submitting it officially? Am I allowed to? 3) I have my final examinations scheduled during three weeks in the coming month of May after which I am totally free to pursue gsoc internship. Though I will use this time to research for design and implementations of other similar libraries, I would still need to channel much time into my examinations. How am I supposed to circumvent this conflict, given that I do have ample time to dedicate to my internship later on? Thanks.Anurag.

2 1

[fusion] [range] Interest in unified functions
by Antony Polukhin 19 Apr '13

19 Apr '13

Hi, I was playing with Boost.Fusion and wrote this simple function: template <class Sequence> std::string stringize(const Sequence& seq) { std::string result; boost::fusion::for_each(seq, stringize_functor(result)); return result; } Which allows to convert many types to strings: boost::fusion::vector<cat, int, std::string> tup1(cat(), 0, "_0"); boost::tuple<cat, int, std::string> tup2(cat(), 0, "_0"); std::pair<cat, cat> cats; std::cout << stringize(tup1) << '\n' << stringize(tup2) << '\n' << stringize(cats) << '\n' But this example fails to convert the following : std::vector<cat> too_many_cats(20); All we need to do to allow conversions, is just add the following: #include <boost/range/algorithm/for_each.hpp> namespace boost { namespace fusion { template <typename Sequence, typename F> inline typename disable_if< traits::is_sequence<Sequence> , void >::type for_each(Sequence const& seq, F const& f) { ::boost::range::for_each(seq, f); } }} So now std::cout << stringize(too_many_cats) << '\n'; works and boost::fusion::for_each may work with any type, runtime length or compile time. We may also make a lot of other algorithms to make no difference between runtime and compile time classes: accumulate, find, find_if, count, all, none, begin, end, advance, distance, dereference, empty and others... The questions are: Is there interest in such features? Is there interest in adopting other algorithms and which ones? To what library shall those methods belong? -- Best regards, Antony Polukhin

1 0

[signals2] Uncombined signal
by Ivan Le Lann 19 Apr '13

19 Apr '13

Hi, I have a project where I use boost::signals2 in the spirit of the "Signal Return Values (Advanced)" section of the tutorial. That is, I have signals roughly equivalent to : boost::signals2::signal<float (), maximum<float> > sig; // slots produce values accumulated by the combiner Problem comes when I want multiple combiners on the same slots. Especially combiners of different types : You need to duplicate signals, and you need your connection setup code to know about used combiners. IMHO, having a basic signal class with no combiner makes sense. Attached is a POC patch to version 1.50, to add to boost::signals2::signal the method : slot_call_range all (BOOST_SIGNALS2_SIGNATURE_FULL_ARGS(BOOST_SIGNALS2_NUM_ARGS)) const (in boost/signals2/detail/signal_template.hpp) >From there, I think one could use any algorithm/accumulator directly on the signal.all() result. Implementation left aside, any feedback on this ? Regards, Ivan

2 4

GSoC project idea: Directory monitor for Boost.Asio (student wanted)
by Boris Schaeling 18 Apr '13

18 Apr '13

Here's another idea for a GSoC project: Turn the directory monitor from <http://www.highscore.de/boost/dir_monitor.zip> into a full-featured Boost.Asio extension. This includes understanding the source code of the existing directory monitor, getting familiar with Boost.Asio internals, enhancing the current interface, implementing the directory monitor on multiple operating systems, writing test cases and a documentation. This is a project which can be completed within a summer. It could be the right project for a student who is interested in Boost.Asio and wants to go through all steps from designing to documenting. Boris

1 0

bug in boost::container ??
by Olaf Peter 18 Apr '13

18 Apr '13

Hi, the attached example confuses me, I've got: $ g++ -Wall boost_container_bug.cpp -o boost_container_bug && ./boost_container_bug (size=4 [1, 2, 3, 4, 0, 4]) $ LANG=en g++ --version g++ (GCC) 4.6.3 20120306 (Red Hat 4.6.3-2) Copyright (C) 2011 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Did I miss something or is it a bug? Thanks, Olaf

6 6