- Boost - lists.boost.org

[interprocess] Ticket 9414 (32 process communicating with 64 process)
by Joseph Van Riper 20 Jun '14

20 Jun '14

I ran into a problem with message queues that, after a couple of days investigation, lead to finding this bug. I notice that the maintainer has labelled this bug as 'invalid'. I would like to convince the maintainer otherwise. My alternatives are less optimum. I am working on a project where, on a Windows machine, I am running a service that waits for messages on the message queue. On a 32-bit environment, I will not run into any problems. But in a 64-bit environment, I may have either 64-bit or 32-bit clients attempting to write to the message queue, due to the nature of my needs and the nature of the Windows operating system. The messages from the clients are not specific to the bit-ness of the client, but are sent to the server. The server records these messages to a database it maintains. The server then pulls messages from the database and posts it to a web page. As the code stands now, I will have to compile both a 32-bit and 64-bit version of the server to install on 64-bit WinOS boxes, maintaining two separate databases of similar information, which will post to the web site with no sense of co-ordination (and little hope of co-ordination since they can't talk to each other). Or, alternatively, I would have to create my own message queue that doesn't rely upon std::size_t, but perhaps uses boost::uint32_t or boost::uint64_t instead... but it seems silly to me to maintain another message queue when this one is very close to being able to do what I need. I should also point out that I need for this to work in Linux as well, although I don't expect Linux has the Windows annoyance of having to work with two different bit-wise operating systems on one box. At the very least, I'd like a dialog, so I can understand why this defect is considered 'invalid'. Convince me that it really is invalid, and I'll go away. Otherwise, I respectfully argue against it. - Trey

3 4

blincubator comments
by Sohail Somani 19 Jun '14

19 Jun '14

Hi Robert, First of all, great idea and thanks for doing it. The concepts are solid and the site will be a great help for users and authors alike. It appeared that it was not possible to add any reviews anonymously. Is this by design? Does one have to register? It would be clearer if the page was unavailable or that there was a placeholder requiring the visitor to register before they could view the "submit review" page[1]. I closed the page after writing a review and being unable to submit because it seemed the site was buggy and so I set out to submit a report, but maybe the mistake was that I was supposed to have registered first. It was unclear. Also, if you ever do consider writing another version, consider Django because the admin interface[2] could allow you to generate a nice interface without futzing around with plugins and can also help you create a more maintainable site because it forces you into a structure. I'd be happy to help if you choose to go this way. General question: are there any other sites/applications of this kind out there? It seems to be a generally useful thing to make it easier to solicit user contributions for open source software. The closest would be a fork+pull request in Github that people can comment on. Maybe that's enough, I don't know. [1] http://rrsd.com/blincubator.com/review/?library_post_id=769 [2] http://www.djangobook.com/en/2.0/chapter06.html Sohail

3 4

[interest] Is there interest in planar angle library ?
by Matus Chochlik 19 Jun '14

19 Jun '14

On Tue, Jun 17, 2014 at 11:52 PM, Robert Ramey <ramey(a)rrsd.com> wrote: > how would this differ from boost units? > For one thing, in its dependencies, Boost.Units is a wonderful library, but for many use-cases it is too heavyweight. As mentioned before this library depends only on standard cmath. Also this library is more specialized on angle operations than Boost.Units is, at least out of the box. Matus

2 2

[gil] Optimizations
by Harg Tholan 19 Jun '14

19 Jun '14

Hi all, I've been wondering whether is there any room for ASM optimizations in GIL. Regards, H4rg.

2 1

[modularization] spirtit -> serialization
by Vicente J. Botet Escriba 19 Jun '14

19 Jun '14

Hi, comments about this dependency: |<boost/serialization/vector.hpp>| * from |<boost/spirit/home/support/detail/lexer/serialise.hpp>| It seems that this file is not used |boost/spirit/home/support/detail/lexer/serialise.hpp Could this file be removed or moves to examples? Best, Vicente |

10 58

Interest in bit-wise flags?
by Jeffrey Bush 19 Jun '14

19 Jun '14

Hi Boost! I have developed a type-safe bit-wise flags class for my own personal use and am wondering if it would be of interest for me to submit it as a Boost library. At the moment it is not ready for submission (code is messy) but I am testing the waters so I present an overview below. * Fully ISO standard C++11 (except for an MSVC version which is API-compatible except it doesn't support as many an infinite number of flag names) * They are type-safe, requiring explicit casts to and from integers/booleans * Supports standard bit-wise operations, and always keep values within the possible set of flags * Supports getting the name of a flag and looking up flags by name at run-time (when a flag is actually multiple-flags it gives something like "A|B") * Supports getting an array of all flags at run-time Now the bad things, which may be a deal-breaker: * Because of limitations in C++ the syntax can feel a bit awkward. You have to use a macro to define flag-names (which actually creates a class) then you can pass those flag-names as template arguments to the flags. An example: FLAG_NAME(A); FLAG_NAME(B); FLAG_NAME(C); typedef Flags<std::uint8_t, Flag_A, Flag_B, Flag_C>::WithValues<0x01, 0x02, 0x04> MyFlags; * I also couldn't get around using the ::WithValues nested class * I use a set of macros to make this cleaner (e.g. the above could be FLAGS(A, B, C)) and once defined there is no more ugliness Thanks for consideration! Jeff

5 5

Boost Library Incubator recommended by steering committee
by Beman Dawes 18 Jun '14

18 Jun '14

The Boost Library Incubator (www.blincubator.com) is a web site conceived, designed, and implemented to alleviate the log-jam of libraries waiting to be reviewed by Boost. It helps new library submitters through the process, encourages development of an initial user base, and accumulates feedback in the form of comments, test results and Boost style reviews. The Boost Steering Committee has voted to recommend using the Boost Library Incubator as a prelude to getting a library reviewed by Boost. The Steering Committee recommends libraries currently in the Boost review queue be added to the Incubator by their developers. The relationship between Boost and the Incubator is purely informal, but there as several things Boosters can do to help make the Incubator a success. Authors can submit their libraries and respond to feedback. Users can experiment with submitted libraries and provide feedback on their experience. WordPress/php developers can contribute enhancements to the Boost Library Incubator implementation. The steering committee extends its thanks to Robert Ramey for launching the Boost Library Incubator! --The Boost Steering Committee

5 7

[modularization] Missing libs/core file
by Vicente J. Botet Escriba 18 Jun '14

18 Jun '14

Hi, I don't reach to get the last changes in libs/core after un update of the whole boost repository and it modules cd modular-boost git checkout master git pull git submodule update viboes$ pwd /Users/viboes/github/modular-boost/libs/core viboes$ ls What I need to do to see this new repository? Vicente

9 17

[1.56][multi_index][Sandia-intel-11.1] help with SIGSEVs
by Joaquin M Lopez Munoz 18 Jun '14

18 Jun '14

[I have previously posted to boost-testing to no avail] Hi, Boost.MultiIndex is all green on master except for these two tests with Intel 11.1 on Darwin: http://tinyurl.com/keofovz http://tinyurl.com/muhtnn2 which build fine but exit with code 139 (seg fault) on execution. Could someone with access to this environment trace the error down to more useful information such as the offending line, valgrind backlog or something? Thank you in advance, Joaquín M López Munoz Telefónica

1 0

[interest] Is there interest in planar angle library ?
by Matus Chochlik 17 Jun '14

17 Jun '14

Hi, I would like to gauge interest in adding a very lightweight library implementing a class for handling planar angles and related operations to Boost. The library sources and several examples of usage can be found here: https://github.com/matus-chochlik/angle It does not conform to Boost conventions yet, nor is there any documentation, but the library is very simple to use: There is a template angles::angle<T> representing planar angles, using type T to store the angle value in radians. Conversions for 10 common angle units are included and new units can easily be added. The library also implements construction functions and user-defined literal operators allowing to specify angles in various units and also implements overloads of functions like sin, cos, etc. The only external header that this library includes is standard `cmath`. Here follow some examples of usage: using namespace angles; for(angle<double> a; a < 4_turns; a += 45_deg) { std::cout << a.to<unit::degree>() << std::endl; } for(angle<double> a=-quarters(2); a <= quarters(2); a += gradians(50)) { std::cout << a.to<unit::turn>() << std::endl; } for(angle<double> a; a < turns(1); a += degrees(15)) { std::cout << sin(a) << std::endl; } assert(turns(1) == quarters(4)); assert(degrees(90) == gradians(100)); assert(degrees(45) == quarters(0.5)); assert(degrees(2) == minutes(120)); assert(minutes(4) == seconds(240)); assert(degrees(1) == seconds(3600)); assert(turns(0.5) == gradians(200)); assert(pi(1) == quarters(2)); assert( 3_o_clock == 90_deg); assert( 6_o_clock == 200_gon); assert( 7_o_clock == 210_deg); assert( 9_o_clock == 300_gon); assert(11_o_clock == 1_turns - 30_deg); assert(12_o_clock == 2_pi); Please let me know if you are interested in the 'Boostification' of this library or if you have any ideas on how it could be improved. Best regards, Matus

3 2