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

boost MPI user-defined datatype.
by Jack Bryan 24 Jun '10

24 Jun '10

Hi, all: Where can I find some boost.MPI example program about how to transfer user-defined datatype from one process to another process ? I cannot find it on boost.org and google. Any help is appreciated. thanks Jack June 22 2010 _________________________________________________________________ The New Busy is not the old busy. Search, chat and e-mail from your inbox. http://www.windowslive.com/campaign/thenewbusy?ocid=PID28326::T:WLMTAGL:ON:…

2 2

What is the bare minimum that needs to implemented for a Graph concept?
by W.P. McNeill 24 Jun '10

24 Jun '10

The concept checking code for the Graph concept seems to require more associated types than is called for by the documentation. According to "The Boost Graph Library" book by Siek et al. and documentation on the boost website ( http://www.boost.org/doc/libs/1_43_0/libs/graph/doc/Graph.html) the Graph concept needs just four associated types: vertex_descriptor, directed_category, edge_parallel_category, and traversal_category. I implemented the following bare-bones graph concept: #include <boost/graph/graph_concepts.hpp> struct ImplicitGraph { // Graph concept typedef size_t vertex_descriptor; typedef boost::undirected_tag directed_category; typedef boost::disallow_parallel_edge_tag edge_parallel_category; typedef boost::adjacency_graph_tag traversal_category; }; int main (int argc, char const *argv[]) { boost::function_requires< boost::GraphConcept<ImplicitGraph> >(); ImplicitGraph g; return 0; } However, when I try to build it I get the following errors from the concept checking code: graph_traits.hpp:30: error: no type named ‘edge_descriptor’ in ‘struct ImplicitGraph’ graph_traits.hpp:31: error: no type named ‘adjacency_iterator’ in ‘struct ImplicitGraph’ graph_traits.hpp:32: error: no type named ‘out_edge_iterator’ in ‘struct ImplicitGraph’ graph_traits.hpp:33: error: no type named ‘in_edge_iterator’ in ‘struct ImplicitGraph’ graph_traits.hpp:34: error: no type named ‘vertex_iterator’ in ‘struct ImplicitGraph’ graph_traits.hpp:35: error: no type named ‘edge_iterator’ in ‘struct ImplicitGraph’ graph_traits.hpp:41: error: no type named ‘vertices_size_type’ in ‘struct ImplicitGraph’ graph_traits.hpp:42: error: no type named ‘edges_size_type’ in ‘struct ImplicitGraph’ graph_traits.hpp:43: error: no type named ‘degree_size_type’ in ‘struct ImplicitGraph’ I would not expect the concept checker to give me these errors because these types are not part of the documented Graph concept. Also, the out_edge_iterator and in_edge_iterator don't make sense for the undirected graph I have defined here. Is the concept checking code out of sync with the documentation, or am I misunderstanding how concept checking works? This is Boost version 1.42 installed via Macports on OS X.

2 1

[TUPLE] n for an n-tuple
by Hossein Haeri 24 Jun '10

24 Jun '10

Dear all, Given an n-tuple t, is there any way to acquire n from t itself? I mean something like: tuple<int, float> t; size_t n = t.size();//n == 2 TIA, --Hossein

2 1

Re: [Boost-users] [RFC] Signals bound to phoenix functions
by Thomas Heller 24 Jun '10

24 Jun '10

On Thursday 24 June 2010 09:31:36 Thomas Heller wrote: > On Wednesday 23 June 2010 18:50:38 Ovanes Markarian wrote: > > Stephan, hi! > > > > please see my answer below. > > > > On Wed, Jun 23, 2010 at 5:42 PM, Stephan Menzel > > <stephan.menzel(a)gmail.com>wrote: > > > Unless I want to add something. Unfortunately I can't always take > > > wrap()s output but have to modify a little. In fact, my Queue needs to > > > be templatized as well, modifying the behaviour of the functor. I have > > > a template parameter "Calling". When it is true, another function > > > shall be called by the functor after the method was posted. Now I > > > wanted to do this by phoenix: > > > > > > template <bool Calling> > > > class Queue { > > > > > > template<typename Handler> > > > > > > void post(Handler n_handler) { > > > > > > m_iosrv.post(n_handler); > > > > > > }; > > > > > > ... > > > > > > template<typename SlotSignature, typename SlotFunction> > > > boost::signals2::connection > > > > > > connect(boost::signals2::signal<SlotSignature> &n_signal, SlotFunction > > > n_method) { > > > > > > return n_signal.connect( > > > > > > if_( CallingBack ) [ > > > > > > post(n_method) , > > > m_signal_callback() > > > > > > ] .else_ [ > > > > > > m_iosrv.wrap( n_method ) > > > > > > ] ); > > > > > > }; > > > > > > ... > > > > It is difficult to conclude smth from the code without having a > > self-containing example. But my assumption is that in the 'else'-branch > > your code does not generate a function object. As far as I can see in the > > 'if'-branch your code generates a function object using the the > > comma-operator (if that operator is overloaded in Phoenix), in the > > 'else'-branch you just have a normal function call, which is not lazy and > > does not return a function-object. > > Phoenix statements always return void. > What you want is: > phoenix::if_else( CallingBack, /* then functor */, /*else functor */ ) > > For reference: > http://www.boost.org/doc/libs/1_43_0/libs/spirit/phoenix/doc/html/phoenix/c > omposite.html#phoenix.composite.operator and > http://www.boost.org/doc/libs/1_43_0/libs/spirit/phoenix/doc/html/phoenix/c > omposite.html#phoenix.composite.statement (There is a note at the end of > that section, for the return value of phoenix statements) Sorry misunderstood your problem ... The correct answer is: post, m_signal_callback() and m_iosrv.wrap need to be lazy expressions. To achieve that for the first two, you can have a phoenix::function wrapper, for the last one, you can use phoenix::bind (which can be used for the first two as well).

2 1

Re: [Boost-users] ptrdiff_t
by yushang 24 Jun '10

24 Jun '10

Hi John, Thanks for your tips . I searched my system directory , found 2 cstddef files , one is in my VC directory and one is in boost compatibility directory . The latter do import ptrdiff_t into std namespace . It seems boost include the former . Should I copy boost's cstddef to my VC directory ? BTW I'm using WDK (Windows Driver Kit) , C compiler version is 15.00 and not ran bootstrap.bat ever. Many thanks > > This makes no sense to me, which VC++ version are you using, and what > compiler options? Boost.Array works just fine for me under VC++ and always > has. > > FYI, ptrdiff_t is defined in crtdefs.h and then imported into namespace std > in cstddef - at least it is in VC9. > > John.

2 1

[RFC] Signals bound to phoenix functions
by Stephan Menzel 24 Jun '10

24 Jun '10

G'day, I'd like to get your opinion on a problem that puzzles me for a while. Basically, I'm trying to do sort of a delayed signals2 notification mechanism. I have a class wrapped around ASIOs io_service object that I normally use as a thread multiplexer and function storage. Now in this case I want to use it without working threads so a current thread can process whatever handlers are in it. Which works fine but now I want to connect signals to it. I have several data classes that contain signals. These are to be connected to slots, but not directly. Instead, these slots are to be wrapped in little handlers and these handlers shall be put in the io_service object. So the signal's slot should not be executed straight away but by another thread that executes everything in the io_service. Now this strikes me as something that could be done nicely with phoenix. I want to use phoenix to create a little function that I can connect to the signal and that will do nothing more but post the handler into the io_service when the signal is triggered. I just can't figure out if that can actually work. Here's what I have so far (simplyfied). I try to illustrate on an example with a one-parameter slot. class Queue : public boost::noncopyable { public: template<typename Handler> void post(Handler n_handler) { m_iosrv.post(n_handler); } std::size_t process(boost::system::error_code & n_errcode) { return m_iosrv.poll(n_errcode); }; template<typename Slot> boost::signals2::connection connect(boost::signals2::signal<void()> &n_signal, Slot n_method) { return n_signal.connect(boost::bind(&CommandQueue::slotWrapper<Slot>, this, n_method)); }; template<typename Slot, typename T1> boost::signals2::connection connect(boost::signals2::signal<void(T1)>& n_signal, Slot n_method) { return n_signal.connect(boost::bind(&CommandQueue::slotWrapper<Slot, T1>, this, n_method, _1)); } // ... more to come with more parameters T2, T3..... private: template<typename Slot> void slotWrapper(Slot n_method) { post(n_method); } template<typename Slot, typename T1> void slotWrapper(Slot n_method, T1 t1) { boost::function<void(T1)> f(n_method); post(boost::bind(f, t1)); } // ... more to come with more parameters ... boost::asio::io_service m_iosrv; }; Now I can use this like this: struct testslot_one { void operator()(int n_arg) const { std::cout << "testslot 1: " << n_arg << std::endl; } }; main { Queue q; boost::signals2::signal<void (int)> sig1; struct testslot_one t1; q.connect(sig1, t1); // signal not yet executed but only the handler posted sig1(42); boost::system::error_code errc; // here we execute the accumulated signals q.process(errc); } Now this works OK so far but I have two problems: First of all, the standard use case will be to bind member functions and not seperate functors such as "testslot_one" in this example. Which is when the connect fails. For reasons unknown to me. But that must work. Second, I want to get rid of the "slotWrapper" functions and replace them by a phoenix expression. If that makes sense, which I'm not sure of. Also, I am not certain about the whole thing. Can a phoenix generated function actually serve this way? Just post the handler when the signal is triggered? Any opinions are appreciated! Cheers, Stephan

2 4

boost::regex - I do not understand why this test fails.
by Mauricio Gomes 23 Jun '10

23 Jun '10

Hi, Below it is a self contained example and the output it produces. I thought I would get a match for REGEX2 but not for REGEX1 in string s. However REGEX1 matches and produces weird (for me) results. I would expect REGEX1 only matches for strings with 6 terms (3 words and 3 numbers). I know this probably is just a regex (lack of ) knowledge problem on my part and not a boost::regex problem but I could not find a better forum than this one to ask for help. Thank you in advance for your attention ! Mau. #define BOOST_TEST_MODULE test_module_example #include <boost/test/included/unit_test.hpp> #include <boost/lexical_cast.hpp> #include <boost/regex.hpp> #include <string> BOOST_AUTO_TEST_SUITE(example_suite) BOOST_AUTO_TEST_CASE(example_test) { boost::cmatch res; std::string s = " JETIX 2,957,081 643,225.51 0.00"; // tabs separating the terms. static const std::string& REGEX1 = "\\s*(\\w+)\\s+([\\d,\\.]+)\\s+([\\d,\\.]+)\\s([\\d,\\.]+)\\s*$"; static const std::string& REGEX2 = "\\s*(\\w+){1}\\s*(\\w+){1}\\s*(\\w+){1}\\s+([\\d,\\.]+){1}\\s+([\\d,\\.]+){1}\\s([\\d,\\.]+){1}\\s*$"; boost::regex rx(REGEX2); if (boost::regex_match (s.c_str(), res, rx)) { BOOST_CHECK_EQUAL ("JETIX" , res[1]); BOOST_CHECK_EQUAL ("2,957,081" , res[2]); BOOST_CHECK_EQUAL ("643,225.51", res[3]); BOOST_CHECK_EQUAL ("0.00" , res[4]); } else { BOOST_FAIL ("It was supposed to match."); } boost::cmatch res2; boost::regex rx2(REGEX1); bool match = boost::regex_match (s.c_str(), res2, rx2); for (unsigned i = 0; i < res2.size (); ++i) std::cout << res2[i] << std::endl; if (match) // IT FAILS HERE. BOOST_FAIL ("It was NOT supposed to match."); } BOOST_AUTO_TEST_SUITE_END() -------------------------------------------------------------------------------------- Output: Running 1 test case... JETIX 2,957,081 643,225.51 0.00 JET I X 2,957,081 643,225.51 0.00 C:/projects/test/main2.cpp(40): fatal error in "example_test": It was NOT supposed to match. *** 1 failure detected in test suite "test_module_example" Process returned 201 (0xC9) execution time : 0.250 s Press any key to continue.

3 4

Re: [Boost-users] ptrdiff_t
by yushang 23 Jun '10

23 Jun '10

I've check crtdefs.h on my system . It defined ptrdiff_t here but not under std namespace . Is the right place that ptrdiff_t got defined ? If not in which file should ptrdiff_t be defined . Maybe I should search the file where size_t got defined ? thanks in advance > Message: 7 > Date: Wed, 23 Jun 2010 10:56:27 +0200 > From: Niels Dekker - address until 2010-10-10 > <niels_address_until_2010-10-10(a)xs4all.nl> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] ptrdiff_t > Message-ID: <4C21CC3B.30408(a)xs4all.nl> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Stefan Strasser wrote: >> Zitat von yushang: >> >>> I'm using boost with VC , when using array.hpp compiler complain the >>> following error: >>> 'ptrdiff_t' : is not a member of 'std' >>> I searched ptrdiff_t definition in all files , found it defined in >>> crtdefs.h which is not in namespace std. But array class has this >> >> #include <cstddef> >> >> array should include it though, if it doesn't please file a bug report: >> http://www.boost.org/support/bugs.html > > > ptrdiff_t *is* a member of 'std'. And boost/array.hpp *does* #include > <cstddef>. At least at http://www.boost.org/doc/libs/1_43_0/boost/array.hpp > > So yushang, do you really think it's a Boost bug? > > Kind regards, > > Niels > -- > Niels Dekker > http://www.xs4all.nl/~nd/dekkerware > Scientific programmer at LKEB, Leiden University Medical Center > >

3 2

[array] range check (at compile time)
by alfC 23 Jun '10

23 Jun '10

Hi, Lately I find myself using boost::array intesively, specially in small demo programs. Sometimes, when "manually" accessing the elements I type a index out of range. The library can detect these errors once the program is running but I found this a waste, also I was surprised not to see this kind of static check not implemented in the library. So I wanted to see if I could enforce range checking at compile time, and I come out with this solution. namespace boost{ //sorry about the namespace name template<size_t IDX, typename T, size_t N> const T& get(boost::array<T, N> const& arr){ BOOST_STATIC_ASSERT(IDX<N); return arr[IDX]; } template<size_t IDX, typename T, size_t N> T& get(boost::array<T, N>& arr){ BOOST_STATIC_ASSERT(IDX<N); return arr[IDX]; } } #include<iostream> void main(){ boost::array<double, 3> a = {1,2,3}; std::clog<<boost::get<2>(a)<<std::endl; // ok, (namespace specification needed, why?) std::clog<<boost::get<5>(a)<<std::endl; //does not compile return 0; } (I though about using enable_if instead of BOOST_STATIC_ASSERT but that would be too much overengineering.) Is this implemented already in some other way? Alfredo

6 8

Best libraries for a Boost workshop
by José Tomás Tocino García 23 Jun '10

23 Jun '10

Hi, I'm going to be teaching a four hours workshop about getting started with Boost, and I'm wondering which libraries would be the most representative and interesting to show. I was thinking about doing a quick review of the boost libraries that were accepted for the C++ Technical Report 1, quickly saying what each is about, and showing one example. That would be the first part of the workshop. For the second part, I'm making a selection of the most interesting libraries. I'd thoroughly explain each of them, showing several examples and maybe giving some time for the students to fiddle with their computers and the libraries. And here's where I need your help. So far, the libraries I'm sure I'm going to teach are: smart pointers, lexical_cast, bind and function, ref, hash and unordered containers. I'd also add strings algorithms, maybe regex and/or tokenizer. I'm not sure about «program options». Anyway, what's your advice? What are the 12~15 boost libraries you find essential? Thanks in advance. -- José Tomás Tocino García

12 16

[multi-index] looking for "not greater than"
by Igor R 23 Jun '10

23 Jun '10

Hello, I've got a container with an ordered non-unique key. I have to find an element, which is not greater than X. [1, 3, 3, 5, 7] myIndex.not_greater_than(4) --> 5 myIndex.not_greatet_than(7) --> 7 myIndex.not_greatet_than(8) --> 7 IUUC, neither lower_bound(), nor upper_bound() can help here. Is there a simple way to do this? Thanks.

3 4

[BGL] Stoer–Wagner min-cut algorithm
by Daniel Trebbien 23 Jun '10

23 Jun '10

> The usual idiom for that in BGL algorithms is to use an > iterator_property_map on the graph's vertices, built using a vector and > indexed by the vertex_index property map of the graph. You can also use a > shared_array_property_map, which manages its storage internally. If you > are doing a generic algorithm, the logic to manage these maps correctly is > somewhat difficult. One place to look for a template of what to do is the > distance map handling at the bottom of > <boost/graph/dijkstra_shortest_paths.hpp>, particularly > dijkstra_shortest_paths() and detail::dijkstra_dispatch1(). The basic > logic is to look at the named parameter structure that the user passes is > and see if there is an assignment map there. If so, use it; otherwise, > look for a vertex_index map in the named parameter structure, defaulting > to get(vertex_index, g), then use the found vertex_index map to create an > iterator_property_map or shared_array_property_map. Now that compilers > are more compliant, there are probably simpler ways to implement the logic > than to use multiple dispatch functions, but the approach in > dijkstra_shortest_paths.hpp is known to work. > > When you get this algorithm done, you may want to contribute it to BGL to > be added to Boost. We are always interested in new algorithms. > > -- Jeremiah Willcock Hello Jeremiah, I would very much like to contribute my implementation of the Stoer–Wagner min-cut algorithm to BGL. In preparation for this, I have attached a "pre-release" version to this e-mail which has everything needed to build the test case with g++ and GNU Make. Before I add in all of the template code to support "default" template parameters and other niceties, I figured that it would be good to have a review of the code to make sure that I am headed in the right direction. Also, I have tested my code against the example from Stoer & Wagner (1997). It appears to be working correctly, but there might be bugs. I think that it would be good to have more testing. Would someone please review my code? Also, is anyone aware of good examples for testing min-cut implementations? Daniel

2 3

Re: [Boost-users] boost-io streams building with zlib/bzip2 again
by Filip Konvička 23 Jun '10

23 Jun '10

Hi Sean, > Bjam toolset=msvc stage –SZLIB_SOURCE=”c:\progrma files\zlib\” > > This still doesn’t find the zlib.h file which is in c;\program files\zlib. Are you sure you don't have any typos in your path? :-) I don't know what the official way is, but I use something like this (guessing your actual zlib path): set "ZLIB_SOURCE=C:\Program Files\zlib" bjam ....... I'm not sure whether the space in the zlib path could be an issue.... Cheers, Filip

1 0

Boost Graph - Get the vertex based on the
by Muthuveerappan Alagappan 23 Jun '10

23 Jun '10

Hi, I am a newbie to boost graph library (BGL). 1) To build a graph with vertices with unique ids - Able to do this 2) To get the vertex containing a specific idsI have created a graph with vertices that have a custom property. - how can I do this ? The way I have tried to do is to iterate through all the vertices and checked each vertex's property value. Is there a better way to do this ? Note - This field is a unique Id field Can it be indexed based on the unique id, so that it can be accessed directly ? I have attached the cpp file which shows a small example. It would be great if someone can help with this. Thanks, Muthu

2 1

ptrdiff_t
by yushang 23 Jun '10

23 Jun '10

Hi dear all, I'm using boost with VC , when using array.hpp compiler complain the following error: 'ptrdiff_t' : is not a member of 'std' I searched ptrdiff_t definition in all files , found it defined in crtdefs.h which is not in namespace std. But array class has this declaration: typedef std::ptrdiff_t difference_type; which cause compiler's complaining , a work arround is to get rid of the std namespace typedef ptrdiff_t difference_type; but I found there are a lot of files to change , apparently this is a tough task , any good suggestion ? thanks in advance

3 2

[iterator] lazy container
by alfC 23 Jun '10

23 Jun '10

Hi, I am implementing a lazy container/iterator that represents the results of certain iterative algorithm. I have a class (call it solver) that should look like an interator. First I was using boost.operators to make it look like a pointer but then I found boost.Iterator. Because of the nature of the algorithm it can be only traversed forward. I am using it in this way: class solver : //public boost::dereferenceable<solver, result const*>, //replaced with boost::iterator public boost::iterator_facade<solver, result const, boost::forward_traversal_tag, result const /*noref*/ >{ ... result dereference() const{ //was result operator*() const ... } void increment() {...} //was operator++ } note that tipically the last argument is intended to be a reference but in this case, since there in no underlying data the return can't be a reference but a new element generated by the algorithm. Question: is this the intended use of boost::iterator_facade is there an alternative base class for lazy operators? Thank you, Alfredo

1 0

[serialization] no RTTI data error
by Noah Roberts 22 Jun '10

22 Jun '10

I'm hoping someone can help me narrow down what I might be looking for. Already spent a lot of time trying to get somewhere and still trying to step through but using VS2010 and it's slower than ANYTHING ELSE THAT EXISTS!! The problem is that when I load my file I get an, "Access violation - no RTTI data," error. Yes, RTTI is turned on and the application actually relies upon it very heavily throughout its operation (acyclic visitor is a major component). The problem seems to have just cropped up and is within code that has previously passed tests. Best I can do at this point is describe the problem and hope someone has an idea of what to look for because I've been inch by inch stepping through serialization template code with a debugger that takes 30 seconds each damn step. I won't be done for hours. (anyone know how to speed this bitch up?) The problem seems to involve a type that I'm using save/load_construct_data on. There is a collection of these objects that is stored and loaded previously in the file and then I try to load a vector of objects that have shared pointers to these previously loaded objects on an individual basis. It was working fine and then I attached more data after the vector. Now it throws this exception when I try to load the pointer; before it reaches the new code that is otherwise entirely unrelated (it's just an object that happens to be stored in the same parent). If and when I get more information I'll post but for now I'm hoping someone can save me some time and frustration. This debugger is the slowest damn thing I've ever seen in my life. -- http://crazyeddiecpp.blogspot.com/

2 3

asio: tcp::iostream::async_connect with specific io_service instance
by Walther Zwart 22 Jun '10

22 Jun '10

I have a question about boost asio iostreams. I'm trying to create a server and client with tcp::iostreams that use async_connect and async_accept and use a specific tcp::io_service instance. My code currently looks somewhat like this. Server: ------------ io_service my_service; tcp::endpoint my_endpoint; ... ... tcp::acceptor my_acceptor(my_service, my_endpoint); tcp::iostream my_stream; my_acceptor.async_accept(my_stream.rdbuf(), boost::bind(connectedHandler, placeholders::error)); ------------ This works the way I want to. Another thread calls run on the io_service and thus makes sure the accept is handled. Client: ------------ io_service my_service; tcp::endpoint my_endpoint; ... ... tcp::iostream my_stream; my_stream.rdbuf()->async_connect(my_endpoint, boost::bind(connectedHandler, placeholders::error)); ------------ This doesn't work with my io_service. I don't see a way to tell the tcp::iostream or the underlying basic_socket_streambuf which io_service to use. This means I have to call run on a new io_service every time I connect to a socket somewhere, right? Is there a way to do an async_connect with your own service? regards, Walther

1 0

Providing a string-to-X feature
by John Dlugosz 22 Jun '10

22 Jun '10

Suppose I wanted to expose a "parse from string" feature for my data type. For discussion, I'll suppose it's a date/time type since everyone knows that and it illustrates the worst problems. What is the current thought on the "best practices" way to expose this? Maybe I'll start with a stream operator>>, and make sure it works with lexical_cast<X>(string). But, where do I add the extra options that tells it what to allow or assume when parsing? Dates for example might have different formats and it can recognize any legal format, but you can tell it to ignore some since that clashes with other input data. It contains spaces and trailing components are optional, so it doesn't know when to stop until it runs into something that doesn't fit. In some sense, that ought to be a constructor. But it should take any kind of string-like thing or stream, and the declaration might clash with other more normal constructors, so a purpose-named "take from human-readable form" is better. An earlier discussion touched on whether to use lexical_cast or a to_string function. This is the other direction, but might have similar issues. Only from_string doesn't seem to be as omni-present as an expectation. Any suggestions? --John (big footer ahead) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

matrix_slice access, assignment, issues
by Eric Shamay 22 Jun '10

22 Jun '10

I've been trying to form a class based on the matrix_slice to ease some operations. Thus far I have: http://codepad.org/EepVDx2C The compiler complains about the line where I form a matrix_slice (line 21 in the paste), and specifically with the first argument. I'm lost as to why I can't submit a matrix<double> as the first argument in the manner I've tried. Any help would be greatly appreciated. ~Eric

2 1

[MPI] error in hybrid OpenMP + Boost.MPI application
by Riccardo Murri 22 Jun '10

22 Jun '10

