- Boost - lists.preview.boost.org

Questions about Graph Project
by Liang Dong 22 Mar '10

22 Mar '10

Hi, I am reading the Graph Project's source code. I find there are page rank algorithm, but there is no HITS algorithm and samba. I am curious that if this would be a good topic or everyone just endorse pagerank? best, Liang Dong

2 1

[log] std::endl manipulator does not work, intentional
by Andreas Huber 22 Mar '10

22 Mar '10

Hi Andrey On VS2008, this code ... #include <boost/log/trivial.hpp> #include <ostream> int main() { BOOST_LOG_TRIVIAL(trace) << "This is a" << std::endl << "multiline message"; return 0; } ... fails compilation with the following error: error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'overloaded-function' (or there is no acceptable conversion) Now I do realize that "\r\n" would be a better choice here, as the flushing that comes with std::endl is not necessary. However, some developers in our team seem to prefer std::endl nevertheless. So, the question is: Is this intentional or just an oversight? BTW, only std::endl, std::ends and std::flush don't work, all the other manipulators do. Thanks, -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header.

2 1

GSOC - Boost Libraries - BIGINT
by swagat konchada 22 Mar '10

22 Mar '10

Hello! I am Swagat and C++ is my passion. I am a student at IIT Roorkee. I would love to work for Boost libraries in GSOC or any other manner. I came to know about GSOC recently. I hope I am not late. Though I initially thought of working for cppnetlib, after seeing the ideas given in the boost gsoc’10 page, I think the project I would like to work the most would be to implement BigInt. I have suffered many times trying to work with big integers, though some code is available on the Internet. A standardized library for BigInt if made enough programmer-friendly would be wonderful. As a programmer who often participates in online competitions, BigInt feature would have been of great use to me and working on it would be more than fun! Also I am free for the summer when I would be staying at my campus the whole time, without distractions. I have attached my resume above. Please comment. ---------------------------------------------------------------------------- A problem is a phenomenon indicating lack of thought. http://letmeseeswagat.blogspot.com/

1 0

GSoC draft proposal: Heaps & Queues library
by Andre Ferreira 22 Mar '10

22 Mar '10

This is only a draft, not the final proposal. Personal Details: Name: André Martins Ferreira Email: greiskul(a)gmail.com University: Universidade Federal do Rio Grande do Sul < www.ufrgs.br > Course: Computer Science Degree Program: Bachelor of Computer Science Availability: About 30 hours a week will be devoted to the project, more if nescessary. Start Date: April 1st End Date: not yet decided Factors of influence: I live in the Southern Hemisphere, so the Summer of Code will be during Winter. While I will have a winter vacation where my attettion will be 100% devoted to the project, it will only last about a month, from July to August. During the rest of the time I will study in the morning, and work on the project on my free time, which luckily this semester entails all afternoons. I have worked during school time in previous semesters, and know that it's possible. Background Information: I am a brazilian computer science student, my course has 9 semesters, I am currently in the 7th. I have been programming for the last 5 years, mostly in C++ but also in Scheme, Lua, and many other languages. I've had an intership in developing parallel programs using MPI, and more recently in supporting an ERP written in C++. My main interest is in algorithms and data structures, but I'm also interested in functional programming languages. My experience with heaps comes from my university classes, Cormen's Introduction to algorithms book, various online sources and personal experimentation. While I have implemented heap data structures before (binary, binomial, skew), I have never integrated them in a single package generic package before and I'm looking foward to learn from it. I would rate my experience in the following technologies this way: 4 C++ 4 C++ Standard Library 2 Boost C++ Libraries 3 Subversion I use mainly Eclipse and Geany for development, but I have also done projects with Visual Studio. For documentation I prefer to use Doxygen. Purpose and goal: Heaps are very useful data structures and are used as building blocks in many algorithms. There are some heap data structures implemented in boost, for use in Boost.Graph for example, but at the moment they are coupled with the library they support. This project's goal is to decouple them into a boost/heaps library, cleaning them up where needed, and completely rewritting them if nescessary. All heaps will provide a common interface where possible, allowing algorithms writters to quickly change the data structure they are using without further changes to their code. The complexity of every operation on every heap will be documented, and tested to ensure correctness. A priority queue wrapper like std::priority_queue will also be provided. Heaps structures that will be provided: binary, binomial, fibonnaci, mutable heaps, suggestions are welcomed. Proposed Milestones and Schedule (work in progress): Binary heap implemented and submitted, possibly on top of STL heap algorithms, to have some foundation for the rest of the work, allowing tests on the other data structures to be compared to a simple but correct heap implementation. Moving heap structures from /boost/pending to the heap library, adapting them to a common interface and cleaning up where nescessary. No rewrites. Binomial Heap implementation. If any of the heap structures from pending were deemed unfit, rewritting them. This proposal is still under work, but I would like feedback from the community, not only on the project but also in the proposal itself.

