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

Re: [boost] [msm] new version available
by Christophe Henry 06 Apr '10

06 Apr '10

> Christophe Henry wrote: >> Hi all, >> >> I just finished the newest MSM version. Unfortunately, I'm afraid I'm >> a bit late to get it shipped with boost v1.43 but at least it will >> give us time to have a look at it. >> What is new: >> - the doc was rewritten almost from the ground up. >> - internal transitions: for all front-ends, and both ways: either in >> the transition table or inside state's internal transition tables >> - more row types (yes, even more) allowing actions to be defined in >> state machines or in states >> The last 2 points aim at making states more useful >> > > Christophe - > > I'm looking forward to trying it out. > > michael I'm counting on your always very useful comments! Thanks, Christophe

1 0

python/test/Jamfile.v2 help needed
by Ralf W. Grosse-Kunstleve 06 Apr '10

06 Apr '10

I've merged the current boost/python and libs/python trunk into the release branch, followed by this patch: Index: libs/python/test/Jamfile.v2 =================================================================== --- libs/python/test/Jamfile.v2 (revision 61033) +++ libs/python/test/Jamfile.v2 (working copy) @@ -184,8 +184,10 @@ # bpl-test bienstman5 ; # } -[ bpl-test calling_conventions ] -[ bpl-test calling_conventions_mf ] +# XXX disabled on release branch only, +# XXX to avoid failures on platforms other than Windows +# [ bpl-test calling_conventions ] +# [ bpl-test calling_conventions_mf ] # --- unit tests of library components --- Is it possible to have those two tests built and run only under Windows? Thanks! Ralf

3 5

[GSOC2010] HEAPS & QUEUES draft proposal
by Alexandru Damian 06 Apr '10

06 Apr '10