Hello, I have an OpenMP+MPI application, which crashes with an exception on some inputs. The backtrace shows that the error originates in the Boost.MPI code:: terminate called after throwing an instance of 'boost::archive::archive_exception' what(): unregistered class ... [compute-0-7:23208] [ 0] /lib64/libpthread.so.0 [0x3110c0e4c0] [compute-0-7:23208] [ 1] /lib64/libc.so.6(gsignal+0x35) [0x3110430215] [compute-0-7:23208] [ 2] /lib64/libc.so.6(abort+0x110) [0x3110431cc0] [compute-0-7:23208] [ 3] /usr/lib64/libstdc++.so.6(_ZN9__gnu_cxx27__verbose_terminate_handlerEv+0x114) [0x31114bec44] [compute-0-7:23208] [ 4] /usr/lib64/libstdc++.so.6 [0x31114bcdb6] [compute-0-7:23208] [ 5] /usr/lib64/libstdc++.so.6 [0x31114bcde3] [compute-0-7:23208] [ 6] /usr/lib64/libstdc++.so.6 [0x31114bceca] [compute-0-7:23208] [ 7] /home/oci/murri/sw/lib/libboost_serialization.so.1.43.0(_ZN5boost7archive6detail19basic_iarchive_impl12load_pointerERNS1_14basic_iarchiveERPvPKNS1_25basic_pointer_iserializerEPFS9_RKNS_13serialization18extended_type_infoEE+0x23b) [0x2b3d485348ab] [compute-0-7:23208] [ 8] /home/oci/murri/rank/rank_wf_dbg(_ZN5boost7archive6detail17load_pointer_typeINS_3mpi15packed_iarchiveEE6invokeIPN9Waterfall9Processor9SparseRowEEEvRS4_RT_+0x49) [0x4d7989] [compute-0-7:23208] [ 9] /home/oci/murri/rank/rank_wf_dbg(_ZN5boost7archive4loadINS_3mpi15packed_iarchiveEPN9Waterfall9Processor9SparseRowEEEvRT_RT0_+0x22) [0x4d79f6] [compute-0-7:23208] [10] /home/oci/murri/rank/rank_wf_dbg(_ZN5boost7archive6detail15common_iarchiveINS_3mpi15packed_iarchiveEE13load_overrideIPN9Waterfall9Processor9SparseRowEEEvRT_i+0x28) [0x4d7a20] [compute-0-7:23208] [11] /home/oci/murri/rank/rank_wf_dbg(_ZN5boost7archive21basic_binary_iarchiveINS_3mpi15packed_iarchiveEE13load_overrideIPN9Waterfall9Processor9SparseRowEEEvRT_i+0x23) [0x4d7a45] [compute-0-7:23208] [12] /home/oci/murri/rank/rank_wf_dbg(_ZN5boost3mpi15packed_iarchive13load_overrideIPN9Waterfall9Processor9SparseRowEEEvRT_iN4mpl_5bool_ILb0EEE+0x23) [0x4d7a6b] [compute-0-7:23208] [13] /home/oci/murri/rank/rank_wf_dbg(_ZN5boost3mpi15packed_iarchive13load_overrideIPN9Waterfall9Processor9SparseRowEEEvRT_i+0x2a) [0x4d7a98] [compute-0-7:23208] [14] /home/oci/murri/rank/rank_wf_dbg(_ZN5boost7archive6detail18interface_iarchiveINS_3mpi15packed_iarchiveEErsIPN9Waterfall9Processor9SparseRowEEERS4_RT_+0x2a) [0x4d7ac4] [compute-0-7:23208] [15] /home/oci/murri/rank/rank_wf_dbg(_ZNK5boost3mpi12communicator9recv_implIPN9Waterfall9Processor9SparseRowEEENS0_6statusEiiRT_N4mpl_5bool_ILb0EEE+0x93) [0x4f41ef] [compute-0-7:23208] [16] /home/oci/murri/rank/rank_wf_dbg(_ZNK5boost3mpi12communicator4recvIPN9Waterfall9Processor9SparseRowEEENS0_6statusEiiRT_+0x3f) [0x4f427b] [compute-0-7:23208] [17] /home/oci/murri/rank/rank_wf_dbg(_ZN9Waterfall4rankEv+0x291) [0x4acf27] [compute-0-7:23208] [18] /home/oci/murri/rank/rank_wf_dbg(main+0x698) [0x4ad9b6] [compute-0-7:23208] [19] /lib64/libc.so.6(__libc_start_main+0xf4) [0x311041d974] [compute-0-7:23208] [20] /home/oci/murri/rank/rank_wf_dbg [0x4aa219] [compute-0-7:23208] *** End of error message *** One MPI rank is started per compute node; all OpenMP threads may call mpi::isend(); only one will do mpi::iprobe()/mpi::recv(). Although the above error is in the mpi::communicator::recv(), serializing the mpi::isend() calls apparently solves the issue; similarly, the program runs fine if I run it on one node only; with some other (smaller) inputs, it runs fine as well. This leads me to think that it is a thread-safety issue with the MPI part. I have checked that the MPI library (OpenMPI 1.4.2) is initialized with MPI_Init_threads() and provides the threading level MPI_THREAD_MULTIPLE. So, question: is there a (known) thread-safety issue with Boost.MPI, or should I definitely look somewhere else? Thanks for any help! Riccardo

2 1

[BGL] algorithms and listS as vertex list container
by Christophe Goessen 22 Jun '10

22 Jun '10

Hello, I recently tried to use some (almost all) shortest path algorithms from BGL. But since my program remove a lot of vertices, I opted for an adjacency list graph with list as vertex list container instead of vector. > boost::adjacency_list <boost::setS, boost::listS, boost::bidirectionalS,[...] This seems to trigger some troubles at compilation level. If I try anything else than vector for vertex list I'm rewarded by similar errors: > boost/graph/relax.hpp:55: error: no matching function for call to ‘put(long unsigned int*&, void*&, long unsigned int)’ My question is as follow, do algorithms handle graphs with list (or set) as vertex list containers? I searched for information about this on the internet and in the documentation but failed to find any clues. Thanks -- Christophe

2 5

Erorr compiling application with boost 1.43.0 on WinXp/VS2008
by Ovidiu MacSiniuc 22 Jun '10

22 Jun '10

Hello everybody, I am developing some application on Visual Studio 2008. I am working on Windows XP (sp3) and our minimim requirement platform for the applcation is also WinXp. I downloaded and compiled the lasta boost version (1.43.0). However, when compiling the application I'm getting this error: C:\Boost\1.43.0\boost/asio/detail/win_fenced_block.hpp(48) : error C3861: 'MemoryBarrier': identifier not found It looks like the MSVC wants to build it as a Vista application since according to http://msdn.microsoft.com/en-us/library/ms684208%28VS.85%29.aspx minimum supported client for MemoryBarrier(void) is Windows Vista. What would be the proper fix for this issue? Thanks, Ovidiu

2 4

[Proto] Building custom expression and new domain deduction not working
by Joel Falcou 22 Jun '10

22 Jun '10

Here's an update on my last version. I have now added a new function building a custom expression node in a given domain. http://codepad.org/ddjFylti This code fails to compile under current trunk by saying that there is no proper operator+ to find. I guess it's because it can't see t and iota(0,8) to be in the same , compatible domain. Did I do something wrong ?

3 2

[boost][lambda] How to adapt container objects?
by Peter Barnes 22 Jun '10

22 Jun '10

I need to create an index using a std:vector as the sort key. boost::lamda and std::sort seem just the thing: // Data vectors // // Goal is to sort index based on values of random // std::vector<int> index(10); // 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 std::vector<int> random(10); // random values, not in order namespace bll = boost::lambda ; // Sorted through vector pointer // // This compiles // std::vector<int> * ranp = & random; std::sort(index.begin(), index.end(), bll::var(*ranp)[bll::_1] < bll::var(*ranp)[bll::_2] ); In reality, my std::vector is wrapped in another object (for reasons given below, but unrelated to this question), with an operator[] to retrieve contents: // Container wrapper class Container { std::vector<int> _v; public: Container(std::vector<int> v) : _v(v) { } ; const int operator[](const int i) { return _v[i]; } }; // Sorted through container object // // This *does not* compile // Container * cvp = new Container(random); std::sort(index.begin(), index.end(), bll::var(*cvp)[bll::_1] < bll::var(*cvp)[bll::_2] ); /* Compiler error (g++ 4.01 (Apple)): obj-indexer.cc:95: instantiated from here boost/lambda/detail/operator_lambda_func_base.hpp:137: error: conversion from 'const int' to non-scalar type 'boost::lambda::detail::unspecified' requested */ I don't understand the error message, and can't make out from the documentation why this doesn't work. Do I need to extend the return type deduction system somehow? But operator[] is not one of the action types. Thanks for your help, Peter Aside: Why do I wrap std::vector inside Container? I'm memory constrained, so I combine a std::vector<uint16_t> with a std::map to catch the overflows. The operator[i] then computes int ret = vector[i] + ( (o = map.find(i)) != map.end() ? o->second * 2^16 : 0); ____________ Peter Barnes pdbj(a)me.com ____________ Peter Barnes pdbj(a)me.com

2 1

[Exceptions] Boost exception relationship with std exception & streams
by joel falcou 22 Jun '10

22 Jun '10

I'm about to use boost.exception in a library which may require to be built in environnement where using std is eitehr impossible or has huge penalty one may want to avoid. My main idea was to use the BOOST_THROW_EXCEPTION and the error_info to build the diagnostic infos into exception class then: - if BOOST_NO_EXCEPTIONS is not set, process normally - if BOOST_NO_EXCEPTIONS is set, then jump into a throw_exception function that just stream diagnsotic_info to cerr or some such - if BOOST_NO_EXCEPTIONS and NT2_NO_STREAM is set, jump to a throw_exception that fprintf the diagnostic_info to stderr My question is: how deeply std elements ar eintegrated in boost::exception and is this kind of scheme workable with current version ?

3 5

[statechart] Somebody aware of a graphical uml tool?
by Dietmar Hummel 22 Jun '10

22 Jun '10

Hi all! Does somebody know a graphical uml modelling tool which ist able to create template code for boost::statechart? Thanks in advance... Dietmar

1 0

posix_time io slow
by Hite, Christopher 22 Jun '10

22 Jun '10

I'm in the process of writing a logging library and I noticed that each call to print out ptime took about ~50us. Even just printing out the duration time_of_day cost ~20us. I'm using boost1.43 with g++ (GCC) 4.4.3 g++ -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -DNDEBUG I was able to do the same thing for <1us not using stream ops (see code below). Does anyone care to optimize this stuff? I'm considering specializing my own boost::date_time::ostream_time_duration_formatter to override to slow impl. template<typename int_t> void printDecimal(int_t d,int places,char* out){ int_t rest=d; for(int i=0;i<places;i++){ out[places-i-1]= '0'+(rest%10); rest/=10; } } void printDuration(const boost::posix_time::time_duration& d,char* out){ int64_t ticks=d.ticks(); int64_t us=ticks%1000000; int64_t r1=ticks/1000000; int64_t s=r1%60; int64_t r2=r1/60; int64_t m=r2%60; int64_t h=r2/60; printDecimal(h,2,out); out[2]=':'; printDecimal(m,2,out+3); out[5]=':'; printDecimal(s,2,out+6); out[8]='.'; printDecimal(us,6,out+9); } .. char buf[32]; printDuration(pt.time_of_day(),buf); std::cout<< buf <<" -\n"; // <1us //std::cout<< pt.time_of_day() <<" -\n"; // ~15us Chris

2 1

Most efficient way to use boost::asio
by Dmytro Ovdiienko 22 Jun '10

22 Jun '10

Hello All, I'm implementing high performance network application and looking for the tutorial how to use boost asio library in _most_ efficient way. One part of application is TCP server/client. It should support SSL (if remote site supports SSL). Also it should support synchronous and asynchronous modes to write/read to/from socket to get best latency/throughput results (I'm not sure though if there any sense in synchronous mode). Another part is UDP client. It uses asynchronous IO. I noticed that null_buffers, shared_ptr make application slower. Are there other stuffs I should avoid? Thank you for assistance. Dima

1 0

Re: [Boost-users] Serializing to .csv files
by alfC 22 Jun '10

22 Jun '10

On Jun 13, 7:37 pm, "Sean Farrow" <sean.far...(a)seanfarrow.co.uk> wrote: > Hi: > > Has anyone ever written extra classes to serialize c++ datatypes to .csv > files using boost.Serialization. this is the closest (and still not quite) thing I found to what you are looking for http://code.google.com/soc/2008/boost/appinfo.html?csaid=BE3EEB904A90B03A serialization to YAML format. I don't know more details, but it can be useful to use as an example on how to do .cvs serialization. On the other hand what you can actually serialize with .cvs is limited to list of numbers, isn't it? (is there even a formal specification what a cvs file should be like?) Alfredo

2 1

Re: [Boost-users] boost-io streams building with zlib/bzip2 again
by Johan Nilsson 22 Jun '10

22 Jun '10

Sean Farrow wrote: > Hi: > Ok, This is now sorted, but in the process, I may have found a bug, > if I specify a path on windows using a full path: > C:\progrma files\zlib\ I assume that's another typo? > This doesn't work I get a c1083 error. > But if I use "c:\progra~1\zlib\" as the path this works fine. > Is this a bug, or intended beheavour? It's a problem related to passing variables containing spaces to bjam. See if this helps: http://www.boost.org/doc/tools/build/doc/html/jam/usage.html#jam.usage.opti… Regards / Johan

1 0

Re: [Boost-users] boost-io streams building with zlib/bzip2 again
by Mikko Vainio 22 Jun '10

22 Jun '10

It's probably a typo: you misspelled "program" in your full path invocation. Cheers, Mikko On 06/22/2010 08:05 AM, Sean Farrow wrote: > Hi: > Ok, This is now sorted, but in the process, I may have found a bug, if I > specify a path on windows using a full path: > C:\progrma files\zlib\ > This doesn't work I get a c1083 error. > But if I use "c:\progra~1\zlib\" as the path this works fine. > Is this a bug, or intended beheavour? > Regards > Sean. > > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Steven Watanabe > Sent: 22 June 2010 05:10 > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] boost-io streams building with zlib/bzip2 again > > AMDG > > Sean Farrow wrote: >> Error 2 doesn't make sense, can you elaborate? >> > > It's Perl syntax for regex replacement. i.e. replace progrma with > program. > >> Sean Farrow wrote: >> >>> Bjam toolset=msvc stage -SZLIB_SOURCE="c:\progrma files\zlib\" >>> >> >> Error 1: lowercase -s, -sZLIB_SOURCE... >> Error 2: s/progrma/program/ >> > > In Christ, > Steven Watanabe > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > --

1 0

Re: [Boost-users] boost-io streams building with zlib/bzip2 again
by Steven Watanabe 22 Jun '10

22 Jun '10

AMDG Sean Farrow wrote: > Error 2 doesn't make sense, can you elaborate? > It's Perl syntax for regex replacement. i.e. replace progrma with program. > Sean Farrow wrote: > >> Bjam toolset=msvc stage -SZLIB_SOURCE="c:\progrma files\zlib\" >> > > Error 1: lowercase -s, -sZLIB_SOURCE... > Error 2: s/progrma/program/ > In Christ, Steven Watanabe

2 2

Re: [Boost-users] boost-io streams building with zlib/bzip2 again
by Richard Clokie 22 Jun '10

22 Jun '10

On 22/06/2010 4:21 p.m., Sean Farrow wrote: > Ok, so what should the correct zlib_source path be given that is it in > c:\program files\zlib\ > Cheers > Sean. You typoed the 'program' in "c:\progrma files\zlib\" in your bjam invocation.

1 0

Re: [Boost-users] boost-io streams building with zlib/bzip2 again
by Steven Watanabe 22 Jun '10

22 Jun '10

AMDG Sean Farrow wrote: > Following the previous message, > > I've altered the command line used to: > > Bjam toolset=msvc stage -SZLIB_SOURCE="c:\progrma files\zlib\" > > This still doesn't find the zlib.h file which is in c;\program files\zlib. > > Can someone give me a command line under windows that builds this > successfully, or tell me what is going wrong, as I appear to have followed > instructions in the IO streams docs. > Error 1: lowercase -s, -sZLIB_SOURCE... Error 2: s/progrma/program/ In Christ, Steven Watanabe

2 1

boost-io streams building with zlib/bzip2 again
by Sean Farrow 22 Jun '10

22 Jun '10

Hi: Following the previous message, I've altered the command line used to: Bjam toolset=msvc stage -SZLIB_SOURCE="c:\progrma files\zlib\" This still doesn't find the zlib.h file which is in c;\program files\zlib. Can someone give me a command line under windows that builds this successfully, or tell me what is going wrong, as I appear to have followed instructions in the IO streams docs. Cheers Sean.

1 0

Re: [Boost-users] issues when building boost with zlib and bzip2
by Steven Watanabe 22 Jun '10

22 Jun '10

AMDG Sean Farrow wrote: > I'm trying to build boost with both the bzip2 and zlib io filters. I've > tried the following command line with no success: > > Bjam -toolset=msvc -stage -sbzip_source="c:\program files\bzip2" > -szlib_source="c:\program files\zlib" > > I get the error: > > Error c1083: cannot open file zlib.h > > This is in the c:\program files\zlib directory. > > Anyone know what I'm doing wrong? > The case of the options is significant. I'm also surprised that this doesn't fail earlier. Also, you shouldn't have a "-" in front of toolset=msvc or stage. In Christ, Steven Watanabe

1 0

issues when building boost with zlib and bzip2
by Sean Farrow 22 Jun '10

22 Jun '10

Hi: I'm trying to build boost with both the bzip2 and zlib io filters. I've tried the following command line with no success: Bjam -toolset=msvc -stage -sbzip_source="c:\program files\bzip2" -szlib_source="c:\program files\zlib" I get the error: Error c1083: cannot open file zlib.h This is in the c:\program files\zlib directory. Anyone know what I'm doing wrong? Cheers Sean.

1 0

Box-Muller - normal distributed random numbers
by Matthias Fuchs 21 Jun '10

21 Jun '10

Hi, I wonder why _cached_rho is calclulated this way: sqrt(-result_type(2) * log(result_type(1)-_r2)); in normal_distribution.hpp:70 and not sqrt(-result_type(2) * log(_r2)); So I don't understand why there is "result_type(1) - _r2" instead of just "_r2". Cheers! matthias PS.: I hope this was not a stupid question, if so please forgive me as I am just a newbie.

2 1

[variant] apply_visitor and bind
by Olivier Tournaire 21 Jun '10

21 Jun '10

Hi all, How could you I use bind with apply_visitor? #include <boost/variant.hpp> #include <boost/bind.hpp> struct foo_visitor : public boost::static_visitor<> { template <typename Type> result_type operator()(const Type& data, double d) const { return /**/; } }; int main (int argc, char** argv) { boost::variant<int, double> foo; boost::apply_visitor( boost::bind( &foo_visitor, 2.), foo); // here? return 0; } Hope you could help Regards, Olivier

1 1

[asio] Multicast Receive with multiple network cards (nics)
by Ryan McConnehey 21 Jun '10

21 Jun '10

From all the different material I've read, receiving multicast network packets on multiple network cards is easy. Just bind to the network card who you want to receive the packet and join the multicast group. I understand that because Windows XP (which I use), has a "Weak End System" ("Weak E/S") model; meaning sending out on a specific network card is a lot more difficult. I have provided a sample program that's been slightly modified from the multicast receive example in Asio documentation. This program doesn't receive packets from any interface specified. It will only receive information on the primary network card. I'm not sure what is going on and would greatly appreciate any help. Ryan // SampleAsioReceive.cpp : Defines the entry point for the console application. // #include <map> #include <iostream> #include <string> //Boost Includes #include <boost/shared_ptr.hpp> #include <boost/bind.hpp> #include <boost/asio.hpp> class RdssReceive { public: RdssReceive( boost::asio::io_service* ioService , const boost::asio::ip::address& listenAddress, const boost::asio::ip::address& mcAddr, unsigned int mcPort = 0 /* 31001 */ ) : m_MulticastPort( mcPort ) // multicast port , m_MulticastAddress( mcAddr ) // multicast ip addr , m_Socket( *ioService ) , m_InterfaceAddress( listenAddress ) , m_numRec(0) { try { // Create the socket so that multiple may be bound to the same address. boost::asio::ip::udp::endpoint listenEndpoint( listenAddress, static_cast<unsigned short>(m_MulticastPort) ); m_Socket.open(listenEndpoint.protocol()); m_Socket.set_option(boost::asio::ip::udp::socket::reuse_address(true)); boost::system::error_code ec; m_Socket.bind(listenEndpoint, ec); // Join the multicast group. m_Socket.set_option( boost::asio::ip::multicast::join_group(m_MulticastAddress) ); m_Socket.async_receive_from( boost::asio::buffer(m_Data, max_size), m_SenderEndpoint, boost::bind( &RdssReceive::handleReceiveFrom, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } catch( std::exception& e ) { std::cerr << "Create error. " << e.what() << std::endl; } } void handleReceiveFrom( const boost::system::error_code& error, size_t bytes_recvd ){ if (!error) { std::cout << "Msg received: " << m_numRec++ << std::endl; } else { std::cerr << "handleReceiveFrom error -> " << error.value() << std::endl; } try { m_Socket.async_receive_from( boost::asio::buffer(m_Data, max_size), m_SenderEndpoint, boost::bind(&RdssReceive::handleReceiveFrom, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } catch ( std::exception& e ) { std::cerr << "Error in handleReceiveFrom during async_receive_from. " << e.what() << std::endl; } catch ( ... ) { std::cerr << "Unknow error in handleReceiveFrom during async_receive_from." << std::endl; } } virtual ~RdssReceive() { std::cout << "RdssReceive destructor: " << m_MulticastAddress.to_string() << ":" << m_MulticastPort << std::endl; m_Socket.shutdown(boost::asio::ip::tcp::socket::shutdown_receive); m_Socket.close(); } typedef unsigned long long uint64_t; static const int max_size = 1500; private: boost::asio::ip::udp::socket m_Socket; boost::asio::ip::udp::endpoint m_SenderEndpoint; unsigned int m_MulticastPort; boost::asio::ip::address m_MulticastAddress; boost::asio::ip::address m_InterfaceAddress; char m_Data[max_size]; int m_numRec; }; std::string ipAddr = ""; int port = 9252; std::string mcAddr = "225.6.6.254"; int main(int argc, char* argv[]) { boost::asio::io_service ioServ; if ( argc > 1 ) { ipAddr = argv[1]; port = atoi(argv[2]); } std::cout << "IpAddress: " << ipAddr << " Port: " << port << std::endl; RdssReceive rdssReceive( &ioServ, boost::asio::ip::address::from_string(ipAddr), boost::asio::ip::address::from_string(mcAddr), port ); ioServ.run(); //std::cout << "Press key and return to exit." << std::endl; char cc; std::cin >> cc; return 0; }

1 0

Re: [Boost-users] ll_any_cast
by Richard Ulrich 21 Jun '10

21 Jun '10