3 2

GSoC 2010 - Boost.Phoenix
by Thomas Heller 22 Mar '10

22 Mar '10

Hi List, As the subject indicates I am interested in the Boost.Phoenix project for this years summer of code. At first, a little information on me. I am currently studying at University of Erlangen-Nuremberg in Germany. I am learning C++ since 2005. I have experience with Expression Templates. I used them as part of my bachelors thesis: http://www10.informatik.uni- erlangen.de/Publications/Theses/2009/Heller_BA09.pdf Some months ago I discovered the Boost.Proto library. I was trying to implement a DSEL for a GUI description language. This attempt can be found here: http://gitorious.org/phobos/main/trees/c014102b5aefb2592eef625047340fa92d85… However this approach was not continued, and I developed a spirit parser which gives more flexibility in that particular domain. I like the idea of Boost.Phoenix as it is right now. I think an implementation with Boost.Proto seems only natural. I searched the boost SVN repository but i couldn't find the prototypes you mentioned. A link to these would be helpful to be able further look into this project proposal. Regards, Thomas Heller

5 11

queries regarding the BigInt project @ GSoc 2010
by Ankit Malpani 22 Mar '10

22 Mar '10

hello all! i am really interested in developing the proposed BigInt library for Boost as a part of GSoC this summer . Here are a couple of queries i have. 1. With regard to the data structure for handling such integers - are we looking at bit-level implementation(less space and probably more execution time) or digit level manipulation (more space - and probably less execution time). i.e. for an n-digit number is it ok to use up [n/2 to n] bytes of space or necessary to stick to log n amount of space for a BigInt object. 1.1 The arbitrary precision calculations could be implemented using the BigInt data-structure along with a scaling factor variable 2. what all are the expected functions of this library - basic arithmetic(add, subtract ,multiply, divide, modulo, powers) , relational(<=, <, >,>=, !=, ==) , bitwise operation ,and maybe added functionality like gcd and lcm are some of the things i can think of, please do add on to the list . 3. i have no prior experience of using Boost libraries, will this prove to be a problem with regard to this project? Please do refine this design and point out all the flaws in my understanding. Hope to get your replies soon Thanking You, Cheers! Ankit Malpani, 3rd year Undergraduate | BE. (Hons) Computer Science, BITS Pilani - Goa Campus -- Ankit Malpani 3rd Year Undergraduate | BE. Hons Computer Science BITS Pilani Goa Campus

4 3

Trac XMLRPC support
by Vladimir Prus 21 Mar '10

21 Mar '10

Would it be possible to have XMLRPC plugin installed in Boost Trac instance? See: http://trac-hacks.org/wiki/XmlRpcPlugin The installation appears to be fairly simple (and indeed seems to just work somewhere else). This will allow to use third-party tools to grab tickets from Boost Trac, which will hopefully lead to more issues fixed :-) - Volodya

4 5

Boost.Graph and SoC2010
by Cezary Bartosiak 21 Mar '10

21 Mar '10

Hello, I am writing in regards to your SoC2010 participation. I am particurarly interested in developing the Boost Graph library. I have got a working knowledge of graph and networks theory and C++ programming experience. I think I can handle any of the ideas listed in Boost.Graph section of the Project Ideas page as well as I could provide my own proposals for the library. I would like to get in touch with somebody responsible for Boost.Graph in order to talk about possibilities and what are the priorities. I would be glad to provide this person with additional information. Best, Cezary

1 0