Hello everyone, My name is Alexandru Damian. I am a second year student at the Polytechnic University of Bucharest, Romania. I am very interested in the Heaps & Queues idea, and with both a good programming and mathematical background, I believe that I can offer valuable ideas to this project. Below is a draft proposal for this. I didn't know what you would expect from such a proposal (talked to grafikrobot on freenode and he redirected me here), so the structures that are to be implemented are rather vague. If the proposal is on track, I will detail them. I have also talked so some guys on the irc channel about a more generic approach to trees and tries. What's your opinion on that (given that tree structures are already implemented in /intrusive)? I hope I'm not too annoying :). ***STUDENT PROPOSAL: HEAPS & QUEUES*** NOTE: My Student Proposal follows the template listed on: https://svn.boost.org/trac/boost/wiki/SoCSubmissionTemplate **PERSONAL DETAILS** NAME: Alexandru Damian UNIVERSITY: Polytechnic University of Bucharest MAJOR: Computer Science and Engineering DEGREE PROGRAM: B.Sc. EMAIL: alexdamian1989(a)gmail.com AVAILABILITY: According to the official timeline, there will be 11-12 weeks at my disposal: March 24 - August 9 (16). However, I plan to contract the "Community Bonding Period" to 2-3 weeks, so that I may have at least one week advance in coding. This will help me better organize my time during the summer, when I will be unavailable for about 2 weeks (in June) because of my exams. **BACKGROUND INFORMATION:** EDUCATIONAL & WORK BACKGROUND: I have been preparing in the fields of Computer Science and Mathematics since high-school when I have competed in numerous national and international competitions, gaining important experience and always finishing among the best. My interest in personal and professional growth has continued at university as well, with even better results at contests and scientific research. My work background and coursework have supplied me with many skills in theoretical computer science, data structures, algorithms and programming languages. In addition, I have broad experience in Mathematics and problem solving techniques. In the year 2009, I have worked at different projects for the Faculty of Automatic Control and Computers, including the research and development of a way to store and illustrate the temperature ratio in the University server room. The same year, I worked as a volunteer student consultant and I offered support in Mathematics for students taking the admission examinations. EXPRESSION OF INTEREST: Boost C++ Libraries has caught my attention in 2008, when I had my first important encounters with the Open Source Community. A library that offers more advanced data structures and algorithms than STL is needed on a daily basis when optimizing complex code. It is only natural for me to choose the "Heaps & Queues" project, as I have valuable experience in the algorithms that power these structures and their real-world applications. My plans for further support and development of the Boost C++ Libraries will extend even after the GSOC deadline, with plans to implement more algorithms supplementary to the work done during the summer and in other areas (such as the BigInt idea, or AI algorithms: neural networks, genetic algorithms, fuzzy systems etc.). PROGRAMMING SKILLS: Strong background in theoretical computer science, algorithms, data stuctures and optimization . Strong background in advanced mathematics. Programming Languages: C (4/5), Java (4/5), C++ (3/5), C# (3/5), Shell scripting (2/5), ASM (2/5). Other programming languages and their proficency levels are illustrated in the Resume. **PROJECT PROPOSAL** ABSTRACT The purporse of this project is to create a library that involves heap and queue creation and manipulation. This will be very useful in implementing more complex algorithms or data structures that take advantage of these structures (a basic example is Dijkstra's shortest path algorithm). The library will include basic implementations of heap structures (i.e. binary heap) and queues, as well as the more complex (and more relevant) structures. PROJECT CONTENTS The current version of the Libraries has little support for heaps and queues. Therefore, the following will be implemented, with a discussion on every structure's difficulty, speed and memory used. Firstly, a well-known table of complexities for the binary min(max)-heap: findMin(findMax) : O(1) | deleteMin(deleteMax) : O(log N) | insert : O(log N) | merge : O(N) * D-ARY HEAP : a more general implementation of the binary heap (2-ary heap). The main advantage a d-ary heap has is that insertion will be significantly faster, requiring a theoretical O(log_d N) operations. However, finding an element's parent is rather difficult if d is not a power of 2, since we can not use bitwise shifting operations. However, delete-min is slower, because of the d-1 comparisons to find the minimum value, using a standard algorithm (probable fix: use a min-heap). * BINOMIAL HEAP, BINOMIAL TREES : a mergeable heap; although the complexity for findMin(findMax) is O(log N), this heap, along with the ones below (also mergeable), offer a better complexity for merge : O(log N). Since binomial heaps use binomial trees, this data structure will also be implemented. * FIBONACCI HEAP : another mergeable heap, with better amortized time complexity than the binomial heap * RELAXED HEAP, RELAXED FIBONACCI HEAP (an idea at: http://www.google.ro/url?sa=t&source=web&ct=res&cd=1&ved=0CAYQFjAA&url=http…) * SKEW HEAP : a structure that is easier to merge than a binary heap, but is unbalanced. This could be considered optional, as it is a median option between d-ary heaps and mergeable heaps (binomial, fibonacci). * TREAP : although treaps are already implemented, they should be adapted to use the new heap library. * QUEUE : a basic implementation of the queue structure (possibly use the STL container) * DEQUEUE : although an implementation already exists /fusion/container, that has to be documented. A new implementation using the generic queue structure mentioned above. * PRIORITY QUEUE : implemented with the use of a heap. * BUFFER (CIRCULAR QUEUE) : fixed size, circular queue (if queue is full, the oldest data is overwritten). Such a queue could be used to implement a structure similar to RRDs. * (BONUS) SKIPLISTS : randomized search structure. * (BONUS) B-TREES : extended binary trees with excellent complexity when comparisons are not the most time-consuming operations. * (BONUS) INTERVAL TREES : extended complete binary trees supporting fast segment intersection queries. Some of these structures can use a fixed size array (use /boost/array). However, it would be good to eliminate the constraints of fixed size arrays. This will require using STL's <vector> or, should it be decided not to include a binary, a local implementation of it, i.e. ARRAY LIST. TIMELINE As stated above, I would like to start with an advance of one week (May 17). WEEKS -2, -1, 0 (April 26 - May 16) : Community Bonding Period These three weeks will offer me the possibility to accomodate with the code, the coding conventions and the community. During these 3 weeks, I will also discuss with the organization whether binary libraries should be included or proprietary structures should be implemented (variable sized arrays, basic queue, basic priority queue (heap)). Modifications in the timeline (reordering, additions, deletions) can also occur. Finally, I will decide if I clean up the implementations from /pending (i.e. queue, fibonacci_heap, relaxed_heap, etc.) or create new structures, based on the newly implemented structures. Implement some simple structures so as to better get used to the code (probably ARRAY LIST or BINARY HEAP). WEEK 1 (May 17 - May 23) : Implement D-ARY HEAP, BINARY HEAP (2-ARY HEAP). Decide whether to first implement the d-ary heap and then the binary heap as a particular case, or implement the binary heap first, and after that the d-ary heap, associating a binary min(max)-heap to each array of children; solve the excess memory. WEEKS 2, 3 (May 24 - June 6) : Implement BINOMIAL TREES, BINOMIAL HEAPS, FIBONACCI HEAPS (don't adapt, usage for relaxed fibonacci heaps), RELAXED HEAPS and RELAXED FIBONACCI HEAPS. Official start of the coding phase. All of these heaps follow the same basic ideas, therefore progress should be relatively easier after the binomial heaps are implemented. Initial algorithms will probably be those specified (and variations) in Cormen or Knuth, as well as the idea suggested in the above mentioned link. WEEKS 4, 5 (June 7 - June 20) : University Exams WEEKS 6, 7 (June 21 - July 4) : Fix any problems with previous heaps. Implement SKEW HEAPS. Adapt TREAPS. WEEKS 8, 9 (July 5 - July 18/16) : Add mutable behaviour to the heaps. Apply optimizations. Create some automated tests. Week 8 will mark the mid-term evaluation deadline. The objective is to complete HEAP structures. The timeline offers roughly 2 weeks for bug fixing, so that should be enough. WEEK 10 (July 19 - July 25) : Implement QUEUE, DEQUEUE. WEEK 11 (July 26 - August 1) : Implement CIRCULAR QUEUE, PRIORITY QUEUE. WEEK 12 (August 2 - August 8) : Fix bugs related to the QUEUE structures. Add mutable behaviour to the queues. Apply optimizations and custom algorithms for fixed-length data types. Create automated tests. WEEK 13 (August 9 - August 16): Finalize code and documentation. NOTES: 1. The Exams period is, actually, 4 weeks (June 7 - July 5), comprising 5 exams. However, I should be able to compress the total time to only 2 weeks by moving some of my studying in May. 2. Weeks 6 and 8 are reserved for fixing heap bugs. Should there be less problems than expected, I can gain one bonus week. 3. If we choose to implement the structures using STL binaries, I could gain one more bonus week from weeks 1, 10 and 11. 4. With (2) and (3) in mind, I could implement any of the bonuses written above (at the end, if everything else is complete). a) SKIPLISTS : a randomized search structure with very good practical complexity. b) INTERVAL TREES : given the already implemented Interval structure (/numeric/interval), it would be nice to have such a structure, for easy geometric intersection queries. c) B-TREES : adaptation of the Balanced Binary Trees, typically used in situations where the comparison operation is not the most time consuming one (disk seeking). WORK FLOW I plan to organize my time and coding in such a manner that I am able to post changes on a forum / blog every 4 days (except the period with exams). That means roughly 2 times per week, as I will have no problem working in weekends. TODO Cheers, -- Alexandru Damian Polytechnic University of Bucharest Faculty of Automatic Control and Computers

2 1

boost.graph
by Piyush Garg 06 Apr '10

06 Apr '10

What is the best representation of graph in memory that is compatible with other libraries used in the boost? Can we implement connectives in any way?

2 1

[mpl] is_macro_called
by Lorenzo Caminiti 06 Apr '10

06 Apr '10

Hello all: Is there a way I can check at compile-time and class-scope if a macro has been called and expanded (at least one time) from within a member function? For example: #define X(...) ... // Some macro definition -- the macro parameters could be anything needed to implement is_macro_called. struct is_macro_X_called { ... }; // Some implementation -- this could be a template or something else. So that: struct z { void f() { X(...); // Macro called from within a member function. } // Detect at class-scope and a compile-time that the macro was called. static const bool is_macro_X_called::value; // Evaluates to true. }; Instead: struct z { void f() { // X(...); // Macro not called. } static const bool is_macro_X_called::value; // Evaluates to false. }; I do not know how to program this. However, could for example the macro X() instantiate a template with some special template parameter that can then be inspected at compile-time by a is_macro_called metafunction? Thank you very much. Lorenzo

4 8

[Boost.process] GSoc proposal
by Kasra 05 Apr '10

05 Apr '10

Hi, I have decided to polish up the current boost.process this summer. It has been on the list far too many times without much further progress. After checking out the code I've begun working, so I need to start working on the new API which I intend to be similar to boost.thread. Are there any volunteering mentors? class process { class id; class status; class priority; typedef std::bitset<?> affinity_type; static process& this_process(); static std::vector<process> processes(); static std::vector<process> processes(const std::string& machine); static std::vector<process> processes_by_name(const std::string& name); static std::vector<process> processes_by_name(const std::string& name, const std::string& machine_name); static process start(const std::string& proc); static process start(const std::string& proc, const std::string& params); const id& get_id() const throw(); void terminate(bool kill = false ); status wait(); status idle_wait(); const boost::posix_time::ptime& start_time() const; affinity_type processor_affinity() const throw(); void processor_affinity(const affinity_type& affinity); const priority& priority() const throw(); void priority(const priority& new_priority) const throw(); postream& standard_input() const; pistream& standard_output() const; pistream& standard_error() const; boost::posix_time::time_duration kernel_time() const; boost::posix_time::time_duration user_time() const; boost::posix_time::time_duration total_time() const; const void* max_working_set() const; void max_working_set(const void* value); const void* min_working_set() const; void min_working_set(const void* value); uintmax_t peak_paged_memory() const; uintmax_t peak_private_memory() const; uintmax_t peak_virtual_memory() const; uintmax_t peak_working_memory() const; uintmax_t paged_system_memory() const; uintmax_t paged_memory() const; uintmax_t private_memory() const; uintmax_t virtual_memory() const; uintmax_t working_memory() const; }; With Best Regards Mr. Kasra Nassiri Department of Computer Science Imperial College London

3 2

Re: [boost] python/test/Jamfile.v2 help needed
by Ralf W. Grosse-Kunstleve 05 Apr '10

05 Apr '10

I think I figured it out: I moved the new "rule" block up in Jamefile.v2 . Now monitoring the build summaries again... Ralf ----- Original Message ---- From: Ralf W. Grosse-Kunstleve <rwgk(a)yahoo.com> To: boost(a)lists.boost.org Sent: Mon, April 5, 2010 1:05:20 PM Subject: Re: [boost] python/test/Jamfile.v2 help needed The recent build summaries for boost.python come up all blank. I'm guessing this is a bad sign. Are the log files somewhere from which I could tell what's wrong? Given boost svn trunk, I found out I can run bootstrap.sh to get a bjam executable. But I couldn't figure out how to build and run the python tests. Could some help with the commands I need? I have Fedora 6, 8, 11, 12. Ralf ----- Original Message ---- From: Vladimir Prus <ghost(a)cs.msu.su> To: boost(a)lists.boost.org Sent: Sat, April 3, 2010 11:21:04 PM Subject: Re: [boost] python/test/Jamfile.v2 help needed Ralf W. Grosse-Kunstleve wrote: > I've merged the current boost/python and libs/python trunk into the release branch, > followed by this patch: > > Index: libs/python/test/Jamfile.v2 > =================================================================== > --- libs/python/test/Jamfile.v2 (revision 61033) > +++ libs/python/test/Jamfile.v2 (working copy) > @@ -184,8 +184,10 @@ > # bpl-test bienstman5 ; > # } > > -[ bpl-test calling_conventions ] > -[ bpl-test calling_conventions_mf ] > +# XXX disabled on release branch only, > +# XXX to avoid failures on platforms other than Windows > +# [ bpl-test calling_conventions ] > +# [ bpl-test calling_conventions_mf ] > > # --- unit tests of library components --- > > > Is it possible to have those two tests built and run only under Windows? Yes. Create a function as follows (in your Jamfile): rule require-windows ( properties * ) { if ! <target-os>windows in $(properties) { return <build>no ; } } then, in requirements of your tests, use <conditional>@require-windows, e.g: [ bpl-test calling_conventions : : <condiitonal>@require-windows ] Note that cygwin is a different OS from windows, so if the test must be run on cygwin, you need to adjust conditional accordingly. Does this help? - Volodya _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] [msm] new version available
by Christophe Henry 05 Apr '10

05 Apr '10

>>> Hi, >>> >>> Just a form remark. We use to see the code highlighted. Have you the possibility to highligth the code? >>> >>> Best, >>> Vicente >>> >> >> Probably. I just need to find out if there is another DocBook tag for >> this. At the moment, I'm using <code>. >> I'm not a BocBook expert, but if one reads this, please help ;-) > > I have never used DocBook but I have found that http://www.sagehill.net/docbookxsl/SyntaxHighlighting.html. > > There are some uses of <programlisting> already in Boost.Function. > > Hoping this helps > Vicente Oh yes it does. And it looks much better, you're right. Great! Then it'll be done fast. Thanks a lot, Christophe