Sorry for the noise. I found the solution. I modified too much when copying from ll_static_cast. If this were added to boost, would it more likely have to live in lambda or in any? This one works now: namespace boost { namespace lambda { template<class T> class any_cast_action; template<class T> class cast_action<any_cast_action<T> > { public: template<class RET, class Arg1> static RET apply(Arg1 &a1) { boost::any myany = a1; RET retval = any_cast<RET>(a1); return retval; } }; // any_cast template <class T, class Arg1> inline const lambda_functor< lambda_functor_base< action<1, cast_action<any_cast_action<T> > >, tuple<typename const_copy_argument <const Arg1>::type> > > ll_any_cast(const Arg1& a1) { return lambda_functor_base< action<1, cast_action<any_cast_action<T> > >, tuple<typename const_copy_argument <const Arg1>::type> > ( tuple<typename const_copy_argument <const Arg1>::type>(a1)); } } // namespace lambda } // namespace boost

1 0

Boost regex is breaking math.h's signbit
by Adrian 21 Jun '10

21 Jun '10

Hi All, If I include boost/regex.hpp - the builtin c signbit stops being available. I am using my version of gcc 4.5.0 and my version of boost (built and installed with defaults) I've removed distro's install of boost and gcc. I am new to this list so apologies if I've missed any need information. TIA Adrian ---------------------------------------------------------------------- adrianc@dluadrianc:~> cat signbit.cc #include <iostream> #include <math.h> #include <boost/version.hpp> #ifdef WITH_BOOST_REGEX_ADRIAN #include <boost/regex.hpp> #endif int main(int argc, char *argv[]) { float a=12.4234; float b=-123.4333; #ifdef _XOPEN_SOURCE std::cout << "_XOPEN_SOURCE=" << _XOPEN_SOURCE << std::endl; #endif #ifdef _ISOC99_SOURCE std::cout << "_ISOC99_SOURCE is here\n"; #endif std::cout << "Boost version=" << BOOST_LIB_VERSION << std::endl; std::cout << "Boost version=" << BOOST_VERSION << std::endl; #ifdef WITH_SIGNBIT_ADRIAN std::cout << "signbit a=" << signbit(a) << std::endl; std::cout << "signbit b=" << signbit(b) << std::endl; #endif return 0; } adrianc@dluadrianc:~> g++ -DWITH_SIGNBIT_ADRIAN signbit.cc adrianc@dluadrianc:~> a.out _XOPEN_SOURCE=700 _ISOC99_SOURCE is here Boost version=1_43 Boost version=104300 signbit a=0 signbit b=-2147483648 adrianc@dluadrianc:~> g++ -DWITH_SIGNBIT_ADRIAN -DWITH_BOOST_REGEX_ADRIAN signbit.cc signbit.cc: In function 'int main(int, char**)': signbit.cc:25:42: error: 'signbit' was not declared in this scope adrianc@dluadrianc:~> :~> which gcc /usr/local/bin/gcc :~> gcc -v Using built-in specs. COLLECT_GCC=gcc COLLECT_LTO_WRAPPER=/usr/local/libexec/gcc/i686-pc-linux-gnu/4.5.0/lto-wrapp er Target: i686-pc-linux-gnu Configured with: ../gcc-4.5.0/configure --enable-__cxa_atexit --enable-languages=c,c++ --enable-threads --with-cpu=core2 --disable-nls --with-arch=i686 --with-mpfr=/usr/local --with-gmp=/usr/local --with-mpc=/usr/local --with-build-time-tools=/usr/local --enable-lto Thread model: posix gcc version 4.5.0 (GCC)

3 2

ll_any_cast
by Richard Ulrich 21 Jun '10

21 Jun '10

I want to use an any_cast within a lambda expression. Searching for ll_any_cast didn't bring up anything. So, the first attempt was to bind to the overloaded any_cast function with a function pointer cast. This worked, but was ugly and unreadable. The second attempt is to write ll_any_cast using ll_static cast as a starting point. The problem here is that cast_action<any_cast_action<std::string> >::apply() passes an any containing a lambda placeholder to the any_cast instead an any containing the string. So, that's where I'm stuck at the moment. Below is what I have so far with two call stacks. One for ll_static_cast and the other for ll_any_cast. namespace boost { namespace lambda { template<class T> class any_cast_action; template<class T> class cast_action<any_cast_action<T> > { public: template<class RET, class Arg1> static RET apply(Arg1 &a1) { return any_cast<RET>(a1); } }; // any_cast template <class T> inline const lambda_functor< lambda_functor_base< action<1, cast_action<any_cast_action<T> > >, tuple<typename const_copy_argument<const any>::type> > > ll_any_cast(const any& a1) { return lambda_functor_base< action<1, cast_action<any_cast_action<T> > >, tuple<typename const_copy_argument<const any>::type> > ( tuple<typename const_copy_argument<const any>::type>(a1)); } } // namespace lambda } // namespace boost BOOST_AUTO_TEST_CASE(ll_any_cast_test) { std::string msg0("Hello"); std::string msgO("Robert"); boost::any many = msg0; std::string msg1 = any_cast<string>(many) + " " + msgO; std::string msg2 = (ll_static_cast<string>(_1) + " " + _2)(msg0, msgO); std::string msg3 = (ll_any_cast<string>(_1) + " " + _2)(many, msgO); BOOST_CHECK_EQUAL(msg1, "Hello Robert"); BOOST_CHECK_EQUAL(msg1, msg2); BOOST_CHECK_EQUAL(msg1, msg3); } > SHUnitTests.exe! boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > >::apply<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >(std::basic_string<char,std::char_traits<char>,std::allocator<char> > & a1="Hello") Line 41 C++ SHUnitTests.exe! boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >::call<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(std::basic_string<char,std::char_traits<char>,std::allocator<char> > & a="Hello", std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 403 + 0x38 bytes C++ SHUnitTests.exe! boost::lambda::detail::select<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > > & op={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & a="Hello", std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 30 + 0x1c bytes C++ SHUnitTests.exe! boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >::call<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(std::basic_string<char,std::char_traits<char>,std::allocator<char> > & a="Hello", std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 206 + 0x9d bytes C++ SHUnitTests.exe! boost::lambda::detail::select<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > > & op={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & a="Hello", std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 30 + 0x1c bytes C++ SHUnitTests.exe! boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,boost::lambda::lambda_functor<boost::lambda::placeholder<2> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >::call<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(std::basic_string<char,std::char_traits<char>,std::allocator<char> > & a="Hello", std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 206 + 0x9d bytes C++ SHUnitTests.exe! boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::static_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,boost::lambda::lambda_functor<boost::lambda::placeholder<2> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >::operator()<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >(std::basic_string<char,std::char_traits<char>,std::allocator<char> > & a="Hello", std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert") Line 191 + 0x1e bytes C++ SHUnitTests.exe!ll_any_cast_test::test_method() Line 660 + 0x57 bytes C++ > SHUnitTests.exe! boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > >::apply<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::any const >(const boost::any & a1={...}) Line 628 C++ SHUnitTests.exe! boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >::call<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::any,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(boost::any & a={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 403 + 0x5e bytes C++ SHUnitTests.exe! boost::lambda::detail::select<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >,boost::any,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > > & op={...}, boost::any & a={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 30 + 0x1c bytes C++ SHUnitTests.exe! boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >::call<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::any,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(boost::any & a={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 206 + 0x9d bytes C++ SHUnitTests.exe! boost::lambda::detail::select<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >,boost::any,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(const boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > > & op={...}, boost::any & a={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 30 + 0x1c bytes C++ SHUnitTests.exe! boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,boost::lambda::lambda_functor<boost::lambda::placeholder<2> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> >::call<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::any,std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::tuples::null_type const ,boost::tuples::null_type const >(boost::any & a={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert", const boost::tuples::null_type & c={...}, const boost::tuples::null_type & env={...}) Line 206 + 0x9d bytes C++ SHUnitTests.exe! boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::action<1,boost::lambda::cast_action<boost::lambda::any_cast_action<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >,boost::tuples::tuple<boost::any const ,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,char const (&)[2],boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >,boost::lambda::lambda_functor<boost::lambda::placeholder<2> >,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type> > >::operator()<boost::any,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >(boost::any & a={...}, std::basic_string<char,std::char_traits<char>,std::allocator<char> > & b="Robert") Line 191 + 0x1e bytes C++ SHUnitTests.exe!ll_any_cast_test::test_method() Line 661 + 0xbf bytes C++

1 0

[ASIO] deadline_timer
by Caleb 21 Jun '10

21 Jun '10

Greetings, I have a boost ASIO application which is using deadline_timer for operation timeouts. It has been used for quite some time, but I have noticed some odd behavior with the timeout cancellation. The following is a brief description of the problem. First I initiate a connection request and setup a timeout timer set timer for 30 seconds async timer wait async connection request A couple of millseconds later the connection is up and in the callback I cancel the timer and start the next phase cancel timer start data activity... Most of the time the cancel is successful and I get the callback with operation canceled(as expected). But occasionally the cancel fails and returns 0 async operations effected, however this cannot be as the timer was created and is active (but not yet timed out)... then ~30 seconds later the timer goes off (and I treat it as a timeout). This occurs on average about 1 time per 20 connection attempts. The application is currently single threaded. Another developer has indicated that he has experienced similar issues. He is working on a completely different project with a different code base. The other developer worked around the issue by checking an internal state before propagating the timeout. I am loathed to do this, but have a similar work around in mind. Both the projects are building against version 1.39.0. I have done a diff between the latest version of boost and the 1.39.0 and did not spot any blaring fixes wrt deadline_timer. Has anyone else experienced this problem? Any patches/bug fixes in place for it? I am trying to reproduce this behavior consistently with some small sample code and have yet to do so. Thanks in advance for the help. Cheers Caleb

1 0

[function] Which function is adressed?
by Matthias Dondorff 21 Jun '10

21 Jun '10

Hi, I have searched the web a bit for some debugging aid when using boost::function objects. The best I found, was a little aid for a little less step into calls on Visual Studio ("F11 Hell", http://askldjd.wordpress.com/2009/09/22/some-relief-in-debugging-boost-func…) What I'm about to digg depper into, is to get to know at runtime which (member) function is adressed. I'm not believing that there is a platform or compiler independent way of doing so, but I think that it should be possible for a given compiler / platform. What I'm thinking about is some sort of symbol lookup on the adressed function and possibly some virtual table and whatsoever. Has anyone tried something like that and can give me some pointers? Best wishes, Matthias

1 0

[Test] Problem with expected failures in test suite
by Maria Kozinska 21 Jun '10

21 Jun '10

Hello, I tried to write a test suite with one expected failure, however it is not working. Probably I'm doing something wrong. The idea is that I have a function that can be implemented in few ways, thus there are few possible correct results. Depending on the implementation, I want to test it with different set of test cases. I don't want to check at the beginning of each test case which option is valid, I would prefer to skip unnecessary test cases. Is it possible? The simplified code is below: bool xxx = ...; // opt1 and opt2: two exclusive options // one of them always passes and one always fails void opt1(){ BOOST_CHECK(xxx); } void opt2(){ BOOST_CHECK(!xxx); } void test1_1(){ } test_suite* init_unit_test_suite( int argc, char* argv[] ) { test_case* opt1_case = BOOST_TEST_CASE(&opt1); test_case* opt2_case = BOOST_TEST_CASE(&opt2); test_suite* dichotomic_test = BOOST_TEST_SUITE( "dichotomic test" ); framework::master_test_suite().add(dichotomic_test); dichotomic_test->add( opt1_case ); dichotomic_test->add( opt2_case ); // I want exactly one of them to fail dichotomic_test->increase_exp_fail(1); test_case* case1_1 = BOOST_TEST_CASE(&test1_1); case1_1->depends_on(opt1_case); framework::master_test_suite().add(case1_1); } I'll be thankful for help, Maria

3 3

does boost has some traits for container inner types which doesn't instantiate the container.
by Abir Basak 21 Jun '10

21 Jun '10

I have the code given below #include <boost/array.hpp> #include <boost/foreach.hpp> #include <vector> struct parent; struct child; typedef boost::array<child,5> childs_t; typedef std::vector<parent> parents_t; //typedef boost::array<parent,6> parents_t; //1) typedef parent* parent_pointer; //typedef parents_t::pointer parent_pointer; //2) struct child { parent_pointer par; }; struct parent { childs_t childs; }; int main() { parents_t all(6); BOOST_FOREACH(parent& p,all) { childs_t& ch = p.childs; BOOST_FOREACH(child& c,ch ) { c.par = &p; } } } I want to use the parent_pointer in a generic way as nested typedef of parents_t so that if needed I can have a different pointer type than parent* as the commented code shown in 2) .That is probably not permitted as vector of incomplete type is illegal, though it actually might work. But the same is not possible with boost::array as in 1) , as it needs complete type parent. This is because compiler tries to instantiate boost::array while accessing inner type pointer (Though actually boost::array doesn't have pointer , I can replace it by iterator, probably c++0x has pointer typedef ). On the other hand my requirement is only pointer/iterator which may not depend on complete type parent, and none of parent or child otherwise has even problem with vector, array or any other container. Is it possible (or boost has) some portable wrapper over the inner typedef of the containers which doesn't tries to instantiate the container which might depend on completeness of the type, so that I can just change the typedef of container / allocator in one location and rest will "just work". Assumption is container nested types like value_type, pointer, reference, size_type, difference_type, iterator and const counterparts doesn't depend on completeness f the parametre T. Though this question is not entirely boost related, it may not be entirely uncorrelated. Thanks abir -- Abir Basak B. Tech , IIT KGP Research Engineer & Technology Lead, Read Ink Technologies

1 0

preprocessor metaprogramming question
by Nathan Ridge 20 Jun '10

20 Jun '10

Hello, Here's a question for the preprocessor metaprogramming experts out there. I have some classes that need to have write() methods that look like this: template <typename output> bool write(output& out) const { return utils::write(out, member_1) && utils::write(out, member_2) && ... utils::write(out, member_n); } where member_1, member_2, ..., member_n are the member variables of the class. (These write() methods are used as part of a serialization framework). Since I have quite a few classes that need write() methods that look like this, and the structure of each write() method is uniform (the only thing that varies is the names of the class members), I figured that it would be neat to somehow generate the code for these write() methods. What I came up with is macros that look like this: #define MEMBERS1(m1) \ template <typename output> \ bool write(output& out) const \ { \ return utils::write(out, m1); \ } #define MEMBERS2(m1, m2) \ template <typename output> \ bool write(output& out) const \ { \ return utils::write(out, m1) && \ utils::write(out, m2); \ } // and so on for MEMBERS3, MEMBERS4, etc. Then, instead of declaring and defining the write() methods explicilty, I would just call the appropriate MEMBERS# macro in the class definition, e.g. for a class with 3 members named a, b, and c, I'd write MEMBERS3(a, b, c) in the class definition. While this is definitely an improvement over writing the write() methods explicitly for each class, there are two issues with it: 1) The number of lines of code needed to write the macro definitions is quadratic in the maximum number of parameters supported. It would be nice if it could be constant instead. 2) The user of the macros needs to match the macro name to the number of member variables in the class, and to change the macro name whenever the number of member variables changes. I'm wondering if there is a way to improve on this generation scheme that solves one or both of these issues. If I were allowed to use C++0x, I could have a variadic macro MEMBERS(...) and inside it pass the parameters to a variadic template function which unpacks its parameters and calls utils::write() on each. This would solve both issues. Unfortunately, however, I am not allowed to use C++0x features, since our code needs to be able to compile on our servers, which run Ubuntu 8.04, which runs g++ 4.2, which does not support C++0x features. So I thought I'd turn to some more preprocessor magic to solve these issues. I looked at examples in Boost.Preprocessor that generated repetitive code using preprocessor metaprogramming. However, all the examples there generated repetitive *code*, whereas what I seem to need is to be able to generate repetitive *macro definitions*. Is there a way to do that? If not, can anyone recommend other ways of improving the way I generate the code for the write() functions? Thanks in advance, Nate. _________________________________________________________________ Learn more ways to connect with your buddies now http://go.microsoft.com/?linkid=9734388

3 7

contiguous Boost.Multimap revisited
by anony 20 Jun '10

20 Jun '10

>From a post by Mathias Gaunard: > Who claimed such a thing? > An array is always stored contiguously; an array of arrays is no > different in that regard. I need to direct you to the controversy that my old post has caused: [Boost-users] Boost.Range fancify please In any case, Patrick Hogan claimed an array of arrays may not be stored contiguously (i.e. that it is not required by the standard): anony wrote: > What I see in > > vertices[][3] = { ... }; > > is an a array object of array objects. Nowhere in the standard did I > ever see multidimensional arrays specifically mentioned. It's in: 5.3.4 New section 5 (which notes: the type of new int[i][10] is int (*)[10]), and 6 8.3.4 Arrays sections 2, 3, 4, 7, and 8 8.5.1 aggregates sections 10 and 11 on array initialization, 13.1 Overloadable Declarations section 3 which notes that Parameter declarations that differ only in a pointer * versus an array [] are equivalent. That is, the array declaration is adjusted to become a pointer declaration (8.3.5) 20.5.6.4 Array modifications, Table 39. and on and on in many more places, all consistently saying the for a multidimensional array, all but the final dimensions are pointers. > Since the > elements of this array are arrays, these arrays must be contiguous in > memory. What you're missing, is that it's required in the standard (8.3.4 section 6), to consider an array as a pointer to it's first element, so an array of arrays is an array of pointers (well explained in 8.3.4 section 7 and 8). For example in gcc, this code: #include <iostream> int main() { int array[2][2]; std::cout << std::hex << array[0] << std::endl; std::cout << array[1] << std::endl; std::cout << &array[0][0] << std::endl; std::cout << &array[1][0] << std::endl; std::cout << std::dec << sizeof(array[1]) << std::endl; std::cout << sizeof(array[1][1]) << std::endl; } prints out 0xbff3519c 0xbff351a4 0xbff3519c 0xbff351a4 8 4 on one particular run, showing that array[0], and array[1] are just the addresses of their first elements, their elements are 8 byte pointers to 4 byte ints. The pointers are the elements of the array, and as you pointed out, have to be contiguous. There's nothing in the standard that requires that the rows pointed to have to be contiguous, because they aren't the elements of the array, the pointers to them are. So, the contents of the rows have to be contiguous, and the pointers to the rows have to be contiguous, but the rows themselves don't have to be. There's nothing in the standard that requires it. You get away with it with one set of data on one compiler, because it's easy for the compiler with this data to allocate memory for all the rows at once, but nothing guarantees that it will work. Liking it, or wishing that it was the way the spec has it, doesn't help. You're relying on undefined behavior. Patrick

2 2

[PTree] Failed to compile simple code
by Klaim 20 Jun '10

20 Jun '10

Hi! I'm trying to use boost::property_tree but can't compile this simple code on VC10 : #include <string> #include <boost/property_tree/ptree.hpp> #include <boost/property_tree/info_parser.hpp> const std::string CONFIG_FILE = "game.cfg"; int main() { using namespace boost::property_tree; ptree properties; // compilation error here //read_info( CONFIG_FILE, properties ); return 0; } The compilation log : Main.cpp d:\sdk\boost\boost_1_43_0\include\boost-1_43\boost\property_tree\detail\ptree_implementation.hpp(30): error C2440: 'specialization' : cannot convert from 'const std::string std::_Pair_base<_Ty1,_Ty2>::* ' to 'const std::basic_string<_Elem,_Traits,_Ax> std::pair<_Ty1,_Ty2>::* ' with [ _Ty1=const std::string, _Ty2=boost::property_tree::basic_ptree<std::string,std::string> ] and [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, _Ty1=const std::string, _Ty2=boost::property_tree::basic_ptree<std::string,std::string> ] Standard conversion from pointer-to-member of base to pointer-to-member of derived is not applied for template arguments d:\sdk\boost\boost_1_43_0\include\boost-1_43\boost\property_tree\detail\ptree_implementation.hpp(159) : see reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>::subs' being compiled with [ Key=std::string, Data=std::string ] d:\sdk\boost\boost_1_43_0\include\boost-1_43\boost\property_tree\detail\ptree_implementation.hpp(159) : while compiling class template member function 'boost::property_tree::basic_ptree<Key,Data>::basic_ptree(void)' with [ Key=std::string, Data=std::string ] d:\tests\test_ptree\test_ptree\main.cpp(11) : see reference to class template instantiation 'boost::property_tree::basic_ptree<Key,Data>' being compiled with [ Key=std::string, Data=std::string ] As I'm using a default ptree typedef that is already used in the tutorial, I think I might be doing something stupid but I can't find what. I tried that with boost 1.42 and 1.43, both failed. Any idea? Thanks Joël Lamotte

2 3

Boost.Wave crippling
by anony 20 Jun '10

20 Jun '10

I need Boost.Wave preprocessing functionality, but without it doing any macro expansion or substitution, only #including other header files. I'd greatly appreciate any help.

3 6

[boost] [chrono] v0.4.1 + thread_clock implementation on Windows
by vicente.botet 20 Jun '10

20 Jun '10

Hi all, As suggested by Roland Bock on the Boost Users ML, I have implemented the thread_clock on Windows using FILETIME creationTime, exitTime, kernelTime, userTime; GetThreadTimes(GetCurrentThread (), &creationTime, &exitTime, &kernelTime,&userTime); I don't know Windows well, it would be very kind if someone of you can inspect the implementation. The implementation of thread_clock for Mac is still missing. I don't know even if thread cloks are provided on this platform. In addition, I have added also the function prototypes to Boost.Thread using Boost.Chrono as well as updated the tests. This could be used as a base for a possible Boost.Thread update using chrono (standard C++0x proposal), if the library is accepted, of course. Note the modifications of Boost.Thread have been done on the base of 1.43. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. Anthony Williams has accepted to manage the review. We have not yet fixed a date, but I expect we could communicate one soon. I will be very thankful, if people using the library already or that could be interested in, can do a review even before the date. Thanks, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 7

generating a derived class from a base class
by Hicham Mouline 20 Jun '10

20 Jun '10

Hello, I have a base class with a number of pure virtual functions. I will have to write a large number of derived classes and I wish to generate the derived class definitions programmatically as containing the list of all pure virtual functions present in the base class. class Base { public: function decl 1 pure virtual function decl 2 ... function decl n private: ... }; I'd like to generate the following header file content programmatically: class Derived1 : public Base { private: <list of pure virtual functions from Base> }; The implementation file would also be generated programmatically as it only varies slightly for each new derived. How would one proceed? Regards,

1 0

call_once
by seweryn＠habdank.pl 20 Jun '10

20 Jun '10

Dears, I had observed dead lock in call_once (posix code). How to understand what causes this dead lock?Windows code works well - my usage of call_once runs normally on windows, but ported to Linuxhangs. Below I had marked where the code is waiting (endless) - see line with '// ***'. I understand that condition "flag.epoch==uninitialized_flag" is not fullfilled, but"flag.epoch==being_initialized" is passed. So it seems that: pthread_cond_waitis waiting, but I have no clue for what it is waiting. Especially that I haveno real access to "detail::once_epoch_cv" - seems to be private member of thenamespace. Also I observed that there is single hit to that function. The whileloop is done once - program is entering while and stops on the first pthread_cond_wait. template void call_once(once_flag try { pthread::pthread_mutex_scoped_unlock relocker( f(); } catch(...) { flag.epoch=uninitialized_flag; BOOST_VERIFY(!pthread_cond_broadcast( throw; } flag.epoch=--detail::once_global_epoch; BOOST_VERIFY(!pthread_cond_broadcast( } else { while(flag.epoch==being_initialized) { BOOST_VERIFY(!pthread_cond_wait(&detail::once_epoch_cv, // *** first hit here causes dead lock } } Best regards,Seweryn Habdank-Wojewodzki.

1 0

Boost ASIO on WinCE 6.0
by Louis Landerman 20 Jun '10

20 Jun '10

I am working on a new CE 6.0 device and would love to use Boost's ASIO for our networking library. I attempted a basic app and added "#include <boost/asio.hpp>" and received a load of errors about <cerrno> not existing (among other libraries). After a little research I came across a page in the MSDN (http://msdn.microsoft.com/en-us/library/tehass7h%28VS.90%29.aspx) which states: Unsupported Headers The device version of the Standard C++ Library does not support the following headers: *<cerrno> *<csignal> *<locale> Is there a #define list I need to get this to compile with these limitations? Has anyone got this running with these limitations? Thank You, Louis J. Landerman Software Engineer II GameTech International

2 1

General C++: Unresolved reference to operator overloads
by Etienne Philip Pretorius 19 Jun '10

19 Jun '10

Hello List, I please be kind, as I know this is not boost related. Inside the header file I define the following: /* Operator + */ std::vector<std::uint8_t> operator+( const std::vector<std::uint8_t>& x, const std::vector<std::uint8_t>& y ); /* Operator - */ std::vector<std::uint8_t> operator-( const std::vector<std::uint8_t>& x, const std::vector<std::uint8_t>& y ); And then inside the implementation CPP file I do the following: /* Operator + */ std::vector<std::uint8_t> operator+( const std::vector<std::uint8_t>& x, const std::vector<std::uint8_t>& y ) { *obmitted for brievity* }; /* Operator - */ std::vector<std::uint8_t> operator-( const std::vector<std::uint8_t>& x, const std::vector<std::uint8_t>& y ) { *obmitted for brievity* }; Yet when I compile I keep on getting : undefined reference to `operator+(std::vector<unsigned char, std::allocator<unsigned char> > const&, std::vector<unsigned char, std::allocator<unsigned char> > const&)' Is there something that I am missing? Kind Regards, Etienne Pretorius

3 3

[MPI] Test fails
by Miguel Ángel Vázquez 19 Jun '10

19 Jun '10

Dear all, I already installed Boost MPI library and I tested like you suggest in the tutorial (executing bjam in /libs/mpi/test). Unfortunately, it doesn't pass all the tests and I don't know whether they are important or not or what to do to try to fix them. I enclose you the output, hope someone can help me somehow. Cheers, Miguel

2 2

Re: [Boost-users] building the boost documentation for reading off-line
by Steven Watanabe 19 Jun '10

19 Jun '10

AMDG Sean Farrow wrote: > Is there any way I can build the boost documentation to allow me to read > this on a machine that is (90) percent of the time not connected to the > internet. > The packaged releases include compiled documentation. If you're working off svn, please see https://svn.boost.org/trac/boost/wiki/BoostDocs/GettingStarted In Christ, Steven Watanabe

1 0

boost serialization compile warnings
by Barry Haddow 19 Jun '10

19 Jun '10

Hi Does anyone know what these compiler warnings mean? I get them when I try to serialize a non-constant object. If I copy my object into a const, and then serialize, the warnings go away. I also get them from the demo. I looked at check.hpp, and it refers you to the rationale, but I see no explanation of 'object tracking' there. /mnt/saxnot3/bhaddow/boost/include/boost/mpl/print.hpp: In instantiation of ‘boost::mpl::print<boost::serialization::BOOST_SERIALIZATION_STATIC_WARNING_LINE<98> >’: /mnt/saxnot3/bhaddow/boost/include/boost/serialization/static_warning.hpp:92: instantiated from ‘boost::serialization::static_warning_test<false, 98>’ /mnt/saxnot3/bhaddow/boost/include/boost/archive/detail/check.hpp:98: instantiated from ‘void boost::archive::detail::check_object_tracking() [with T = Josiah::FVector]’ regards Barry

2 1

building the boost documentation for reading off-line
by Sean Farrow 19 Jun '10

19 Jun '10

Hi: Is there any way I can build the boost documentation to allow me to read this on a machine that is (90) percent of the time not connected to the internet. Regards Sean.

1 0

Serialize a boost function (actually a member function pointer)
by Fabian Fritz 18 Jun '10

18 Jun '10

Hi, I want to use boost serialization to serialize a boost function. In other places I learned that I need to use non-intrusive serialization and the target<>() method, but I still don't get it to work: #include <vector> #include <iostream> #include <fstream> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/function.hpp> class A { public: void func1() { std::cout << "Hello World"; } }; typedef void (A::*fPointerType)(); class FuncPointerWrapper { boost::function<void (A*)> f; friend class boost::serialization::access; template<typename Archive>void serialize(Archive & ar, const unsigned int version) { ar & f; } public: FuncPointerWrapper() {} FuncPointerWrapper(fPointerType fun) { f = fun; } boost::function<void (A*)> getFuncPointer() {return f;} }; //non-intrusive namespace boost { namespace serialization { template<typename Archive>void serialize(Archive & ar,boost::function<void (A*)> & f, const unsigned int version) { ar & (f.template target<fPointerType>()); //error: no match for 'operator&' in 'ar & ((boost::function_base*)(+f))->boost::function_base::target [with Functor = void (A::*)()]()'| // but how do I have to use it then? } } } int main() { FuncPointerWrapper fpw(&A::func1); std::ofstream ofs("filename"); { boost::archive::text_oarchive oa(ofs); // write class instance to archive oa << fpw; // archive and stream closed when destructors are called } A a; fpw.getFuncPointer()(&a); // Some other place, some other time: FuncPointerWrapper fpw2; { std::ifstream ifs("filename"); boost::archive::text_iarchive ia(ifs); ia >> fpw2; } A b; fpw2.getFuncPointer()(&b); }

1 0

What is boost::copy?
by John Dlugosz 18 Jun '10

18 Jun '10

In other threads, I see mentions of boost::copy. I'd like to find out about it. Which library is it in? How is it different from std::copy? (Once I know what it's part of, I'll just read the docs) --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

4 4

[lambda] make lambda play well with std::complex, imag, real, abs, etc.
by alfC 18 Jun '10

18 Jun '10

Hi, I need some complex arithmetic in lambda expressions, for that I implemented this to make some std::complex functions work with Boost.Lambda. namespace boost{ namespace lambda{ #define BOOST_LAMBDA_COMPLEX_IMPL(function_name) \ template<typename Arg> \ lambda_functor<lambda_functor_base< \ action<2, function_action<2> >, \ boost::tuples::tuple< \ const double& (* const)(const std::complex<double>&), \ const lambda_functor<Arg> \ > \ > > function_name(const lambda_functor<Arg>& f){ \ return boost::lambda::bind(static_cast<double const&(*) (std::complex<double> const&)>(&std::function_name<double>), f); \ } BOOST_LAMBDA_COMPLEX_IMPL(real) BOOST_LAMBDA_COMPLEX_IMPL(imag) BOOST_LAMBDA_COMPLEX_IMPL(abs) BOOST_LAMBDA_COMPLEX_IMPL(norm) } } use as boost::function<double(complex)> f = imag(_1) + real(_1) + abs(_1+2.); I have two questions about it: 1) Is this something that is implemented in some other way already? 2) it seem imposible to generalized to other template overloads of imag<T>, real<T> (i.e. something that can be used for std::complex<T>) because the template parameter Arg doesn't have information about the actual type. is it so? (comments on the code and alternatives also accepted) Thank you, Alfredo

4 6

[type_traits] Checking for same class template
by Edward Diener 18 Jun '10

18 Jun '10

The type_trait is_same<T,T> can be used to check if two types are the same. Is there a type_trait to check if two templates are the same ? A template class I am developing takes as a template parameter a template rather than a class and I would like to check, to be used in MPL, whether the template being passed as a template parameter is the same as another template.

1 1

Re: [Boost-users] Can't compile with date time
by André Santee 18 Jun '10

18 Jun '10

According to the doc, date_time is one of the libs which the build is not necessary (but optional). Am I misinterpreting it or is it wrong? Here's the link: http://www.boost.org/doc/libs/1_41_0/more/getting_started/windows.html#head… André. Date: Thu, 17 Jun 2010 18:55:43 -0400 > From: Brett Gmoser <bgmoser(a)codexterous.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Can't compile with date time > Message-ID: <4C1AA7EF.4080506(a)codexterous.com> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > On 6/17/2010 6:42 PM, Andr? Santee wrote: > > Why is my Visual C++ Express giving me the following error message? > > > > LINK : fatal error LNK1104: cannot open file > > 'libboost_date_time-vc90-mt- > gd-1_41.lib' > > > > The boost documentation says that the date_time library is > > header-only. Why is it trying to find binaries? > > > > Andre. > > > > I'm not sure where you read that date_time is header only, but it isn't. > :) You'll need to build boost to use it. Make sure MSVC knows where to > find the binaries you want it to link with. >

2 1

Boost 1.41.0, GCC 4.4, Ubuntu Compile Errors
by Michael Jackson 18 Jun '10

18 Jun '10

I am running a Ubuntu 10.04 Desktop system which has GCC 4.4.3 installed (the default). When trying to compile program_options I am getting the following error: [ 1%] Building CXX object libs/program_options/src/CMakeFiles/boost_program_options-mt-shared.dir/conf ig_file.cpp.o In file included from /home/mjackson/Workspace/MXABoost/boost/mpl/apply.hpp:23, from /home/mjackson/Workspace/MXABoost/boost/iterator/iterator_facade.hpp:34, from /home/mjackson/Workspace/MXABoost/boost/program_options/eof_iterator.hpp:9, from /home/mjackson/Workspace/MXABoost/boost/program_options/detail/config_file.h pp:17, from /home/mjackson/Workspace/MXABoost/libs/program_options/src/config_file.cpp:1 0: /home/mjackson/Workspace/MXABoost/boost/mpl/apply_wrap.hpp:81:31: error: missing binary operator before token "(" /home/mjackson/Workspace/MXABoost/boost/mpl/apply_wrap.hpp:173:31: error: missing binary operator before token "(" In file included from /home/mjackson/Workspace/MXABoost/boost/mpl/bind.hpp:27, from /home/mjackson/Workspace/MXABoost/boost/mpl/lambda.hpp:18, from /home/mjackson/Workspace/MXABoost/boost/mpl/apply.hpp:25, from /home/mjackson/Workspace/MXABoost/boost/iterator/iterator_facade.hpp:34, from /home/mjackson/Workspace/MXABoost/boost/program_options/eof_iterator.hpp:9, from /home/mjackson/Workspace/MXABoost/boost/program_options/detail/config_file.h pp:17, from /home/mjackson/Workspace/MXABoost/libs/program_options/src/config_file.cpp:1 0: /home/mjackson/Workspace/MXABoost/boost/mpl/apply_wrap.hpp:81:31: error: missing binary operator before token "(" /home/mjackson/Workspace/MXABoost/boost/mpl/apply_wrap.hpp:173:31: error: missing binary operator before token "(" In file included from /home/mjackson/Workspace/MXABoost/boost/mpl/lambda.hpp:18, from /home/mjackson/Workspace/MXABoost/boost/mpl/apply.hpp:25, from /home/mjackson/Workspace/MXABoost/boost/iterator/iterator_facade.hpp:34, from /home/mjackson/Workspace/MXABoost/boost/program_options/eof_iterator.hpp:9, from /home/mjackson/Workspace/MXABoost/boost/program_options/detail/config_file.h pp:17, from /home/mjackson/Workspace/MXABoost/libs/program_options/src/config_file.cpp:1 0: /home/mjackson/Workspace/MXABoost/boost/mpl/bind.hpp:364:31: error: missing binary operator before token "(" /home/mjackson/Workspace/MXABoost/boost/mpl/bind.hpp:531:31: error: missing binary operator before token "(" In file included from /home/mjackson/Workspace/MXABoost/boost/mpl/lambda.hpp:22, from /home/mjackson/Workspace/MXABoost/boost/mpl/apply.hpp:25, from /home/mjackson/Workspace/MXABoost/boost/iterator/iterator_facade.hpp:34, from /home/mjackson/Workspace/MXABoost/boost/program_options/eof_iterator.hpp:9, from /home/mjackson/Workspace/MXABoost/boost/program_options/detail/config_file.h pp:17, from /home/mjackson/Workspace/MXABoost/libs/program_options/src/config_file.cpp:1 0: /home/mjackson/Workspace/MXABoost/boost/mpl/aux_/full_lambda.hpp:230:31: error: missing binary operator before token "(" In file included from /home/mjackson/Workspace/MXABoost/boost/iterator/iterator_facade.hpp:34, from /home/mjackson/Workspace/MXABoost/boost/program_options/eof_iterator.hpp:9, from /home/mjackson/Workspace/MXABoost/boost/program_options/detail/config_file.h pp:17, from /home/mjackson/Workspace/MXABoost/libs/program_options/src/config_file.cpp:1 0: /home/mjackson/Workspace/MXABoost/boost/mpl/apply.hpp:138:31: error: missing binary operator before token "(" make[2]: *** [libs/program_options/src/CMakeFiles/boost_program_options-mt-shared.dir/con fig_file.cpp.o] Error 1 make[1]: *** [libs/program_options/src/CMakeFiles/boost_program_options-mt-shared.dir/all ] Error 2 make: *** [all] Error 2 Has anyone else seen this error message? Thanks Mike Jackson

2 1

[BGL] Using a default-constructed property map for storing temporary vertex properties
by Daniel Trebbien 18 Jun '10

18 Jun '10

Hello all, I am currently working on a generic implementation of the Stoer–Wagner min-cut algorithm using BGL. Crucial to the algorithm is the merging of a vertex s into a vertex t after each phase, creating a new view of the input graph, the merged graph, denoted G/{s, t}. Rather than create a new graph that represents the merged graph, I figured that I could use a vertex property that would be the vertex that each vertex is assigned to at the start of each phase. One of the template parameters of my implementation is the property map type of the "assignment" property map. It is the last template parameter, as it's not as important to the algorithm as others, but I wanted the user to be able to provide the assignment property map type if s/he wanted, otherwise, the implementation would use a "default" property map type and default-constructed instance of the default assignment property map type. I tried `boost::associative_property_map<std::map<vertex_descriptor, vertex_descriptor> >`, which can be default-constructed, but the first time that I call `boost::get` or `boost::put` on the property map object, I get a SEGFAULT. Apparently, the default construction of `boost::associative_property_map<std::map<vertex_descriptor, vertex_descriptor> >` did not default-construct a `std::map<vertex_descriptor, vertex_descriptor>` object for use in storing the vertex property values. Is there some other property map type that I can use for this purpose? Daniel

2 1

[mini-review] Update of Boost.Assign (13th-19th of June)
by Thorsten Ottosen 18 Jun '10

18 Jun '10

Dear Boost Developers and Users, Erwann Rogard has implemented an update to Boost.Assign which we shall evaluate during the next week. His extensions allows one to write code like the following: (A) A list of references (to temporaries, in this example): boost::array<int,8> a = cref_csv( 1,5,3,4,2,9,0,7 ) (B) Chained ranges: vector<int> v = vector<int>( 3,1 ) && vector<int>( 3,2 ); If you have comments and suggestions about these new features, please submit a small review or voice your oppinion on the Boost developer list. If you have other feedback for Boost.Assign, now would be a good time to mention them too. If you submit a review, please follow the guidelines here: http://www.boost.org/community/reviews.html#Comments To access the new docs, please see https://svn.boost.org/svn/boost/sandbox/statistics/support/libs/assign/doc/… To access the new code, please see https://svn.boost.org/svn/boost/sandbox/statistics/support/boost/assign/ best regards Thorsten Ottosen, Review Manager

4 10

[Important] Server downtime tomorrow (Friday) morning
by Doug Gregor 17 Jun '10

17 Jun '10

The Boost server will be down tomorrow for about an hour for maintenance. We'll be upgrading Trac to version 0.12 and also taking this opportunity for a kernel update. Date: Friday, June 18, 2010 Time: 8:00AM to 9:00AM (Eastern Time) We expect that the following services would be NOT available during the upgrade. - Apache server * trac * svn * mail archives * boost web sites. - Doug

1 0

Can't compile with date time
by André Santee 17 Jun '10

17 Jun '10

Why is my Visual C++ Express giving me the following error message? LINK : fatal error LNK1104: cannot open file 'libboost_date_time-vc90-mt-gd-1_41.lib' The boost documentation says that the date_time library is header-only. Why is it trying to find binaries? Andre.

2 1

[Boost.Assign] list_of::range without an initial (single) element?
by Michael McNeil Forbes 17 Jun '10

17 Jun '10

What is the recommended way of initializing an array from a concatenation of other arrays? list_of::range looks right and I would like to use something like: array<int, 2> a = { 1, 2 }; array<int, 2> b = { 3, 4 }; array<int, 4> c = list_of<int>().range(a).range(b); However, list_of<int>() inserts a default value (so that list_of<int>().range(a).range(b) == {0,1,2,3,4}). There are several workarounds, e.g. array<int, 4> c = list_of<int>(a[0]) .range(a.begin()+1, a.end()) .range(b); array<int, 4> c = boost::assign_detail::generic_list<int>() .range(a) .range(b); The first is ugly; the second seems an abuse of assign_detail (and fails for static_generic_list). I am sure I am missing a simple solution, but can't seem to find it. Thanks, Michael.

4 10

Re: [Boost-users] [boost] [chrono] v0.4.1 + thread_clock implementation on Windows
by vicente.botet 17 Jun '10

17 Jun '10

----- Original Message ----- From: "Roland Bock" <rbock(a)eudoxos.de> To: <boost(a)lists.boost.org> Sent: Thursday, June 17, 2010 5:20 PM Subject: Re: [boost] [chrono] v0.4.1 + thread_clock implementation on Windows > > Vicente Botet Escriba wrote: >> >> Hi, >> >> I see the error. You can remove the installed part for Boost.Thread. There >> is a dependency to my own Converion library, which was not packaged on the >> zip file. Or add the Conversion library from the sandbox. >> >> I will release this evening the complete package? >> >> Thanks for the report, >> Vicente >> >> > Ok, will try again tomorrow morning :-) Done. I have update the sandbox and the vault. Vicente

1 0

[Serialization] Sometimes Fails Reading Binary File
by Robert McCullough 17 Jun '10

17 Jun '10

Hi, I am using Boost 1.43.0, Linux 2.6.23, gcc version 4.0.0 on a Freescale PowerPC. I am reading in a serialized binary file using Ifstream ifs; try { Ifs.open(filename.c_str(), iso_base::binary | iso_base::in); If(fs.is_open()) { Boost::archive::binary_iarchive ia(ifs); ia >> data; ifs.close(); } } catch (std:exception &e) { Ifs.close(); } Sometimes it reads the file fine and sometimes it throws one of the following errors. invalid_signature, Basic_string::resize, or stream error. Does anyone have an idea why sometimes it works and sometimes it does not work? Best regards, Robert McCullough Senior Software Engineer Promess Incorporated 11429 Grand River Road Brighton, Michigan 48116 Email: <mailto://rob@promessdev.com> mailto://rob@promessinc.com Web: <http://promessinc.com/> http://promessinc.com Tel: (810) 229-9334 Fax: (810) 229-8125

3 18

undefined reference to member function in AUTO_TEST_CASE
by Moritz Beber 17 Jun '10

17 Jun '10

Dear all, I have a peculiar problem when compiling my unit tests. The reason why I find it peculiar is that I can compile the same code in a normal function just fine. Here is what I have in a main function: // std #include <iostream> // project #include "headers/common_definitions.hpp" #include "classes/C_ParameterManager.hpp" int main(int argc, char** argv) { using std::cout; using std::endl; gsl_error_handler_t* const old_handler = gsl_set_error_handler_off(); rfn::ParameterManager* my_test = NULL; my_test->instance(rfn::flow_evolved); cout << my_test->instance() << endl; return (EXIT_SUCCESS); The ParameterManager::instance function is declared as follows: static ParameterManager* instance(const FunctionalNetworkScheme scheme); and in the main function it correctly returns a pointer. For testing purposes I use the following code: #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MODULE rfn test suite // project #include "../headers/common_definitions.hpp" #include "../classes/C_ParameterManager.hpp" // boost #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE(ParameterManagerTest) BOOST_AUTO_TEST_CASE(test_default_constructor) { rfn::ParameterManager* c = NULL; c = c->instance(rfn::flow_evolved); BOOST_CHECK_NE(c->instance()->seed(), 0); } BOOST_AUTO_TEST_SUITE_END() // ParameterManagerTest When I try to compile it I get the following errors: /tmp/ccOI5FiJ.o: In function `ParameterManagerTest::test_default_constructor::test_method()': test_rfn.cpp:(.text+0xcf): undefined reference to `rfn::ParameterManager::instance(rfn::FunctionalNetworkScheme)' test_rfn.cpp:(.text+0x136): undefined reference to `rfn::ParameterManager::instance()' I see no reason why the reference should be undefined as I include the class header and specify the path to the .cpp file. Does the unit test framework have a problem with static member functions? Thank you for your help, Moritz

2 4

Could you help me to get more help about boost message queue?
by coofucoo zhang 17 Jun '10

17 Jun '10

Hi Everyone: I found a little strange when I want to use boost message queue in real project. Do you have answers for the following problems? Thank you very much. :) Does boost mq store the information into a file? If true, how can I find it? Does I need send message before I start to receive? Because I found if I start receiver first, even the sender begin to send later, the receiver still can not get the message? It still blocked. Do you know why? How does two program share the same mq? Using the same mq name? Does the mq name can contains a real path? How much data the mq can contains? How about its performance? I can not found the answer from the documentation of boost. Could you help me? Or just told me how can I found the answer. BTW, my OS is Centos 5.5. Thank you, guys. ^_^ -- With regards. Coofucoo Zhang

1 0

[boost-users] Compile and Install boost::thread from souce code on Ubuntu
by Boost lzw 17 Jun '10

17 Jun '10

Hi, there, The most updated version of boost on my Ubuntu is 1_40_0. So I choose to compile and install 1_43_0 from source code. During the building process of step 4 (mentioned bellow), I was prompted that boost::thread, boost::mpi, etc. libraries need to be compiled and installed separetly. I ignored them and finished the process. Now I can run the following program sucessfully with // robert@ubuntu:~/boost$ g++ -I /home/robert/src/boost_1_43_0 example.cpp -o example // echo 1 2 3 | ./example for example.cpp =================== #include <iostream> #include <iterator> #include <algorithm> int main() { using namespace boost::lambda; typedef std::istream_iterator<int> in; std::for_each( in(std::cin), in(), std::cout << (_1 * 3) << " " ); } =================== but failed to compile thread.cpp program with robert@ubuntu:~/boost$ g++ -I /home/robert/src/boost_1_43_0 thread.cpp -o thread for the following thread.cpp =================== #include <boost/thread/thread.hpp> #include <iostream> void hello() { std::cout << "Hello world, I'm a thread!" << std::endl; } int main(int argc, char* argv[]) { boost::thread thrd(&hello); thrd.join(); return 0; } =================== The first few complaints I got are: ---------------------------------------------- /tmp/ccwgSZ3d.o: In function `main': thread.cpp:(.text+0x6e): undefined reference to `boost::thread::join()' thread.cpp:(.text+0x7f): undefined reference to `boost::thread::~thread()' thread.cpp:(.text+0xa0): undefined reference to `boost::thread::~thread()' /tmp/ccwgSZ3d.o: In function `boost::detail::thread_data_base::thread_data_base()': How can I compile boost::thread separately for it to work? Thanks a lot. By the way, these are steps I did to compile and install boost_1_43_0 in case that you may want to review it (or I did something wrong): [NOTE: The downloaded boost_1_43_0 source code located at my home directory: ~/src/ ] (0) cd ~/src (1) wget http://sourceforge.net/projects/boost/files/boost/1.43.0/boost_1_43_0.tar.g… (2) tar zxvf boost_1_43_0.tar.gz (3) cd boost_1_43_0 (4) robert@ubuntu:~/src/boost_1_43_0$ sudo ./bootstrap.sh --prefix=/usr/local --show-libraries --with-libraries=all --exec-prefix=/usr/local/bin/ (5) ./bjam install

2 2

boost_tokenizer gives unexpected result
by andrew.marlow＠uk.bnpparibas.com 17 Jun '10

17 Jun '10

I am getting a result from the boost_tokenizer that I do not expect. I wonder if anyone could explain. I have a line which only contains one occurence of the delimiter and it happens to be the first character. I would expect tokenization to yield two tokens, The first would be the empty string, the next would be the word that occurs after the delimiter. What actually happens is there is only one token, the word I am after. I do not get the expected empty string first. This seems wrong to me. Can anyone comment please? Here is the (simplified) code: boost::char_separator<char> emSeparator("M"); boost_tokenizer emTokenizer(line, emSeparator); boost_tokenizer::const_iterator it2 = emTokenizer.begin(); std::cout << "first token = [" << *it2 << "]" << std::endl; I am using boost version 1.42.0 on Windows-XP SP3, compiling with VS 2005 (aka vc8). Regards, Andrew Marlow ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

1 0

boost.spirit.qi : how to disable semantic actions
by olivier musse 17 Jun '10

17 Jun '10

Hi All, I'am using spirit::qi for developping a parser. Thanks boost for this great job. My issue is that I would like to test the syntax of my grammar before performing semantic actions. Is these any way to do that, I mean parse a string without performing the defined semantic actions ? Thanks in advance for any help Oli

3 3

Re: [Boost-users] Connect holes in polygon (Barend Gehrels)
by Macumber, Daniel 17 Jun '10

17 Jun '10

Hi Barend, thanks for the reply. As I understand it the algorithm is not that simple but I would be happy to find out I am wrong. The requirements I have are that the "seams" cannot cut through any holes, the connect_holes algorithm does prevent seams crossing holes this but may have to create new vertices for seam "take-offs" to travel to other holes. I have tried using the QPolygon class in Qt, it has an simple implementation that just iterates around all the holes but can lead to seams crossing holes (or seams going out of the boundary of the outer polygon). Do you think an easy solution exists given these requirements? Dan -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of boost-users-request(a)lists.boost.org Sent: Wednesday, June 16, 2010 9:45 AM To: boost-users(a)lists.boost.org Subject: Boost-users Digest, Vol 2392, Issue 2 Send Boost-users mailing list submissions to boost-users(a)lists.boost.org To subscribe or unsubscribe via the World Wide Web, visit http://lists.boost.org/mailman/listinfo.cgi/boost-users or, via email, send a message with subject or body 'help' to boost-users-request(a)lists.boost.org You can reach the person managing the list at boost-users-owner(a)lists.boost.org When replying, please edit your Subject line so it is more specific than "Re: Contents of Boost-users digest..." Today's Topics: 1. Connect holes in polygon (Macumber, Daniel) 2. Re: config / cygwin question (Steven Watanabe) 3. Re: boost.xpressive: using placeholders with custom (check()) assertions (Eric Niebler) 4. Re: Connect holes in polygon (Barend Gehrels) 5. Re: [boost] [log] Link error with trivial logging (Roger Stewart) 6. Re: config / cygwin question (Fr?d?ric Bron) 7. Re: [Serialization] Sometimes Fails Reading Binary File (Robert McCullough) 8. Re: [Serialization] Sometimes Fails Reading Binary File (Steven Watanabe) 9. Re: [Serialization] Sometimes Fails Reading Binary File (Robert McCullough) ---------------------------------------------------------------------- Message: 1 Date: Wed, 16 Jun 2010 06:07:15 -0600 From: "Macumber, Daniel" <Daniel.Macumber(a)nrel.gov> To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Subject: [Boost-users] Connect holes in polygon Message-ID: <07186B30C3DFE948B0EE2862AC1999F70A5B89E426(a)MAILBOX2.nrel.gov> Content-Type: text/plain; charset="us-ascii" Does anyone know how to use boost Polygon or boost GGL to take a convert a polygon with holes to a polygon with no holes? I am looking for functionality similar to this http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Boolean_set_operations_…. I have already found a way to extract trapezoids using boost Polygon but I was hoping there was a method more similar to connect_holes. Thanks a lot, Dan ------------------------------ Message: 2 Date: Wed, 16 Jun 2010 06:22:02 -0700 From: Steven Watanabe <watanabesj(a)gmail.com> To: boost-users(a)lists.boost.org Cc: Rene Rivera <grafikrobot(a)gmail.com> Subject: Re: [Boost-users] config / cygwin question Message-ID: <4C18CFFA.7010902(a)providere-consulting.com> Content-Type: text/plain; charset=ISO-8859-1; format=flowed AMDG Fr?d?ric Bron wrote: > # Uploading log archive > "/cygdrive/d/boost_regression/cygwin/results/bronf-cygwin-1.7.zip" to > ftp://anonymous@boost.cowic.de/boost/do-not-publish-this-url/results//trunk > Rene, I think you're going to have to change this again. In Christ, Steven Watanabe ------------------------------ Message: 3 Date: Wed, 16 Jun 2010 09:29:38 -0400 From: Eric Niebler <eric(a)boostpro.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] boost.xpressive: using placeholders with custom (check()) assertions Message-ID: <4C18D1C2.6010208(a)boostpro.com> Content-Type: text/plain; charset=ISO-8859-1 On 6/16/2010 3:04 AM, Alex Dubov wrote: > Greetings. > > Xpressive allows the use of object placeholders in semantic actions, > which are being replaced by actual object references during the > match, like in this simple example: > > placeholder<string> p_string; sregex r = > (expr)[do_something(p_string, _)]; > > When executed, do_something() functor will receive a reference to > string, as expected. > > However, if functor is wrapped with assertion, this won't work: > > sregex r = (expr)[check(do_something(p_string, _))]; > > Compilation will fail, because do_something has no method which > accepts xpressive::placeholder<> objects. It should if it is a lazy function. How is do_something defined? Can you send a self-contained program that demonstrates the problem you're having? > And even if such method was > to be added, there's no obvious way to obtain a run-time reference to > actual object out of placeholder. xpressive will do that for you. > This leads to some question: 1. Is there any trick allowing to use > placeholders within check() assertions? 2. Alternatively, may there > be a way to declare a semantic action functor, returning bool, in > such a way, that it will act as custom assertion? It seems to me, > that some cunning trick involving boost::proto construct may exist, > even though I can't think of any particular way to do so. > > In light of the above, I also thought about sort of feature request: > 3. Sometimes, custom assertion applies only to a part of the match, > something like: > > *((expr)[check(cond)] | _) > > That is, a desire is to consume everything, until some specific > "expr" token matches a precondition. Yes, that should work. > However, raised assertion will > not stop the matching, because it only applies to one branch of the > regexp. It could be very handy if there was a way to signal from > assertion that a larger containing expression matched it results. I don't understand that last sentence. Can you clarify? -- Eric Niebler BoostPro Computing http://www.boostpro.com ------------------------------ Message: 4 Date: Wed, 16 Jun 2010 15:59:12 +0200 From: Barend Gehrels <barend(a)geodan.nl> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Connect holes in polygon Message-ID: <4C18D8B0.7060902(a)geodan.nl> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Hi Dan, Macumber, Daniel wrote: > Does anyone know how to use boost Polygon or boost GGL to take a convert a polygon with holes to a polygon with no holes? I am looking for functionality similar to this http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Boolean_set_operations_…. I have already found a way to extract trapezoids using boost Polygon but I was hoping there was a method more similar to connect_holes. > As also described on the GGL-mailing list: > No, Boost.Geometry does not (yet) provide conversion from polygons > with holes to so-called key-holed polygons as you describe. Normally > this is necessary or useful for graphic user interfaces. The algorithm > is not that difficult, visiting the outer polygon and after that the > inner rings, while pushing the first point of the outer polygon > between all inner rings, is normally enough. This can be done by > normal iterators. Regards, Barend ------------------------------ Message: 5 Date: Wed, 16 Jun 2010 10:00:20 -0400 From: "Roger Stewart" <rstewart(a)noregon.com> To: <boost-users(a)lists.boost.org> Subject: Re: [Boost-users] [boost] [log] Link error with trivial logging Message-ID: <A9BF6EA2DF78AB47A87CC2A0F55437FA014A4831(a)mail2003.noregon.com> Content-Type: text/plain; charset="utf-8" > -----Original Message----- > From: boost-users-bounces(a)lists.boost.org [mailto:boost-users- > bounces(a)lists.boost.org] On Behalf Of Igor R > Sent: Wednesday, June 16, 2010 3:56 AM > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [boost] [log] Link error with trivial > logging > > > libboost_log-vc80-mt-sgd-1_43.lib(trivial.obj) : error LNK2019: > > unresolved external symbol "class boost::system::error_category const > > & __cdecl boost::system::get_system_category(void)" > > (?get_system_category@system@boost@@YAABVerror_category@12@XZ) > > referenced in function "void __cdecl boost::system::`dynamic > > initializer for 'system_category''(void)" > > (??__Esystem_category@system@boost@@YAXXZ) > > > > Any thoughts on what might be causing this? ?Below is my main(). > ?Thanks! > > Do you have libboost_system-vc80-mt-sgd-1_43.lib ? > This lib should be linked as well. > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users I am using msvc90 with boost 1.43 and receive the same linking errors when compiling a simple trivial console project. I can get the project to link successfully if I include a backend sink, i.e.: #include <boost/log/sinks/text_file_backend.hpp> This bug can be verified by declaring #define BOOST_LIB_DIAGNOSTIC and watching which libs get pulled in for linking when including or commenting out text_file_backend.hpp. Roger S. ------------------------------ Message: 6 Date: Wed, 16 Jun 2010 16:37:57 +0200 From: Fr?d?ric Bron <frederic.bron(a)m4x.org> To: boost-users(a)lists.boost.org Cc: Rene Rivera <grafikrobot(a)gmail.com> Subject: Re: [Boost-users] config / cygwin question Message-ID: <AANLkTinaBs96oAkTOtfqmBoUpQJlfce3XnOKbSsFnkvK(a)mail.gmail.com> Content-Type: text/plain; charset="iso-8859-1" >> # Uploading log archive >> "/cygdrive/d/boost_regression/cygwin/results/bronf-cygwin-1.7.zip" to >> >> ftp://anonymous@... > > Rene, I think you're going to have to change this again. Oh! I am terribly sorry for this mistake. May I propose the attached patch so that this will never happen again. Regards, Fr?d?ric

2 1

flags for VS2010 project when using boost
by Jogeshwar Karthik Akundi 17 Jun '10

17 Jun '10

Hi, I am a newbie to boost and I am trying to develop an application which uses boost thread/mutex/condition/date-time classes. I now get crashes in boost::detail::basic_timed_mutex::unlock. What I suspect at this point of time is that my project settings may be wrong. Can somebody please tell me the right configuration flags etc to use when compiling an application using boost on Windows XP VS 2010. Cheers AJ

1 0

compile errors with boost::bind
by Nathan Ridge 17 Jun '10

17 Jun '10

Hello, I'm getting some compiler errors with boost::bind that I'm not able to figure out. I was able to reduce it to the following minimal example: #include <boost/bind.hpp> using boost::bind; template <typename RawProc> void AdapterProc(RawProc proc) { // do other stuff, then call proc() } template <typename RawProc> void f(RawProc proc) { bind(&AdapterProc<RawProc>, proc)(); } void RawProc(int x); int main() { f(bind(&RawProc, 0)); } The compiler errors with gcc 4.4 are the following: In file included from /usr/include/boost/bind.hpp:22, from test.cpp:1: /usr/include/boost/bind/bind.hpp: In member function ‘void boost::_bi::list1< boost::_bi::bind_t< void, void (*)(int), boost::_bi::list1<boost::_bi::value<int> > > > ::operator()( boost::_bi::type<void>, void (*)( boost::_bi::bind_t< void, void (*)(int), boost::_bi::list1<boost::_bi::value< int>>>)&, boost::_bi::list0 &, int)’: /usr/include/boost/bind/bind_template.hpp:20: instantiated from ‘boost::_bi ::result_traits< void, void (*)( boost::_bi::bind_t< void, void (*)(int), boost::_bi::list1<boost::_bi::value< int>>>) >::type boost::_bi::bind_t< void, void (*)( boost::_bi::bind_t< void, void (*)(int), boost::_bi::list1<boost::_bi::value< int>>>), boost::_bi::list1< boost::_bi::bind_t< void, void (*)(int), boost::_bi::list1<boost::_bi::value<int> > > > >::operator()()’ test.cpp:14: instantiated from ‘void f( boost::_bi::bind_t< void, void (*)(int), boost::_bi::list1<boost::_bi::value<int>>>)’ test.cpp:21: instantiated from here /usr/include/boost/bind/bind.hpp:246: error: conversion from ‘void’ to non- scalar type ‘boost::_bi::bind_t< void, void (*)(int), boost::_bi::list1<boost::_bi::value<int>>>’ requested I noticed that if I modify the global RawProc to take no arguments so that I don't need another bind() call in main() (I can just pass &RawProc to f() directly), it works fine. Could someone explain what I'm doing wrong? On a more general note, does anyone have some tips on how to interpret error messages like this from boost? It seems to me that without reading through the sources and understanding how the libraries are implemented, figuring out the cause of these errors is next to impossible... Thanks, Nate. _________________________________________________________________ Game on: Challenge friends to great games on Messenger http://go.microsoft.com/?linkid=9734387

2 1

Applying mpl::transform to an mpl::string
by Pedro d'Aquino 16 Jun '10

16 Jun '10

Hi, I'm trying to apply a transformation to an mpl::string, but can't get it to compile. I'm using MS VC++2010 and Boost 1.43.0. The code: #include <boost/mpl/string.hpp> #include <boost/mpl/vector_c.hpp> #include <boost/mpl/transform.hpp> #include <boost/mpl/plus.hpp> #include <boost/mpl/arithmetic.hpp> using namespace boost; int main() { // this compiles OK typedef mpl::vector_c<int, 'abcd', 'efgh'> numbers; typedef mpl::transform<numbers, mpl::plus<mpl::_1, mpl::int_<1> > >::type result_numbers; // this doesn't (error C2039: 'value' : is not a member of 'boost::mpl::has_push_back_arg') typedef mpl::string<'abcd', 'efgh'> chars; typedef mpl::transform<chars, mpl::plus<mpl::_1, mpl::int_<1> > >::type result_chars; } I've posted the full error message at http://paste.ubuntu.com/447759/. Am I doing something wrong? Thanks, Pedro d'Aquino

2 1

Re: [Boost-users] [boost] [log] Link error with trivial
by Joey Mink 16 Jun '10

16 Jun '10

> -----Original Message----- > From: boost-users-bounces_at_[hidden] [mailto:boost-users- > bounces_at_[hidden]] On Behalf Of Igor R > Sent: Wednesday, June 16, 2010 3:56 AM > To: boost-users_at_[hidden] > Subject: Re: [Boost-users] [boost] [log] Link error with trivial > logging > > > libboost_log-vc80-mt-sgd-1_43.lib(trivial.obj) : error LNK2019: > > unresolved external symbol "class boost::system::error_category const > > & __cdecl boost::system::get_system_category(void)" > > (?get_system_category_at_system@boost@@YAABVerror_category_at_12@XZ) > > referenced in function "void __cdecl boost::system::`dynamic > > initializer for 'system_category''(void)" > > (??__Esystem_category_at_system@boost@@YAXXZ) > > > > Any thoughts on what might be causing this? Â Below is my main(). > Â Thanks! > > Do you have libboost_system-vc80-mt-sgd-1_43.lib ? > This lib should be linked as well. Igor - thanks for the reply - yes, I did have that library available. I am using msvc90 with boost 1.43 and receive the same linking errors when > compiling a simple trivial console project. I can get the project to link successfully if I include a backend sink, > i.e.: #include <boost/log/sinks/text_file_backend.hpp> > This bug can be verified by declaring #define BOOST_LIB_DIAGNOSTIC and > watching which libs get pulled in for linking when including or commenting > out text_file_backend.hpp. > Roger S. Roger - thanks for the reply and suggestion. I included a backend sink as you mentioned and my linking issue was no more! Joey

1 0

[date time] using date_facet to output to a stream once
by Steve Lorimer 16 Jun '10

16 Jun '10

Hi I have a an object which contains a ptime and an int mask. The mask tells me that regardless of the value stored inside the ptime object, I should display the ptime as such. If you look at the code below (set_fmt function), I set the format of a date_facet object according to some bitmasks. I now want to use this date_facet together with my ptime to output the ptime value to an outputstream? I don't want it to change the outputstream's settings for ALL ptime values, just for this single instance All the examples use a date_facet allocated on the heap, and use std::cout.imbue(...), whereas I'm looking for functionality similar to strftime... is this possible? eg: class expiration { enum expiry_mask { expiry_null = 0x00, expiry_year = 0x01, expiry_month = 0x02, expiry_day = 0x04, expiry_hour = 0x08, expiry_minute = 0x10, expiry_second = 0x20, expiry_date = 0x07, // yyyy/mm/dd expiry_time = 0x38, // hh:nn:ss expiry_all = 0x3f // yyyy/mm/dd hh:nn:ss }; boost::posix_time::ptime desig; int32_t desig_mask; boost::gregorian::date_facet fmt; public: void expiration::set_fmt(const int32_t mask) { switch(mask & expiry_date) *// strip off time part of mask* { case expiry_null: fmt.format(""); break; case expiry_year | expiry_month | expiry_day: *// display as "**dd Mmm yy"* fmt.format("%d %b %y"); break; case expiry_year | expiry_month: *// display as **"Mmm yy"* fmt.format("%b %y"); break; case expiry_year: *// display as "**yy"* fmt.format("%y"); break; default: break; } } ... some other stuff here ... }; Thanks Steve

1 2

read floats from serial (polhemus fastrak)
by Jubei 16 Jun '10

16 Jun '10

Hello. I have been trying to read some floats off a polhemus tracker for a good week now. I'm just about ready to give up. I would really really appreciate any help in solving this as it has consumed an entire week of my life :) An example of the floats I'm trying to read are displayed in this image. It's the data that I see when I open a terminal to it. http://www.rci.kutc.kansai-u.ac.jp/problem.png Based on an example i found on the net I put together a class as such: *class minicom_client * *{ * *public: * * minicom_client(boost::asio::io_service& io_service, unsigned int baud, const std::string& device, EventQueue* queue) * * : serialPort(io_service, device), eventQueue(queue) * * { * * **if (!serialPort.is_open()) * * { * * MessageBox(NULL,"Serial Port","Failed to open",MB_OK);* * return; * * } * * boost::asio::serial_port_base::baud_rate baud_option(baud); * * serialPort.set_option(baud_option);* * * * **std::string msg = "fC"; **//command to get the tracker to start sending us binary output continuously* * * * **boost::asio::write(serialPort,boost::asio::buffer(msg.c_str(),msg.size())); *//send the command * * * ** *//start reading for input * **serialPort.async_read_some(boost::asio::buffer(buffer, max_read_length), boost::bind(&minicom_client::read_complete, * * this, * * boost::asio::placeholders::error, * * boost::asio::placeholders::bytes_transferred)); * * * * } * * * *private:* * **void read_complete(const boost::system::error_code& error, size_t bytes_transferred) * * **{** * * **boost::array<float, 7> topush;* * * * **for (int i=0;i<7;i++) {* * **topush[i] = reverse(getFloat(i)); //already tried with ntohl()* * * * **}** * * * * * * **boost::mutex::scoped_lock lock(io_mutex);* * *//event queue is a <dequeue> that we push the data in (the ui thread reads the data off that queue) * **eventQueue->push(topush); * * **lock.unlock();* * * * //go back to waiting for data* * **serialPort.async_read_some(boost::asio::buffer(buffer, max_read_length), boost::bind(&minicom_client::read_complete, * * **this, * * **boost::asio::placeholders::error, * * **boost::asio::placeholders::bytes_transferred)); * * **}* * * * **float getFloat(int index) **//extract floats from the buffer by memcpying them to floats. Function tested and works fine* * **{* * **float temp = 0.0;** * * * * **memcpy(&temp,buffer+3*sizeof(char)+index*sizeof(float),sizeof(float));* * **return temp;* * * * **}* * * * **float reverse( float const& x ) ** **//reverse the bytes* * **{* * **float res;* * * * **char* pres = (char*)(&res);* * **char const* px = (char const*)(&x);* * * * **std::reverse_copy(px,px+sizeof(float),pres);* * * * **return res;* * **}* * * * **// maximum amount of data to read in one operation 2 ascii, 1 space and 7 4-byte floats * * **static const int max_read_length = 7*4+3;* * * * **boost::asio::serial_port serialPort; **// the serial port this instance is connected to** * * **unsigned char buffer[max_read_length]; **// data read from the socket * * **EventQueue* eventQueue;* *};* then on my main() i do: * * * * *boost::asio::io_service io_service;* *boost::asio::io_service::work work(io_service);* *try {* * **minicom_client c(io_service, 115200, "COM4",queuePointer); * * **io_service.run();* *}* *catch (std::exception& e)* *{* * **MessageBox(NULL,e.what(),"You Buffoon SERIAL error",MB_OK);* *}* But the floats on the output become unreadable (like -541.3414e-035). Any help would be appreciated. Thanks in advance, Jubei

1 0

config / cygwin question
by Robert Ramey 16 Jun '10

16 Jun '10

looks like it didn't like the attachments. Try a smaller set Robert Ramey wrote: > I recently upgraded my cygwin gcc compiler to version 4.3.4 from > version > 4.3.2 and now I've having problems compiling tests for the > serialization library. > > The problem shows up as a failure to link to > std::basic_string<wchar_t> ... > > This can be traced back to: > > #ifndef BOOST_NO_STD_WSTRING > ar & BOOST_SERIALIZATION_NVP(z); > #endif > > Which suggests to me that BOOST_NO_STD_WSTRING is not being defined > even though it should be with this configuration. > > I've run the config test - the results are atached. > > I've looked through the config files and can't figure out how this > could be different between the two versions 4.3.2 and 4.3.4. > > Any help would be appreciated. > > Robert Ramey begin 666 bjam.log M8F]O<W0M=&5S="A#3TU024Q%7T9!24PI(")C;VYF:6<O=&5S=%]T:')E861? M9F%I;#(B(#H@(FQI8G,O8V]N9FEG+W1E<W0O=&AR96%D<R]T97-T7W1H<F5A M9%]F86EL,BYC<' B#0IB;V]S="UT97-T*$-/35!)3$5?1D%)3"D@(F-O;F9I M9R]T97-T7W1H<F5A9%]F86EL,2(@.B B;&EB<R]C;VYF:6<O=&5S="]T:')E M861S+W1E<W1?=&AR96%D7V9A:6PQ+F-P<"(-"F)O;W-T+71E<W0H4E5.*2 B M8V]N9FEG+V-O;F9I9U]L:6YK7W1E<W0B(#H@(FQI8G,O8V]N9FEG+W1E<W0O M;&EN:R]M86EN+F-P<"(-"F)O;W-T+71E<W0H4E5.*2 B8V]N9FEG+VQI;6ET M<U]T97-T(B Z(")L:6)S+V-O;F9I9R]T97-T+VQI;6ET<U]T97-T+F-P<"(- M"F)O;W-T+71E<W0H4E5.*2 B8V]N9FEG+V%B:5]T97-T(B Z(")L:6)S+V-O M;F9I9R]T97-T+V%B:2]A8FE?=&5S="YC<' B(")L:6)S+V-O;F9I9R]T97-T M+V%B:2]M86EN+F-P<"(-"F)O;W-T+71E<W0H4E5.*2 B8V]N9FEG+VUA=&A? M:6YF;R(@6R)A;'=A>7-?<VAO=U]R=6Y?;W5T<'5T(ET@.B B;&EB<R]C;VYF M:6<O=&5S="]M871H7VEN9F\N8W!P(@T*8F]O<W0M=&5S="A254XI(")C;VYF M:6<O8V]N9FEG7VEN9F]?=&AR96%D960B(%LB86QW87ES7W-H;W=?<G5N7V]U M='!U=")=(#H@(FQI8G,O8V]N9FEG+W1E<W0O8V]N9FEG7VEN9F\N8W!P(@T* M8F]O<W0M=&5S="A254XI(")C;VYF:6<O8V]N9FEG7VEN9F\B(%LB86QW87ES M7W-H;W=?<G5N7V]U='!U=")=(#H@(FQI8G,O8V]N9FEG+W1E<W0O8V]N9FEG M7VEN9F\N8W!P(@T*8F]O<W0M=&5S="A254XI(")C;VYF:6<O8V]N9FEG7W1E M<W0B(#H@(FQI8G,O8V]N9FEG+W1E<W0O8V]N9FEG7W1E<W0N8W!P(@T*8F]O M<W0M=&5S="A254XI(")C;VYF:6<O8V]N9FEG7W1E<W1?=&AR96%D960B(#H@ M(FQI8G,O8V]N9FEG+W1E<W0O8V]N9FEG7W1E<W0N8W!P(@T*+BXN<&%T:65N M8V4N+BX-"BXN+F9O=6YD(#$Q,C0@=&%R9V5T<RXN+@T*+BXN=7!D871I;F<@ M,3 U('1A<F=E=',N+BX-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)< M;&EB<UQC;VYF:6<-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB M<UQC;VYF:6=<=&5S= T*8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I;BYV,EQL M:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]T97-T7W1H<F5A9&5D+G1E<W0-"F-O M;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QC M;VYF:6=?=&5S=%]T:')E861E9"YT97-T7&=C8RTT+C,N- T*8V]M;6]N+FUK M9&ER("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]T M97-T7W1H<F5A9&5D+G1E<W1<9V-C+30N,RXT7&1E8G5G#0IC;VUM;VXN;6MD M:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG7W1E M<W1?=&AR96%D960N=&5S=%QG8V,M-"XS+C1<9&5B=6=<=&AR96%D:6YG+6UU M;'1I#0IG8V,N8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N M9FEG7'1E<W1<8V]N9FEG7W1E<W1?=&AR96%D960N=&5S=%QG8V,M-"XS+C1< M9&5B=6=<=&AR96%D:6YG+6UU;'1I7&-O;F9I9U]T97-T+F\-"F-Y9W=I;B!W M87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY< M+BX-"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z("XN+RXN+RXN M#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S M9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U M;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/ M4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN M970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"DEN(&9I;&4@:6YC;'5D M960@9G)O;2 O=7-R+VQI8B]G8V,O:38X-BUP8RUC>6=W:6XO-"XS+C0O:6YC M;'5D92]C*RLO97AT+VAA<VA?<V5T.C8T+ T*(" @(" @(" @(" @(" @("!F M<F]M(&)O;W-T7VAA<U]H87-H+FEP<#HQ-BP-"B @(" @(" @(" @(" @(" @ M9G)O;2!C;VYF:6=?=&5S="YC<' Z-C,R.@T*+W5S<B]L:6(O9V-C+VDV.#8M M<&,M8WEG=VEN+S0N,RXT+VEN8VQU9&4O8RLK+V)A8VMW87)D+V)A8VMW87)D M7W=A<FYI;F<N:#HS,SHR.B!W87)N:6YG.B C=V%R;FEN9R!4:&ES(&9I;&4@ M:6YC;'5D97,@870@;&5A<W0@;VYE(&1E<')E8V%T960@;W(@86YT:7%U871E M9"!H96%D97(@=VAI8V@@;6%Y(&)E(')E;6]V960@=VET:&]U="!F=7)T:&5R M(&YO=&EC92!A="!A(&9U='5R92!D871E+B!0;&5A<V4@=7-E(&$@;F]N+61E M<')E8V%T960@:6YT97)F86-E('=I=&@@97%U:79A;&5N="!F=6YC=&EO;F%L M:71Y(&EN<W1E860N($9O<B!A(&QI<W1I;F<@;V8@<F5P;&%C96UE;G0@:&5A M9&5R<R!A;F0@:6YT97)F86-E<RP@8V]N<W5L="!T:&4@9FEL92!B86-K=V%R M9%]W87)N:6YG+F@N(%1O(&1I<V%B;&4@=&AI<R!W87)N:6YG('5S92 M5VYO M+61E<')E8V%T960N#0I);B!F:6QE(&EN8VQU9&5D(&9R;VT@8V]N9FEG7W1E M<W0N8W!P.C8V,CH-"F)O;W-T7VAA<U]N;%]T>7!E<U]H+FEP<#HQ,CHR,CH@ M97)R;W(Z(&YL7W1Y<&5S+F@Z($YO('-U8V@@9FEL92!O<B!D:7)E8W1O<GD- M"DEN(&9I;&4@:6YC;'5D960@9G)O;2!C;VYF:6=?=&5S="YC<' Z,S$Q.@T* M8F]O<W1?;F]?:7-?86)S=')A8W0N:7!P.B!);B!F=6YC=&EO;B#B@)AI;G0@ M8F]O<W1?;F]?:7-?86)S=')A8W0Z.G1E<W0H*>* F3H-"F)O;W-T7VYO7VES M7V%B<W1R86-T+FEP<#HT.3H@=V%R;FEN9SH@8V]M<&%R:7-O;B!B971W965N M(.* F&5N=6T@8F]O<W1?;F]?:7-?86)S=')A8W0Z.FES7V%B<W1R86-T7W1E M<W0\8F]O<W1?;F]?:7-?86)S=')A8W0Z.FYO;E]A8G-T<F%C=#XZ.CQA;F]N M>6UO=7,^XH"9(&%N9"#B@)AE;G5M(&)O;W-T7VYO7VES7V%B<W1R86-T.CII M<U]A8G-T<F%C=%]T97-T/&)O;W-T7VYO7VES7V%B<W1R86-T.CIA8G-T<F%C M=#XZ.CQA;F]N>6UO=7,^XH"9#0I);B!F:6QE(&EN8VQU9&5D(&9R;VT@8V]N M9FEG7W1E<W0N8W!P.C0U,3H-"F)O;W-T7VYO7W-T9&-?;F%M97-P86-E+FEP M<#H@26X@9G5N8W1I;VX@XH"8:6YT(&)O;W-T7VYO7W-T9&-?;F%M97-P86-E M.CIT97-T*"GB@)DZ#0IB;V]S=%]N;U]S=&1C7VYA;65S<&%C92YI<' Z,S(Z M('=A<FYI;F<Z('-T871E;65N="!H87,@;F\@969F96-T#0IB;V]S=%]N;U]S M=&1C7VYA;65S<&%C92YI<' Z,S,Z('=A<FYI;F<Z('-T871E;65N="!H87,@ M;F\@969F96-T#0IB;V]S=%]N;U]S=&1C7VYA;65S<&%C92YI<' Z,S0Z('=A M<FYI;F<Z('-T871E;65N="!H87,@;F\@969F96-T#0I);B!F:6QE(&EN8VQU M9&5D(&9R;VT@8V]N9FEG7W1E<W0N8W!P.C0Y-CH-"F)O;W-T7VYO7W-T9%]T M>7!E:6YF;RYI<' Z($EN(&9U;F-T:6]N(.* F&EN="!B;V]S=%]N;U]S=&1? M='EP96EN9F\Z.G1E<W0H*>* F3H-"F)O;W-T7VYO7W-T9%]T>7!E:6YF;RYI M<' Z,3DZ('=A<FYI;F<Z('5N=7-E9"!V87)I86)L92#B@)APXH"9#0I);B!F M:6QE(&EN8VQU9&5D(&9R;VT@8V]N9FEG7W1E<W0N8W!P.C4S,3H-"F)O;W-T M7VYO7W1E;7!L871E7W-T<F5A;7,N:7!P.B!);B!F=6YC=&EO;B#B@)AI;G0@ M8F]O<W1?;F]?=&5M<&QA=&5D7VEO<W1R96%M<SHZ=&5S="@IXH"9.@T*8F]O M<W1?;F]?=&5M<&QA=&5?<W1R96%M<RYI<' Z,3DZ('=A<FYI;F<Z('5N=7-E M9"!V87)I86)L92#B@)AO<W+B@)D-"DEN(&9I;&4@:6YC;'5D960@9G)O;2!C M;VYF:6=?=&5S="YC<' Z-30V.@T*8F]O<W1?;F]?='EP96ED+FEP<#H@26X@ M9G5N8W1I;VX@XH"8:6YT(&)O;W-T7VYO7W1Y<&5I9#HZ=&5S="@IXH"9.@T* M8F]O<W1?;F]?='EP96ED+FEP<#HQ.3H@=V%R;FEN9SH@<W1A=&5M96YT(&AA M<R!N;R!E9F9E8W0-"DEN(&9I;&4@:6YC;'5D960@9G)O;2!C;VYF:6=?=&5S M="YC<' Z-C8R.@T*8F]O<W1?:&%S7VYL7W1Y<&5S7V@N:7!P.B!);B!F=6YC M=&EO;B#B@)AI;G0@8F]O<W1?:&%S7VYL7W1Y<&5S7V(a)Z.G1E<W0H*>* F3H- M"F)O;W-T7VAA<U]N;%]T>7!E<U]H+FEP<#HQ.3H(a)97)R;W(Z(.* F&YL7V-A M=&3B@)D@=V%S(&YO="!D96-L87)E9"!I;B!T:&ES('-C;W!E#0IB;V]S=%]H M87-?;FQ?='EP97-?:"YI<' Z,3DZ(&5R<F]R.B!E>'!E8W1E9"!@.R<@8F5F M;W)E(.* F&-A=.* F0T*8F]O<W1?:&%S7VYL7W1Y<&5S7V@N:7!P.C(P.B!E M<G)O<CH@XH"88V%TXH"9('=A<R!N;W0@9&5C;&%R960@:6X@=&AI<R!S8V]P M90T*8F]O<W1?:&%S7VYL7W1Y<&5S7V@N:7!P.C(P.B!E<G)O<CH@XH"88V%T M8VQO<V7B@)D@=V%S(&YO="!D96-L87)E9"!I;B!T:&ES('-C;W!E#0IB;V]S M=%]N;U]S=&1?=W-T<F5A;6)U9BYI<' Z($EN(&UE;6)E<B!F=6YC=&EO;B#B M@)AT>7!E;F%M92!B;V]S=%]N;U]S=&1?=W-T<F5A;6)U9CHZ<&%R<V5R7V)U M9CQC:&%R5"P@=')A:71S/CHZ<&]S7W1Y<&4@8F]O<W1?;F]?<W1D7W=S=')E M86UB=68Z.G!A<G-E<E]B=68\8VAA<E0L('1R86ET<SXZ.G-E96MO9F8H='EP M96YA;64@<W1D.CIB87-I8U]S=')E86UB=68\7T-H87)4+"!?5')A:71S/CHZ M;V9F7W1Y<&4L('-T9#HZ7TEO<U]3965K9&ER+"!S=&0Z.E]);W-?3W!E;FUO M9&4I(%MW:71H(&-H87)4(#T@8VAA<BP@=')A:71S(#T@<W1D.CIC:&%R7W1R M86ET<SQC:&%R/EWB@)DZ#0IB;V]S=%]N;U]S=&1?=W-T<F5A;6)U9BYI<' Z M,3 T.B @(&EN<W1A;G1I871E9"!F<F]M(&AE<F4-"F)O;W-T7VYO7W-T9%]W M<W1R96%M8G5F+FEP<#HU.3H@=V%R;FEN9SH@96YU;65R871I;VX@=F%L=64@ MXH"87U-?:6]S7W-E96MD:7)?96YDXH"9(&YO="!H86YD;&5D(&EN('-W:71C M: T*8F]O<W1?;F]?<W1D7W=S=')E86UB=68N:7!P.B!);B!M96UB97(@9G5N M8W1I;VX@XH"8='EP96YA;64@8F]O<W1?;F]?<W1D7W=S=')E86UB=68Z.G!A M<G-E<E]B=68\8VAA<E0L('1R86ET<SXZ.G!O<U]T>7!E(&)O;W-T7VYO7W-T M9%]W<W1R96%M8G5F.CIP87)S97)?8G5F/&-H87)4+"!T<F%I=',^.CIS965K M;V9F*'1Y<&5N86UE('-T9#HZ8F%S:6-?<W1R96%M8G5F/%]#:&%R5"P@7U1R M86ET<SXZ.F]F9E]T>7!E+"!S=&0Z.E]);W-?4V5E:V1I<BP@<W1D.CI?26]S M7T]P96YM;V1E*2!;=VET:"!C:&%R5" ]('=C:&%R7W0L('1R86ET<R ]('-T M9#HZ8VAA<E]T<F%I=',\=V-H87)?=#Y=XH"9.@T*8F]O<W1?;F]?<W1D7W=S M=')E86UB=68N:7!P.C$P-3H@("!I;G-T86YT:6%T960@9G)O;2!H97)E#0IB M;V]S=%]N;U]S=&1?=W-T<F5A;6)U9BYI<' Z-3DZ('=A<FYI;F<Z(&5N=6UE M<F%T:6]N('9A;'5E(.* F%]37VEO<U]S965K9&ER7V5N9.* F2!N;W0@:&%N M9&QE9"!I;B!S=VET8V@-"@T*(" @(")G*RLM-"(@("UF=&5M<&QA=&4M9&5P M=&@M,3(X("U/," M9FYO+6EN;&EN92 M5V%L;" M9R M;71H<F5A9',@("U$ M0D]/4U1?04Q,7TY/7TQ)0CTQ(" M22(N+EPN+EPN+B(@+6,@+6\@(BXN7"XN M7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]T97-T7W1H<F5A M9&5D+G1E<W1<9V-C+30N,RXT7&1E8G5G7'1H<F5A9&EN9RUM=6QT:5QC;VYF M:6=?=&5S="YO(B B8V]N9FEG7W1E<W0N8W!P(@T*#0HN+BYF86EL960@9V-C M+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T M7&-O;F9I9U]T97-T7W1H<F5A9&5D+G1E<W1<9V-C+30N,RXT7&1E8G5G7'1H M<F5A9&EN9RUM=6QT:5QC;VYF:6=?=&5S="YO+BXN#0HN+BYS:VEP<&5D(#QP M+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG7W1E<W1? M=&AR96%D960N=&5S=%QG8V,M-"XS+C1<9&5B=6=<=&AR96%D:6YG+6UU;'1I M/F-O;F9I9U]T97-T7W1H<F5A9&5D+F5X92!F;W(@;&%C:R!O9B \<"XN7"XN M7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]T97-T7W1H<F5A M9&5D+G1E<W1<9V-C+30N,RXT7&1E8G5G7'1H<F5A9&EN9RUM=6QT:3YC;VYF M:6=?=&5S="YO+BXN#0HN+BYS:VEP<&5D(#QP+BY<+BY<+BY<8FEN+G8R7&QI M8G-<8V]N9FEG7'1E<W1<8V]N9FEG7W1E<W1?=&AR96%D960N=&5S=%QG8V,M M-"XS+C1<9&5B=6=<=&AR96%D:6YG+6UU;'1I/F-O;F9I9U]T97-T7W1H<F5A M9&5D+G)U;B!F;W(@;&%C:R!O9B \<"XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O M;F9I9UQT97-T7&-O;F9I9U]T97-T7W1H<F5A9&5D+G1E<W1<9V-C+30N,RXT M7&1E8G5G7'1H<F5A9&EN9RUM=6QT:3YC;VYF:6=?=&5S=%]T:')E861E9"YE M>&4N+BX-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF M:6=<=&5S=%QC;VYF:6=?=&5S="YT97-T#0IC;VUM;VXN;6MD:7(@+BY<+BY< M+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG7W1E<W0N=&5S=%QG M8V,M-"XS+C0-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC M;VYF:6=<=&5S=%QC;VYF:6=?=&5S="YT97-T7&=C8RTT+C,N-%QD96)U9PT* M9V-C+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT M97-T7&-O;F9I9U]T97-T+G1E<W1<9V-C+30N,RXT7&1E8G5G7&-O;F9I9U]T M97-T+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D M971E8W1E9#H@+BY<+BY<+BX-"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE M;G0@:7,Z("XN+RXN+RXN#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L M92!O<'1I;VX@(FYO9&]S9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A M<FYI;F<N#0H@($-O;G-U;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D M971A:6QS(&%B;W5T(%!/4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN M8V]M+V-Y9W=I;BUU9RUN970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,- M"DEN(&9I;&4@:6YC;'5D960@9G)O;2 O=7-R+VQI8B]G8V,O:38X-BUP8RUC M>6=W:6XO-"XS+C0O:6YC;'5D92]C*RLO97AT+VAA<VA?<V5T.C8T+ T*(" @ M(" @(" @(" @(" @("!F<F]M(&)O;W-T7VAA<U]H87-H+FEP<#HQ-BP-"B @ M(" @(" @(" @(" @(" @9G)O;2!C;VYF:6=?=&5S="YC<' Z-C,R.@T*+W5S M<B]L:6(O9V-C+VDV.#8M<&,M8WEG=VEN+S0N,RXT+VEN8VQU9&4O8RLK+V)A M8VMW87)D+V)A8VMW87)D7W=A<FYI;F<N:#HS,SHR.B!W87)N:6YG.B C=V%R M;FEN9R!4:&ES(&9I;&4@:6YC;'5D97,@870@;&5A<W0@;VYE(&1E<')E8V%T M960@;W(@86YT:7%U871E9"!H96%D97(@=VAI8V@@;6%Y(&)E(')E;6]V960@ M=VET:&]U="!F=7)T:&5R(&YO=&EC92!A="!A(&9U='5R92!D871E+B!0;&5A M<V4@=7-E(&$@;F]N+61E<')E8V%T960@:6YT97)F86-E('=I=&@@97%U:79A M;&5N="!F=6YC=&EO;F%L:71Y(&EN<W1E860N($9O<B!A(&QI<W1I;F<@;V8@ M<F5P;&%C96UE;G0@:&5A9&5R<R!A;F0@:6YT97)F86-E<RP@8V]N<W5L="!T M:&4@9FEL92!B86-K=V%R9%]W87)N:6YG+F@N(%1O(&1I<V%B;&4@=&AI<R!W M87)N:6YG('5S92 M5VYO+61E<')E8V%T960N#0I);B!F:6QE(&EN8VQU9&5D M(&9R;VT@8V]N9FEG7W1E<W0N8W!P.C8V,CH-"F)O;W-T7VAA<U]N;%]T>7!E M<U]H+FEP<#HQ,CHR,CH@97)R;W(Z(&YL7W1Y<&5S+F@Z($YO('-U8V@@9FEL M92!O<B!D:7)E8W1O<GD-"DEN(&9I;&4@:6YC;'5D960@9G)O;2!C;VYF:6=? M=&5S="YC<' Z,S$Q.@T*8F]O<W1?;F]?:7-?86)S=')A8W0N:7!P.B!);B!F M=6YC=&EO;B#B@)AI;G0@8F]O<W1?;F]?:7-?86)S=')A8W0Z.G1E<W0H*>* MF3H-"F)O;W-T7VYO7VES7V%B<W1R86-T+FEP<#HT.3H@=V%R;FEN9SH@8V]M M<&%R:7-O;B!B971W965N(.* F&5N=6T@8F]O<W1?;F]?:7-?86)S=')A8W0Z M.FES7V%B<W1R86-T7W1E<W0\8F]O<W1?;F]?:7-?86)S=')A8W0Z.FYO;E]A M8G-T<F%C=#XZ.CQA;F]N>6UO=7,^XH"9(&%N9"#B@)AE;G5M(&)O;W-T7VYO M7VES7V%B<W1R86-T.CII<U]A8G-T<F%C=%]T97-T/&)O;W-T7VYO7VES7V%B M<W1R86-T.CIA8G-T<F%C=#XZ.CQA;F]N>6UO=7,^XH"9#0I);B!F:6QE(&EN M8VQU9&5D(&9R;VT@8V]N9FEG7W1E<W0N8W!P.C0U,3H-"F)O;W-T7VYO7W-T M9&-?;F%M97-P86-E+FEP<#H@26X@9G5N8W1I;VX@XH"8:6YT(&)O;W-T7VYO M7W-T9&-?;F%M97-P86-E.CIT97-T*"GB@)DZ#0IB;V]S=%]N;U]S=&1C7VYA M;65S<&%C92YI<' Z,S(Z('=A<FYI;F<Z('-T871E;65N="!H87,@;F\@969F M96-T#0IB;V]S=%]N;U]S=&1C7VYA;65S<&%C92YI<' Z,S,Z('=A<FYI;F<Z M('-T871E;65N="!H87,@;F\@969F96-T#0IB;V]S=%]N;U]S=&1C7VYA;65S M<&%C92YI<' Z,S0Z('=A<FYI;F<Z('-T871E;65N="!H87,@;F\@969F96-T M#0I);B!F:6QE(&EN8VQU9&5D(&9R;VT@8V]N9FEG7W1E<W0N8W!P.C0Y-CH- M"F)O;W-T7VYO7W-T9%]T>7!E:6YF;RYI<' Z($EN(&9U;F-T:6]N(.* F&EN M="!B;V]S=%]N;U]S=&1?='EP96EN9F\Z.G1E<W0H*>* F3H-"F)O;W-T7VYO M7W-T9%]T>7!E:6YF;RYI<' Z,3DZ('=A<FYI;F<Z('5N=7-E9"!V87)I86)L M92#B@)APXH"9#0I);B!F:6QE(&EN8VQU9&5D(&9R;VT@8V]N9FEG7W1E<W0N M8W!P.C4S,3H-"F)O;W-T7VYO7W1E;7!L871E7W-T<F5A;7,N:7!P.B!);B!F M=6YC=&EO;B#B@)AI;G0@8F]O<W1?;F]?=&5M<&QA=&5D7VEO<W1R96%M<SHZ M=&5S="@IXH"9.@T*8F]O<W1?;F]?=&5M<&QA=&5?<W1R96%M<RYI<' Z,3DZ M('=A<FYI;F<Z('5N=7-E9"!V87)I86)L92#B@)AO<W+B@)D-"DEN(&9I;&4@ M:6YC;'5D960@9G)O;2!C;VYF:6=?=&5S="YC<' Z-30V.@T*8F]O<W1?;F]? M='EP96ED+FEP<#H@26X@9G5N8W1I;VX@XH"8:6YT(&)O;W-T7VYO7W1Y<&5I M9#HZ=&5S="@IXH"9.@T*8F]O<W1?;F]?='EP96ED+FEP<#HQ.3H@=V%R;FEN M9SH@<W1A=&5M96YT(&AA<R!N;R!E9F9E8W0-"DEN(&9I;&4@:6YC;'5D960@ M9G)O;2!C;VYF:6=?=&5S="YC<' Z-C8R.@T*8F]O<W1?:&%S7VYL7W1Y<&5S M7V@N:7!P.B!);B!F=6YC=&EO;B#B@)AI;G0@8F]O<W1?:&%S7VYL7W1Y<&5S M7V(a)Z.G1E<W0H*>* F3H-"F)O;W-T7VAA<U]N;%]T>7!E<U]H+FEP<#HQ.3H@ M97)R;W(Z(.* F&YL7V-A=&3B@)D@=V%S(&YO="!D96-L87)E9"!I;B!T:&ES M('-C;W!E#0IB;V]S=%]H87-?;FQ?='EP97-?:"YI<' Z,3DZ(&5R<F]R.B!E M>'!E8W1E9"!@.R<@8F5F;W)E(.* F&-A=.* F0T*8F]O<W1?:&%S7VYL7W1Y M<&5S7V@N:7!P.C(P.B!E<G)O<CH@XH"88V%TXH"9('=A<R!N;W0@9&5C;&%R M960@:6X@=&AI<R!S8V]P90T*8F]O<W1?:&%S7VYL7W1Y<&5S7V@N:7!P.C(P M.B!E<G)O<CH@XH"88V%T8VQO<V7B@)D@=V%S(&YO="!D96-L87)E9"!I;B!T M:&ES('-C;W!E#0IB;V]S=%]N;U]S=&1?=W-T<F5A;6)U9BYI<' Z($EN(&UE M;6)E<B!F=6YC=&EO;B#B@)AT>7!E;F%M92!B;V]S=%]N;U]S=&1?=W-T<F5A M;6)U9CHZ<&%R<V5R7V)U9CQC:&%R5"P@=')A:71S/CHZ<&]S7W1Y<&4@8F]O M<W1?;F]?<W1D7W=S=')E86UB=68Z.G!A<G-E<E]B=68\8VAA<E0L('1R86ET M<SXZ.G-E96MO9F8H='EP96YA;64@<W1D.CIB87-I8U]S=')E86UB=68\7T-H M87)4+"!?5')A:71S/CHZ;V9F7W1Y<&4L('-T9#HZ7TEO<U]3965K9&ER+"!S M=&0Z.E]);W-?3W!E;FUO9&4I(%MW:71H(&-H87)4(#T@8VAA<BP@=')A:71S M(#T@<W1D.CIC:&%R7W1R86ET<SQC:&%R/EWB@)DZ#0IB;V]S=%]N;U]S=&1? M=W-T<F5A;6)U9BYI<' Z,3 T.B @(&EN<W1A;G1I871E9"!F<F]M(&AE<F4- M"F)O;W-T7VYO7W-T9%]W<W1R96%M8G5F+FEP<#HU.3H@=V%R;FEN9SH@96YU M;65R871I;VX@=F%L=64@XH"87U-?:6]S7W-E96MD:7)?96YDXH"9(&YO="!H M86YD;&5D(&EN('-W:71C: T*8F]O<W1?;F]?<W1D7W=S=')E86UB=68N:7!P M.B!);B!M96UB97(@9G5N8W1I;VX@XH"8='EP96YA;64@8F]O<W1?;F]?<W1D M7W=S=')E86UB=68Z.G!A<G-E<E]B=68\8VAA<E0L('1R86ET<SXZ.G!O<U]T M>7!E(&)O;W-T7VYO7W-T9%]W<W1R96%M8G5F.CIP87)S97)?8G5F/&-H87)4 M+"!T<F%I=',^.CIS965K;V9F*'1Y<&5N86UE('-T9#HZ8F%S:6-?<W1R96%M M8G5F/%]#:&%R5"P@7U1R86ET<SXZ.F]F9E]T>7!E+"!S=&0Z.E]);W-?4V5E M:V1I<BP@<W1D.CI?26]S7T]P96YM;V1E*2!;=VET:"!C:&%R5" ]('=C:&%R M7W0L('1R86ET<R ]('-T9#HZ8VAA<E]T<F%I=',\=V-H87)?=#Y=XH"9.@T* M8F]O<W1?;F]?<W1D7W=S=')E86UB=68N:7!P.C$P-3H@("!I;G-T86YT:6%T M960@9G)O;2!H97)E#0IB;V]S=%]N;U]S=&1?=W-T<F5A;6)U9BYI<' Z-3DZ M('=A<FYI;F<Z(&5N=6UE<F%T:6]N('9A;'5E(.* F%]37VEO<U]S965K9&ER M7V5N9.* F2!N;W0@:&%N9&QE9"!I;B!S=VET8V@-"@T*(" @(")G*RLM-"(@ M("UF=&5M<&QA=&4M9&5P=&@M,3(X("U/," M9FYO+6EN;&EN92 M5V%L;" M M9R @+41"3T]35%]!3$Q?3D]?3$E"/3$@("U)(BXN7"XN7"XN(B M8R M;R B M+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG7W1E<W0N M=&5S=%QG8V,M-"XS+C1<9&5B=6=<8V]N9FEG7W1E<W0N;R(@(F-O;F9I9U]T M97-T+F-P<"(-"@T*+BXN9F%I;&5D(&=C8RYC;VUP:6QE+F,K*R N+EPN+EPN M+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QC;VYF:6=?=&5S="YT97-T7&=C M8RTT+C,N-%QD96)U9UQC;VYF:6=?=&5S="YO+BXN#0HN+BYS:VEP<&5D(#QP M+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG7W1E<W0N M=&5S=%QG8V,M-"XS+C1<9&5B=6<^8V]N9FEG7W1E<W0N97AE(&9O<B!L86-K M(&]F(#QP+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG M7W1E<W0N=&5S=%QG8V,M-"XS+C1<9&5B=6<^8V]N9FEG7W1E<W0N;RXN+@T* M+BXN<VMI<'!E9" \<"XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T M7&-O;F9I9U]T97-T+G1E<W1<9V-C+30N,RXT7&1E8G5G/F-O;F9I9U]T97-T M+G)U;B!F;W(@;&%C:R!O9B \<"XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I M9UQT97-T7&-O;F9I9U]T97-T+G1E<W1<9V-C+30N,RXT7&1E8G5G/F-O;F9I M9U]T97-T+F5X92XN+@T*8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I;BYV,EQL M:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]I;F9O+G1E<W0-"F-O;6UO;BYM:V1I M<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QC;VYF:6=?:6YF M;RYT97-T7&=C8RTT+C,N- T*8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I;BYV M,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]I;F9O+G1E<W1<9V-C+30N,RXT M7&1E8G5G#0IG8V,N8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-< M8V]N9FEG7'1E<W1<8V]N9FEG7VEN9F\N=&5S=%QG8V,M-"XS+C1<9&5B=6=< M8V]N9FEG7VEN9F\N;PT*8WEG=VEN('=A<FYI;F<Z#0H@($U3+41/4R!S='EL M92!P871H(&1E=&5C=&5D.B N+EPN+EPN+@T*("!0<F5F97)R960@4$]325@@ M97%U:79A;&5N="!I<SH@+BXO+BXO+BX-"B @0UE'5TE.(&5N=FER;VYM96YT M('9A<FEA8FQE(&]P=&EO;B B;F]D;W-F:6QE=V%R;FEN9R(@='5R;G,@;V9F M('1H:7,@=V%R;FEN9RX-"B @0V]N<W5L="!T:&4@=7-E<B=S(&=U:61E(&9O M<B!M;W)E(&1E=&%I;',@86)O=70@4$]325@@<&%T:',Z#0H@(" @:'1T<#HO M+V-Y9W=I;BYC;VTO8WEG=VEN+75G+6YE="]U<VEN9RYH=&UL(W5S:6YG+7!A M=&AN86UE<PT*9V-C+FQI;FL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG M7'1E<W1<8V]N9FEG7VEN9F\N=&5S=%QG8V,M-"XS+C1<9&5B=6=<8V]N9FEG M7VEN9F\N97AE#0IC>6=W:6X@=V%R;FEN9SH-"B @35,M1$]3('-T>6QE('!A M=&@@9&5T96-T960Z("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T M7&-O;F9I9U]I;F9O+G1E<W1<9V-C+30N,RXT7&1E8G5G7&-O;F9I9U]I;F9O M+F\-"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z("XN+RXN+RXN M+V)I;BYV,B]L:6)S+V-O;F9I9R]T97-T+V-O;F9I9U]I;F9O+G1E<W0O9V-C M+30N,RXT+V1E8G5G+V-O;F9I9U]I;F9O+F\-"B @0UE'5TE.(&5N=FER;VYM M96YT('9A<FEA8FQE(&]P=&EO;B B;F]D;W-F:6QE=V%R;FEN9R(@='5R;G,@ M;V9F('1H:7,@=V%R;FEN9RX-"B @0V]N<W5L="!T:&4@=7-E<B=S(&=U:61E M(&9O<B!M;W)E(&1E=&%I;',@86)O=70@4$]325@@<&%T:',Z#0H@(" @:'1T M<#HO+V-Y9W=I;BYC;VTO8WEG=VEN+75G+6YE="]U<VEN9RYH=&UL(W5S:6YG M+7!A=&AN86UE<PT*=&5S=&EN9RYC87!T=7)E+6]U='!U=" N+EPN+EPN+EQB M:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QC;VYF:6=?:6YF;RYT97-T7&=C8RTT M+C,N-%QD96)U9UQC;VYF:6=?:6YF;RYR=6X-"B @(" @(" @,2!F:6QE*',I M(&-O<&EE9"X-"BHJ<&%S<V5D*BH@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N M9FEG7'1E<W1<8V]N9FEG7VEN9F\N=&5S=%QG8V,M-"XS+C1<9&5B=6=<8V]N M9FEG7VEN9F\N=&5S= T*8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I;BYV,EQL M:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]I;F9O7W1H<F5A9&5D+G1E<W0-"F-O M;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QC M;VYF:6=?:6YF;U]T:')E861E9"YT97-T7&=C8RTT+C,N- T*8V]M;6]N+FUK M9&ER("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]I M;F9O7W1H<F5A9&5D+G1E<W1<9V-C+30N,RXT7&1E8G5G#0IC;VUM;VXN;6MD M:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG7VEN M9F]?=&AR96%D960N=&5S=%QG8V,M-"XS+C1<9&5B=6=<=&AR96%D:6YG+6UU M;'1I#0IG8V,N8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N M9FEG7'1E<W1<8V]N9FEG7VEN9F]?=&AR96%D960N=&5S=%QG8V,M-"XS+C1< M9&5B=6=<=&AR96%D:6YG+6UU;'1I7&-O;F9I9U]I;F9O+F\-"F-Y9W=I;B!W M87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY< M+BX-"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z("XN+RXN+RXN M#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S M9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U M;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/ M4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN M970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"F=C8RYL:6YK("XN7"XN M7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]I;F9O7W1H<F5A M9&5D+G1E<W1<9V-C+30N,RXT7&1E8G5G7'1H<F5A9&EN9RUM=6QT:5QC;VYF M:6=?:6YF;U]T:')E861E9"YE>&4-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$ M3U,@<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY<+BY<8FEN+G8R7&QI8G-< M8V]N9FEG7'1E<W1<8V]N9FEG7VEN9F]?=&AR96%D960N=&5S=%QG8V,M-"XS M+C1<9&5B=6=<=&AR96%D:6YG+6UU;'1I7&-O;F9I9U]I;F9O+F\-"B @4')E M9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z("XN+RXN+RXN+V)I;BYV,B]L M:6)S+V-O;F9I9R]T97-T+V-O;F9I9U]I;F9O7W1H<F5A9&5D+G1E<W0O9V-C M+30N,RXT+V1E8G5G+W1H<F5A9&EN9RUM=6QT:2]C;VYF:6=?:6YF;RYO#0H@ M($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S9FEL M97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U;'0@ M=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/4TE8 M('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN970O M=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"G1E<W1I;F<N8V%P='5R92UO M=71P=70@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG M7VEN9F]?=&AR96%D960N=&5S=%QG8V,M-"XS+C1<9&5B=6=<=&AR96%D:6YG M+6UU;'1I7&-O;F9I9U]I;F9O7W1H<F5A9&5D+G)U;@T*(" @(" @(" Q(&9I M;&4H<RD@8V]P:65D+@T**BIP87-S960J*B N+EPN+EPN+EQB:6XN=C)<;&EB M<UQC;VYF:6=<=&5S=%QC;VYF:6=?:6YF;U]T:')E861E9"YT97-T7&=C8RTT M+C,N-%QD96)U9UQT:')E861I;F<M;75L=&E<8V]N9FEG7VEN9F]?=&AR96%D M960N=&5S= T*8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O M;F9I9UQT97-T7&UA=&A?:6YF;RYT97-T#0IC;VUM;VXN;6MD:7(@+BY<+BY< M+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<;6%T:%]I;F9O+G1E<W1<9V-C M+30N,RXT#0IC;VUM;VXN;6MD:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N M9FEG7'1E<W1<;6%T:%]I;F9O+G1E<W1<9V-C+30N,RXT7&1E8G5G#0IG8V,N M8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1< M;6%T:%]I;F9O+G1E<W1<9V-C+30N,RXT7&1E8G5G7&UA=&A?:6YF;RYO#0IC M>6=W:6X@=V%R;FEN9SH-"B @35,M1$]3('-T>6QE('!A=&@@9&5T96-T960Z M("XN7"XN7"XN#0H@(%!R969E<G)E9"!03U-)6"!E<75I=F%L96YT(&ES.B N M+B\N+B\N+@T*("!#64=724X@96YV:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N M(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T* M("!#;VYS=6QT('1H92!U<V5R)W,@9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A M8F]U="!03U-)6"!P871H<SH-"B @("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W M:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I;F<M<&%T:&YA;65S#0IG8V,N;&EN M:R N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QM871H7VEN9F\N M=&5S=%QG8V,M-"XS+C1<9&5B=6=<;6%T:%]I;F9O+F5X90T*8WEG=VEN('=A M<FYI;F<Z#0H@($U3+41/4R!S='EL92!P871H(&1E=&5C=&5D.B N+EPN+EPN M+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QM871H7VEN9F\N=&5S=%QG8V,M M-"XS+C1<9&5B=6=<;6%T:%]I;F9O+F\-"B @4')E9F5R<F5D(%!/4TE8(&5Q M=6EV86QE;G0@:7,Z("XN+RXN+RXN+V)I;BYV,B]L:6)S+V-O;F9I9R]T97-T M+VUA=&A?:6YF;RYT97-T+V=C8RTT+C,N-"]D96)U9R]M871H7VEN9F\N;PT* M("!#64=724X@96YV:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I M;&5W87)N:6YG(B!T=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT M('1H92!U<V5R)W,@9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-) M6"!P871H<SH-"B @("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T M+W5S:6YG+FAT;6PC=7-I;F<M<&%T:&YA;65S#0IT97-T:6YG+F-A<'1U<F4M M;W5T<'5T("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&UA=&A? M:6YF;RYT97-T7&=C8RTT+C,N-%QD96)U9UQM871H7VEN9F\N<G5N#0H@(" @ M(" @(#$@9FEL92AS*2!C;W!I960N#0HJ*G!A<W-E9"HJ("XN7"XN7"XN7&)I M;BYV,EQL:6)S7&-O;F9I9UQT97-T7&UA=&A?:6YF;RYT97-T7&=C8RTT+C,N M-%QD96)U9UQM871H7VEN9F\N=&5S= T*8V]M;6]N+FUK9&ER("XN7"XN7"XN M7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&%B:5]T97-T+G1E<W0-"F-O;6UO M;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QA8FE? M=&5S="YT97-T7&=C8RTT+C,N- T*8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I M;BYV,EQL:6)S7&-O;F9I9UQT97-T7&%B:5]T97-T+G1E<W1<9V-C+30N,RXT M7&1E8G5G#0IC;VUM;VXN;6MD:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N M9FEG7'1E<W1<86)I7W1E<W0N=&5S=%QG8V,M-"XS+C1<9&5B=6=<86)I#0IG M8V,N8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E M<W1<86)I7W1E<W0N=&5S=%QG8V,M-"XS+C1<9&5B=6=<86)I7&%B:5]T97-T M+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E M8W1E9#H@86)I7&%B:5]T97-T+F-P< T*("!0<F5F97)R960@4$]325@@97%U M:79A;&5N="!I<SH@86)I+V%B:5]T97-T+F-P< T*("!#64=724X@96YV:7)O M;FUE;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N M<R!O9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT('1H92!U<V5R)W,@9W5I M9&4@9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-)6"!P871H<SH-"B @("!H M='1P.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I M;F<M<&%T:&YA;65S#0IG8V,N8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R M7&QI8G-<8V]N9FEG7'1E<W1<86)I7W1E<W0N=&5S=%QG8V,M-"XS+C1<9&5B M=6=<86)I7&UA:6XN;PT*8WEG=VEN('=A<FYI;F<Z#0H@($U3+41/4R!S='EL M92!P871H(&1E=&5C=&5D.B!A8FE<;6%I;BYC<' -"B @4')E9F5R<F5D(%!/ M4TE8(&5Q=6EV86QE;G0@:7,Z(&%B:2]M86EN+F-P< T*("!#64=724X@96YV M:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I;&5W87)N:6YG(B!T M=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT('1H92!U<V5R)W,@ M9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-)6"!P871H<SH-"B @ M("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T+W5S:6YG+FAT;6PC M=7-I;F<M<&%T:&YA;65S#0IG8V,N;&EN:R N+EPN+EPN+EQB:6XN=C)<;&EB M<UQC;VYF:6=<=&5S=%QA8FE?=&5S="YT97-T7&=C8RTT+C,N-%QD96)U9UQA M8FE?=&5S="YE>&4-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@ M<&%T:"!D971E8W1E9#H@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E M<W1<86)I7W1E<W0N=&5S=%QG8V,M-"XS+C1<9&5B=6=<86)I7&%B:5]T97-T M+F\-"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z("XN+RXN+RXN M+V)I;BYV,B]L:6)S+V-O;F9I9R]T97-T+V%B:5]T97-T+G1E<W0O9V-C+30N M,RXT+V1E8G5G+V%B:2]A8FE?=&5S="YO#0H@($-91U=)3B!E;G9I<F]N;65N M="!V87)I86)L92!O<'1I;VX@(FYO9&]S9FEL97=A<FYI;F<B('1U<FYS(&]F M9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U;'0@=&AE('5S97(G<R!G=6ED92!F M;W(@;6]R92!D971A:6QS(&%B;W5T(%!/4TE8('!A=&AS.@T*(" @(&AT=' Z M+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN970O=7-I;F<N:'1M;"-U<VEN9RUP M871H;F%M97,-"G1E<W1I;F<N8V%P='5R92UO=71P=70@+BY<+BY<+BY<8FEN M+G8R7&QI8G-<8V]N9FEG7'1E<W1<86)I7W1E<W0N=&5S=%QG8V,M-"XS+C1< M9&5B=6=<86)I7W1E<W0N<G5N#0H@(" @(" @(#$@9FEL92AS*2!C;W!I960N M#0HJ*G!A<W-E9"HJ("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T M7&%B:5]T97-T+G1E<W1<9V-C+30N,RXT7&1E8G5G7&%B:5]T97-T+G1E<W0- M"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S M=%QL:6UI='-?=&5S="YT97-T#0IC;VUM;VXN;6MD:7(@+BY<+BY<+BY<8FEN M+G8R7&QI8G-<8V]N9FEG7'1E<W1<;&EM:71S7W1E<W0N=&5S=%QG8V,M-"XS M+C0-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=< M=&5S=%QL:6UI='-?=&5S="YT97-T7&=C8RTT+C,N-%QD96)U9PT*9V-C+F-O M;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&QI M;6ET<U]T97-T+G1E<W1<9V-C+30N,RXT7&1E8G5G7&QI;6ET<U]T97-T+F\- M"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E M9#H@+BY<+BY<+BX-"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z M("XN+RXN+RXN#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I M;VX@(FYO9&]S9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N M#0H@($-O;G-U;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS M(&%B;W5T(%!/4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y M9W=I;BUU9RUN970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"F-O;6UO M;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T#0IC;VUM;VXN;6MD M:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9 T*8V]M;6]N+FUK M9&ER("XN7"XN7"XN7&)I;BYV,EQL:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT M#0IC;VUM;VXN;6MD:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL M9%QG8V,M-"XS+C1<9&5B=6<-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN M=C)<;&EB<UQT97-T7&)U:6QD7&=C8RTT+C,N-%QD96)U9UQL:6YK+7-T871I M8PT*9V-C+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL:6)S7'1E<W1< M8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A=&EC7&-O;7!I;&5R7VQO M9U]F;W)M871T97(N;PT*8WEG=VEN('=A<FYI;F<Z#0H@($U3+41/4R!S='EL M92!P871H(&1E=&5C=&5D.B N+EPN+EPN+EQL:6)S7'1E<W1<<W)C7&-O;7!I M;&5R7VQO9U]F;W)M871T97(N8W!P#0H@(%!R969E<G)E9"!03U-)6"!E<75I M=F%L96YT(&ES.B N+B\N+B\N+B]L:6)S+W1E<W0O<W)C+V-O;7!I;&5R7VQO M9U]F;W)M871T97(N8W!P#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L M92!O<'1I;VX@(FYO9&]S9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A M<FYI;F<N#0H@($-O;G-U;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D M971A:6QS(&%B;W5T(%!/4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN M8V]M+V-Y9W=I;BUU9RUN970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,- M"F=C8RYC;VUP:6QE+F,K*R N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U M:6QD7&=C8RTT+C,N-%QD96)U9UQL:6YK+7-T871I8UQD96)U9RYO#0IC>6=W M:6X@=V%R;FEN9SH-"B @35,M1$]3('-T>6QE('!A=&@@9&5T96-T960Z("XN M7"XN7"XN7&QI8G-<=&5S=%QS<F-<9&5B=6<N8W!P#0H@(%!R969E<G)E9"!0 M3U-)6"!E<75I=F%L96YT(&ES.B N+B\N+B\N+B]L:6)S+W1E<W0O<W)C+V1E M8G5G+F-P< T*("!#64=724X@96YV:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N M(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T* M("!#;VYS=6QT('1H92!U<V5R)W,@9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A M8F]U="!03U-)6"!P871H<SH-"B @("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W M:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I;F<M<&%T:&YA;65S#0IG8V,N8V]M M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<97AE8W5T:6]N7VUO;FET;W(N;PT* M8WEG=VEN('=A<FYI;F<Z#0H@($U3+41/4R!S='EL92!P871H(&1E=&5C=&5D M.B N+EPN+EPN+EQL:6)S7'1E<W1<<W)C7&5X96-U=&EO;E]M;VYI=&]R+F-P M< T*("!0<F5F97)R960@4$]325@@97%U:79A;&5N="!I<SH@+BXO+BXO+BXO M;&EB<R]T97-T+W-R8R]E>&5C=71I;VY?;6]N:71O<BYC<' -"B @0UE'5TE. M(&5N=FER;VYM96YT('9A<FEA8FQE(&]P=&EO;B B;F]D;W-F:6QE=V%R;FEN M9R(@='5R;G,@;V9F('1H:7,@=V%R;FEN9RX-"B @0V]N<W5L="!T:&4@=7-E M<B=S(&=U:61E(&9O<B!M;W)E(&1E=&%I;',@86)O=70@4$]325@@<&%T:',Z M#0H@(" @:'1T<#HO+V-Y9W=I;BYC;VTO8WEG=VEN+75G+6YE="]U<VEN9RYH M=&UL(W5S:6YG+7!A=&AN86UE<PT*9V-C+F-O;7!I;&4N8RLK("XN7"XN7"XN M7&)I;BYV,EQL:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM M<W1A=&EC7&9R86UE=V]R:RYO#0IC>6=W:6X@=V%R;FEN9SH-"B @35,M1$]3 M('-T>6QE('!A=&@@9&5T96-T960Z("XN7"XN7"XN7&QI8G-<=&5S=%QS<F-< M9G)A;65W;W)K+F-P< T*("!0<F5F97)R960@4$]325@@97%U:79A;&5N="!I M<SH@+BXO+BXO+BXO;&EB<R]T97-T+W-R8R]F<F%M97=O<FLN8W!P#0H@($-9 M1U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S9FEL97=A M<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U;'0@=&AE M('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/4TE8('!A M=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN970O=7-I M;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"F=C8RYC;VUP:6QE+F,K*R N+EPN M+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD7&=C8RTT+C,N-%QD96)U9UQL M:6YK+7-T871I8UQP;&%I;E]R97!O<G1?9F]R;6%T=&5R+F\-"F-Y9W=I;B!W M87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY< M+BY<;&EB<UQT97-T7'-R8UQP;&%I;E]R97!O<G1?9F]R;6%T=&5R+F-P< T* M("!0<F5F97)R960@4$]325@@97%U:79A;&5N="!I<SH@+BXO+BXO+BXO;&EB M<R]T97-T+W-R8R]P;&%I;E]R97!O<G1?9F]R;6%T=&5R+F-P< T*("!#64=7 M24X@96YV:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I;&5W87)N M:6YG(B!T=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT('1H92!U M<V5R)W,@9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-)6"!P871H M<SH-"B @("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T+W5S:6YG M+FAT;6PC=7-I;F<M<&%T:&YA;65S#0IG8V,N8V]M<&EL92YC*RL@+BY<+BY< M+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS+C1<9&5B=6=<;&EN M:RUS=&%T:6-<<')O9W)E<W-?;6]N:71O<BYO#0IC>6=W:6X@=V%R;FEN9SH- M"B @35,M1$]3('-T>6QE('!A=&@@9&5T96-T960Z("XN7"XN7"XN7&QI8G-< M=&5S=%QS<F-<<')O9W)E<W-?;6]N:71O<BYC<' -"B @4')E9F5R<F5D(%!/ M4TE8(&5Q=6EV86QE;G0@:7,Z("XN+RXN+RXN+VQI8G,O=&5S="]S<F,O<')O M9W)E<W-?;6]N:71O<BYC<' -"B @0UE'5TE.(&5N=FER;VYM96YT('9A<FEA M8FQE(&]P=&EO;B B;F]D;W-F:6QE=V%R;FEN9R(@='5R;G,@;V9F('1H:7,@ M=V%R;FEN9RX-"B @0V]N<W5L="!T:&4@=7-E<B=S(&=U:61E(&9O<B!M;W)E M(&1E=&%I;',@86)O=70@4$]325@@<&%T:',Z#0H@(" @:'1T<#HO+V-Y9W=I M;BYC;VTO8WEG=VEN+75G+6YE="]U<VEN9RYH=&UL(W5S:6YG+7!A=&AN86UE M<PT*9V-C+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL:6)S7'1E<W1< M8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A=&EC7')E<W5L='-?8V]L M;&5C=&]R+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T M:"!D971E8W1E9#H@+BY<+BY<+BY<;&EB<UQT97-T7'-R8UQR97-U;'1S7V-O M;&QE8W1O<BYC<' -"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z M("XN+RXN+RXN+VQI8G,O=&5S="]S<F,O<F5S=6QT<U]C;VQL96-T;W(N8W!P M#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S M9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U M;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/ M4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN M970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"F=C8RYC;VUP:6QE+F,K M*R N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD7&=C8RTT+C,N-%QD M96)U9UQL:6YK+7-T871I8UQR97-U;'1S7W)E<&]R=&5R+F\-"F-Y9W=I;B!W M87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY< M+BY<;&EB<UQT97-T7'-R8UQR97-U;'1S7W)E<&]R=&5R+F-P< T*("!0<F5F M97)R960@4$]325@@97%U:79A;&5N="!I<SH@+BXO+BXO+BXO;&EB<R]T97-T M+W-R8R]R97-U;'1S7W)E<&]R=&5R+F-P< T*("!#64=724X@96YV:7)O;FUE M;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N<R!O M9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT('1H92!U<V5R)W,@9W5I9&4@ M9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-)6"!P871H<SH-"B @("!H='1P M.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I;F<M M<&%T:&YA;65S#0IG8V,N8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI M8G-<=&5S=%QB=6EL9%QG8V,M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<=&5S M=%]M86EN+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T M:"!D971E8W1E9#H@+BY<+BY<+BY<;&EB<UQT97-T7'-R8UQT97-T7VUA:6XN M8W!P#0H@(%!R969E<G)E9"!03U-)6"!E<75I=F%L96YT(&ES.B N+B\N+B\N M+B]L:6)S+W1E<W0O<W)C+W1E<W1?;6%I;BYC<' -"B @0UE'5TE.(&5N=FER M;VYM96YT('9A<FEA8FQE(&]P=&EO;B B;F]D;W-F:6QE=V%R;FEN9R(@='5R M;G,@;V9F('1H:7,@=V%R;FEN9RX-"B @0V]N<W5L="!T:&4@=7-E<B=S(&=U M:61E(&9O<B!M;W)E(&1E=&%I;',@86)O=70@4$]325@@<&%T:',Z#0H@(" @ M:'1T<#HO+V-Y9W=I;BYC;VTO8WEG=VEN+75G+6YE="]U<VEN9RYH=&UL(W5S M:6YG+7!A=&AN86UE<PT*9V-C+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV M,EQL:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A=&EC M7'1E<W1?=&]O;',N;PT*8WEG=VEN('=A<FYI;F<Z#0H@($U3+41/4R!S='EL M92!P871H(&1E=&5C=&5D.B N+EPN+EPN+EQL:6)S7'1E<W1<<W)C7'1E<W1? M=&]O;',N8W!P#0H@(%!R969E<G)E9"!03U-)6"!E<75I=F%L96YT(&ES.B N M+B\N+B\N+B]L:6)S+W1E<W0O<W)C+W1E<W1?=&]O;',N8W!P#0H@($-91U=) M3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S9FEL97=A<FYI M;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U;'0@=&AE('5S M97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/4TE8('!A=&AS M.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN970O=7-I;F<N M:'1M;"-U<VEN9RUP871H;F%M97,-"F=C8RYC;VUP:6QE+F,K*R N+EPN+EPN M+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD7&=C8RTT+C,N-%QD96)U9UQL:6YK M+7-T871I8UQU;FET7W1E<W1?;&]G+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!- M4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY<+BY<;&EB<UQT97-T M7'-R8UQU;FET7W1E<W1?;&]G+F-P< T*("!0<F5F97)R960@4$]325@@97%U M:79A;&5N="!I<SH@+BXO+BXO+BXO;&EB<R]T97-T+W-R8R]U;FET7W1E<W1? M;&]G+F-P< T*("!#64=724X@96YV:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N M(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T* M("!#;VYS=6QT('1H92!U<V5R)W,@9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A M8F]U="!03U-)6"!P871H<SH-"B @("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W M:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I;F<M<&%T:&YA;65S#0IG8V,N8V]M M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<=6YI=%]T97-T7VUA:6XN;PT*8WEG M=VEN('=A<FYI;F<Z#0H@($U3+41/4R!S='EL92!P871H(&1E=&5C=&5D.B N M+EPN+EPN+EQL:6)S7'1E<W1<<W)C7'5N:71?=&5S=%]M86EN+F-P< T*("!0 M<F5F97)R960@4$]325@@97%U:79A;&5N="!I<SH@+BXO+BXO+BXO;&EB<R]T M97-T+W-R8R]U;FET7W1E<W1?;6%I;BYC<' -"B @0UE'5TE.(&5N=FER;VYM M96YT('9A<FEA8FQE(&]P=&EO;B B;F]D;W-F:6QE=V%R;FEN9R(@='5R;G,@ M;V9F('1H:7,@=V%R;FEN9RX-"B @0V]N<W5L="!T:&4@=7-E<B=S(&=U:61E M(&9O<B!M;W)E(&1E=&%I;',@86)O=70@4$]325@@<&%T:',Z#0H@(" @:'1T M<#HO+V-Y9W=I;BYC;VTO8WEG=VEN+75G+6YE="]U<VEN9RYH=&UL(W5S:6YG M+7!A=&AN86UE<PT*9V-C+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL M:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A=&EC7'5N M:71?=&5S=%]M;VYI=&]R+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@ M<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY<+BY<;&EB<UQT97-T7'-R8UQU M;FET7W1E<W1?;6]N:71O<BYC<' -"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV M86QE;G0@:7,Z("XN+RXN+RXN+VQI8G,O=&5S="]S<F,O=6YI=%]T97-T7VUO M;FET;W(N8W!P#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I M;VX@(FYO9&]S9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N M#0H@($-O;G-U;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS M(&%B;W5T(%!/4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y M9W=I;BUU9RUN970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"F=C8RYC M;VUP:6QE+F,K*R N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD7&=C M8RTT+C,N-%QD96)U9UQL:6YK+7-T871I8UQU;FET7W1E<W1?<&%R86UE=&5R M<RYO#0IC>6=W:6X@=V%R;FEN9SH-"B @35,M1$]3('-T>6QE('!A=&@@9&5T M96-T960Z("XN7"XN7"XN7&QI8G-<=&5S=%QS<F-<=6YI=%]T97-T7W!A<F%M M971E<G,N8W!P#0H@(%!R969E<G)E9"!03U-)6"!E<75I=F%L96YT(&ES.B N M+B\N+B\N+B]L:6)S+W1E<W0O<W)C+W5N:71?=&5S=%]P87)A;65T97)S+F-P M< T*("!#64=724X@96YV:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O M<V9I;&5W87)N:6YG(B!T=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS M=6QT('1H92!U<V5R)W,@9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A8F]U="!0 M3U-)6"!P871H<SH-"B @("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M M;F5T+W5S:6YG+FAT;6PC=7-I;F<M<&%T:&YA;65S#0IG8V,N8V]M<&EL92YC M*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS+C1< M9&5B=6=<;&EN:RUS=&%T:6-<=6YI=%]T97-T7W-U:71E+F\-"F-Y9W=I;B!W M87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E9#H@+BY<+BY< M+BY<;&EB<UQT97-T7'-R8UQU;FET7W1E<W1?<W5I=&4N8W!P#0H@(%!R969E M<G)E9"!03U-)6"!E<75I=F%L96YT(&ES.B N+B\N+B\N+B]L:6)S+W1E<W0O M<W)C+W5N:71?=&5S=%]S=6ET92YC<' -"B @0UE'5TE.(&5N=FER;VYM96YT M('9A<FEA8FQE(&]P=&EO;B B;F]D;W-F:6QE=V%R;FEN9R(@='5R;G,@;V9F M('1H:7,@=V%R;FEN9RX-"B @0V]N<W5L="!T:&4@=7-E<B=S(&=U:61E(&9O M<B!M;W)E(&1E=&%I;',@86)O=70@4$]325@@<&%T:',Z#0H@(" @:'1T<#HO M+V-Y9W=I;BYC;VTO8WEG=VEN+75G+6YE="]U<VEN9RYH=&UL(W5S:6YG+7!A M=&AN86UE<PT*9V-C+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL:6)S M7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A=&EC7'AM;%]L M;V=?9F]R;6%T=&5R+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y M;&4@<&%T:"!D971E8W1E9#H@+BY<+BY<+BY<;&EB<UQT97-T7'-R8UQX;6Q? M;&]G7V9O<FUA='1E<BYC<' -"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE M;G0@:7,Z("XN+RXN+RXN+VQI8G,O=&5S="]S<F,O>&UL7VQO9U]F;W)M871T M97(N8W!P#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@ M(FYO9&]S9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@ M($-O;G-U;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B M;W5T(%!/4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I M;BUU9RUN970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"F=C8RYC;VUP M:6QE+F,K*R N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD7&=C8RTT M+C,N-%QD96)U9UQL:6YK+7-T871I8UQX;6Q?<F5P;W)T7V9O<FUA='1E<BYO M#0IC>6=W:6X@=V%R;FEN9SH-"B @35,M1$]3('-T>6QE('!A=&@@9&5T96-T M960Z("XN7"XN7"XN7&QI8G-<=&5S=%QS<F-<>&UL7W)E<&]R=%]F;W)M871T M97(N8W!P#0H@(%!R969E<G)E9"!03U-)6"!E<75I=F%L96YT(&ES.B N+B\N M+B\N+B]L:6)S+W1E<W0O<W)C+WAM;%]R97!O<G1?9F]R;6%T=&5R+F-P< T* M("!#64=724X@96YV:7)O;FUE;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I M;&5W87)N:6YG(B!T=7)N<R!O9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT M('1H92!U<V5R)W,@9W5I9&4@9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-) M6"!P871H<SH-"B @("!H='1P.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T M+W5S:6YG+FAT;6PC=7-I;F<M<&%T:&YA;65S#0IG8V,N87)C:&EV92 N+EPN M+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD7&=C8RTT+C,N-%QD96)U9UQL M:6YK+7-T871I8UQL:6)B;V]S=%]T97-T7V5X96-?;6]N:71O<BUG8V,T,RUD M+3%?-#0N80T*5&AE('-Y<W1E;2!C86YN;W0@9FEN9"!T:&4@<&%T:"!S<&5C M:69I960N#0I4:&4@<WES=&5M(&-A;FYO="!F:6YD('1H92!P871H('-P96-I M9FEE9"X-"@T*(" @("(O=7-R+VDV.#8M<&,M8WEG=VEN+V)I;B]A<BYE>&4B M("!R8R B+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS M+C1<9&5B=6=<;&EN:RUS=&%T:6-<;&EB8F]O<W1?=&5S=%]E>&5C7VUO;FET M;W(M9V-C-#,M9"TQ7S0T+F$B("(N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T M7&)U:6QD7&=C8RTT+C,N-%QD96)U9UQL:6YK+7-T871I8UQC;VUP:6QE<E]L M;V=?9F]R;6%T=&5R+F\B("(N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U M:6QD7&=C8RTT+C,N-%QD96)U9UQL:6YK+7-T871I8UQD96)U9RYO(B B+BY< M+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS+C1<9&5B=6=< M;&EN:RUS=&%T:6-<97AE8W5T:6]N7VUO;FET;W(N;R(@(BXN7"XN7"XN7&)I M;BYV,EQL:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A M=&EC7&9R86UE=V]R:RYO(B B+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB M=6EL9%QG8V,M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<<&QA:6Y?<F5P;W)T M7V9O<FUA='1E<BYO(B B+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL M9%QG8V,M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<<')O9W)E<W-?;6]N:71O M<BYO(B B+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS M+C1<9&5B=6=<;&EN:RUS=&%T:6-<<F5S=6QT<U]C;VQL96-T;W(N;R(@(BXN M7"XN7"XN7&)I;BYV,EQL:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G M7&QI;FLM<W1A=&EC7')E<W5L='-?<F5P;W)T97(N;R(@(BXN7"XN7"XN7&)I M;BYV,EQL:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A M=&EC7'1E<W1?;6%I;BYO(B B+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB M=6EL9%QG8V,M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<=&5S=%]T;V]L<RYO M(B B+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS+C1< M9&5B=6=<;&EN:RUS=&%T:6-<=6YI=%]T97-T7VQO9RYO(B B+BY<+BY<+BY< M8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS+C1<9&5B=6=<;&EN:RUS M=&%T:6-<=6YI=%]T97-T7VUA:6XN;R(@(BXN7"XN7"XN7&)I;BYV,EQL:6)S M7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A=&EC7'5N:71? M=&5S=%]M;VYI=&]R+F\B("(N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U M:6QD7&=C8RTT+C,N-%QD96)U9UQL:6YK+7-T871I8UQU;FET7W1E<W1?<&%R M86UE=&5R<RYO(B B+BY<+BY<+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG M8V,M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<=6YI=%]T97-T7W-U:71E+F\B M("(N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD7&=C8RTT+C,N-%QD M96)U9UQL:6YK+7-T871I8UQX;6Q?;&]G7V9O<FUA='1E<BYO(B B+BY<+BY< M+BY<8FEN+G8R7&QI8G-<=&5S=%QB=6EL9%QG8V,M-"XS+C1<9&5B=6=<;&EN M:RUS=&%T:6-<>&UL7W)E<&]R=%]F;W)M871T97(N;R(-"B @(" B+W5S<B]I M-C@V+7!C+6-Y9W=I;B]B:6XO<F%N;&EB+F5X92(@(BXN7"XN7"XN7&)I;BYV M,EQL:6)S7'1E<W1<8G5I;&1<9V-C+30N,RXT7&1E8G5G7&QI;FLM<W1A=&EC M7&QI8F)O;W-T7W1E<W1?97AE8U]M;VYI=&]R+6=C8S0S+60M,5\T-"YA(@T* M#0HN+BYF86EL960@9V-C+F%R8VAI=F4@+BY<+BY<+BY<8FEN+G8R7&QI8G-< M=&5S=%QB=6EL9%QG8V,M-"XS+C1<9&5B=6=<;&EN:RUS=&%T:6-<;&EB8F]O M<W1?=&5S=%]E>&5C7VUO;FET;W(M9V-C-#,M9"TQ7S0T+F$N+BX-"BXN+G-K M:7!P960@/' N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QL:6UI M='-?=&5S="YT97-T7&=C8RTT+C,N-%QD96)U9SYL:6UI='-?=&5S="YE>&4@ M9F]R(&QA8VL@;V8@/' N+EPN+EPN+EQB:6XN=C)<;&EB<UQT97-T7&)U:6QD M7&=C8RTT+C,N-%QD96)U9UQL:6YK+7-T871I8SYL:6)B;V]S=%]T97-T7V5X M96-?;6]N:71O<BUG8V,T,RUD+3%?-#0N82XN+@T*+BXN<VMI<'!E9" \<"XN M7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&QI;6ET<U]T97-T+G1E M<W1<9V-C+30N,RXT7&1E8G5G/FQI;6ET<U]T97-T+G)U;B!F;W(@;&%C:R!O M9B \<"XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&QI;6ET<U]T M97-T+G1E<W1<9V-C+30N,RXT7&1E8G5G/FQI;6ET<U]T97-T+F5X92XN+@T* M8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T M7&-O;F9I9U]L:6YK7W1E<W0N=&5S= T*8V]M;6]N+FUK9&ER("XN7"XN7"XN M7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]L:6YK7W1E<W0N=&5S M=%QG8V,M-"XS+C0-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB M<UQC;VYF:6=<=&5S=%QC;VYF:6=?;&EN:U]T97-T+G1E<W1<9V-C+30N,RXT M7&1E8G5G#0IC;VUM;VXN;6MD:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N M9FEG7'1E<W1<8V]N9FEG7VQI;FM?=&5S="YT97-T7&=C8RTT+C,N-%QD96)U M9UQL:6YK#0IG8V,N8V]M<&EL92YC*RL@+BY<+BY<+BY<8FEN+G8R7&QI8G-< M8V]N9FEG7'1E<W1<8V]N9FEG7VQI;FM?=&5S="YT97-T7&=C8RTT+C,N-%QD M96)U9UQL:6YK7&UA:6XN;PT*8WEG=VEN('=A<FYI;F<Z#0H@($U3+41/4R!S M='EL92!P871H(&1E=&5C=&5D.B!L:6YK7&UA:6XN8W!P#0H@(%!R969E<G)E M9"!03U-)6"!E<75I=F%L96YT(&ES.B!L:6YK+VUA:6XN8W!P#0H@($-91U=) M3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S9FEL97=A<FYI M;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U;'0@=&AE('5S M97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/4TE8('!A=&AS M.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN970O=7-I;F<N M:'1M;"-U<VEN9RUP871H;F%M97,-"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB M:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QL:6YK#0IC;VUM;VXN;6MD:7(@+BY< M+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<;&EN:UQG8V,M-"XS+C0- M"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S M=%QL:6YK7&=C8RTT+C,N-%QD96)U9PT*9V-C+F-O;7!I;&4N8RLK("XN7"XN M7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&QI;FM<9V-C+30N,RXT7&1E M8G5G7&QI;FM?=&5S="YO#0IC>6=W:6X@=V%R;FEN9SH-"B @35,M1$]3('-T M>6QE('!A=&@@9&5T96-T960Z(&QI;FM<;&EN:U]T97-T+F-P< T*("!0<F5F M97)R960@4$]325@@97%U:79A;&5N="!I<SH@;&EN:R]L:6YK7W1E<W0N8W!P M#0H@($-91U=)3B!E;G9I<F]N;65N="!V87)I86)L92!O<'1I;VX@(FYO9&]S M9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T:&ES('=A<FYI;F<N#0H@($-O;G-U M;'0@=&AE('5S97(G<R!G=6ED92!F;W(@;6]R92!D971A:6QS(&%B;W5T(%!/ M4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C>6=W:6XN8V]M+V-Y9W=I;BUU9RUN M970O=7-I;F<N:'1M;"-U<VEN9RUP871H;F%M97,-"F=C8RYL:6YK+F1L;" N M+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QL:6YK7&=C8RTT+C,N M-%QD96)U9UQL:6)L:6YK7W1E<W0M9V-C-#,M9"TQ7S0T+F1L;"YA#0IC>6=W M:6X@=V%R;FEN9SH-"B @35,M1$]3('-T>6QE('!A=&@@9&5T96-T960Z("XN M7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&QI;FM<9V-C+30N,RXT M7&1E8G5G7&QI;FM?=&5S="YO#0H@(%!R969E<G)E9"!03U-)6"!E<75I=F%L M96YT(&ES.B N+B\N+B\N+B]B:6XN=C(O;&EB<R]C;VYF:6<O=&5S="]L:6YK M+V=C8RTT+C,N-"]D96)U9R]L:6YK7W1E<W0N;PT*("!#64=724X@96YV:7)O M;FUE;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N M<R!O9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT('1H92!U<V5R)W,@9W5I M9&4@9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-)6"!P871H<SH-"B @("!H M='1P.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I M;F<M<&%T:&YA;65S#0I#<F5A=&EN9R!L:6)R87)Y(&9I;&4Z("XN7"XN7"XN M7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&QI;FM<9V-C+30N,RXT7&1E8G5G M7&QI8FQI;FM?=&5S="UG8V,T,RUD+3%?-#0N9&QL+F$-"F=C8RYL:6YK("XN M7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]L:6YK7W1E M<W0N=&5S=%QG8V,M-"XS+C1<9&5B=6=<8V]N9FEG7VQI;FM?=&5S="YE>&4- M"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y;&4@<&%T:"!D971E8W1E M9#H@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<8V]N9FEG7VQI M;FM?=&5S="YT97-T7&=C8RTT+C,N-%QD96)U9UQL:6YK7&UA:6XN;PT*("!0 M<F5F97)R960@4$]325@@97%U:79A;&5N="!I<SH@+BXO+BXO+BXO8FEN+G8R M+VQI8G,O8V]N9FEG+W1E<W0O8V]N9FEG7VQI;FM?=&5S="YT97-T+V=C8RTT M+C,N-"]D96)U9R]L:6YK+VUA:6XN;PT*("!#64=724X@96YV:7)O;FUE;G0@ M=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N<R!O9F8@ M=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT('1H92!U<V5R)W,@9W5I9&4@9F]R M(&UO<F4@9&5T86EL<R!A8F]U="!03U-)6"!P871H<SH-"B @("!H='1P.B\O M8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I;F<M<&%T M:&YA;65S#0IT97-T:6YG+F-A<'1U<F4M;W5T<'5T("XN7"XN7"XN7&)I;BYV M,EQL:6)S7&-O;F9I9UQT97-T7&-O;F9I9U]L:6YK7W1E<W0N=&5S=%QG8V,M M-"XS+C1<9&5B=6=<8V]N9FEG7VQI;FM?=&5S="YR=6X-"B @(" @(" @,2!F M:6QE*',I(&-O<&EE9"X-"BHJ<&%S<V5D*BH@+BY<+BY<+BY<8FEN+G8R7&QI M8G-<8V]N9FEG7'1E<W1<8V]N9FEG7VQI;FM?=&5S="YT97-T7&=C8RTT+C,N M-%QD96)U9UQC;VYF:6=?;&EN:U]T97-T+G1E<W0-"F-O;6UO;BYM:V1I<B N M+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QT97-T7W1H<F5A9%]F M86EL,2YT97-T#0IC;VUM;VXN;6MD:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-< M8V]N9FEG7'1E<W1<=&5S=%]T:')E861?9F%I;#$N=&5S=%QG8V,M-"XS+C0- M"F-O;6UO;BYM:V1I<B N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S M=%QT97-T7W1H<F5A9%]F86EL,2YT97-T7&=C8RTT+C,N-%QD96)U9PT*9V-C M+F-O;7!I;&4N8RLK("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I9UQT97-T M7'1E<W1?=&AR96%D7V9A:6PQ+G1E<W1<9V-C+30N,RXT7&1E8G5G7'1E<W1? M=&AR96%D7V9A:6PQ+F\-"F-Y9W=I;B!W87)N:6YG.@T*("!-4RU$3U,@<W1Y M;&4@<&%T:"!D971E8W1E9#H@=&AR96%D<UQT97-T7W1H<F5A9%]F86EL,2YC M<' -"B @4')E9F5R<F5D(%!/4TE8(&5Q=6EV86QE;G0@:7,Z('1H<F5A9',O M=&5S=%]T:')E861?9F%I;#$N8W!P#0H@($-91U=)3B!E;G9I<F]N;65N="!V M87)I86)L92!O<'1I;VX@(FYO9&]S9FEL97=A<FYI;F<B('1U<FYS(&]F9B!T M:&ES('=A<FYI;F<N#0H@($-O;G-U;'0@=&AE('5S97(G<R!G=6ED92!F;W(@ M;6]R92!D971A:6QS(&%B;W5T(%!/4TE8('!A=&AS.@T*(" @(&AT=' Z+R]C M>6=W:6XN8V]M+V-Y9W=I;BUU9RUN970O=7-I;F<N:'1M;"-U<VEN9RUP871H M;F%M97,-"DEN(&9I;&4@:6YC;'5D960@9G)O;2!T:')E861S7'1E<W1?=&AR M96%D7V9A:6PQ+F-P<#HY.@T*+BY<+BY<+BXO8F]O<W0O8V]N9FEG+W)E<75I M<F5S7W1H<F5A9',N:'!P.C(Y.C0Z(&5R<F]R.B C97)R;W(@(E1H<F5A9&EN M9R!S=7!P;W)T('5N879A;&EA8FQE.B!I="!H87,@8F5E;B!E>'!L:6-I=&QY M(&1I<V%B;&5D('=I=&@@0D]/4U1?1$E304),15]42%)%0413(@T**&9A:6QE M9"UA<RUE>'!E8W1E9"D@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E M<W1<=&5S=%]T:')E861?9F%I;#$N=&5S=%QG8V,M-"XS+C1<9&5B=6=<=&5S M=%]T:')E861?9F%I;#$N;PT**BIP87-S960J*B N+EPN+EPN+EQB:6XN=C)< M;&EB<UQC;VYF:6=<=&5S=%QT97-T7W1H<F5A9%]F86EL,2YT97-T7&=C8RTT M+C,N-%QD96)U9UQT97-T7W1H<F5A9%]F86EL,2YT97-T#0IC;VUM;VXN;6MD M:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG7'1E<W1<=&5S=%]T:')E M861?9F%I;#(N=&5S= T*8V]M;6]N+FUK9&ER("XN7"XN7"XN7&)I;BYV,EQL M:6)S7&-O;F9I9UQT97-T7'1E<W1?=&AR96%D7V9A:6PR+G1E<W1<9V-C+30N M,RXT#0IC;VUM;VXN;6MD:7(@+BY<+BY<+BY<8FEN+G8R7&QI8G-<8V]N9FEG M7'1E<W1<=&5S=%]T:')E861?9F%I;#(N=&5S=%QG8V,M-"XS+C1<9&5B=6<- M"F=C8RYC;VUP:6QE+F,K*R N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=< M=&5S=%QT97-T7W1H<F5A9%]F86EL,BYT97-T7&=C8RTT+C,N-%QD96)U9UQT M97-T7W1H<F5A9%]F86EL,BYO#0IC>6=W:6X@=V%R;FEN9SH-"B @35,M1$]3 M('-T>6QE('!A=&@@9&5T96-T960Z('1H<F5A9'-<=&5S=%]T:')E861?9F%I M;#(N8W!P#0H@(%!R969E<G)E9"!03U-)6"!E<75I=F%L96YT(&ES.B!T:')E M861S+W1E<W1?=&AR96%D7V9A:6PR+F-P< T*("!#64=724X@96YV:7)O;FUE M;G0@=F%R:6%B;&4@;W!T:6]N(")N;V1O<V9I;&5W87)N:6YG(B!T=7)N<R!O M9F8@=&AI<R!W87)N:6YG+@T*("!#;VYS=6QT('1H92!U<V5R)W,@9W5I9&4@ M9F]R(&UO<F4@9&5T86EL<R!A8F]U="!03U-)6"!P871H<SH-"B @("!H='1P M.B\O8WEG=VEN+F-O;2]C>6=W:6XM=6<M;F5T+W5S:6YG+FAT;6PC=7-I;F<M M<&%T:&YA;65S#0I);B!F:6QE(&EN8VQU9&5D(&9R;VT@=&AR96%D<UQT97-T M7W1H<F5A9%]F86EL,BYC<' Z,3(Z#0HN+EPN+EPN+B]B;V]S="]C;VYF:6<O M<F5Q=6ER97-?=&AR96%D<RYH<' Z-#<Z-3H@97)R;W(Z("-E<G)O<B B0V]M M<&EL97(@=&AR96%D:6YG('-U<'!O<G0@:7,@;F]T('1U<FYE9"!O;BX@4&QE M87-E('-E="!T:&4@8V]R<F5C="!C;VUM86YD(&QI;F4@;W!T:6]N<R!F;W(@ M=&AR96%D:6YG.B M<'1H<F5A9" H3&EN=7@I+" M<'1H<F5A9',@*%-O;&%R M:7,I(&]R("UM=&AR96%D<R H36EN9W<S,BDB#0HH9F%I;&5D+6%S+65X<&5C M=&5D*2 N+EPN+EPN+EQB:6XN=C)<;&EB<UQC;VYF:6=<=&5S=%QT97-T7W1H M<F5A9%]F86EL,BYT97-T7&=C8RTT+C,N-%QD96)U9UQT97-T7W1H<F5A9%]F M86EL,BYO#0HJ*G!A<W-E9"HJ("XN7"XN7"XN7&)I;BYV,EQL:6)S7&-O;F9I M9UQT97-T7'1E<W1?=&AR96%D7V9A:6PR+G1E<W1<9V-C+30N,RXT7&1E8G5G M7'1E<W1?=&AR96%D7V9A:6PR+G1E<W0-"BXN+F9A:6QE9"!U<&1A=&EN9R S M('1A<F=E=',N+BX-"BXN+G-K:7!P960@.2!T87)G971S+BXN#0HN+BYU<&1A 3=&5D(#DS('1A<F=E=',N+BX-"@`` ` end

3 4

[boost] [log] Link error with trivial logging
by Joey Mink 16 Jun '10

16 Jun '10

Hi, I just built boost 1.43 with the latest version of boost-log included (from boost-log.sourceforge.net) I'm currently using the static, multi-threaded debug libraries from the build: libboost_log-vc80-mt-sgd-1_43.lib At the end of this e-mail you can see the main() from my win32 console application. However, I'm receiving many link errors like the following: libboost_log-vc80-mt-sgd-1_43.lib(trivial.obj) : error LNK2019: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::get_system_category(void)" (?get_system_category@system@boost@@YAABVerror_category@12@XZ) referenced in function "void __cdecl boost::system::`dynamic initializer for 'system_category''(void)" (??__Esystem_category@system@boost@@YAXXZ) Any thoughts on what might be causing this? Below is my main(). Thanks! ------------------ #include <boost/log/trivial.hpp> // For "trivial" logging API #include <iostream> #include <string> void main(int argc, char* argv[]) { BOOST_LOG_TRIVIAL(trace) << "A trace severity message"; BOOST_LOG_TRIVIAL(debug) << "A debug severity message"; BOOST_LOG_TRIVIAL(info) << "An informational severity message"; BOOST_LOG_TRIVIAL(warning) << "A warning severity message"; BOOST_LOG_TRIVIAL(error) << "An error severity message"; BOOST_LOG_TRIVIAL(fatal) << "A fatal severity message"; // keep cmd window open std::cout << "press a key..."; std::string whateva; std::cin >> whateva; } ------------------

3 2

Connect holes in polygon
by Macumber, Daniel 16 Jun '10

16 Jun '10

Does anyone know how to use boost Polygon or boost GGL to take a convert a polygon with holes to a polygon with no holes? I am looking for functionality similar to this http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Boolean_set_operations_…. I have already found a way to extract trapezoids using boost Polygon but I was hoping there was a method more similar to connect_holes. Thanks a lot, Dan

2 1

Planar graph generator
by Mike Douglass 16 Jun '10

16 Jun '10

I'm going to write a shell script or a C++ program which creates planar graphs, pipes them to my graph coloring program and lists successes and failures. After consulting the internet I found only three reasonable candidates for planar graph generators. Brendon McKay's plantri and fullgen Ledas graph_gen and Donald Knuth's Stanford Graph Base gb_plane . Any thoughts on which planar graph generator to use, or anything?

1 0

[array] the array that thinks it is a number
by alfC 16 Jun '10

16 Jun '10

I have a bunch of numerical routines in C++ that take and return boost::arrays, for example array<double, 5> strange_function(array<double, 3>); in another example, one integrates boost::function that takes an array of size N and returns arrays of size F The library is pretty general because it works in any number of dimensions. But it seems to be a syntactic waste to use those general functions in the cases where the input or the output is a single number, i.e. one has to use array<double, 1> all over the place, array constructions or ugly casts. One option would be to transform all the functions and boost::function declaration to take arbitrary combinations of double input/ouput and array input/out double strange_function(array<double, 3>); array<double,3> strange_function(double ); (actually strange_function is a template function, so what it really does depends on the template parameter strange_function<T>) ( Think for example of Mathematica functions that take numbers or vectors Integrate[{f[x],g[x]},x] or Integrate[f[x],x] ) I come up with a solution that is, instead of working with boost::array work with a similar type that simply believes it is a number when the dimension is one, here it is the implementation: template<size_t Dim> struct array : boost::array<double, Dim>{ typedef boost::array<double, Dim> base; array(base const& arr) : base(arr){} array(double const& d); operator double&(); operator double const&() const; }; template<> array<1>::array(double const& d) : base((base){{d}}){} template<> array<1>::operator double&(){return (*this)[0];} template<> array<1>::operator double const&() const{return (*this) [0];} in this way the array is transformed from and into a number if requested, and the existing code that uses boost::array still works. Just wondering for some feedback. Thank you, Alfredo

1 0

Planar graph generator
by Mike Douglass 16 Jun '10

16 Jun '10

I need to auto generate a bunch of graphs in order to test my planar graph coloring algorithm. Is there a program to generate all ( or a bunch of ) planar graphs of a certain size? I'm presently only interested in testing planar graphs of <= 50 vertices.

1 0

[BGL] read_graphviz example
by Adam Spargo 15 Jun '10

15 Jun '10

Hi, I have been trying to build the example BOOST_ROOT/libs/graph/example/ospf-example.cpp I notice that the read_graphviz function has changed and there is no longer a function of the form in this example. I have tried to read the file using an example I found elsewhere but then I get into issues with copying the properties. Can anybody point me at a version of this example that builds with the 1.43.0 boost_graph library. Currently I get an error saying there is no matching function for read_graphviz, as expected, but I'm not having any luck reading the file with the new function prototype either. Thanks for any help, Adam. -- Dr Adam Spargo High Performance Assembly Group email: aws(a)sanger.ac.uk Wellcome Trust Sanger Institute Tel: +44 (0)1223 834244 x7728 Hinxton, Cambridge CB10 1SA Fax: +44 (0)1223 494919 -- The Wellcome Trust Sanger Institute is operated by Genome Research Limited, a charity registered in England with number 1021457 and a company registered in England with number 2742969, whose registered office is 215 Euston Road, London, NW1 2BE.

2 1

Shared memory access denied
by Carla Strembicke 15 Jun '10

15 Jun '10

Using boost shared memory. One process creates shared memory ( as an administrator on windows). shared_memory_object(open_or_create, pShareName, read_write); Another process ( not administrator) tries to open and map to shared memory. shared_memory_object(open_only, pShareName, read_write); <-this fails with access denied Check permissions in on file and users only have a read permission. Once those are changes ( after created by the process running as administrator) the file can then be opened and shared by the other process. Is this how shared memory works. I check the code and createfile has a file_share_read|write|delete option and is set to Generic_read|write. I have not been able to find any literature on a solution, but have seen the problem on the net. Thanks Carla Strembicke Software Developer [cid:image9f88f7.jpg@6cbb1949.05f74c72] SUBNET Solutions Inc. www.SUBNET.com<http://www.subnet.com/> Making Substations More Intelligent T: 403.270.8885 F: 403.270.9631 #100, 4639 Manhattan Road SE, Calgary, Alberta, Canada; T2G 4B3 Follow SUBNET: Twitter<http://www.subnet.com/subnetsoc-t.htm> | Facebook<http://www.subnet.com/subnetsoc-f.htm> | Linkedln<http://www.subnet.com/subnetsoc-l.htm> Visit the all new SUBNET website at http://www.SUBNET.com<http://www.subnet.com/> CONFIDENTIAL INFORMATION NOTICE: The information contained in this e-mail is privileged, confidential and intended solely for the use of the addressee named above. If the reader of this e-mail is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this e-mail is strictly prohibited. If you received this in error, please contact the sender and destroy all copies of this e-mail. Thank you.

2 1

[UTF] Boost.Test compilation error(anonymous namespace)::unit_test_log
by Guillaume Theraud 15 Jun '10

15 Jun '10

I am trying to compile a class which inherit from boost.test test_suite one. However, I get the following message while linking : undefined reference to `global constructors keyed to _ZN5boost9unit_test119_GLOBAL__N__[...]_WizardTestSuite.cpp_C629D373_A17403F013unit_test_logE' (boost::unit_test::(anonymous namespace)::unit_test_log) I added both following line in the cpp file but it does not solve the issue : #include <boost/test/unit_test_log.hpp> namespace { static unit_test_log_t & inst = unit_test_log_t::instance(); } Thanks. Guillaume

2 1

concat files for compression
by Kraus Philipp 15 Jun '10

15 Jun '10

Hi, on my previous posting I have another questing: I create my compression stream with bio::filtering_streambuf< bio::input > l_deflate; switch (m_compress) { case gzip : l_deflate.push( bio::gzip_compressor() ); break; case bzip2 : l_deflate.push( bio::bzip2_compressor() ); break; } For a single file I push it to zip with: l_deflate.push( bio::file_source(p_str1, BOOST_IOS::binary) ); I need a concatination for two files like: l_deflate.push( bio::file_source(p_str1, BOOST_IOS::binary) ); l_deflate.push( bio::file_source(p_str2, BOOST_IOS::binary) ); for unix shell I do this with: cat file1.txt > tozip.txt cat file2.txt >> tozip.txt How I can push a concatinated file to the deflate stream buffer? Thanks Phil

4 10

[Filesystem] feedback on operator<<
by John Dlugosz 15 Jun '10

15 Jun '10

The "inserter" for paths needs a manipulator that specifies whether portable or system form is output. It may need OS-dependant flags too, to specify details about how escaping is done, quotes added, etc. --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

[bind] static member function binding
by Stefan Strasser 15 Jun '10

15 Jun '10

Hi, does Boost.Bind contain anything to create a function object that is statically bound to a member function? IIUC all function objects created by bind contain a function pointer, so they have overhead compared to a manual function object. something like: struct A{ void f(); } A *a; bind<void (A::*)(),&A::f>(a); -> function object bound to "a", calling A::f

1 1

boost serialization saving a linked list
by tronix 15 Jun '10

15 Jun '10

Hi all, I'm learning using the boost serialization libraries. Can someone point me to references which use boost serialization libraries to save a linked list to a file and again read it/ parse the list. I'm not able to find simple examples that'll help me in understanding the basic points. Thanks, ----- "tron"ix -- View this message in context: http://old.nabble.com/boost-serialization-saving-a-linked-list-tp28885853p2… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Re: [Boost-users] spirit and property_tree headers conflict
by Artem Kozlov 15 Jun '10

15 Jun '10

>>>> Hello, >>>> >>>> When attempting to compile a program which includes the following >>> headers >>>> (at once): >>>> >>>> #include<boost/property_tree/json_parser.hpp> >>>> #include<boost/spirit/include/qi.hpp> >>> >>> I suspect this is because the JSON parser is implemented in >>> Spirit.Classic. I eventually want to switch to Qi, but until then, I have >>> no idea what to do. I thought Classic and Qi can coexist, but maybe I'm >>> doing something wrong. >> >>> It should co-exist. What are the problems, exactly? >> >> Well, here is the bunch of errors that I see during compilation: > [snips] > I think this is fixed now in the trunk. Could you verify, please? Hello, I've just built and installed Boost from the trunk, but this conflict remains - lots of compilation errors. Regards, Artem

4 4