Re: [boost] [contract] Released Contract Programming Library on SourceForge
by Andrzej Krzemienski 21 Mar '10

21 Mar '10

> I have released on SourceForge a library that implements Contract > Programming (a.k.a. Design by Contract(TM) ) for C++. I am considering > to submit this library to Boost (as Boost.Contract). > Comments? Hi, Just another thought for a tiny extension that came to my mind. I tried to use the block invariant as a regular assert: int main() { CONTRACT_ASSERT_BLOCK_INVARIANT( fee fee fee ); } This code compiles and works fine. This is because "disabling block invariants" means that the entire macro invocation will disappear, inclusive of the nonsense I wrote inside. We are used to it because this is how C-style asserts work, but one of the advantage of asserts over comments, as it is often advertised, is that the predicates are checked for syntactic and (to some extent) semantic correctness. But this is not the case if we disable the assertion macros. I believe, it would be useful if "disabling block invariants" meant no run-time overhead, but still checking syntactic correctness. It would be possible if the macro CONTRACT_ASSERT_BLOCK_INVARIANT( expression ); were replaced with something like: ... sizeof( expression ) ... then, the expression is not evaluated, but required to be correct. If the value of sizeof is not used it should be eliminated by the compiler. Obviously, the same would be applicable for all the other types of checks, Regards, &rzej

2 2

GSOC 2010 : Boost.graph
by Chinmaya Poswalia 21 Mar '10

21 Mar '10

In boost.graph what would be better : a) Manipulate the original graph - it would save space(crucial for big graph) -if the user want he can copy the graph object to a new object and then feed into functions b) Generate a new graph - although space will be allocated but user has the opportunity to directly input the graph.

2 1

GSOC 2010
by Chinmaya Poswalia 21 Mar '10

21 Mar '10

Hello, I want to enquire following things? 1) Who are the mentors and can i get there email-address? I was not able to find there names on the project list site.

3 2

[Boost.Locale] More updates
by Artyom 21 Mar '10

21 Mar '10

Hello, Updates ------- I had uploaded updated version of Boost.Locale that includes few bug fixes and some cleanup of MSVC warnings so now it clearly compiles with /W3 under MSVC. Also some documentation updated. Docs: http://cppcms.sourceforge.net/boost_locale/html/ Tutorial: http://cppcms.sourceforge.net/boost_locale/html/tutorial.html Download (boost_locale-svn_r1112.zip): https://sourceforge.net/projects/cppcms/files/ Formal Review Request --------------------- I want to submit the library for formal review: - When can it be done? - Do I have to provide full BJam build before formal review (at this point it builds fine with CMake)? - Do you think that I should wait more, improve the library more and if so what exactly? Best, Artyom

3 3

[proto] call for help with msvc-7.1
by Eric Niebler 21 Mar '10

21 Mar '10

A recent check-in of mine (https://svn.boost.org/trac/boost/changeset/60706) broke proto on msvc-7.1. For instance, see <http://tinyurl.com/yg5wgw5>. I don't have access to this toolset anymore. Is there anybody out there willing to give this problem a shot? Or is it time to drop support for this old compiler? -- Eric Niebler BoostPro Computing http://www.boostpro.com

1 0

[Log] Pre-review questions
by Christian Holmquist 21 Mar '10

21 Mar '10

Hi, I'm currently attempting to convert parts of our production log system to using Boost.Log as part of my review. At first glance this looked like a trivial thing, since Boost.Log supports all features (and more!) than I would need to do this task. However, I can't find what I'm looking for in the docs and I wish to not poke around anymore in the Boost.Log code. Simple task 1 I've two source level attributes, System and Severity. I wish to create a log macro that takes these two arguments. enum System { SYSTEM_A, SYSTEM_B, }; enum SeverityLevel // I don't want to use the built-in severity enum, since need flexibility to add/remove levels. { FREQUENT, DEBUG, TEMP, INFO, WARNING, ERROR, }; void foo() { LOG(SYSTEM_A, INFO, "Hello cruel world" << "!"); } The above is not a complicated scenario and I should be able to quickly find an answer. Maybe I've just missed it..:) Simple task 2 Create a custom filter without using any Lambda magic. struct Filter { System sys; SeverityLevel sev; bool operator()(???) { // pseudo-code, since I don't know how to write this return Attributes["System"] == sys && Attributes["SeverityLevel"] >= sev; } }; Help appreciated, I would like to get to the more complicated parts.. / Christian

4 6

[gil] Can not open test.jpg
by Mariusz Kwiczala 20 Mar '10

20 Mar '10

Hi, I cannot open test.jpg from boost_1_42_0\libs\gil\example\test.jpg I use below application: InfranView FireFox IE Windows tools: (Paint, WLXPhotoGallery ... ) Does it mean that GIL uses some special, jpg file format? :) Best regards, Mariusz

