- Boost - lists.boost.org

[config] Macro proposal
by Gennaro Prota 13 Jul '06

13 Jul '06

Hi guys, could we please add something like this to the config system? #if defined(__GNUC_PATCHLEVEL__) # define <choose_a_name> ( __GNUC__ * 10000 \ + __GNUC_MINOR__ * 100 \ + __GNUC_PATCHLEVEL__ ) #else # define <choose_a_name> ( __GNUC__ * 10000 \ + __GNUC_MINOR__ * 100) #endif PS: of course it's possible to "share" the common part of the replacement-lists: ( __GNUC__ * 10000 + __GNUC_MINOR__ * 100) or (100 * ( __GNUC__ * 100 + __GNUC_MINOR__)) The decision is up to John :) --Gennaro.

4 19

Random Access to Files (RAF) - any interest ?
by Slava, Alex 13 Jul '06

13 Jul '06

Dear Boost Community, Is there any interest in submission of a Random Access to Files (RAF) Library to Boost? Please see http://www.trukhanov.kiev.ua/RAF/ for documentation and an initial implementation. Thank you, -- Svyatoslav Trukhanov, Oleksii Ursulenko

9 34

Re: [boost] Is there interest in parallel versions of<algorithm>functions?
by Oliver.Kowalke＠qimonda.com 13 Jul '06

13 Jul '06

Hi, > Before parallel <algorithm> things, I think we need to step > back and handle the cross-thread domain container issues. It > is very common in hardware programming to have a FIFO go > between clock domains. I'm picturing the same thing for > software; a FIFO where the push is in one thread and the pop > in the other. The thread with the pop would block on a pop > call until there was data and the thread with the push would > block on push if the FIFO were full. Already implemented (thread_queue) - please look at boost vault / Concurrent Programming / thread_queue or defer library. regards, Oliver

1 0

[BGL] Querying the vertex/edge property map from an graph obj
by Wang Weiwei 13 Jul '06

13 Jul '06

hello, Is there a nonmember function, say vertex_property_map()/Edge_property_map() of the graph classes that can be used to query the vertex/edge property map from an graph obj? Thanks Max

1 0

Re: [boost] [BGL] Help Needed
by Wang Weiwei 13 Jul '06

13 Jul '06

>I have yet to be able to use edge descriptors as keys >to external property maps. Try using internal >property maps. > > Cromwell D. Enage > Thanks for your help. Would you pls give me an example showing the usage of internal property map for the vertices and edges? Thanks again. max

1 0

Evaluation of the PropertyTree library
by Stroemsdoerfer, Christian 12 Jul '06

12 Jul '06

I am currently using the PropertyTree library and I think it's both useful and easy to use. I haven't looked too much into the implementation, but I wanted to mention that although the library enables the use of wchar_t for properties and their values, it does not do so for file names (xml_read for instance takes a "std::string" for a filename). There are, however, people amongst us that work on operating systems with Unicode-enabled file systems. This should be supported by the library. Sincerely, Christian Strömsdörfer

3 2

boost 1.33.1 and MSVC.NET 2005
by jmzorko＠mac.com 12 Jul '06

12 Jul '06

Hello, all ... I'm aware that Boost 1.33.1 and MSVC.NET 2005 have some issues working together, and though i've built a version of our app that uses the latest Boost stuff from CVS (which gets along much better with MSVC.NET 2005), I also need to build a version that uses 1.33.1. Since 1.33.1 gets along well with the MSVC.NET 2003 compiler, we built the boost binaries with that compiler. The problem i'm having right now -- which may be more of a VC problem than a Boost one -- is that i'm trying to use those binaries with MSVC.NET 2005. The 2005 linker is looking for 'liboost_filesystem- vc80-mt-sgd-1_33_1.lib', but since this Boost library was built with MSVC.NET 2003, it's called 'liboost_filesystem-vc80-mt- sgd-1_33_1.lib'. These names are never directly referenced in my project e.g. 2005's linker seems to somehow divine the name of the static Boost library it's to link to ... but I don't know how this is done, or how to change it to look for the 7.1 version. Any ideas? Regards, John Falling You - exploring the beauty of voice and sound http://www.fallingyou.com

2 1

[assign] two assign_decay's?
by Shunsuke Sogame 12 Jul '06

12 Jul '06

Hi, 'assign_detail::assign_decay' is defined at both <list_of.hpp> and <ptr_list_of.hpp>? -- Shunsuke Sogame

2 2

new library proposition : lisp interpreter library
by Guillaume Chereau 12 Jul '06

12 Jul '06

Hello, I want to suggest a new boost library, that could be used to parse and run lisp programs. I think of a way to create at compile time a language interpreter with list syntax, but with only the needed features. It could be used for people who need to run simple scripts from a C++ program, but who don't want to use python. Here is an naive example to illustrate what I mean (I hope it is clear enough by itself) using boost.lisp // we create the lisp interpreter with integer and math operation support lisp::lisp<lisp::with_int, lisp::with_math> mylisp; // we run the lisp program : (+ 10 20) lisp::result res = mylisp.run(lisp::word("+") >> 10 >> 20); std::cout << ret.as<int>() << std::endl; // same thing but from a string res = mylisp.run(lisp::parse("(+ 10 20)") ) It may then be possible to expose C++ functions and classes the same way it has been done for python by the boost.python library. What do you think of this idea ? Guillaume

4 4

big integer implementation
by Brannon King 12 Jul '06

12 Jul '06

So does the big integer class use the CPU's carry flag? I'm picturing an implementation where you chop the dataset into int32_t. Then, for the add operation, each piece is composed of a.int32_t[x]+b.int32_t[x]+carry flag of the previous operation. Does that sound right? If so, I'm wondering how you're using the carry flag. Do you get that using assembly code or is there some standard C/C++ command to give you access to that? (Or would somebody mind taking a second and pointing me to the correct location for the code for that?) Using the above method, I think it would be quite useful to have these dataset types: u/int128_t, u/int192_t, u/int256_t Anyone else agree? ______________________________ Brannon King ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯

2 1