- Boost-users - lists.preview.boost.org

HOW TO: Building flexible structure definitions
by Robert Dailey 17 Nov '07

17 Nov '07

Hi, Right now I'm trying to develop a tricky structure that MAY contain any of the following information: - Vertex coordinates (x,y,z) - Color components (r, g, b) - Texture coordinates (u, v) Basically, I'd end up having a structure that looks like this (with all information included): struct Vertex { float x,y,z; // vertex coordinates unsigned char r, g, b; // color components double u,v; // texture coordinates }; The tricky part is that the user isn't required to create a structure with all of this information. For example, the structure above could be missing texture coordinates, color coordinates, or both (however the vertex coordinates are required since I doubt we care about empty structs)! This is for OpenGL vertex buffers, so in addition to this information we need to be able to specify some information in this structure that tells external classes a little bit more about itself. Note that this information CANNOT modify the size of the Vertex structure and must be compile-time only. For example: struct Vertex { // Information (does not change size). Note that if static const unsigned int vertex_type = GL_FLOAT; // Tells openGL the type of the x,y,z members static const unsigned int color_type = GL_UNSIGNED_CHAR; // Tells openGL the type of the r,g,b members static const unsigned int texture_type = GL_DOUBLE; // Tells openGl the type of the u,v members float x,y,z; // vertex coordinates unsigned char r, g, b; // color components double u,v; // texture coordinates }; But wait! There's more I need! This is the part that I was hoping boost could help me with. I have a class that takes objects of type Vertex (well, at least in this example it does. It takes a template argument. See below). The class needs a way (at runtime) to check of the Vertex object passed in has either color, texture, or vertex data in it. Example: template< typename t_vertex > class VertexBuffer { public: VertexBuffer( const t_vertex& vert ) { // How do I check what information is in vert? } } struct Vertex1 { float x,y,z; // vertex coordinates unsigned char r, g, b; // color components double u,v; // texture coordinates }; // This vertex type has NO color! // How would VertexBuffer tell?!? struct Vertex2 { float x,y,z; // vertex coordinates double u,v; // texture coordinates }; VertexBuffer<Vertex1> vbuffer1; VertexBuffer<Vertex2> vbuffer2; Is there something in boost I can utilize to make the definition of Vertex more flexible and open-ended? Perhaps I can use boost in the VertexBuffer class as well to determine the construct of the template type being passed in? Any and ALL help is appreciated.

2 1

Problems with regex, using 1.34.1 version but asking for 1.31
by Arnau Rebassa 17 Nov '07

17 Nov '07

Hi all, I'm very newbie with boost and regex library. First I downloaded the latest version and compiled it for Visual Studio .NET 2003, the compilation went smooth but when I try to compile a minimal program it says: expressions_regulars fatal error LNK1104: cannot open file 'libboost_regex-vc71-sgd-1_31.lib'. I only have *1_34_1.lib files. Searching a bit more, I found the binary installer, so I removed everything from my manual compilation and installed it. When I try to compile, again the same message. I don't understand anything, any idea? Thanks to all!! -- Arnau _________________________________________________________________ Peek-a-boo FREE Tricks & Treats for You! http://www.reallivemoms.com?ocid=TXT_TAGHM&loc=us

2 1

SORRY, FALSE ALARM ===> boost::type_traits::is_convertible.hpp ....how to assert a type is _not_ convertible?
by jono 17 Nov '07

17 Nov '07

i was misreading the error. it was my mistake. cheers jono''

1 0

boost::type_traits::is_convertible.hpp ....how to assert a type is _not_ convertible?
by jono 17 Nov '07

17 Nov '07

hi all, i've got 2 classes like this.... //================================= struct Symbol : private std::string { public: Symbol(const char *cp):std::string(cp){} ~Symbol(){} }; struct String : private std::string { public: String(const String &s):std::string(s.c_str()){} String(const char *cp):std::string(cp){} ~String(){} }; //================================= // // and i'm trying to compile this.... // //================================= template<BinaryOp op, typename ObjectT> Object binary_op(const ObjectT &arg1, const ObjectT &arg2) { return undefined; } template<BinaryOp op> class BinaryOpVisitor : public boost::static_visitor<Object> { public: template<typename ObjectT, typename ObjectU> Object operator()( const ObjectT &arg0, const ObjectU &arg1) const { bool const y = boost::is_convertible<ObjectT, ObjectU>::value; return undefined; } template<typename ObjectT> Object operator ()(const ObjectT &arg0, const ObjectT &arg1) const { return binary_op<op, ObjectT>(arg0, arg1); } }; //================================= // // but using msvc 7.1 i'm getting the following error... // // s:\lib\boost_1_33_1\boost\type_traits\is_convertible.hpp(202) : // error C2243: 'type cast' : conversion from 'Symbol *__w64 ' to 'const std::basic_string<_Elem,_Traits,_Ax> &' exists, but is inaccessible // // //================================= // is_convertible.hpp(202) is as follows ... BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(_m_from) ) == sizeof(::boost::type_traits::yes_type) ); //================================= // // // how do i tell (deceive?) the compiler that the conversion does not exist? cheers, jono poff day-one digital auckland, nz

1 0

[mpl] making an array of sizes given a type list
by Michael Marcin 16 Nov '07

16 Nov '07

Given a MPL Random Access Container (typename Types) I want to make a static const std::size_t array which contains the sizeof each type in Types. How can I do this? Thanks, Michael Marcin

2 2

[regex] character classes when using wide chars
by Tomaž Šolc 16 Nov '07

16 Nov '07

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi Documentation says that when using wide character strings with boost::wregex a character class like [[:alpha:]] depends on the system's implementation of iswalpha() function. My system seems to have a working implementation of iswalpha() function, but [[:alpha:]] still only seems to match ASCII alphabet characters. For example the following code: #define UNICODE #include <boost/regex.h> #include <stdio.h> #include <wctype.h> #include <locale.h> int main() { regex_t r; setlocale(LC_ALL, "en_US.utf8"); regcomp(&r, L"^[[:alpha:]]$", REG_EXTENDED); printf("%d\n", iswalpha(L'A')); printf("%d\n\n", regexec(&r, L"A", 0, NULL, 0)); printf("%d\n", iswalpha(L'\x160')); printf("%d\n\n", regexec(&r, L"\x160", 0, NULL, 0)); printf("%d\n", iswalpha(L'1')); printf("%d\n", regexec(&r, L"1", 0, NULL, 0)); regfree(&r); return 0; } Returns 1 0 1 1 0 1 In the second pair, iswalpha() correctly recognizes Unicode "S WITH CARON" character, however regular expression with [[:alpha:]] doesn't match it. I'm using Debian GNU/Linux with Boost 1.33.1. I also tried a similar program using boost::wregex and std::iswalpha() classes instead of the POSIX interface with the same results. Can anyone give me some advice on what I'm doing wrong here? Thanks Tomaž Šolc -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (Darwin) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iD8DBQFHPNZXsAlAlRhL9q8RAlymAKDktxV+FWCTvBEBKwMNfr9yus5rgQCfc3N1 WoCdr+9zgBSEXPORSLAJiUM= =18dB -----END PGP SIGNATURE-----

2 3

[condition] How to wait on multiple mutexes with OR semantics?
by Andrey Tcherepanov 16 Nov '07

16 Nov '07

Hello boosters, Let's say I have a 2 condition variables, and 2 threads that wait on them. I would like to collapse these 2 threads into 1 by making thread wait on *either* of these conditions to lock their mutexes (it is not the same mutex). Is it possible to do, or I better change the logic under the hood? Thank you very much, Andrey

2 1

Boost Review Wizard Report for November 2007
by Ronald Garcia 16 Nov '07

16 Nov '07

============================================== Review Wizard Status Report for November 2007 ============================================== News ==== November 7, 2007 - Exception Library Accepted Announcement: http://lists.boost.org/boost-users/2007/11/31912.php We need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants or library contributors. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "garcia at cs dot indiana dot edu" and "jphillip at capital dot edu" respectively. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. If you're library author and plan on submitting a library for review in the next 3-6 months, send Ron or John a short description of your library and we'll add it to the Libraries Under Construction below. We know that there are many libraries that are near completion, but we have hard time keeping track all of them. Please keep us informed about your progress. Review Queue ============ * Finite State Machines * Floating Point Utilities * Switch * Property Map (fast-track) * Graph (fast-track) * Forward (fast-track) * Singleton (fast-track) * Factory (fast-track) * Lexer * Thread-Safe Signals * Logging * Flyweight * Unordered Containers -------------------- Finite State Machines --------------------- :Author: Andrey Semashev :Review Manager: Martin Vuille :Download: `Boost Sandbox Vault <http://tinyurl.com/yjozfn>`__ :Description: The Boost.FSM library is an implementation of FSM (stands for Finite State Machine) programming concept. The main goals of the library are: * Simplicity. It should be very simple to create state machines using this library. * Performance. The state machine infrastructure should not be very time and memory-consuming in order to be applicable in more use cases. * Extensibility. A developer may want to add more states to an existing state machine. A developer should also be able to specify additional transitions and events for the machine with minimum modifications to the existing code. Floating Point Utilities ------------------------ :Author: Johan Råde :Review Manager: Need Volunteer :Download: `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php? directory=Math%20-%20Numerics>`__ :Description: The Floating Point Utilities library contains the following: * Floating point number classification functions: fpclassify, isfinite, isinf, isnan, isnormal (Follows TR1) * Sign bit functions: signbit, copysign, changesign (Follows TR1) * Facets that format and parse infinity and NaN according to the C99 standard (These can be used for portable handling of infinity and NaN in text streams). Switch ------ :Author: Steven Watanabe :Review Manager: Need Volunteer :Download: `Boost Sandbox Vault <http://boost-consulting.com/vault/index.php? action=downloadfile&filename=mcs_units_v0.7.1.zip&directory=Units>`__ :Description: The built in C/C++ switch statement is very efficient. Unfortunately, unlike a chained if/else construct there is no easy way to use it when the number of cases depends on a template parameter. The Switch library addresses this issue. Property Map (fast-track) ------------------------- :Author: Andrew Sutton :Review Manager: Jeremy Siek :Download: http://svn.boost.org/svn/boost/sandbox/graph-v2 :Description: A number of additions and modifications to the Property Map Library, including: * A constant-valued property map, useful for naturally unweighted graphs. * A noop-writing property map, useful when you have to provide an argument, but just don't care about the output. * See `ChangeLog <http://svn.boost.org/trac/boost/browser/sandbox/ graph-v2/libs/property_map/ChangeLog>`__ for details. Graph (fast-track) ------------------ :Author: Andrew Sutton :Review Manager: Jeremy Siek :Download: http://svn.boost.org/svn/boost/sandbox/graph-v2 :Description: A number of additions and modifications to the Graph Library, including: * Two new graph classes (undirected and directed) which are intended to make the library more approachable for new developers * A suite of graph measures including degree and closeness centrality, mean geodesic distance, eccentricity, and clustering coefficients. * An algorithm for visiting all cycles in a directed graph (Tiernan's from 1970ish). It works for undirected graphs too, but reports cycles twice (one for each direction). * An algorithm for visiting all the cliques a graph (Bron&Kerbosch). Works for both directed and undirected. * Derived graph measures radius and diameter (from eccentricity) and girth and circumference (from Tiernan), and clique number (from Bron&Kerbosch). * An exterior_property class that helps hides some of the weirdness with exterior properties. * runtime and compile-time tests for the new algorithms. * a substantial amount of documentation * Graph cores, implemented by David Gleich (@Stanford University) * Deterministic graph generators - capable of creating or inducing specific types of graphs over a vertex set (e.g., star graph, wheel graph, prism graph, etc). There are several other specific types that could be added to this, but I haven't had the time just yet. Forward (fast-track) -------------------- :Author: Tobias Schwinger :Review Manager: John Torjo :Download: http://boost-consulting.com/vault/index.php? &direction=0&order=&directory=X-Files :Description: A brute-force solution to the forwarding problem. Singleton (fast-track) ---------------------- :Author: Tobias Schwinger :Review Manager: John Torjo :Download: http://boost-consulting.com/vault/index.php? &direction=0&order=&directory=X-Files :Description: Three thread-safe Singleton templates with an easy-to-use interface. Factory (fast-track) -------------------- :Author: Tobias Schwinger :Review Manager: John Torjo :Download: http://boost-consulting.com/vault/index.php? &direction=0&order=&directory=X-Files :Description: Generic factories. Lexer ----- :Author: Ben Hanson :Review Manager: Need Volunteer :Download: http://boost-consulting.com/vault/index.php? action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-% 20Text%20Processing& :Description: A programmable lexical analyser generator inspired by 'flex'. Like flex, it is programmed by the use of regular expressions and outputs a state machine as a number of DFAs utilising equivalence classes for compression. Thread-Safe Signals ------------------- :Author: Frank Hess :Review Manager: Need Volunteer :Download: http://www.boost-consulting.com/vault/index.php? &direction=0&order=&directory=thread_safe_signals :Description: A thread-safe implementation of Boost.signals that has some interface changes to accommodate thread safety, mostly with respect to automatic connection management. Logging ------- :Author: John Torjo :Review Manager: Need Volunteer :Download: http://torjo.com/log2/ :Description: Used properly, logging is a very powerful tool. Besides aiding debugging/testing, it can also show you how your application is used. The Boost Logging Library allows just for that, supporting a lot of scenarios, ranging from very simple (dumping all to one destination), to very complex (multiple logs, some enabled/some not, levels, etc). It features a very simple and flexible interface, efficient filtering of messages, thread-safety, formatters and destinations, easy manipulation of logs, finding the best logger/filter classes based on your application's needs, you can define your own macros and much more! Flyweight --------- :Author: Joaquín M López Muñoz :Review Manager: Need Volunteer :Download: http://www.boost-consulting.com/vault/index.php? action=downloadfile&filename=flyweight.zip&directory=Patterns :Description: Flyweights are small-sized handle classes granting constant access to shared common data, thus allowing for the management of large amounts of entities within reasonable memory limits. Boost.Flyweight makes it easy to use this common programming idiom by providing the class template flyweight<T>, which acts as a drop-in replacement for const T. Unordered Containers -------------------- :Author: Daniel James :Review Manager: Need Volunteer :Download: http://www.boost-consulting.com/vault/index.php? action=downloadfile&filename=unordered.zip&directory=Containers :Description: An implementation of the unordered containers specified in TR1, with most of the changes from the recent draft standards. Libraries under development =========================== Dataflow -------- :Author: Stjepan Rajko :Description: The Dataflow library provides generic support for data producers, consumers, and connections between the two. It also provides layers for several specific dataflow mechanisms, namely Boost.Signals, VTK data/display pipelines, and plain pointers. The Dataflow library came out of the Signal Network GSoC project, mentored by Doug Gregor. :Status: I am polishing the Dataflow library for submission, and am expecting to add it to the review queue in the next couple of months. I am currently ironing out some faults in the design of the library, filling in missing features, and testing it on / adapting it to different dataflow mechanisms (currently VTK and soon Boost.Iostreams). As soon as I'm pretty sure that things are going the right way, I'll submit this to the review queue while I do the finishing touches. Constrained Value ----------------- :Author: Robert Kawulak :Download: http://rk.go.pl/f/constrained_value.zip http://rk.go.pl/r/constrained_value (Documentation) :Description: The Constrained Value library contains class templates useful for creating constrained objects. The simplest example of a constrained object is hour. The only valid values for an hour within a day are integers from the range [0, 23]. With this library, you can create a variable which behaves exactly like int, but does not allow for assignment of values which do not belong to the allowed range. The library doesn't focus only on constrained objects that hold a value belonging to a specified range (i.e., bounded objects). Virtually any constraint can be imposed using appropriate predicate. You can specify what happens in case of assignment of an invalid value, e.g. an exception may be thrown or the value may be adjusted to meet the constraint criterions. :Status: I'm planning to finish it in 1-2 months. Please let us know of any libraries you are currently developing that you intend to submit for review.

2 1

[filesystem] List all drive letters
by Arno 16 Nov '07

16 Nov '07

Hi all, is it possible to find out all root's (especialy all drive letters) in a windows filesystem with the filesystem library. First I thought that I can navigate with the '..' notation like I see it in the Windows explorer, but that didn't work. Is there a simple possibility to do that with that libray? regards Arno

2 1

Library naming conventions
by bkash 15 Nov '07

15 Nov '07

Hi, Can anyone explain why some libraries created and installed by the build process do not have the boost version number in their names as mentioned in the getting started document? This causes a problem when I build 1_34_1 and install it to the default C:\Boost directory. I have 1_33_1 installed there for projects that will not be updated soon. The 1_34_1 build/install copies files such as boost_date_time-vc71-mt.lib. These files already exist as created by the 1_33_1 build. The file is identical to boost_date_time-vc71-mt-1_34_1.lib, so would imagine I could simply ignore it as long as the automatic linking feature would never use it. The same occurs on linux. For instance libboost_date_time-gcc32-1_34_1.a is identical to libboost_date_time-gcc32.a Thanks, bkash

1 0

leopard and boost
by Lee Faus 15 Nov '07

15 Nov '07

I am having problems with Boost and OS X (10.5) Leapord. using this command: sudo ../boost-jam-3.1.15-1-macosxppc/bjam -sTOOLS=darwin -- layout=system install i am getting a bunch of errors like this: gcc.compile.c++ bin.v2/libs/program_options/build/gcc-4.0.1/debug/ threading-multi/convert.o gcc.compile.c++ bin.v2/libs/program_options/build/gcc-4.0.1/debug/ threading-multi/winmain.o gcc.link.dll /usr/local/lib/libboost_program_options-mt-d.dylib ld: unknown option: -R collect2: ld returned 1 exit status "g++" -Wl,-R -Wl,"/System/Library/Frameworks/Python.framework/ Versions/2.5/lib" -Wl,-R -Wl,"/System/Library/Frameworks/ Python.framework/Versions/2.5/lib/python2.5/config" -o "/usr/local/ lib/libboost_program_options-mt-d.dylib" -Wl,-h - Wl,libboost_program_options-mt-d.dylib -shared -Wl,--start-group "bin.v2/libs/program_options/build/gcc-4.0.1/debug/threading-multi/ cmdline.o" "bin.v2/libs/program_options/build/gcc-4.0.1/debug/ threading-multi/config_file.o" "bin.v2/libs/program_options/build/ gcc-4.0.1/debug/threading-multi/options_description.o" "bin.v2/libs/ program_options/build/gcc-4.0.1/debug/threading-multi/parsers.o" "bin.v2/libs/program_options/build/gcc-4.0.1/debug/threading-multi/ variables_map.o" "bin.v2/libs/program_options/build/gcc-4.0.1/debug/ threading-multi/value_semantic.o" "bin.v2/libs/program_options/build/ gcc-4.0.1/debug/threading-multi/positional_options.o" "bin.v2/libs/ program_options/build/gcc-4.0.1/debug/threading-multi/ utf8_codecvt_facet.o" "bin.v2/libs/program_options/build/gcc-4.0.1/ debug/threading-multi/convert.o" "bin.v2/libs/program_options/build/ gcc-4.0.1/debug/threading-multi/winmain.o" -Wl,--end-group -g ...failed gcc.link.dll /usr/local/lib/libboost_program_options-mt- d.dylib... common.copy /usr/local/include/boost/typeof/std/list.hpp common.copy /usr/local/include/boost/typeof/std/locale.hpp common.copy /usr/local/include/boost/typeof/std/map.hpp common.copy /usr/local/include/boost/typeof/std/memory.hpp common.copy /usr/local/include/boost/typeof/std/ostream.hpp Lee Faus

2 2

Strange (wrong?) behavior of boost::regex_replace()
by Peter Klotz 15 Nov '07

15 Nov '07

The program below gives different output in Boost 1.32.0 compared to 1.33.1 and 1.34.1. In my opinion "R_Test" would be the correct result and therefore Boost 1.33.1 and 1.34.1 would be wrong. Can anyone clarify this issue? Best regards, Peter. #include <iostream> #include <boost/regex.hpp> int main() { // Boost 1.32.0: "R_Test" // Boost 1.33.1 and 1.34.1: "R_TestR_" std::cout << boost::regex_replace(std::string("Test"),boost::regex("(.*)"),"R_$1") << std::endl; return 0; }

4 4

[gil] Cannot read jpeg file
by Christian Henning 14 Nov '07

14 Nov '07

Hi there, this is most likely off-topic. But I'm a little desperate, though please excuse me. I try to load a jpeg file using gil's io extension. But it always fails. Every time when I try to execute jpeg_read_header my app crashes due to some memory exception. At this point the file is already open and yes, it's jpeg file. I'm using Visual Studio 2005 with plenty of memory. Does anyone has any idea? It must be something really simple but I can't see right now. Thanks, Christian

1 0

Re: [Boost-users] Fwd: bind, template member function and thread
by Ovanes Markarian 14 Nov '07

14 Nov '07

Olivier, I did my tests with boost 1.34.1 and VC Express 2005. Can you try at least with the version 1.34.1 of boost and your current compiler? Best Regards, Ovanes > > On 11/14/07, Olivier Tournaire <olitour(a)gmail.com> wrote: > > > > Hi, > > > > Does someone has an issue to this problem ? I am under VC7.1 with boost > > 1.33.1 > > > > 2007/11/13, Olivier Tournaire < olitour(a)gmail.com>: > > > > > > > > > > > > 2007/11/13, Ovanes Markarian < om_boost(a)keywallet.com>: > > > > > > > > And the function template ComputeRadiometries is the member of the > > > > Profile class? Can you please write the second error? > > > > > > > > > Yes. Please note that ComputeRadiometries is a member of the Profile > > > class, and that I call it a member of the MPPGraph class. Here is the second > > > error : > > > > > > error C2780: > > > 'boost::_bi::bind_t<R,boost::_mfi::cmf8<R,T,B1,B2,B3,B4,B5,B6,B7,B8>,_bi::list_av_9<A1,A2,A3,A4,A5,A6,A7,A8,A9>::type> > > > boost::bind(R (__thiscall T::* )(B1,B2,B3,B4,B5,B6,B7,B8) > > > const,A1,A2,A3,A4,A5,A6,A7,A8,A9)' : 10 arguments attendus - 4 fournis > > > > > > E:\librairies\boost_1.33.1_build\include\boost\bind\bind_mf_cc.hpp(222) : > > > voir la déclaration de 'boost::bind' > > > > > > However, where I write a simple function which encapsulates > > > ComputeRadiometries, I got no error : > > > > > > void lance_thread( boost::shared_ptr<Profile> p , boost::shared_ptr< > > > TTImage <unsigned char> > image , eInterpolatorType typeinterp) > > > { > > > p->ComputeRadiometries(image,typeinterp); > > > } > > > > > > // In another member function : > > > > > > boost::shared_ptr<Profile> p2 ( new > > > Profile(origine+(double)i*width_sur_nb_fois_wdir,rect->GetHeightDirection(),MPPParameters_.ProfilesNbPoints_,MPPParameters_.ProfilesDistancePoints_ > > > ) ); > > > boost::shared_ptr<Profile> p3 ( new > > > Profile(origine+(double)(-i)*width_sur_nb_fois_wdir,rect->GetHeightDirection(),MPPParameters_.ProfilesNbPoints_,MPPParameters_.ProfilesDistancePoints_ > > > ) ); > > > lance_thread(p2,image_,BICUBIC); > > > lance_thread(p3,image_,BICUBIC); > > > > > > Regards > > > > > > On 11/13/07, Olivier Tournaire <olitour(a)gmail.com> wrote: > > > > > > > > > > Here is the method signature : > > > > > > > > > > // in profile.hpp > > > > > template <class T> void ComputeRadiometries( boost::shared_ptr< > > > > > TTImage <T> > image , const eInterpolatorType type_interpolator=BICUBIC ) > > > > > { > > > > > // ... > > > > > } > > > > > > > > > > Here is how I create the threads > > > > > > > > > > // ... > > > > > boost::shared_ptr<Profile> p2 ( new > > > > > Profile(origine+(double)i*width_sur_nb_fois_wdir,rect->GetHeightDirection(),MPPParameters_.ProfilesNbPoints_,MPPParameters_.ProfilesDistancePoints_ > > > > > ) ); > > > > > boost::thread t( > > > > > boost::bind > > > > > ( > > > > > &Profile::template ComputeRadiometries<unsigned > > > > > char> > > > > > , p2 > > > > > , image_ > > > > > , BICUBIC > > > > > ) > > > > > ); > > > > > > > > > > 2007/11/13, Ovanes Markarian < om_boost(a)keywallet.com>: > > > > > > > > > > > > Can you please post here som example how you function signature > > > > > > looks like, and how you create a new thread? > > > > > > > > > > > > Regards, > > > > > > Ovanes > > > > > > > > > > > > On 11/13/07, Olivier Tournaire <olitour(a)gmail.com> wrote: > > > > > > > > > > > > > Geat, seems simpler. However, it does not compile for me > > > > > > > (boost 1.33.1). Aot of error, but the first one seems to be > > > > > > > the more interesting : > > > > > > > > > > > > > > error C2780: > > > > > > > 'boost::_bi::bind_t<R,boost::_mfi::dm<R,T>,_bi::list_av_1<A1>::type> > > > > > > > boost::bind(R T::* ,A1)' : 2 arguments attendus - 4 fournis > > > > > > > > > > > > > > (translation attempt : [...] 2 args waited, 4 given) > > > > > > > > > > > > > > > > > > > > > > _______________________________________________ > > > > Boost-users mailing list > > > > Boost-users(a)lists.boost.org > > > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > > > > > > > > > > > > > > -- > > > Le temps des cerises reviendra. Dans l'immédiat, c'est le temps des > > > noyaux. Courage. > > > > > > > > > > > -- > > Le temps des cerises reviendra. Dans l'immédiat, c'est le temps des > > noyaux. Courage. > > > > _______________________________________________ > > Boost-users mailing list > > Boost-users(a)lists.boost.org > > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > >

2 3

[iterator] readable and writable transform_iterator
by Chris Weed 14 Nov '07

14 Nov '07

I can't figure out how to make a writable transform_iterator work. Here is what I have: #include <boost/iterator/transform_iterator.hpp> #include <boost/tuple/tuple.hpp> #include <vector> template< int N > struct Get { template<typename T> struct result; template<int M,typename T> struct result<Get<M>(T&)> { typedef typename boost::reference_wrapper<typename boost::tuples::element<M,T>::type>::type type; }; template<typename Tup> typename result<Get<N>(Tup&)>::type operator()(Tup& t) { return boost::tuples::get<N>(t); } }; int main() { std::vector<boost::tuple<int,float> > v1; v1.push_back(boost::make_tuple(1,2.2f)); v1.push_back(boost::make_tuple(2,3.2f)); std::vector<boost::tuple<int,float> > v2(2); std::copy(boost::make_transform_iterator(v1.begin(),Get<0>()), boost::make_transform_iterator(v1.end(),Get<0>()), boost::make_transform_iterator(v2.begin(),Get<0>())); } g++ seems to get hung up on figuring out the result type of Get<0>. Any help would be greatly appreciated. Chris

3 6

"Getting Started" document : missing documentation of the stdlib flag (fwd)
by Vincent Torri 14 Nov '07

14 Nov '07

Hello, no news about that request ? thank you Vincent Torri ---------- Forwarded message ---------- Date: Sat, 3 Nov 2007 11:15:13 +0100 (CET) From: Vincent Torri <vtorri(a)univ-evry.fr> To: boost-users(a)lists.boost.org Subject: "Getting Started" document : missing documentation of the stdlib flag Hello, If I'm not mistaken, to compile boost with STLport, one must pass -stdlib=stlport (or something like that) to bjam. But it's not mentionned in the "Getiing Started" documentation (Unix or Windows), while STLport itself is mentioned. Also, stdlib is mentioned when I launch bjam with --help, --help-options or --help-internal. Can someone add the documentation of the stdlib flag in "Getting Started", please ? (and maybe also in the boost build, to get doc with bjam --help) Thank you Vincent Torri

2 1

Fwd: bind, template member function and thread
by Ovanes Markarian 14 Nov '07

14 Nov '07

On 11/13/07, Olivier Tournaire <olitour(a)gmail.com> wrote: > > Yep, that what I tried, but it does not work. The compiler error is > described below. This is really strange. This code compiles fine: typedef bool (Profile::*mem_fcn)(boost::shared_ptr< TTImage <unsigned char> >, eInterpolatorType); mem_fcn f = &Profile::template ComputeRadiometries<unsigned char>; and the doc example states for member functions: boost::function<int (X*, int)> f; f = &X::foo; X x; f(&x, 5); But I also got errors. Regards, Ovanes

2 8

Is Anyone going to tell me the way to Build BOOST?
by question boost 14 Nov '07

14 Nov '07

Hi, at boost root directory i do: C:\Program Files\boost> bjam ^More? --build-dir=C:\Program Files\boost \directory_1 ^More? --toolset=gcc stage the error message is the following :could not find main target assuming it's a name of a file to create could not find main target C:\Program Files\boost \directory_1 assuming it's a name of a file to create... note:C:\Program Files\boost is my boost root directory, stage a subdirectory of directory_1 Be very clear THANK YOU, David _________________________________________________________________ Découvrez le blog Messenger Le Meilleur du Web : toutes les vidéos qui buzzent le plus sur Internet ! http://meilleurduweb.spaces.live.com/

6 8

Boost - Build Directory Problem
by chandra_india＠webdunia.com 14 Nov '07

14 Nov '07

2 1

[filesystem] sugges: directory_begin(), directory_end()
by v2cechura 14 Nov '07

14 Nov '07

I would suggest introduction of (template) functions that would return "begin" and "end" directory iterators. I think that it's clearer to see: for_each(directory_begin( dir_path ), directory_end(), do_something()); than for_each(directory_iterator( dir_path ), directory_iterator(), do_somethig()); The functions directory_begin()/directory_end() would mimic the convenient container.begin()/container.end() functions used in STL. I know that it's merely a decoration but so is std::make_pair. It could just be: template <class Path> inline class basic_directory_iterator<Path> directory_begin(const Path& dp) { return basic_directory_iterator<Path>(dp); } template <class Path> inline class basic_directory_iterator<Path> directory_end() { return basic_directory_iterator<Path>(); } Vaclav Cechura

1 0

Boost semaphore with condition variable
by f＠rtfs.org 14 Nov '07

14 Nov '07

Hi! I have a quite simple problem, but I still lack a nice implementation in C++ with boost. My problem is, that I have two threads A and B and thread A needs some information that B will calculate at runtime. Therefore I need some kind of synchronization. So my first attempt was to use a mutex and a condition variable: Thread A: boost::thread::mutex::scoped_lock lock ( mMutex ); mConditionVar.wait ( lock ); Thread B: mConditionVar.notify_one (); This works nice as long as thread A already started waiting on the condition before thread B finished providing it. Otherwise the notify will be lost. So my second attempt was to use a barrier: Init barrier with count 2 Thread A: mBarrier.wait (); Thread B: mBarrier.wait (); This works fine and A will wait until the result is available and it doens't matter if it starts waiting before or after B finished calculaating. But the problem now is that B also needs to wait for A to reach the point in execution. So if I just want to signal thread A from thread B that some point was reached . I don't know how to do it with boost. If I would have a semaphore available I could init it with 0 and thread A tries to decrement it while thread B will increment it once it reached the point. But http://www.boost.org/doc/html/thread/faq.html#id1747096 says: "Semaphore was removed as too error prone. The same effect can be achieved with greater safety by the combination of a mutex and a condition variable." So how exactly is this achived with the mutex and condition variable. I always only come up with a mutex, condition variable and a bool which all three must be shared between both threads. I would greatly appreciate any suggestions! Thanks, Fabian

1 0

Re : RE : Re: compilation trouble with boost::regex
by hallouina-ml＠yahoo.fr 14 Nov '07

14 Nov '07

Thanks for your answer, I think it's clear : So you mean that BOOST_REGEX_MATCH_EXTRA is made for matching for exemple somethingsomething in the string : "blablablasomethingsomethingblablabla". Is it right? In fact I want extract all the link from a webpage. I want to used the regex because this is faster than doing a DOM tree from the webpage. So I want doing the perl equivalent of @matches =~ m/.*(regex_of_the_url_with_href).*/gs g flag because I want extract all of the url. s flag beacause I want that "." match "\n" too. ----- Message d'origine ---- De : John Maddock <john(a)johnmaddock.co.uk> À : boost-users(a)lists.boost.org Envoyé le : Mardi, 13 Novembre 2007, 17h13mn 26s Objet : Re: [Boost-users] RE : Re: compilation trouble with boost::regex hallouina-ml(a)yahoo.fr wrote: > I need Perl style capture like m/(some_regex)/g > > because I need the g flag (to capture more than one time my regex). So > if I understand the documentation (as you can see, my english is far > from beeing perfect...) ; if I want to use the g flag equivalent in my > regex, I need to enable this feature. Oh no you don't :-) The Perl /g flag is something different again: the equivalent functionality in Boost.Regex is regex_iterator, which enumerates one at a time over all the possible matches in a string. Repeated captures come into play when you have say an expression "(something)+" matched against "somethingsomething" in which case in Perl: $0 = "somethingsomething" $1 = "something" With BOOST_REGEX_MATCH_EXTRA enabled then $1 contains a list of all the "something"'s matched by the first capturing group within a single overall match. I hope this is clear, Regards, John Maddock. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users _____________________________________________________________________________ Ne gardez plus qu'une seule adresse mail ! Copiez vos mails vers Yahoo! Mail

3 2

boost-users [program options, tuple]
by chun ping wang 14 Nov '07

14 Nov '07

Hi i would like to know how to make program options play nicely with tuple. int main( int ac, char* av[] ) { namespace po = boost::program_options; po::options_description desc("Allowed options"); std::vector<BigInteger> key_pair; desc.add_options() ("generate", "generates a pair of key") ("secert", po::value(&key_pair)->multitoken(), "creates the share secret key"); po::variables_map vm; po::store(po::parse_command_line(ac, av, desc), vm); po::notify(vm); try { if (vm.count("generate")) { BigInteger my_prime = encryptcpw::random_prime<BigInteger>(&algocpw::Solovay_Stressen<BigInteger>, 16); std::cout << "my prime: " << my_prime << "\n"; boost::tuple<BigInteger, BigInteger> pare(encryptcpw::dh_init<BigInteger>( my_prime )); std::cout << "pair of generated number: " << pare << "\n"; } if (vm.count("secert")) { const BigInteger p( encryptcpw::random_prime<BigInteger>(&algocpw::Solovay_Stressen<BigInteger>, 16)); std::cout << encryptcpw::dh_secret<BigInteger>( p, key_pair[0], key_pair[1]); } } catch (const char* error) { std::cerr << error << "\n"; } } I would like to replace vector with tuple. boost::tuple<BigInteger, BigInteger> key_pair; for some reason doing that cause the program to crash.. when run DiffieHellman --generate 1371 2397

1 0

template specializing question (boost::static_visitor related)
by jono 14 Nov '07

14 Nov '07

hello all. i have a boost::static_visitor that delegates to a static function to enable partial specialization... /// the templates & so on are declared as so ...... /// /// /// ============================================================= typedef enum {ADD, SUBTRACT, MULTIPLY, DIVIDE, EQUAL, LESS} BinaryOp; template<BinaryOp op, typename ObjectT> Object binary_op(const ObjectT &arg1, const ObjectT &arg2) {return undefined;} template<BinaryOp op, typename ObjectT, typename ObjectU> Object binary_op(const ObjectT &arg1, const ObjectU &arg2) {return undefined;} template<BinaryOp op> class BinaryOpVisitor : public boost::static_visitor<Object> { public: template<typename ObjectT, typename ObjectU> Object operator()( const ObjectT &arg0, const ObjectU &arg1) const { return binary_op<op, ObjectT, ObjectU>(arg0, arg1); } template<typename ObjectT> Object operator ()(const ObjectT &arg0, const ObjectT &arg1) const { return binary_op<op, ObjectT>(arg0, arg1); } }; /// ============================================================= /// /// then i have specialized the binary_op function as follows.... /// /// ============================================================= template<> Object binary_op<ADD>(const Integer& arg0, const Integer& arg1) {return make< Integer >(arg0 + arg1);} template<> Object binary_op<ADD>(const Real& arg0, const Real& arg1) {return make< Real >(arg0 + arg1);} /// ============================================================= /// /// the problem arises when i want to apply an operator to heterogenous but convertible types, eg: Integer + Real /// /// ============================================================= template<> Object binary_op<ADD>(const Integer& arg0, const Real& arg1) {return make< Real >(arg0 + arg1);} template<> Object binary_op<ADD>(const Real& arg0, const Integer& arg1) {return make< Real >(arg0 + arg1);} /// ============================================================= /// /// as shown, i can get the result i want by explicitly specializing each combination of operands, /// but if i add a Complex, then a Rational, then a Modulus and so on, i end up with a combinatorial explosion. /// /// i would like to find a way of doing all this with a single specialization for each pair of heterogenous operands, /// such that they can be accepted in any order... /// any takers? cheers Jono Poff Day One Digital Media Auckland, NZ

1 0

pulling my hair out over Leopard
by Mark Roden 14 Nov '07

14 Nov '07

Hi everyone, I'm trying to get leopard and boost to play nice, so that I can use dicomlib for another app. Apparently, dicom lib requires boost, because it gives 116 error messages if you try to compile in xcode without it. To repro: 1) download dicomlib from http://dicomlib.swri.ca/joomla/index.php?option=com_remository&Itemid=26&fu… 2) put those files into an xcode project 3) watch as they don't compile with 116 errors all related to boost I've tried: 1) including the boost header files in the xcode project. xcode doesn't care unless I change all the < to ", which is painful, time consuming, and frankly, stupid. 2) installing boost at /usr/local/include using ./configure make sudo make install as an administrator. Of course, the boost library is handily titled 'boost-1_34_1' instead of something like 'boost', which means that I have to soft link it using ln -s. Neither the regular install nor the ln option gets around the 115 compile errors. 3) I tried bjam -sTOOLS=darwin and bjam -sTOOLS=darwin -sBUILD=framework, neither of which work, both of which give errors that ld -h is an unrecongized option. I don't know where the linker options are defined, so maybe just getting rid of -h would do it, but that switch probably means something, so just wholesale removing a compiler switch may not be the best move. So here's the real question: How do I make this work? I've lost about 24 hours to this, and I just don't see how it's gonna work. In the meantime, I'm guessing I'm gonna go with http://www.apple.com/downloads/macosx/math_science/quickdicomtoolkit.html but knowing my luck, that will require something similar as well.... Thanks for your help, Mark

5 8