3 3

Heaps and Queues for GSoC
by Thomas Mullaly 20 Mar '10

20 Mar '10

Hello my name is Thomas Mullaly and I am currently an undergraduate in Kent State's Computer Science department. I'm interested in submitting a proposal for this years Google Summer of Code for the Heaps and Queues project, but, first I was wondering if somebody could explain what the requirements are for this project. So I have a better understanding of the project when I write a proposal. -Thomas Mullaly

3 4

[SoC] Call for Mentors
by Andrew Sutton 20 Mar '10

20 Mar '10

All, Boost is once again participating in the Google Summer of Code program. I'm looking to establish an official list of possible mentors for student projects. I have a list of people that have already offered to mentor this year and people who I think might offer to mentor based on their past participation :) but I thought it would be a good idea to do this a little more officially. If you are interested in mentoring a student this year, please send your me your gmail id (e.g., andrew.n.sutton) and a short description of the kinds of projects you would be interested in mentoring. The gmail id is required for me to invite you to be a mentor, as far as I can tell. Please note that mentors should be prepared to work with one student throughout the course of the summer. This typically means reviewing the student's work on a weekly basis and providing guidance by answering questions and suggesting improvements on their work. Thanks, Andrew Sutton andrew.n.sutton(a)gmail.com

5 6

GSOC 2010
by Augustus Q Odena 19 Mar '10

19 Mar '10

Hi, My name is Augustus Odena. I'm really interested in a few of the project ideas that Boost has listed for Google Summer of Code (Heaps and Queues, Bits and Ints, Graph Connectives and Topology Generators). It was suggested to me by the Hints Page that I should join the mailing list - so I've done that. I'd really appreciate it if, whenever someone had the time, they could perhaps fill me in a little bit more on the details behind those projects and their relative merits. I'd be happy to provide any sort of information about myself that would be helpful. -- Thanks, Augie Odena

2 3

Range begin/end and Fusion begin/end
by Mathias Gaunard 19 Mar '10

19 Mar '10

In C++0x, begin and end are supposed to be found through ADL, and this might end up considering fusion::begin/fusion::end as possible overloads. Unfortunately, this breaks, as fusion::begin and fusion::end produce hard errors when passed something else than a fusion sequence. All in all, I find ADL very dangerous. Should it be advocated not to use the names "begin" and "end" for something else than ranges to avoid issues? I suppose that for Fusion, it could be possible to use SFINAE to mask the overloads if the arguments aren't fusion sequences.

3 5

[log] Boost.Log formal review ongoing
by Vladimir Prus 19 Mar '10

19 Mar '10

Boosters, just a a friendly reminder that the formal review of the Boost.Log library, written by Andrey Semashev, is ongoing through March 17, 2010. There's still enough time to submit reviews and have them discussed, so please take a look at the library and share your thoughts. The documentation for the current version is available at: http://boost-log.sourceforge.net The downloads are at: http://sourceforge.net/projects/boost-log Here are the important points: 1. All comments are appreciated. Even if you don't have the time for in-depth study of everything, comments on parts of the library are welcome. In particular, if you are already using logging in your applications and have specialized requirements, you might want to directly check how the proposed library handles them. 2. The reviews and all comments should be submitted to the developers list, boost(a)lists.boost.org and the email should have "[log]" prefix in the subject to make sure it's not missed. The deadline for reviews is 23:59, March 17, PST = 2:59, March 18, EST = 7:59 March 18, GMT = 10:59, March 18 MSK 3. Please explicitly state in your review whether the library should be accepted. 4. The general review checklist is provided below: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Thanks, Volodya

4 11