1 0

[Log] Problem with attributes + gcc -fvisibility=hidden
by Tony Astolfi 05 Apr '10

05 Apr '10

I'm evaluating boost::log for use in a project I'm working on, and I found a potential issue. If I compile my program using gcc with the '-fvisibility=hidden' option enabled, then some log event attributes don't show up in the output. For example: #include <boost/log/attributes/clock.hpp> #include <boost/log/common.hpp> #include <boost/log/utility/init/to_console.hpp> int main () { boost::log::init_log_to_console( std::cout, boost::log::keywords::format = "[%TimeStamp%] %_%" ); boost::log::core::get()->add_global_attribute( "TimeStamp", boost::make_shared< boost::log::attributes::local_clock >() ); boost::log::sources::logger l; BOOST_LOG( l ) << "Error!"; return 0; } Output: % g++ main.cpp -I../../../glnxa64/include -L../../../glnxa64/lib -lboost_log -lboost_system -lboost_log_setup && ./a.out [2010-Apr-05 12:39:14.872961] Error! % g++ main.cpp -I../../../glnxa64/include -L../../../glnxa64/lib -lboost_log -lboost_system -lboost_log_setup -fvisibility=hidden && ./a.out [] Error! I've found issues like this in the past caused by boost libraries not marking certain types as export-visibility, resulting in a failure later on to match two type-id objects that ought to be identical. Could something like this be happening in the recently accepted Boost.Log library? Is this something the author would be interested in fixing/supporting?

1 0

Re: [boost] [msm] new version available
by Christophe Henry 05 Apr '10

05 Apr '10

> Hi, > > Just a form remark. We use to see the code highlighted. Have you the possibility to highligth the code? > > Best, > Vicente > Probably. I just need to find out if there is another DocBook tag for this. At the moment, I'm using <code>. I'm not a BocBook expert, but if one reads this, please help ;-) Christophe

2 1