[SoC] Summer of Code
by Andrew Sutton 18 Mar '10

18 Mar '10

All, Boost is once again participating in the Google Summer of Code program. If you are a student who is interested in contributing to Boost, now would be a good time to discuss your plans on the *developer's* mailing list ( http://lists.boost.org/mailman/listinfo.cgi/boost) Student applications will be accepted here starting March 29, and can be submitted here: http://socghop.appspot.com/. If you have any questions, please feel free to ask me directly or respond to this message. Cheers, Andrew Sutton andrew.n.sutton(a)gmail.com

1 0

[log] Boost.Log formal review
by M-Square 18 Mar '10

18 Mar '10

> Please explicitly state in your review whether the library should be accepted. Yes, I think the library should be accepted. In my view, the library should not be reviewed with the objective of whether it contains all possible implementations that might desired in the world, but whether it’s design and implementation is flexible enough to adopt useful extensions, like binary logging or a printf-style interface. It is unreal to expect from a first implementation to be the mother of all logging libraries, i.e. contain all desired functionality at once. It should be judged on whether it can BECOME the mother of all logging libraries and in my opinion it is flexible enough to do so. In our project, described in last month's ACCU Overload 95 (http://accu.org/index.php/journals/1606) we required a powerful logging/tracing library, mainly for the higher levels of the application. Since our guideline is to use Boost functionality wherever suitable, we particularly looked at the Boost library to fill our needs. It seemed to fulfil our requirements quite well, so we decided to take it on-board. We integrated it into our software, and first experience is that it works quite well. However, in the light of this review I would pay attention to a few aspects that I came across: - complexity of the interface, and how to improve - few design/implementation aspects - high-performance requirements INTERFACE COMPLEXITY ===================== A number of reviewers have mentioned the complexity of the interface and the fact that this might discourage new users. I think introduction of trivial logging partly reduced this problem, but whenever you want to use the library in a more subtle way, you have to know a lot and you have to do a lot. When implementing the various sinks and backend flavours I too found my code blurred with heavy template and shared-pointer handling at a level where I didn't want to see it. Thinking about how to improve this, it seemed to me that the library was lacking an extra interface level between trivial logging and the low-level interface of sinks etc. This extra interface should hide complexity, but still allow the user full control over the detailed aspects of the logging components. In my view this extra-level interface could be well-solved with a policy-based design. The user should just be required to provide the policies for the various aspects (front-end, back-end, formatter, filters) as well as the necessary parameters (file name etc.). The actual assembly of the logging components should be done by the library internally. I put this idea into practice, and, although not an expert in this field, developed a few policy-based creator classes, as well as the most common policies that I could forsee. This made the library much easier to manage and my code look much better. Adopting this approach would greatly remove the objections against the highly complicated interface. Users can just use the policies provided, and if the ones provided do not fit a user's needs, he can easily copy an existing one and modify it according to his wishes. The current design of the library allows insertion of this extra interface level well, proving its flexibility. DESIGN/IMPLEMENTATION ASPECTS =============================== When using the library I came across a few design aspects that might need some improvement. 1. Missing some polymorphism I know it is cursing in the church, but at certain moments I could do with a bit smarter use of polymorphism. To give an example, when my application shuts down unexpectedly, I want to tell the sinks around to stop their work and dump their contents if necessary. For the moment, and as far as i know, I still have to make a distinction between synchronous and asynchronous sinks, as only the asynchronous sinks support these stop methods, and even then I have to take the particular kind of backend in consideration in order to approach them, as this stop method is attached to the backend-templated class. It would be better to lift these methods to a class higher in the hierarchy. There are a few other points in the design were this is the case as well. This being said, there might be good reasons for the current design that I cannot oversee, but then I’d like to see them mentioned in the documentation. 2. In some cases, you might want to be more in control of what the logging library is actually doing. When sending off messages to a sync or async sink, you are only partially in control. Therefor my idea would be to provide something like a buffering logger, that buffers the messages it receives, and only sends it off to the core when the user tells him to. HIGH-PERFORMANCE REQUIREMENTS ================================ In my view, one of the most important aspects to judge a logging library on is its performance. I haven't seen to much about it in the reviews, but I think it is one of the first thing to look at when comparing libraries. I haven't performed comparison tests in detail, but from the results published it looks like Boost.Log is still lagging a bit behind in the multi-threaded case. The question is whether there is room for improvement here. If not, you will definitely loose out on faster libraries. When looking at our current project, there are certain parts of the application where we need a real fast (i.e. low cost) logging facility, and that is something that the current library is not going to offer (nor any of the more common logging libraries around; too often I read comments like "we choose rlog because it is twice as fast as.. "). So my idea would be to develop a lightweight logging module, that can operate next to the current functionality, but is particularly suited for applications or parts of applications where high performance is an issue. This could also be the light and simple library that people are asking for. I think it would be great to have both under one hood, allowing the user to select the kind of performance vs. capability that he wants. This also takes away the burden on the current implementation of having to be both lightweight and feature-rich. For the rest of the formal review questions: >What is your evaluation of the design? The design covers a good set of requirements to start with. It seems to be quite flexible to cater for new functionality. As stated, it might be useful to ease the use of the highly templated interface to prevent it of becoming a hurdle for novices. >What is your evaluation of the implementation? Only looked partly to the implementation, especially with performance in mind. I'm convinced that the implementation is good in general, although improvements can be made, especially with performance in mind. Date/time formatting is still a candidate in this case. >What is your evaluation of the documentation? The level of documentation is sufficient but not more then that. It seems to be written from the view of the developer or from a highly-experienced user. It therefor makes it difficult for a novice to use the library quickly. The introduction of trivial logging however improved this situation. In my view it should be reworked somewhat to cover the questions of less knowledgeable users (i.e. more explanation, more illustration through examples or references to the examples in the code). >What is your evaluation of the potential usefulness of this library? I think the library is very usefull. Regarding covered functionality it is somewhat equal to other well-known logging libraries, and the design is well-suited for extension in all areas where more functionality is required. >Did you try to use the library? With what compiler? Did you have any problems? We tried the library with Microsoft Visual C++ 8.0. We didn’t find any problems with the compiler, apart from some issue with MFC. There is a problem linking Boost.Thread statically with MFC, but this is a problem that resides outside Boost.Log. >Are you knowledgeable about the problem domain? Yes, developed this kind of functionality in earlier days. -- View this message in context: http://old.nabble.com/-log--Boost.Log-formal-review-tp27940788p27940788.html Sent from the Boost - Dev mailing list archive at Nabble.com.

3 2

[log] Boost.Log Formal Review
by sam.gundry＠gmail.com 18 Mar '10

18 Mar '10

(This is my first Boost library review so take it easy...) > Please explicitly state in your review whether the library should be accepted. Yes. There are some concerns but I think it is very nearly complete, as far as my usage is concerned. These concerns are elicited in detail below but for now my three major ones are: - __LINE__, __FILE__ as attributes - Boost.DateTime formatting is sloooowwww - Ability to strip/compile out log messages in their entirety > What is your evaluation of the design? I haven't applied it heavily yet but so far the design seems logical. Separating the sinks and sources provides good flexibility. I'm yet to delve into usage of the filters though. > What is your evaluation of the implementation? I can't speak for the correctness of the implementation, but from a performance perspective, I've compared it to log4cxx (see the sourceforge thread Andrey has referred to) and it is comparable and/or better in most of my usages. Given the flexibility, I am prepared to pay for a little performance hits. A concern, which again Andrey has mentioned during this review, is the speed of Boost.DateTime formatting. From our comparisons, it is about 3-5x slower than log4cxx. Is it possible to have a bare-minimum date time formatter similar to log4cxx's implemented? I wrote a quick little wrapper using a customised strftime (for microseconds) with the most basic caching (which log4cxx's formatter uses) and performance was comparable. > What is your evaluation of the documentation? For most the part, very good. Definitely sufficient/adequate for acceptance. The design and installation pages, etc, are extremely clear and easy to read. Personally, I would prefer a few more concrete examples. For example, (a minor one, I know) but how do you specify keywords via a settings file. > What is your evaluation of the potential usefulness of the library? High. An efficient, highly functional and configurable logging library has much potential. I've found __LINE__ and __FILE__ missing as attributes. Andrey advised these are part of named_scope but the formatting is currently missing. Ideally - and I don't know if this is technically possible but - I would prefer these as just another attribute. Instead of requiring a BOOST_LOG_FUNCTION() call when you want to use them, you should be able to specify it as per usual, something a long the lines of: backend->set_formatter( fmt::format(%1% [%2%:%3%] %4%) % fmt::attr< SeverityLevel >("Severity") % fmt::attr< fmt::scope::file >("File") % fmt::attr< fmt::scope::line >("SrcLineNumber") % fmt::message() ); And then BOOST_LOG_SEV(...) << " a message" has the file and line attribute values already. Note, no need for BOOST_LOG_FUNCTION. With respect to compiling out the log messages: it would be desirable for security, code protection and/or performance if the ability to specify certain log records to be stripped out of the source code. A hack such as follows - which is obviously extremely inflexible - allows the users to define LOG_NTRACE to compile out all trace messages: # if defined (LOG_NTRACE) # define LOG_TRACE(logger, stream) (void(0)) ; # else # define LOG_TRACE(logger, stream) BOOST_LOG_SEV(logger, trace) << stream; # endif Something a lot smarter and flexible built into the library is desirable. Say, templated on your custom severity levels (or, indeed, any arbitrary attribute) and generating disable/enable macros. > Did you try to use the library? With what compiler? Did you have any problems? Yes. gcc 4.3.3, msvc 9, and qcc/gcc 4.x.x (can't remember) on QNX. No problems. > How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? Initially, at the end of last year, I compared performance and functionality to log4cxx. However, for this review, I have had a quick read of the docs (not the code) and attempted integrating it for our purposes, about 4 hours worth. > Are you knowledgeable about the problem domain? Not hugely. Middle-of-the-road. Neither here nor there. 5/10. Relatively average. A big thanks to Andrey for all his effort. Good luck with the acceptance! Cheers, Sam

4 9

[log] Boost.Log formal review is over
by Vladimir Prus 18 Mar '10

18 Mar '10

Boosters, The forward review of the Boost.Log library is now officially over. Big thanks to Andrey for a solid proposal, and for everybody who participated in review. I plan to announce review results in a week from now, on Mar 25. Thanks, Volodya

1 0

[unordered] unordered_set::erase() complexity bug?
by Stefan Strasser 18 Mar '10

18 Mar '10

I think there is something very wrong with boost's implementation of unordered_set/map. 1 unordered_set<int> s; 2 for(int c=0;c<nr;++c) s.insert(c); 3 for(int c=nr-1;c>=0;--c) s.erase(s.find(c)); results: nr: time 20000: 0m0.244s 40000: 0m0.940s 60000: 0m5.584s 80000: 0m4.232s 100000: 0m34.814s 120000: 0m33.486s the function that's causing this is erase(), which is specified to be O(1) average, O(n) worst. I can't think of a reason why it should be O(n) in this case (perfect hash, erase doesn't rehash). but even if it was, the results should be at worst quadratic. load_factor() is below 1, bucket_count(x) is 1. if line 3 is changed to: 3 for(int c=0;c<nr;++c) s.erase(s.find(c)); 20000: 0m0.008s 40000: 0m0.016s 60000: 0m0.028s 80000: 0m0.032s 100000: 0m0.040s 120000: 0m0.044s as you would expect. even if I do the very same thing as above using Boost.Intrusive (using a load factor of 1), I get expected results: struct element : intrusive::unordered_set_base_hook<>{ ... for(int c=0;c<nr;++c) s.insert(*new element(c)); for(int c=nr-1;c>=0;--c) s.erase(s.find(element(c))); 20000 0m0.008s 40000 0m0.016s 60000 0m0.024s 80000 0m0.024s 100000 0m0.032s 120000 0m0.040s but surprisingly enough, the TR1 implementation shipped with libstdc++ also has a problem like that: 20000: 0m0.368s 40000: 0m1.448s 60000: 0m1.668s 80000: 0m7.160s 100000: 0m7.808s 120000: 0m13.349s am I missing something or is there really the same bug in 2 major implementations of unordered_set? it effectively caused a deadlock in some of my code. I'm using 1.38. no bug report in Trac.

20 48