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

Re: CRC problem with 8 bit truncated polynomial
by Daryle Walker 10 Jul '03

10 Jul '03

On Wednesday, July 9, 2003, at 11:02 AM, Victoria Ames wrote: [SNIP] > However, when I have tried examples using 8 bit truncated > polynomials I fail to get a meaningful checksum. > > Example that doesn't work : > std::cout << "Expected CRC-8 : EA" << std::endl; > boost::crc_optimal<8, 0x9B, 0, 0, false, false> crc_8; > crc_8 = std::for_each( data, data + data_len, crc_8 ); > std::cout << "Optimal CRC-8 : " << std::hex << crc_8() << std::endl; > > The results I get are : [SNIP] > Expected CRC-8 : EA > Optimal CRC-8 : Û > > Does anyone know why the 8 bit example does not seem to work? I can't tell at this point. The problem could be that the results of the "crc_8" object is an "unsigned char". The built-in character types can take the same numeric operations as the bigger built-in integral types (i.e. "int"). However, the character types differ from the other integral types since the character types act as C++ text system types. So when an object of a built-in character type is printed, its text value is printed instead of its numeric value. The solution is to convert the result to a numeric-only integral type. Try std::cout << std::hex << static_cast<unsigned>( crc_8() ) << std::endl; to check the numeric value of the result. Then you can tell if the result is correct. If it's not, send us another message. With my hypothesis, the problem is only in the printing. You would have no problem in using the result for further mathematical analyses. Daryle

1 0

RE: [Boost-Users] RE: Re: CRC problem with 8 bit truncated polyno mial
by Jim.Hyslop 09 Jul '03

09 Jul '03

Vladimir Prus wrote: > Sorry, I don't understand what you're saying... > > std::cout << "Optimal CRC-8 : " << std::hex << (unsigned)crc_8() > << std::endl; > > is the same as > > std::cout << "Optimal CRC-8 : " << std::hex << (unsigned int)crc_8() > << std::endl; Sorry, I wasn't very clear in my last message. The results can be unexpected, depending on whether the result of crc_8() (or more precisely, operator() ) is signed or unsigned. If operator() returns an unsigned value, there will be no problems, and the output will be ea. On the other hand, if operator() returns a signed value, then it will first be promoted to a signed int, then converted to an unsigned int. Using the original example values posted by Victoria, the output would be ffffffea. In this scenario, the return value must be first cast to an unsigned char, then to an unsigned int: ... << static_cast<unsigned>( static_cast<unsigned char>( crc_8() ) ) I just had a quick look at the crc.hpp file, and operator() returns an unsigned value, thus banishing my caveat to the dusty corners where all academic footnotes end up ;-) -- Jim

2 1

RE: [Boost-Users] Re: CRC problem with 8 bit truncated polynomial
by Jim.Hyslop 09 Jul '03

09 Jul '03

Vladimir Prus wrote: > I'm guessing this should be > > std::cout << "Optimal CRC-8 : " << std::hex << (unsigned)crc_8() > << std::endl; > > The way iostreams format chars is most likely not what you wanted. True enough - and that includes signed vs. unsigned chars (both are handled the same, at least with my compiler). The result needs to be put into an unsigned *int* for cout to display the numeric value. -- Jim

3 2

RE: [Boost-Users] CRC problem with 8 bit truncated polynomial
by Jim.Hyslop 09 Jul '03

09 Jul '03

victoriaames wrote: > Example that doesn't work : > std::cout << "Expected CRC-8 : EA" << std::endl; > boost::crc_optimal<8, 0x9B, 0, 0, false, false> crc_8; > crc_8 = std::for_each( data, data + data_len, crc_8 ); > std::cout << "Optimal CRC-8 : " << std::hex << crc_8() << std::endl; > > The results I get are : > > Expected CRC-CCITT : 29B1 > Optimal CRC-CCITT : 29b1 > > Expected CRC-8 : EA > Optimal CRC-8 : Û > > Does anyone know why the 8 bit example does not seem to work? I haven't used this library, but judging from the output it looks to me like it's working just fine. The result is an 8-bit value, i.e. a (possibly unsigned) char, with the value 0xEA. Think about what cout does with 'char'. -- Jim

1 0

CRC problem with 8 bit truncated polynomial
by victoriaames 09 Jul '03

09 Jul '03

When I have tried examples using 16 or 32 bit truncated polynomials this library works perfectly. Example that works : unsigned char const data[] = { 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39 }; std::size_t const data_len = sizeof( data ) / sizeof( data[0] ); std::cout << "Expected CRC-CCITT : 29B1" << std::endl; // Simulate CRC-CCITT with the optimal version boost::crc_optimal<16, 0x1021, 0xFFFF, 0, false, false> crc_ccitt2; crc_ccitt2 = std::for_each( data, data + data_len, crc_ccitt2 ); std::cout << "Optimal CRC-CCITT : " << std::hex << crc_ccitt2() << std::endl; However, when I have tried examples using 8 bit truncated polynomials I fail to get a meaningful checksum. Example that doesn't work : std::cout << "Expected CRC-8 : EA" << std::endl; boost::crc_optimal<8, 0x9B, 0, 0, false, false> crc_8; crc_8 = std::for_each( data, data + data_len, crc_8 ); std::cout << "Optimal CRC-8 : " << std::hex << crc_8() << std::endl; The results I get are : Expected CRC-CCITT : 29B1 Optimal CRC-CCITT : 29b1 Expected CRC-8 : EA Optimal CRC-8 : Û Does anyone know why the 8 bit example does not seem to work? Victoria

2 1

[help] thread on intel solaris 8
by meg_r123 09 Jul '03

09 Jul '03

Hi all, I've succesfully compiled the boost library 1.30.0, and the tests for the libthread runs fine, but I get an "abort" when I try to execute a simple test written by me. I suppose it is a link problem, this is the command in the Makefile: (I'm using GCC) CC = g++ OBJS = test_thread.o TARGET = test_thread $(TARGET): $(OBJS) $(CC) -o $(TARGET) $(OBJS) -L$(HOME)/local/lib/ -lboost_thread Any idea to suggest me? Thank you, meg

3 4

[boost::date_time] posix_time::to_simple_string and posix_time::time_from_string
by Russell Hind 08 Jul '03

08 Jul '03

These 2 functions don't seem to work together. to_simple_string will produce a string such as 2003-Jul-08 11:55:47 But time_from_string expects 2003-07-08 11:55:47 This means you can't convert to a string (to store in a text file) then read back in and convert it back to a ptime. Is this a bug, or have I missed a conversion function that can handle this? Thanks Russell

2 3

Const strangeness and indirect_iterator generators.
by Tim Robertson 08 Jul '03

08 Jul '03

Hi, I've been trying to get indirect_iterator working in what seems (to me) to be a straightforward context -- I have a std::vector of boost::shared_ptr objects, and I need both const and non-const iterators into the vector (I'm using the vector as the sole data member of a container class, and I need the iterators to properly handle const and non-const container types). This looks something like this: class MyClass { // ... }; class MyContainer { public: typedef MyClass value_type; typedef value_type & reference; typedef value_type * pointer; // and so on, for const_reference, const_pointer, etc... // ... private: std::vector<boost::shared_ptr<MyClass> > _data; }; Now, the trouble comes when I attempt to define the iterators for MyContainer using the indirect_iterator generators. If I do the obvious: Approach #1: ------------ typedef indirect_iterator_pair_generator< vector<shared_ptr<MyClass> >::iterator, value_type, reference, const_reference, std::random_access_iterator_tag, pointer, const_pointer>::itgen; typedef typename itgen::iterator my_iterator; typedef typename itgen::const_iterator my_const_iterator; I find that the const_iterator generated is inadequate for use in a container context. Particularly, it produces a my_const_iterator that has the following constructor signature: my_const_iterator(shared_ptr<MyClass> *) Whereas, a const std::vector<shared_ptr<MyClass> > will produce const_iterators that look like this: const shared_ptr<MyClass> * const This causes compilation problems, because inevitably, in this context, you'll want to construct a my_const_iterator from a vector::const_iterator. The problem seems obvious: the indirect_iterator_pair_generator class is considering only non-const base iterators. This led me to try the following: Approach #2: ----------- typedef typename indirect_iterator_generator <typename vector<shared_ptr<MyClass> >::iterator, value_type, reference, pointer, std::random_access_iterator_tag>::type my_iterator; typedef typename indirect_iterator_generator <typename vector<shared_ptr<MyClass> >::const_iterator, value_type, const_reference, const_pointer, std::random_access_iterator_tag>::type my_const_iterator; It seemed that this would solve the problem by independently generating the two types of iterators that are needed (note how I've made the base iterator type ::iterator in one, and ::const_iterator in the other). However, with this method I always obtain compilation errors -- whereever there is a use of the operator->(), the following error is produced (g++ 3.0.3 and 3.2 do the same thing, Linux and Mac OSX): "result of `operator->()' yields non-pointer result" I have yet to figure out what is causing this error. This led me to attempt the following "solution" to the problem: Approach #3: ----------- typedef indirect_iterator_pair_generator <typename vector<shared_ptr<MyClass> >::iterator, value_type,reference,const_reference, std::random_access_iterator_tag, pointer,const_pointer> itgen; typedef typename itgen::iterator my_iterator; typedef indirect_iterator_pair_generator <typename vector<shared_ptr<MyClass> >::const_iterator, value_type,reference,const_reference, std::random_access_iterator_tag, pointer,const_pointer> itgen2; typedef typename itgen2::const_iterator my_const_iterator; This actually works! I can't explain why -- it seems like indirect_iterator_pair_generator and indirect_iterator_generator should behave identically when their template parameters are identical.... The way I see it, there's a bug in at least one of the indirect_iterator generator objects. At the very least, indirect_iterator_pair_generator and indirect_iterator_generator are behaving differently when their parameter types are the same (compare approaches #2 and #3). But there's also the issue of why approach #1 didn't work to begin with -- it *seems* like indirect_iterator_pair_generator should produce a const_iterator type that can be initialized with an iterator from a const vector. This isn't the case. If anyone can explain this to me, and convince me that I'm not going insane, I'd appreciate it greatly ;-) (Standard bug-report disclaimers: Current boost distribution, g++ 3.0.x/3.2.x, both Mac OSX and Linux exhibit identical behaviour.) -Tim

2 1

Ublas >> operators
by Amit Bhatia 08 Jul '03

08 Jul '03

Hello All, I was looking for sowe way to write the matrix to some filestream and read the same way from some file stream. Was just wondering if Ublas has any operators as << and >> defined default? I have been able to find none though. thanks, regards, amit.

2 1

Re: Using BOOST_REQUIRE outside the Test framework?
by Gennadiy E. Rozental 08 Jul '03

08 Jul '03

> Is there some macro/facility/whatever which behaves like assert(): > a) works without the Boost Test Framework > b) *AND* integrates into the BTF in those cases where the BTF is used? > > Regards, > > Joaquín M López Muñoz > Telefónica, Investigación y Desarrollo Jonh Torio developing SMART_ASSERT facility that supposed to satisfy your requirements. Look into main list archive. Gennadiy.

1 0

boost_1_30_0: cannot compile red hat gcc
by sebMarc 07 Jul '03

07 Jul '03

I must be freakin stupid. I have the simplest config possible, gcc 2.96 with a red hat system. Downloaded boot1_30_0, unzipped it, tried to compile thread and got: bash-2.05a$ bjam "-sTOOLS=gcc" ...found 341 targets... ...updating 37 targets... MkDir1 ../../../libs/thread/build/bin-stage : command not found MkDir1 ../../../libs/thread/build/bin : command not found mkdir: cannot create directory `\r': File exists mkdir ../../../libs/thread/build/bin ...failed MkDir1 ../../../libs/thread/build/bin... Being jam ignorant, this is it, i am stuck :-(. Sigh.. Tried to run configure and got: bash-2.05a$ chmod +x configure bash-2.05a$ ./configure : bad interpreter: No such file or directory Seb.

3 3

Memory leaks in Solaris
by Lev Assinovsky 07 Jul '03

07 Jul '03

Hi All! I caught a memory leak (24 bytes) when using recursive_mutex class. This class initializes a pthread_mutexattr attribute but never destroys it thus leaving the leak. We use tons of the recursive mutexes in our huge app and that leak leads to significant memory loss. Regards, Lev Assinovsky Aelita Software Corporation O&S Core Division, Programmer ICQ# 165072909

1 0

Using BOOST_REQUIRE outside the Test framework?
by Joaquín Mª López Muñoz 07 Jul '03

07 Jul '03

I'm deploying a library which implements some basic invariant checking when a certain control macro is defined. class A { void foo1(){VERIFY(*invariant conditions *); ...} ... void foon(){VERIFY(*invariant conditions *); ...} }; I use the word VERIFY for reference purposes only. Now, VERIFY is resolved to a call to assert(), which is sensible enough as: * Invariant errors are critical * Invariant checking is only enabled explictly by the user, presumably under testing conditions. On a second thought, it'd be nice if VERIFY could be seamlessly integrated into the Boost Test Framework, i.e. invariant errors are caught by the test execution monitor as other errors defined by BOOST_CHECK, BOOST_REQUIRE etc. Unfortunately, replacing VERIFY with say BOOST_REQUIRE forces the user to link with the Boost Test Framewok object modules. So my question is: Is there some macro/facility/whatever which behaves like assert(): a) works without the Boost Test Framework b) *AND* integrates into the BTF in those cases where the BTF is used? Regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

multi_array performance
by Marco Segurini 07 Jul '03

07 Jul '03

Hi, I am very new in using Boost library. I start replacing row memory array with 'multi_array' class template but the performace slow down a lot. Running this test program... //begin------------------ #include "windows.h" #include <iostream> #include "boost\multi_array.hpp" using namespace std; using namespace boost; int main() { const size_t DimX = 2000; const size_t DimY = 1500; const size_t DimZ = 1; multi_array<int,3> V3(extents[DimZ][DimY][DimX]); int iVal; unsigned long time1 = GetTickCount(); for (size_t Z=0; Z<DimZ; ++Z) for (size_t Y=0; Y<DimY; ++Y) for (size_t X=0; X<DimX; ++X) iVal = V3[Z][Y][X]; unsigned long time2 = GetTickCount(); cout << "Multi_array: " << time2-time1 << endl; int * pInt = V3.data(); time1 = GetTickCount(); for (size_t Z=0; Z<DimZ; ++Z) for (size_t Y=0; Y<DimY; ++Y) for (size_t X=0; X<DimX; ++X) iVal = pInt[(Z*DimY+Y)*DimX+X]; time2 = GetTickCount(); cout << "Pointer....: " << time2-time1 << endl; return 0; } //end------------------ ... the output (using vc++ in release mode with no optimization) is Multi_array: 1663 Pointer....:70 So, where am I wrong? Thanks. Marco.

6 6

[BGL] dijkstra_shortest_paths and the single-pair problem
by Richard Jepps 04 Jul '03

04 Jul '03

I would like to use the dijkstra_shortest_paths algorithm to find the shortest path from one specified vertex to another. The standard Boost implementation will find this, but it will continue until it has found the shortest paths to all nodes in the graph (i.e. solved the single source problem). The BGL book (Section 5.1, pp76) says: "It turns out that there are no algorithms for solving the single-pair problem that are asymptotically faster than the algorithms that solve the single-source problem". I think this is because the single-source algorithms all have the property that it is possible to determine whether the shortest path to any given node has been found during the execution of the algorithm, therefore you can use the same algorithm to solve both types of problem provided that the termination criterion is appropriate to the problem. Consider this problem: "find the shortest path from a source vertex u to a nearby destination vertex v in an infinitely large directed weighted graph G in finite time." The single-source problem can only be solved in infinite time, but the single-pair problem can be solved relatively quickly (because the two vertices are near each other). I think that the termination criterion is quite straightforward using a DijkstraVisitor - it is when vis.finish_vertex(u, g) is called and u == destination_node. Unfortunately I can't see how to stop the algorithm in a reasonable way. An unreasonable solution is to provide a custom graph and turn off all its edges when the termination criterion is met. This is unreasonable because the responsibility for termination belongs to the algorithm, not the data structure - I shouldn't have to modify the data structure to terminate the algorithm. It's also unreasonable because I have to customise both the graph and the algorithm to do something very simple. Is there a better way? Thanks Richard

3 5

function object with lambda
by Matt Hurd 04 Jul '03

04 Jul '03

Not sure how to force a for_each with a lambda to invoke the random function object successively. In the for_each version below get_long is called just once. Not sure how to use var, std_function, bind or something else to overcome this. I'm sure the answer is straight forward... anyone? Regards, Matt. #include <iostream> #include <boost/random.hpp> #include <vector> #include <boost/lambda/lambda.hpp> #include <boost/lambda/bind.hpp> typedef boost::mt19937 base_generator_type; base_generator_type generator( 100123u ); boost::uniform_int<base_generator_type,long> gen_long(generator,-100,100); using namespace std; using namespace boost::lambda; int main(int argc, char *argv[]) { vector<long> v(10); for_each(v.begin(),v.end(), _1 = gen_long() ); for_each(v.begin(), v.end(), cout << _1 << ' '); cout << "\n"; for( vector<>::iterator i = v.begin(); i != v.end(); ++i ) { *i = gen_long(); } for_each(v.begin(), v.end(), cout << _1 << ' '); cout << "\n"; system("PAUSE"); return 0; }

2 4

Re: [Boost-Users] [BGL] dijkstra_shortest_paths and the single-pair problem
by JOAQUIN LOPEZ MU?Z 03 Jul '03

03 Jul '03

Throw an exception? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo ----- Mensaje Original ----- De: Richard Jepps <yg-boost-users(a)m.gmane.org> Fecha: Martes, Julio 1, 2003 3:00 pm Asunto: [Boost-Users] [BGL] dijkstra_shortest_paths and the single-pair problem > I would like to use the dijkstra_shortest_paths algorithm to find the > shortest path from one specified vertex to another. > > The standard Boost implementation will find this, but it will > continue until > it has found the shortest paths to all nodes in the graph (i.e. > solved the > single source problem). > > The BGL book (Section 5.1, pp76) says: "It turns out that there > are no > algorithms for solving the single-pair problem that are asymptotically > faster than the algorithms that solve the single-source problem". > I think this is because the single-source algorithms all have the > propertythat it is possible to determine whether the shortest path > to any given node > has been found during the execution of the algorithm, therefore > you can use > the same algorithm to solve both types of problem provided that the > termination criterion is appropriate to the problem. > > Consider this problem: "find the shortest path from a source > vertex u to a > nearby destination vertex v in an infinitely large directed > weighted graph G > in finite time." > The single-source problem can only be solved in infinite time, but the > single-pair problem can be solved relatively quickly (because the two > vertices are near each other). > > I think that the termination criterion is quite straightforward > using a > DijkstraVisitor - it is when vis.finish_vertex(u, g) is called and > u == > destination_node. Unfortunately I can't see how to stop the > algorithm in a > reasonable way. > > An unreasonable solution is to provide a custom graph and turn off > all its > edges when the termination criterion is met. > This is unreasonable because the responsibility for termination > belongs to > the algorithm, not the data structure - I shouldn't have to modify > the data > structure to terminate the algorithm. > It's also unreasonable because I have to customise both the graph > and the > algorithm to do something very simple. > > Is there a better way? > > Thanks > > Richard > > > > > > > > ------------------------ Yahoo! Groups Sponsor -------------------- > -~--> > Get A Free Psychic Reading! Your Online Answer To Life's Important > Questions.http://us.click.yahoo.com/Lj3uPC/Me7FAA/ySSFAA/EbFolB/TM > ------------------------------------------------------------------- > --~-> > > Info: <" target="l">http://www.boost.org> > Wiki: <" target="l">http://www.crystalclearsoftware.com/cgi- > bin/boost_wiki/wiki.pl>Unsubscribe: <')" >mailto:boost-users- > unsubscribe(a)yahoogroups.com> > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > >

5 5

boost::numeric::ublas::map_array support for the complete std::map interface?
by Markus Werle 03 Jul '03

03 Jul '03

Hi! While trying to test boost::numeric::ublas::map_array as replacement for a std::map in my own code, I found that some memfuns like lower_bound and key_comp are missing. I also found that these can be added quite easily, since e.g. lower_bound exists as external function and only needs to be called in an appropriate way. Though the functions mentioned may not be useful in ublas apps, they would help improve the reusability of map_array. Before I start stalking through the code: Are there any plans to add these features already? Or is there somebody who knows the ublas code better than me and can help me avoid breaking existsing code? best regards, Markus -- Build your own Expression Template Library with Daixtrose! Visit http://daixtrose.sourceforge.net/

2 1

RE: [Boost-Users] Re: [BGL] dijkstra_shortest_paths and the singl e-pair problem
by Jim.Hyslop 03 Jul '03

03 Jul '03

Mark Sizer wrote: > Eeek! Exceptions as flow control are, well, not exceptions. > > I have no solution to offer (I don't even fully understand the > question), but I hope someone has a better answer. At this time, the only solution is to throw an exception. This whole issue was discussed in September, including the morality of using exceptions for flow control. Please see the thread entitled "[BGL] Best way to abort an algorithm from within a visitor?": http://groups.yahoo.com/group/Boost-Users/message/1819 -- Jim

2 1

regular expression control
by Enrico 03 Jul '03

03 Jul '03

Hi all, I'm using regex with a list of regular expressions written by my team. They start from a set of rules and write down the expression (s). What I'm requested to do now is a function that given a regular expression write down all the combinations available, with some limitations of course: if for example an expression has an infinity of combination this could not be achieved. Since all the expression have a limited number of combinations in this case a warning will suffice. I searched for such a function in the regex code but didn't find it. Any idea? Thanks, Enrico

1 0

Boost.Thread and fork
by Pavol Droba 02 Jul '03

02 Jul '03

Hi, I have problem with boost.threads on linux ( under gcc ). I have a multithreaded aplication using Boost.Thread. It works just fine. However, I want to make a daemon out of it. So I tried to fork() at the start of the program and run all the relevant code ( including all threading ) in the child process. But when I do so, first call to create_thread hangs the process. I'm quite new to linux threading, so it is possible, that the problem is not related to Boost.Threads. Any hints? Thanks in advance. Pavol

4 4

another newbie question on bjam
by Karsten Weinert 01 Jul '03

01 Jul '03

Hi, still trying to set up bjam, I am stumbling on the following problem: I want to use jamfile.jam instead of jamfile (because my editor uses extensions to define actions on files). But when I run bjam on it, with bjam -f jamfile.jam -sTOOLS=mingw it complains about an unknown rule exe. What can I do? Here is the jamfile.jam: exe hello : hello.cpp : <include>c:$(SLASH)dev-cpp$(SLASH)include$(SLASH)c++ <include>c:$(SLASH)dev-cpp$(SLASH)include$(SLASH)c++$(SLASH)mingw32 <include>c:$(SLASH)dev-cpp$(SLASH)include$(SLASH)c++$(SLASH)backward ; Furthermore, can you please advise me how to simplify this jamfile? In my opinion, the include-statements belong to mingw-tools.jam, but how can I specify several include directories there? Any comments appreciated, Karsten

2 1

newbie bjam question
by Karsten Weinert 30 Jun '03

30 Jun '03

Hi, there are two questions about bjam I tried to answer, but failed: * which files are read by bjam in which order * where can I declare the standard include path I am using mingw on win98. Would be nice if someone could help me here, Karsten Weinert

2 1

BGL problem with filtered_graph and adjacency_matrix
by Matthias Rupp 30 Jun '03

30 Jun '03

Hi, i'm new to boost and encountered the following problem with the boost graph library and this code: #include "boost/graph/adjacency_list.hpp" #include "boost/graph/adjacency_matrix.hpp" #include "boost/graph/filtered_graph.hpp" int main (void) { using namespace boost; typedef adjacency_matrix<undirectedS> Graph; //typedef adjacency_list<vecS, vecS, undirectedS> Graph; typedef filtered_graph<Graph, keep_all> FilteredGraph; Graph g (5); FilteredGraph fg (g, keep_all ()); } This results in a lot of error messages from the compiler (see end of email), all located in the bgl files. If i use adjacency_list (as in the commented line above) instead of adjacency_matrix, everything's fine. I use gcc 3.3 under linux and version 1.30 of the boost library. Is this a bug? Is there an easy way to make filtered_graph work with adjacency_matrix? (I'd like to use adjacency_matrix because my graphs are almost complete graphs). Best regards, Matthias Rupp The first error messages from the compiler (the rest are also complaints about forming references to void): ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>': ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:852: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:927: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>': ../boost_1_30_0/boost/type_traits/is_convertible.hpp:128: instantiated from `boost::detail::is_convertible_basic_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_convertible.hpp:191: instantiated from `boost::detail::is_convertible_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::is_convertible<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_helper<false>::type<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::is_enum<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::detail::is_scalar_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::is_scalar<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::detail::is_class_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::is_class<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::detail::is_empty_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::is_empty<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::compressed_pair<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>' ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:1313: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1315: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1344: error: forming reference to void [...]

1 0

New file uploaded to Boost-Users
by Boost-Users＠yahoogroups.com 30 Jun '03

30 Jun '03

Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the Boost-Users group. File : /uBLA Performance.pdf Uploaded by : sumohurd <matt(a)finray.net> Description : Updated to correctly use n^2*(2n-1) for notional FLOP count You can access this file at the URL http://groups.yahoo.com/group/Boost-Users/files/uBLA%20Performance.pdf To learn more about file sharing for your group, please visit http://help.yahoo.com/help/us/groups/files Regards, sumohurd <matt(a)finray.net>

1 0

boost with WS6U1
by Gabe E. Nydick 30 Jun '03

30 Jun '03

Has anyone gotten boost 1.29 to work with Sun WS6U1? If so, could you please help me out with some patch files to get it working? - Gabe [Non-text portions of this message have been removed]

1 0

boost::function and VC6 compile failure
by Vincent Finn 30 Jun '03

30 Jun '03

Hi, I am using the function classes in VC6 and have hit a problem The problem is that the compiler can't allocate enough space to build (The error mesages are at the bottom) Nomally you use the /ZmXXX compiler flag to make this bigger but that doesn't work in this case Has anyone hit this before? Is there a simple workaround? In case it makes a differnce the problem arises as follows I have a template class which has instances of boost::function1 and 2 If I build with only one version of my class everything is fine when I have more versions (I need about 12 different types) it stops Vin boost_1_30_0\boost\type_traits\has_trivial_copy.hpp(31): fatal error C1204: compiler limit : internal structure overflow boost_1_30_0\boost\type_traits\has_trivial_copy.hpp(43): see reference to class template instantiation 'boost::detail::has_trivial_copy_impl<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\type_traits\is_stateless.hpp(31): see reference to class template instantiation 'boost::has_trivial_copy<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\type_traits\is_stateless.hpp(43): see reference to class template instantiation 'boost::detail::is_stateless_impl<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_base.hpp(193): see reference to class template instantiation 'boost::is_stateless<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_template.hpp(431): see reference to class template instantiation 'boost::detail::function::get_function_tag<less_equal<unsigned char>>' being compiled boost_1_30_0\boost\function\function_template.hpp(293): see reference to function template instantiation 'void boost::function2<bool,unsigned char,unsigned char,int>::assign_to(less_equal<unsigned char>)' being compil ed

2 2

RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39
by Tom Matelich 27 Jun '03

27 Jun '03

> -----Original Message----- > From: Toon Knapen [mailto:toon.knapen@fft.be] > > > Thanks for the update Toon. I think we're going to migrate > > to the gcc compiler on HP-UX for all our future work. That > > or we're going to go with Linux and bag HP altogether. > > OK but nevertheless some related info : > HP says that gcc only obtains 1/3th of the performance of aCC (never > checked myself though). And you should also now that I tried > to compile > boost with gcc (oops it's not shown anymore on the status pages, I'll > have to update it) and I had trouble compiling it (mostly to do with > posix threads AFAICT). > Not sure where that performance statistic comes from, but I didn't really notice it when we went from aCC to gcc a while back (but that was on 10.20, acc 1.18 -> gcc 2.9x). I'd recommend you use at least gcc 3.3 if you are going to go to gcc. There are a few big bugs. On 3.2.x we've had to drop to -O1 due to what appear to be optimizer bugs. GCC says they fixed some of those with 3.3, though I haven't had the chance to verify. In any case, back when Jens Maurer and I were trying to get Boost on aCC going, we were told Boost was going to become part of their test suite, but the lack of progress seems to indicate that didn't happen. And, if you have the opportunity, run as fast as you can away from HP to Linux. When Douglas Schmidt singles out a platform as being hard to work with (can't remember the exact reference, but it wasn't complimentary), you know its a pain. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

Unelegant constructs in date_time
by Claus Tondering 27 Jun '03

27 Jun '03

Here's a list of a few things I find unelegant in the date_time package: 1. Order or parameters Consider these declarations: date d(year, month, day); partial_date pd(day, month); So date() uses month before day, while partial_date() uses day before month. 2. No += and -= I can say date1 = date1 + date_duration(3); but not date1 += date_duration(3); 3. Namespace problems Date generators are in different namespaces: Both partial_date and first_kday_of_month are found in boost::date_time, but partial_date is also carried over in boost::gregorian, whereas first_kday_of_month is not. 4. Inconsistent abbreviations If I want the first Thursday in September, I must write: boost::date_time::first_kday_of_month<date> fts(Thursday, Sep); 'Thursday' must not be abbreviated to 'Thu'. 'Sep' must not be unabbreviated to 'September'. 5. Misleading exception string This code: try { date d(2003, Feb, 29); } catch (std::out_of_range exc) { std::cout << "Caught exception: " << exc.what() << std::endl; } surprisingly outputs this text: Caught exception: Day of month value is out of range 1..31 So, it seems that 29 is not in the range 1..31. -- Claus Tondering

2 1

RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39
by Murray, Charlie H 27 Jun '03

27 Jun '03

Thanks for the update Toon. I think we're going to migrate to the gcc compiler on HP-UX for all our future work. That or we're going to go with Linux and bag HP altogether. -----Original Message----- From: Toon Knapen [mailto:toon.knapen@fft.be] Sent: Friday, 27 June 2003 01:04 To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Any luck with HP-UX 11i (11.11) using aCC 3.39 > Has anyone had any luck building Boost 1.30.0 on HP-UX 11i > (11.11) using the aCC version 3.39 compiler? The Compiler > Status page for HP-UX lists the 5.38 version of aCC, but it > looks like I'm having many of the same problems. > > Any help would be greatly appreciated. First of all, I'm planning to sync the status pages on HP/aCC every day. But yes, the aCC compiler fails misereably on compiling boost. I've started to try to isolate code that is legal but can't be handled by the aCC compiler and send it to their experts. By exchanging such code-snippets we could improve our understanding of the (deficiencies of the) aCC compiler and improve portability of the boost libraries. So I'll end with the same line as your post : any help would be greatly appreciated. toon Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

2 1

boost::lambda::select2nd
by Markus Werle 27 Jun '03

27 Jun '03

Hi! I would like to write code like int main() { namespace l = boost::lambda; std::map<int, double> M; M[1] = 5.0; M[3] = 7.0; std::for_each(M.begin(), M.end(), l::select2nd(l::_1) *= 6.0); } Is it hard to implement this for boost::lambda? Markus

3 8

BGL problem with filtered_graph and adjacency_matrix
by Matthias Rupp 27 Jun '03

27 Jun '03

Hi, i'm new to boost and encountered the following problem with the boost graph library: #include "boost/graph/adjacency_list.hpp" #include "boost/graph/adjacency_matrix.hpp" #include "boost/graph/filtered_graph.hpp" int main (void) { using namespace boost; typedef adjacency_matrix<undirectedS> Graph; //typedef adjacency_list<vecS, vecS, undirectedS> Graph; typedef filtered_graph<Graph, keep_all> FilteredGraph; Graph g (5); FilteredGraph fg (g, keep_all ()); } This results in a lot of error messages from the compiler (see end of email), all located in the bgl files. If i use adjacency_list (as in the commented line above) instead of adjacency_matrix, everything's fine. I use gcc 3.3 under linux. Is this a bug? Is there an easy way to make filtered_graph work with adjacency_matrix? (I'd like to use adjacency_matrix because my graphs are almost complete graphs). Best regards, Matthias Rupp The first error messages from the compiler (the rest are also complaints about forming references to void): ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>': ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:852: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:927: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp: In instantiation of `boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>': ../boost_1_30_0/boost/type_traits/is_convertible.hpp:128: instantiated from `boost::detail::is_convertible_basic_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_convertible.hpp:191: instantiated from `boost::detail::is_convertible_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::is_convertible<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&, boost::detail::int_convertible>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_helper<false>::type<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>&>' ../boost_1_30_0/boost/type_traits/is_enum.hpp:91: instantiated from `boost::detail::is_enum_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::is_enum<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_scalar.hpp:36: instantiated from `boost::detail::is_scalar_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::is_scalar<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_class.hpp:76: instantiated from `boost::detail::is_class_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::is_class<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/type_traits/is_empty.hpp:75: instantiated from `boost::detail::is_empty_impl<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::is_empty<boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::compressed_pair<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void> >' ../boost_1_30_0/boost/iterator_adaptors.hpp:934: instantiated from `boost::iterator_adaptor<void, boost::filter_iterator_policies<boost::detail::in_edge_predicate<boost::keep_all, boost::keep_all, boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all> >, void>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>, boost::detail::matrix_edge_desc_impl<boost::undirected_tag, size_t>*, boost::multi_pass_input_iterator_tag, ptrdiff_t>' ../boost_1_30_0/boost/graph/filtered_graph.hpp:216: instantiated from `boost::filtered_graph<main()::Graph, boost::keep_all, boost::keep_all>' complaint.cpp:23: instantiated from here ../boost_1_30_0/boost/iterator_adaptors.hpp:1313: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1315: error: forming reference to void ../boost_1_30_0/boost/iterator_adaptors.hpp:1344: error: forming reference to void [...]

1 0

Any luck with HP-UX 11i (11.11) using aCC 3.39
by Murray, Charlie H 27 Jun '03

27 Jun '03

Has anyone had any luck building Boost 1.30.0 on HP-UX 11i (11.11) using the aCC version 3.39 compiler? The Compiler Status page for HP-UX lists the 5.38 version of aCC, but it looks like I'm having many of the same problems. Any help would be greatly appreciated. Charlie Murray Senior Software Engineer National Access Services Comcast Media Centers Phone: 303-267-9819 Email: charlie_murray(a)cable.comcast.com CONFIDENTIAL NOTICE This electronic mail transmission and any accompanying documents contain information belonging to the sender which may be confidential and legally privileged. If you are not the intended recipient, any disclosure, copying, distribution or action taken in reliance on the message is strictly prohibited. If you have received this message in error, please delete it immediately. Thank You

2 1

Cannot compile posix_time.hpp on MSVC
by Claus Tondering 26 Jun '03

26 Jun '03

If I include "boost/date_time/posix_time/posix_time.hpp" in a file and compile the file using the Gnu C++ compiler, everything works fine. But if I compile the file using Miscrosoft Visual C++, I get this error message from the lexical_cast.hpp file: ...\boost\lexical_cast.hpp(147): error C2678: binary '<<' : no operator found which takes a left-hand operand of type 'std::basic_stringstream<_Elem,_Traits,_Alloc>' (or there is no acceptable conversion) with [ _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Alloc=std::allocator<wchar_t> ] The offending line in lexical_cast.hpp contains this function: bool operator<<(const Source &input) { return stream << input; } What am I doing wrong? -- Claus Tondering

2 1

Pyste and class methods
by Jim Wilson 26 Jun '03

26 Jun '03

Pystitos, Pyste digests foo.h: struct foo { static void bar(int); static int bar(); }; under guidance from foo.pyste: Class("foo", "foo.h") and silently yields foo.cpp devoid of any BOOST_PYTHON_MEMBER_OVERLOADS(...) macros. Consequently, gcc begins whining "no matches can be found converting function `bar' to type [..some incredibly complex C++ declaration that I'd never be able to type in correctly, much less understand...]" and suggests the obvious candidates. What stupid thing am I overlooking? Jim Wilson Gainesville, FL

1 0

Problem with filesystem attributes
by richard_fanta 26 Jun '03

26 Jun '03

Hiya, I've been trying to try out the attributes code in the boost-sandbox, but am running into some snags using VC++ version 7 (that comes with VS .NYET). One simple goal here would be to discern whether a file is writeable. Can this be done with the filesystem::attributes library?? The code for attr_test.cpp from the tests directory is included below; it's been slightly modified to run stand-alone instead of through the boost test harness. Problem #1: No string() method on the cache class. Problem #2: The "<<" operator won't work. For the latter, I've seen it suggested that typedefs might help, but don't understand what the underlying issue is. Is this a lingering Microsoft (i.e. VC++) specific issue? I'd greatly appreciate any clarification that people can offer. Much thanks, Richard Fanta ----------------Errors---------------------------------------------- x:\v\ReviewAgent\AttrTest\attr_test.cpp(23) : error C2039: 'string' : is not a member of 'boost::filesystem::cache' x:\ReviewAgent\Util\boost_1_30_0_filesystem\boost\filesystem\cache.hpp(33) : see declaration of 'boost::filesystem::cache' x:\v\ReviewAgent\AttrTest\attr_test.cpp(25) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator x:\v\ReviewAgent\AttrTest\attr_test.cpp(26) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator x:\v\ReviewAgent\AttrTest\attr_test.cpp(26) : error C2676: binary '<<' : 'boost::filesystem::cache' does not define this operator or a conversion to a type acceptable to the predefined operator ----------------Source---------------------------------------------- #include <iostream> #include <exception> #include <string> #include "boost/filesystem/attributes.hpp" #include "boost/filesystem/path.hpp" //#include "boost/test/minimal.hpp" namespace fs = boost::filesystem; //int test_main (int argc, char **argv) int main (int argc, char **argv) { for (int i = 1; i < argc; ++i) { fs::path file (argv [i], fs::native); fs::cache pm (file); std::cout //<< "name: " << get <fs::filename> (pm).string () << "; size: " << get <fs::size> (pm) << "; owner: " << get <fs::owner> (pm) << "; group: " << get <fs::group> (pm) << "\n"; }

1 0

Newbie lambda question
by Ian 25 Jun '03

25 Jun '03

Boosters: Try as I might, I cannot figure a way of converting the following code snippet to use std::for_each with boost::lamdba. Any ideas? unsigned int table[1000]; for ( unsigned int* it = table_; it != table_ + (sizeof(table_) / sizeof(unsigned int)); ++i ) { *it = ((int)it % 3); } The pointer to int cast is the killer, the docs mention the ret<> template briefly, but it does not seem to help... Cheers Ian

3 3

Ublas library
by Alexey Nikitin 25 Jun '03

25 Jun '03

Hello everyone, I am try to use Ublas library and have some questions. I am want to write next code: template<class Matrix> void ProcessRecursive(Matrix& m) { typedef matrix_range<typename Matrix::matrix_type> MatrixRange; ... MatrixRange mr = project(m, range(...), range(...)); ... ProcessRecursive(mr); ... } void StartProcess() { ... matrix<double> m; ... ProcessRecursive(m); } But I have not enough type matrix_type in class matrix<...> and function template<class M> matrix_range<M> project(matrix_range<M>& data, const range& r1, const range& r2); There is almost the same function project but reciving const referens to matrix_range and compiler can't find it even using partial template ordering. Do somebody help my to write this code correctly? Or fix library? Regards, Alexey.

2 4

boost::spirit - why won't this palindrome code work?
by joshwaxman 24 Jun '03

24 Jun '03

Hi. I just started playing with spirit and tried the following code to match palindromes of strings consisting of a's and b's. Why won't this work? (It prints 0, not 1) #include "boost/spirit/core.hpp" #include <iostream.h> using namespace boost::spirit; int main(int argc, char* argv[]) { rule <> S; S = ch_p('a') | ch_p('b') | epsilon_p | ('a' >> S >> 'a') | ('b' >> S >> 'b'); char * str = "aabaa"; cout << parse(str, S).full; return 0; }

2 1

threads within threads
by pmedrow 23 Jun '03

23 Jun '03

Hi I am attempting to create a boost thread within an existing boost thread, i.e. a function called by the operator() function of an existing, running thread is attempting to make more threads. The new threads function objects are of the same type, but different from the parent function object type. This compiles and runs, but takes time equivalent to the threads running sequencially on a single thread. CPU usage indicates that both threads are running in parallel. Very strange... I am building with gcc v3.2.3 on red-hat linux build 2.4.20. Any ideas gratefully received!

2 3

boost::filesystem build in MS Visual Studio .NET 2003
by Stuart C. Schaffner 23 Jun '03

23 Jun '03

Sorry if this is a repost. I am having trouble with my mail system. I tried to build the boost libraries per the instructions on "Building Boost Libraries" at www.boost.org, but most of the builds failed. I did set up the two variables for msvc. However, I noticed that vcvars32.bat is not in the directory that the build script specifies. I can fix this, but I suspect that other things are also in different places in .NET 2003. Any suggestions? Stu Schaffner The MITRE Corp.

2 2

Passing shared_ptr to function that creates obj that shared_ptr points to
by Drew 23 Jun '03

23 Jun '03

[Moderator's note: The only apparent connection this message has to Boost is in the subject line. I am approving it on the assumption that the missing declarations for ParentPtr and DerivedPtr are typedefs using boost::shared_ptr.] Hello everyone... I am attempting to do the following: class Parent { public: int m_value; }; class Derived : public Parent { }; void Fn(ParentPtr& pObj) { pObj = ParentPtr(new Parent()); pObj->m_value = 10; } int main() { ParentPtr pParent; DerivedPtr pDerived; Fn(pDerived); return 0; } If I pass the parent pointer, it compiles and works fine. If I pass the derived pointer I get: error C2664: 'Fn' : cannot convert parameter 1 from 'DerivedPtr' to 'ParentPtr &' Does anyone know how to solve my problem? TIA, Drew

4 4

[BGL] negative_edge thrown inside dijsktra for boost' file dependency example.
by Dan Dimerman 23 Jun '03

23 Jun '03

Hello, The problem I'm having is that I get an exception thrown when I run the example related to File precedency on parallel compilation, using dijkstra algorithm. I mean, there's no code of mine at all, so that reduces the probabilities of it being me to a 75%... ;) thanks...

2 7

Signals library safety
by Eugene Talagrand  22 Jun '03

22 Jun '03

Hello to all, I'm looking into using the Boost.Signals. The library claims not to be thread safe. What does this mean exactly? When using Boost.Threads, can I make concurrent calls to connect as long as I wrap each call in a Mutex? If this is possible, do tackable objects also still work (if two trackable objects get destroyed in two different threads there might be a problem from what I understand) On an different note, I am trying to use Boost.Signals for network event handling. I'd like to set it up so that it uses something similar to he JavaScript event model, where every slot returns a boolean value. If that value is false, the remaining slots are not called. Would anyone have any recommendations on how to do this? Should I wrap each slot in a function that takes the return value and sets a global flag, then every subsequent slot checks the flag? It looks like combiners would not be appropriate, as it appears they are used after each slot is called (unless the InputIterator' opeator* actually calls the slot??) Thanks for any help -Eugene

1 0

FW: [Spirit-general] RE: [Boost-Users] boost::spirit and asts
by HartmutKaiser＠t-online.de 22 Jun '03

22 Jun '03

-----Original Message----- From: Giovanni Bajo [mailto:giovannibajo@libero.it] Sent: Sunday, June 22, 2003 1:39 AM To: Hartmut Kaiser Subject: Fw: [Spirit-general] RE: [Boost-Users] boost::spirit and asts You may want to forward this to boost-users, the mail bounced because I'm not subscribed to it. Giovanni Bajo Giovanni Bajo <giovannibajo(a)libero.it> wrote: > Hartmut Kaiser <hartmutkaiser(a)t-online.de> wrote: > > >>> [AST] >>> a problem -- I can't seem to figure out how to put right-to-left >>> associative operators into the tree properly. I had this as a guess, >>> but I'm really not sure: r = value | value >> root_node_d[ch_p('=')] >>> >> r; > >> Meanwhile I'll >> forward this message to the Spirit mailing list, maybe somebody >> remebers it. Giovanni? > > > The proposed code should work as expected wrt tree generation, but you need > to left-factor it to make it actually work: > > r = value >> !(root_node_d[ch_p('=')] >> r); > > Giovanni Bajo > > > > ------------------------------------------------------- > This SF.Net email is sponsored by: INetU > Attention Web Developers & Consultants: Become An INetU Hosting > Partner. Refer Dedicated Servers. We Manage Them. You Get 10% Monthly > Commission! INetU Dedicated Managed Hosting > http://www.inetu.net/partner/index.php > _______________________________________________ > Spirit-general mailing list > Spirit-general(a)lists.sourceforge.net > https://lists.sourceforge.net/lists/listinfo/spirit-general

1 0

enable_if part of boost ?
by Anders Moe 22 Jun '03

22 Jun '03

Hi all. After reading about enable_if in CUJ I decided to see if this was present in boost, which it is, sort of, in function_base.hpp. However, it seems to exist in function::, and my impression is that its not really an official boost component. Is this correct ? Regards, Anders.

8 15

boost::thread and .NET
by Bruno Martínez 22 Jun '03

22 Jun '03

Hello, I was wondering what outcome to expect from mixing .NET managed c++ and boost::thread. According to ms's docs a c++ application compiles for .net unchanged, but what kind of api can it expect? What may happen if I try to execute .net code in a thread created by boost::thread? Thanks in advance, Bruno Martinez ------------------------------------------------------ Internet en Uruguay es http://www.internet.com.uy

1 0

boost::spirit and asts
by Dan Nuffer 21 Jun '03

21 Jun '03

Hi, I'm trying to write a grammar for a scripting language, and to do this I'm building an AST of each expression. I have this working fine, for the most part, but I've run into a problem -- I can't seem to figure out how to put right-to-left associative operators into the tree properly. I had this as a guess, but I'm really not sure: r = value | value >> root_node_d[ch_p('=')] >> r; _____________________________________________________________ <a href="http://www.gamedev.net">GameDev.net Email Service</a> - "Plenty of 1's and 0's" _____________________________________________________________ Select your own custom email address for FREE! Get you(a)yourchoice.com, No Ads, 6MB, IMAP, POP, SMTP & more! http://www.everyone.net/selectmail?campaign=tag

2 1

Using Ublas for eigenvalue problems.
by Amit Bhatia 20 Jun '03

20 Jun '03

Hello everyone, I am working on trying to use ublas for finding the eigenvalues and eigenvectors of a positive definite matrix. I am not too sure whether this can be done in ublas. I have seen that there are calls for solving system of equations as well as doing rank updates, but still am not sure whether this could be done "safely" (eigenvalues getting close to zero) and efficiently ? I have read at a couple of places the advice' of using prewritten routines for this rather than trying to write one's own for this non trivial problem. I am a newbie! Any advice/suggestion/past experience with the same will be most welcome. regards, amit.

1 0

BGL: Immutable vertex/edge descriptors?
by Tarjei Knapstad 19 Jun '03

19 Jun '03

If I use vecS for EdgeList and/or VertexList, whenever I remove a edge/vertex this also affects any vertex/edge with a higher numbered descriptor, i.e. removing vertex 0 results in subtracting 1 from every other vertex descriptor. I'm making a graphical editor for a structure that is represented as a graph, and to quickly determine which vertex/edge is selected and should be edited in any way I figure the best way is to keep a copy of the edge/vertex descriptor with the graphical object that is supposed to represent just that edge/vertex. If I use vecS this soon becomes a real pain if I have to update edge/vertex descriptors everywhere whenever I remove some part of the graph. I could of course add my own immutable descriptors as properties in the graph, but that just reverses the problem - I'll have to map these back to the 'real' descriptors when I want to modify/access the graph. I assume I can use listS to store both edges and vertices to solve this problem in that the descriptors become pointers which are not disturbed when I remove a vertex/edge? What about setS? If I go with listS I end up with another concern regarding the performance benchmarks on traversal in the BGL book. Is the code used to create those benchmarks available anywhere so that I can do a re-evaluation with later compiler versions? I hope someone can shed some light here. Thanks, -- Tarjei

1 0

gcc3.2.3 regex STLPort-4.5.3
by david 19 Jun '03

19 Jun '03

Hi, I have some undefined references (see below). It looks like I have to use a compiler definition? Is it possible to use regex with gcc.3.2.3? In function `bool boost::re_detail::query_match_aux undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, _STL::allocator<char> >::~reg_expression [in-charge]()' ( in function: In function `bool boost::re_detail::query_match_aux<char const*, _STL::allocator<char>, char, boost::regex_traits<char>, _STL::allocator<char> >(char const*, char const*, boost::match_results<char const*, _STL::allocator<char> >&, boost::reg_expression<char, boost::regex_traits<char>, _STL::allocator<char> > const&, unsigned, boost::re_detail::_priv_match_data<char const*, _STL::allocator<char> >&, char const**)': ) Bye

2 2

_MSC_VER not defined on mingw32
by omnizionic 19 Jun '03

19 Jun '03

I downloaded and unzipped the latest boost (1.30.0) and tried using it in a simple file like this: #include <boost/smart_ptr.hpp> int main() { boost::shared_ptr<int> p(new int); return 0; } I compiled it, and got the following output: gcc -c -Wall -W -Werror -Wundef -Wfloat-equal -Wshadow -Wpointer-arith -Wcast-qual -Wwrite-strings -Wconversion -idirafter c: /programming/lib/kakefisk -Ic:/programming/boost_1_30_0 -O3 -fomit-frame-pointer -ffast-math btest.cpp -o btest.o In file included from c:/programming/boost_1_30_0/boost/scoped_ptr. hpp:16, from c:/programming/boost_1_30_0/boost/smart_ptr.hpp: 17, from btest.cpp:1: c:/programming/boost_1_30_0/boost/checked_delete.hpp:4:5: "_MSC_VER" is not defined In file included from c:/programming/boost_1_30_0/boost/shared_ptr. hpp:26, from c:/programming/boost_1_30_0/boost/smart_ptr.hpp: 19, from btest.cpp:1: c:/programming/boost_1_30_0/boost/throw_exception.hpp:4:5: "_MSC_VER" is not defined In file included from c:/programming/boost_1_30_0/boost/shared_ptr. hpp:27, from c:/programming/boost_1_30_0/boost/smart_ptr.hpp: 19, from btest.cpp:1: c:/programming/boost_1_30_0/boost/detail/shared_count.hpp:4:5: "_MSC_VER" is not defined In file included from c: /programming/boost_1_30_0/boost/detail/shared_count.hpp:27, from c:/programming/boost_1_30_0/boost/shared_ptr. hpp:27, from c:/programming/boost_1_30_0/boost/smart_ptr.hpp: 19, from btest.cpp:1: c:/programming/boost_1_30_0/boost/detail/lightweight_mutex.hpp:4:5: "_MSC_VER" is not defined In file included from c: /programming/boost_1_30_0/boost/detail/lightweight_mutex.hpp:68, from c: /programming/boost_1_30_0/boost/detail/shared_count.hpp:27, from c:/programming/boost_1_30_0/boost/shared_ptr. hpp:27, from c:/programming/boost_1_30_0/boost/smart_ptr.hpp: 19, from btest.cpp:1: c:/programming/boost_1_30_0/boost/detail/lwm_nop.hpp:4:5: "_MSC_VER" is not defined In file included from c:/programming/boost_1_30_0/boost/smart_ptr.hpp: 19, from btest.cpp:1: c:/programming/boost_1_30_0/boost/shared_ptr.hpp:390:60: "BOOST_MSVC" is not defined mingw32-make.exe: *** [btest.o] Error 1 I also tried compiling after setting the following in <boost/config/user.hpp> with no apparent effect: // define this to locate a compiler config file: #define BOOST_COMPILER_CONFIG <boost/config/compiler/gcc.hpp> // define this to locate a stdlib config file: #define BOOST_STDLIB_CONFIG <boost/config/stdlib/libstdcpp3.hpp> // define this to locate a platform config file: #define BOOST_PLATFORM_CONFIG <boost/config/platform/win32.hpp> Does anyone have any ideas as to where the problem might lie?

3 3

Newbie: typle_basic.hpp gives compilation error.
by somlin71 19 Jun '03

19 Jun '03

(Trying to use the tuple function for the first time.) When adding #include "boost/tuple/tuple_comparison.hpp" a compilation gives the following errors: [C++ Error] tuple_basic.hpp(158): E2434 Template declaration missing template parameters ('template<...>') [C++ Error] tuple_basic.hpp(158): E2238 Multiple declaration for 'element<N,T>' [C++ Error] tuple_basic.hpp(143): E2344 Earlier declaration of 'element<N,T>'

1 0

Re: Newbie COMPILATION PROBLEM
by louis.lebrun＠free.fr 19 Jun '03

19 Jun '03

Thanks for your reply. But in fact since I download BOOST 1.30, the problem didn't occure anymore. Louis -----Message d'origine----- De : gbiddison [mailto:gbiddison@velocity11.com] Envoyé : mercredi 18 juin 2003 18:49 À : Boost-Users(a)yahoogroups.com Objet : [Boost-Users] Re: Newbie COMPILATION PROBLEM Hi, I've seen this problem while trying to include boost\python.hpp in a recent project. The problem only seemed to occur for me if I included boost\python.hpp in the precompiled header file (stdafx.h). If I moved the #include so that it wasn't precompiled, the INTERNAL COMPILER ERROR (I have an english version of MSVC7) disappeared. Could this be the problem you are experiencing? Does anyone know of a better solution for this? It would be nice to be able to precompile boost headers ... Giles --- In Boost-Users(a)yahoogroups.com, "lebrun_l" <louis.lebrun@f...> wrote: > Hi All, > > I'am using > Microsoft Visual C++ .NET 7.0 > > I can't manage to compile a single example from the graph library. > > I get the following message : > > c:\BGL\boost_1_25_1\boost\type_traits\cv_traits.hpp(188): fatal > error C1001: ERREUR INTERNE DU COMPILATEUR > (fichier du compilateur 'msc1.cpp', ligne 2844) > Choisissez la commande Support technique du menu ? (Aide) > de Visual C++ > ou ouvrez le fichier d'aide du Support technique pour plus > d'informations > > Thank's in advance for your help. > > Louis

1 0

RE: [Boost-Users] RE: A newbie question.
by Jim.Hyslop 18 Jun '03

18 Jun '03

Amit Bhatia wrote: > Thanks Jim, > I have another doubt which is due to my lack of any previous > experience > with things like templates(Well I am seeing the kind of > programming used in > BOOST for the first time :( ). I was looking at the random > number library, > and it mentions IntType a number of times. I can't figure out > where to look > for it? So is it a generic thing or is it part of some other > BOOST library. It's right under your nose, as they say ;=) The IntType is a parameter to the template, so it's whatever you tell the compiler you want it to be. Taking a snip at (ahem) random from one of the files: template<class IntType, IntType a, IntType c, IntType m> class linear_congruential { public: typedef IntType result_type; static const IntType multiplier = a; static const IntType increment = c; static const IntType modulus = m; static const bool has_fixed_range = true; static const result_type min_value; static const result_type max_value; explicit linear_congruential_fixed(IntType x0 = 1); // compiler-generated copy constructor and assignment operator are fine void seed(IntType x0); IntType operator()(); }; At this point, we don't know exactly what an "IntType" is. However, on the next lines: typedef random::linear_congruential<long, 16807L, 0, 2147483647L, 1043618065L> minstd_rand0; typedef random::linear_congruential<long, 48271L, 0, 2147483647L, 399268537L> minstd_rand; These typedefs provide typedefs that fix IntType as a long, with the various parameters converted to long. More detailed explanation about templates is beyond the scope of this list - it's really quite a basic topic. I'd suggest picking up a good C++ tutorial book. Koenig and Moo's "Accelerated C++" comes highly recommended (I haven't read it myself, but I have yet to hear a negative review of it). -- Jim

1 0

RE: [Boost-Users] A newbie question.
by Jim.Hyslop 18 Jun '03

18 Jun '03

Amit Bhatia wrote: > I have just downloaded boost 1.3.0 a couple of days ago. Welcome! > While going > through the documentation I read that it is not necessary to build > the library, completely. [...] > I have this doubt that is it equally good practice to just > include the > .hpp files rather than building the whole libary. For most of the Boost library items, the header *IS* the entire library (that's the power of templates for you :-) The exceptions are the Python, Regex, Signal and Thread libraries - those you need to build. More details are at http://www.boost.org/tools/build/index.html > Also was just wondering if there are seperate disc groups > for each set of > libaries like numerics/math in one place ? There are separate lists for Python and the Boost.build system (details at http://www.boost.org/more/mailing_lists.htm) Other than that, everything goes through here. -- Jim

2 1

A newbie question.
by Amit Bhatia 18 Jun '03

18 Jun '03

Hi, I have just downloaded boost 1.3.0 a couple of days ago. While going thropugh the documentation I read that it is not necessary to build the library, completely. As of now the uBLAS and the random number library seem to be most useful to me. I have this doubt that is it equally good practice to just include the .hpp files rather than building the whole libary. Does it mean a very messy code, and a rather very different way of compilation, etc ? Also was just wondering if there are seperate disc groups for each set of libaries like numerics/math in one place ? Thanks, amit.

1 0

Newbie COMPILATION PROBLEM
by lebrun_l 18 Jun '03

18 Jun '03

Hi All, I'am using Microsoft Visual C++ .NET 7.0 I can't manage to compile a single example from the graph library. I get the following message : c:\BGL\boost_1_25_1\boost\type_traits\cv_traits.hpp(188): fatal error C1001: ERREUR INTERNE DU COMPILATEUR (fichier du compilateur 'msc1.cpp', ligne 2844) Choisissez la commande Support technique du menu ? (Aide) de Visual C++ ou ouvrez le fichier d'aide du Support technique pour plus d'informations Thank's in advance for your help. Louis

2 1

RE: [Boost-Users] Re: Regex in a service..
by Koss, Loren 18 Jun '03

18 Jun '03

Thanks to all for helping. As soon as I changed the account of the service, it worked which led me to believe it just wasn't finding the DLL, which in fact was the problem. All is working now. Thanks for all the great help and ideas! Loren -----Original Message----- From: Jeff Garland [mailto:jeff@crystalclearsoftware.com] Sent: Tuesday, June 17, 2003 3:38 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Re: Regex in a service.. On Mon, 16 Jun 2003 09:05:57 -0700, Koss, Loren wrote > The service can start and I can attach and run through it, but if I > uncomment it (which is what I need to do), essentially it > IMMEDIATELY fails with a ERROR 1053: The service did not respond to > the start or control request in a timely fashion. Is it possible > that its not finding the proper libraries or a permissions problem > is happening? Windows services have to respond to the Windows Service Control Manager (SCM) within a certain amount of time (a few seconds as I recall) or the SCM will assume the start has failed. How long is your Regex taking? Perhaps you should put the Regex in another thread so that your SCM responses are timely.... HTH, Jeff Yahoo! Groups Sponsor <http://us.adserver.yahoo.com/l?M=247865.3456232.4744922.1261774/D=egroupmai l/S=:HM/A=1482387/rand=728390785> Info: <http://www.boost.org <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! <http://docs.yahoo.com/info/terms/> Terms of Service. [Non-text portions of this message have been removed]

1 0

Python and hello.World class example
by David Brownell 18 Jun '03

18 Jun '03

I am trying to run the hello.World class example in the tutorial and am running into problems. I can compile the dll fine, and then copy the dll (and the boost_python.dll) into my python directory, and then start my Python interpreter. The library will import, but when I call either the greet or set methods, I get the following errors from within the Python interpreter: [greet]: Traceback (most recent call last): File "<interactive input>", line 1, in ? TypeError: unbound method Boost.Python.function object must be called with World instance as first argument (got str instance instead) [set]: Traceback (most recent call last): File "<interactive input>", line 1, in ? TypeError: unbound method Boost.Python.function object must be called with World instance as first argument (got nothing instead) I am failrly new to Python and even newer to Boost.Python, so there may be something very basic that I am missing. I am using boost 1.30, bjam to compile, MSVC 7.1, Python 2.2, and Windows XP. Note that I can compile and successfully execute the inital Hello World example (hello.cpp in the tutorial subdir). Thanks in advance for your help! David Brownell

2 2

Link Problem with filesystem lib test program.
by Adalbert Perbandt 18 Jun '03

18 Jun '03

Hi there, I'm trying to get the boost::filesystem library working on Sun SPARC Solaris 7 with the Sun forte 6.2 compiler. ---------------------------------------------------------------------- $ cd boost_1_30_0/libs/filesystem/test $ bjam -sTOOLS=sunpro -sBOOST_ROOT=/opt/boost_1.30.0 [...] sunpro-Link-action ../../../libs/filesystem/test/bin/convenience_test.test/sunpro/debug/runtime-link-dynamic/convenience_test Undefined first referenced symbol in file boost::__RTTI__1nFboostPchecked_deleter4n0AKfilesystemSdirectory_iteratorLdir_itr_imp___ ../../../libs/filesystem/build/bin/libboost_filesystem.a/sunpro/debug/runtime-link-dynamic/libboost_filesystem.a(9dK8jJofKplZFEI9d1QA.o) [Hint: static member boost::__RTTI__1nFboostPchecked_deleter4n0AKfilesystemSdirectory_iteratorLdir_itr_imp___ must be defined in the program] ld: fatal: Symbol referencing errors. No output written to ../../../libs/filesystem/test/bin/convenience_test.test/sunpro/debug/runtime-link-dynamic/convenience_test CC -o "../../../libs/filesystem/test/bin/convenience_test.test/sunpro/debug/runtime-link-dynamic/convenience_test" -xildoff -g "../../../libs/filesystem/test/bin/convenience_test.test/sunpro/debug/runtime-link-dynamic/convenience_test.o" "../../../libs/filesystem/build/bin/libboost_filesystem.a/sunpro/debug/runtime-link-dynamic/libboost_filesystem.a" "../../../libs/filesystem/build/bin/libboost_filesystem.a/sunpro/debug/runtime-link-dynamic/libboost_filesystem.a" ...failed sunpro-Link-action ../../../libs/filesystem/test/bin/convenience_test.test/sunpro/debug/runtime-link-dynamic/convenience_test... ...skipped <libs!filesystem!test/path_test.test/sunpro/debug/runtime-link-dynamic>path_test.run for lack of <libs!filesystem!test/path_test.test/sunpro/debug/runtime-link-dynamic>path_test... ...skipped <libs!filesystem!test/operations_test.test/sunpro/debug/runtime-link-dynamic>operations_test.run for lack of <libs!filesystem!test/operations_test.test/sunpro/debug/runtime-link-dynamic>operations_test... execute-test ../../../libs/filesystem/test/bin/fstream_test.test/sunpro/debug/runtime-link-dynamic/fstream_test.run **passed** ../../../libs/filesystem/test/bin/fstream_test.test/sunpro/debug/runtime-link-dynamic/fstream_test.test ...skipped <libs!filesystem!test/convenience_test.test/sunpro/debug/runtime-link-dynamic>convenience_test.run for lack of <libs!filesystem!test/convenience_test.test/sunpro/debug/runtime-link-dynamic>convenience_test... ...failed updating 3 targets... ...skipped 6 targets... ...updated 33 targets... ---------------------------------------------------------------------- Is my assumption correct that this again is a consequence of a failure in Sun's forte 6 update 2 compiler? Is there any known workaround for this? Regards, Adalbert Perbandt.

1 0

Newbie: BGL: g++ -O2 or -O3 gives wrong numbers
by michael_wangzy 18 Jun '03

18 Jun '03

HI, I start looking at the Graph library and try the quick_tour.cpp on my machine. Here is something wrong I found out > gcc --vesion gcc (GCC) 3.3 (Gentoo Linux 1.4, PVR 3.3) > g++ -o test -O2 quick_tour.cpp > ./test vertices(g) = A B C D E edges(g) = (A,B) (A,D) (C,A) (D,C) (C,E) (B,D) (D,E) vertex: 0 out-edges: (0,134545512) (0,134545536) in-edges: (2,0) adjacent vertices: 134545512 134545536 vertex: 1 out-edges: (1,134545632) in-edges: (0,1) adjacent vertices: 134545632 vertex: 2 out-edges: (2,134545560) (2,134545608) in-edges: (3,2) adjacent vertices: 134545560 134545608 vertex: 3 out-edges: (3,134545584) (3,134545656) in-edges: (0,3) (1,3) adjacent vertices: 134545584 134545656 vertex: 4 out-edges: in-edges: (2,4) (3,4) adjacent vertices: digraph G { graph [ rankdir="LR", ratio="fill", size="3,3"]; node [ shape="circle"]; 0[label="A"]; 1[label="B"]; 2[label="C"]; 3[label="D"]; 4[label="E"]; 0->1 [label="1.2"]; 0->3 [label="4.5"]; 2->0 [label="2.6"]; 3->2 [label="0.4"]; 2->4 [label="5.2"]; 1->3 [label="1.8"]; 3->4 [label="3.3"]; } Note: the large numbers in the out-edges , like 134545512. Expected numbers are 0,1,2,3,4. Seems some fields are not initilized but read. Note: I tried gcc-3.2.3 and got same results Note: Without -O2 it is fine. My newbie questions are: 1) Is it compiler issue or BGL issue? Cannot we use optimization of gcc when using BGL? 2) I suppose gcc3.3 is good so if this is an BGL issue, where could the thing go wrong? How to fix it? Thanks, Michael

3 2

RE: [Boost-Users] Re: Regex in a service..
by Koss, Loren 17 Jun '03

17 Jun '03

Okay, I now know how to attach to a process - cool! Thanks for that.. However, it looks like when I comment out the following: Regex expression(strMask); The service can start and I can attach and run through it, but if I uncomment it (which is what I need to do), essentially it IMMEDIATELY fails with a ERROR 1053: The service did not respond to the start or control request in a timely fashion. Is it possible that its not finding the proper libraries or a permissions problem is happening? Thanks Loren -----Original Message----- From: Mark Sizer [mailto:yg-boost-users@m.gmane.org] Sent: Saturday, June 14, 2003 6:48 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: Regex in a service.. Yes, you can debug it. After starting the service, open the Task Manager and get the process ID. Then type "msdev -p <pid>" on a command line. If the error happens too quickly (e.g. on startup), put an infinite loop at the very start and break out of it with the debugger. int i=1; while (i > 0 ); is my favorite. Just change i to zero and everything starts going as normal (just don't forget to take it out!). Good Luck, - Mark P.S. I'm using regex in a service and it's working fine (at least I assume it is, nothing noticably bad has happened). MSVC 6, boost_1_30_0, W2K AS and W2K Pro. Koss, Loren wrote: > John, > > Thanks for the response. How do you deal with breakpoints within a service? > I'm compiling then starting the service from the service control manager. > Will I still be able to debug it? >>I seem to be having a difficult time using the Regex class in a >>service. It works wonderfully in a regular app. Can anyone help me >>out.. Basically, instantiating a regex class raises an exception. >>Any thoughts? >> > > Not unless you can tell me what exception and where - if you're using the vc > ide then set it to break on OS and C++ exceptions. > > John. Yahoo! Groups Sponsor <http://us.adserver.yahoo.com/l?M=247865.3425083.4707139.1261774/D=egroupmai l/S=:HM/A=1482387/rand=217687422> Info: <http://www.boost.org <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! <http://docs.yahoo.com/info/terms/> Terms of Service. [Non-text portions of this message have been removed]

3 2

RE: [Boost-Users] to_simple_string and Windows?
by Tom Matelich 17 Jun '03

17 Jun '03

Sorry, I didn't read carefully enough. Have you managed to make a test app fail similarly? tom > -----Original Message----- > From: adutoit [mailto:adutoit@stonethree.com] > Sent: Tuesday, June 10, 2003 11:02 PM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] to_simple_string and Windows? > > > Yes, I know about the UNICODE project option, that is why I > mentioned it in > my previous email... > Anyway, now I am left wondering why opto enabled (with /O3 or > whatever opto > is required) causes my call to "to_simple_string" to fail. > In case anyone > is wondering what I mean by that, it simply aborts without any further > information somewhere in the bowels of said function. > > A. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

4 5

Maximum flow algorithms for interactive application
by Kai-Peter B�ckman 17 Jun '03

17 Jun '03

Hello fellow Boost users, I have been using the boost.graph library in an interactive application for solving the maximum flow problem using the push_relabel algorith. The application consists of the user building the graph network interactively, node by node and edge by edge. Currently the maximum flow for the whole system is recalculated after each change. In addition to the total maximum flow the individual flows in all edges are used by the application. The problem is that interactivity is lost when the amount of nodes approaches 10k with the number of edges varying between 20k-40k. My question is: Is there an algorithm that would let me quickly calculate the changed maxium flow solution after each change without needing to do the global calculations again? The idea here would be to amortize the running time over each interactive change and thus keep response times acceptable (<200ms). My intuition tells me something like this should be possible, but I don't want to reinvent the wheel. Thank you in advance. If someone replies by email I will summarize to the group. Have a nice summer. -- Kai-Peter Bäckman, kai-peter.backman(a)mistaril.com http://www.mistaril.com - Space Station Manager - PC strategy game

1 0

F6U2 anachronisms warnings
by ljohrixxx 16 Jun '03

16 Jun '03

Hello, I get the Anacronism warning from the file is_convertible.hpp line: 293 BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_convertible,From,To, (::boost::detail::is_convertible_impl<From,To>::value)) The warning is: /usr/vobs/ThirdParty/boost/boost_1_30_0/boost/type_traits/is_convertib le.hpp", line 239: Warning (Anachronism): Type names qualified by template parameters require "typename". "/usr/vobs/ThirdParty/boost/boost_1_30_0/boost/type_traits/is_converti ble.hpp", line 239: Warning (Anachronism): Type names qualified by template parameters require "typename". I am using Forte6 U2 compiler on Solaris. Can someone please shed light on what does it mean? I get a whole bunch of similar warnings from many other boost headers. -LJ

2 1

Solution for (some) Compilation Problems with Sun Forte 6.2
by Adalbert Perbandt 16 Jun '03

16 Jun '03

Hi there, a colleague of mine tried to build the Boost::filesystem library (from Boost 1.30.0) under Sun SPARC Solaris7 with the Forte6.2 aka Sun Workshop5.3 compiler and got this failure: >> Assertion: (../links/init.cc, line 972) while processing /opt/boost_1.30.0/boost/type_traits/alignment_of.hpp at line 45. He investigated this problem and found out that defining the preprocessor macro BOOST_NO_INCLASS_MEMBER_INITIALIZATION would solve this. So we changed the boost/config/compiler/sunpro_cc.hpp at line 33 as follows: # if (__SUNPRO_CC <= 0x530) || !defined(BOOST_STRICT_CONFIG) # define BOOST_NO_INCLASS_MEMBER_INITIALIZATION Now we can compile the filesystem library successfully. Could please one of the experts comment on this change or maybe include this in the next release? Regards, Adalbert Perbandt.

3 3

Newbee: Build/Installation Questions
by Adalbert Perbandt 16 Jun '03

16 Jun '03

Hi there, I'm still uncertain how to properly build and install boost libraries under Solaris 7. I unpacked the boost_1_30_0.tar.gz file and ran from the boost_1_30_0/libs/test/build directory: $ jam -sTOOLS=sunpro -sBUILD="debug release" \ -sALL_LOCATE_TARGET=/opt/boost_1.30.0 This created some of the lib files below /opt/boost_1.30.0/libs/test/build/bin/... Not all of them because in release mode compiling the file boost_1_30_0/libs/test/src/unit_test_log.cpp failed several times: [...] sunpro-C++-action /opt/boost_1.30.0/libs/test/build/bin/libboost_test_exec_monitor.a/sunpro/release/runtime-link-dynamic/unit_test_log.o Assertion failure in prep_dot >> Assertion: (../links/prepexpression.cc, line 560) while processing ../src/unit_test_log.cpp at line 301. CC -c -DNDEBUG -fast -O4 -xtarget=generic -features=rtti -features=except -I"/opt/boost_1.30.0/libs/test/build" -I"/home/hwadm/Boost/boost_1_30_0" -o "/opt/boost_1.30.0/libs/test/build/bin/libboost_test_exec_monitor.a/sunpro/release/runtime-link-dynamic/unit_test_log.o" "../src/unit_test_log.cpp" ...failed sunpro-C++-action /opt/boost_1.30.0/libs/test/build/bin/libboost_test_exec_monitor.a/sunpro/release/runtime-link-dynamic/unit_test_log.o... [...] Line 301 and around in this file look so: //____________________________________________________________________________// unit_test_log& unit_test_log::operator<<( checkpoint const& cp ) { if( m_pimpl->m_entry_in_progress ) m_pimpl->set_checkpoint( cp ); // LINE 301 return *this; } //____________________________________________________________________________// I cannot see any complexity here that could lead to an assertion. As I learned from the Boost Users Mailinglist archive such assertions seem to be common problems with Sun's forte 6.2 and 7 compilers. O.k. When the build above was finished I got at least the libs. built in debug mode obvisously completely installed below /opt/boost_1.30.0/libs/test/build/bin/<libs>/sunpro/... To get the header files installed I ran $ bjam -sTOOLS=sunpro -sBUILD=install But this command did not install the header files which would be required to use the test library. Instead a complex directory structure was created below ../sunpro/install. Is there no way to automatically get all the header files that belong to the test lib plus the other boost header files used by this lib installed automatically? Many thanks in advance for any hint. Regards, Adalbert Perbandt.

2 5

Forward lookahead - abysmal failure
by noamxnoam 15 Jun '03

15 Jun '03

Hello all, Tried to use the forward lookahead asserts, both positive and negative and could not make a match. Is there some sample code anywhere or a tip to explain where I went wrong? Thanks, Noam

2 3

RE: [Boost-Users] Agree totally.
by Jim.Hyslop 15 Jun '03

15 Jun '03

Dan Dimerman [mailto:yg-boost-users@gmane.org] wrote: > Can anyone who successfuly wrote some code with BGL post it > somewhere ? I presume you're asking because you are having problems writing code with the BGL. Rather than ask for someone to post code, why not tell us the problem you are having? Oh, by the way - the subject line really should have something to do with the body of the message. At least, that's the traditional way of doing things and it works quite well ;=) -- Jim

2 1

RE: [Boost-Users] Regex in a service..
by Koss, Loren 15 Jun '03

15 Jun '03

John, Thanks for the response. How do you deal with breakpoints within a service? I'm compiling then starting the service from the service control manager. Will I still be able to debug it? Loren -----Original Message----- From: John Maddock [mailto:john_maddock@compuserve.com] Sent: Friday, June 13, 2003 3:22 AM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] Regex in a service.. > I seem to be having a difficult time using the Regex class in a > service. It works wonderfully in a regular app. Can anyone help me > out.. Basically, instantiating a regex class raises an exception. > Any thoughts? Not unless you can tell me what exception and where - if you're using the vc ide then set it to break on OS and C++ exceptions. John. Yahoo! Groups Sponsor <http://us.adserver.yahoo.com/l?M=247865.3425083.4707139.1261774/D=egroupmai l/S=:HM/A=1482387/rand=220444082> Info: <http://www.boost.org <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! <http://docs.yahoo.com/info/terms/> Terms of Service. [Non-text portions of this message have been removed]

3 2

"Unresolved externals" building MSVC 6.0 boost_1_30_0
by Peter Hug 13 Jun '03

13 Jun '03

When trying to build boost_1_30_0 as follows: vcvars32.bat bjam "-sTOOLS=msvc" I get some link errors: cpp_main.obj : error LNK2001: unresolved external symbol "int __cdecl cpp_main(i nt,char * * const)" (?cpp_main@@YAHHQAPAD@Z) test_main.obj : error LNK2001: unresolved external symbol "int __cdecl test_main (int,char * * const)" (?test_main@@YAHHQAPAD@Z) unit_test_main.obj : error LNK2001: unresolved external symbol "class boost::uni t_test_framework::test_suite * __cdecl init_unit_test_suite(int,char * * const)" (?init_unit_test_suite@@YAPAVtest_suite@unit_test_framework@boost@@HQAPAD@Z) And the tool finishes telling me these not so great news: ...failed updating 12 targets... Well I'm new but after spending two days trying to work out what the heck goes on, I'm none the wiser!

2 3

Re: RegEx Windows vs Linux
by Mark Sizer 13 Jun '03

13 Jun '03

On a whim, I tried changing 'boost::cmatch' to 'boost::smatch'. That fixed my problem. I'd appreciate it if someone would tell me what was going on, though. Thanks, - Mark

2 1

Regex in a service..
by lorenkoss12 13 Jun '03

13 Jun '03

I seem to be having a difficult time using the Regex class in a service. It works wonderfully in a regular app. Can anyone help me out.. Basically, instantiating a regex class raises an exception. Any thoughts? Thanks Loren

2 1

Spirit for C++ style if expressions
by Vincent Finn 12 Jun '03

12 Jun '03

Hi, I am thinking of using spirit for C++ style expressions and am wondering if it is the way to go What I have will be something like ( (A != 192) AND ( (V > 0) AND (V < "89") ) ) What I need is to be able to parse this replace the AND, > etc... with operations, replace string numbers with real numbers and then apply the operation to a large number of A and V. I would have thought this would be quite a common usage but I haven't seem any samples doing it of partictuar importance is the delayed evaluation Anyone have an example of this? Vin

2 1

MSVC 6.0 SP5: INTERNAL COMPILER ERROR
by Peter 12 Jun '03

12 Jun '03

Arghhhh.... c:\Development\Libraries\boost\boost_1_30_0\boost\iterator_adaptors.hpp(872) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information c:\Development\Libraries\boost\boost_1_30_0\boost\date_time\date_parsing.hpp (27) : see reference to class template instantiation 'boost::iterator_adaptor<class boost::detail::token_iterator_base<char const *>,class boost::detail::tokenizer_policy<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,class boost::char_delimiters_separator<char,struct std::char_traits<char> > >,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const *,struct std::forward_iterator_tag,int>' being compiled

3 2

boost::condition and lock concept
by db10www 12 Jun '03

12 Jun '03

I have created a mutex class which is a model of the mutex concept. I also have lock classes for this mutex which models the lock concept (e.g. called CMyLock). (The reason for this is to implement a read/write mutex and associated read and write locks) According to the boost documentation I should be able to use this lock with the boost::condition but I get a compile time error:- 'm_mutex' : is not a member of 'CMyLock' This is due to the condition::wait method defined in condition.hpp making a reference to lock.m_mutex Surely boost::condition only needs a lock object to be an instance of a class which is a model of lock. The lock concept makes no reference to a member variable called m_mutex. Is this a bug of boost::condition or am I doing something wrong. Any ideas? Many thanks.

2 1

Struggling with bind
by Paul Thompson 12 Jun '03

12 Jun '03

Hi all. I've been using boost::bind to work around deficiencies with std::mem_fun_ref and std::bind2nd under MSVC6. I have a class called CDocumentAttachments which had a member function thus: HINSTANCE Execute(LPCTSTR verb) const; I was using bind with this as follows: for_each(filenames.begin(), filenames.end(), bind(&CDocumentAttachments::Execute, _1, _T("print"))); "filenames" is a const vector of CDocumentAttachments objects. This worked fine. A little later on in development, I changed the function signature for CDocumentAttachments::Execute to: HINSTANCE Execute(LPCTSTR verb, bool visible) const; How will I pass the extra bool to bind? I can't find any examples of passing more than one parameter to a member function. I thought about (among many others) for_each(filenames.begin(), filenames.end(), bind(&CDocumentAttachments::Execute, _2, _T("print"), false)); but the compiler (VC6) complains with two of the following: k:\vc\include\boost\bind.hpp(760) : error C2679: binary '[' : no operator defined which takes a right-hand operand of type 'const class boost::arg<2>' (or there is no acceptable conversion) k:\vc\include\boost\bind\bind_template.hpp(33) : see reference to function template instantiation 'struct HINSTANCE__ *__cdecl boost::_bi::evaluator3<struct HINSTANCE__ *>::eval(const class boost::_bi::list3<class boost::arg<2>,class boost:: _bi::value<char *>,class boost::_bi::value<bool> > &,struct boost::_mfi::cmf2<struct HINSTANCE__ *,class CDocumentAttachments,char const *,bool>,class boost::_bi::list1<class CDocumentAttachments const &> &)' being compiled I know I'm being really thick here, and I'm sure there's something really obvious that I'm missing, but reading through the documentation hasn't helped me. Thank you very much. Paul -- Paul Thompson Programmer McLellan Software Design Ltd.

2 3

Re: [crc] Simple example please
by Daryle Walker 12 Jun '03

12 Jun '03

On Tuesday, June 10, 2003, at 9:08 AM, Vladimir Prus wrote: [SNIP] > Here's the function that I use for the same purpose. Might not be > optimal, but works: > > unsigned file_crc(const string& name) > { > #if defined(__GNUC__) && __GNUC__ < 3 > ifstream ifs(name.c_str(), ios::binary); > #else > ifstream ifs(name.c_str(), ios_base::binary); > #endif > if (!ifs) > return 0; > else { > using namespace boost; > > crc_32_type crc32; > int c; > while( (c = ifs.rdbuf()->sbumpc()) != -1) > crc32.process_byte(char(c)); > return crc32.checksum(); > } > } > > > I believe some example of this kind should be included... Daryle, what > do you think? I'll consider it. [A few hours pass...] How about something like this: //================================================================ #include <cstdlib> #include <exception> #include <fstream> #include <ios> #include <iostream> #include <ostream> #include <boost/crc.hpp> #ifndef BLOCK_SIZE #define BLOCK_SIZE 1024 #endif int main ( int argc, char const * argv[] ) try { boost::crc_32_type result; // Loop over each file argument for ( int i = 1 ; i < argc ; ++i ) { std::ifstream ifs( argv[i], std::ios_base::binary ); if ( ifs/*std::ifstream ifs(argv[i], std::ios_base::binary)*/ ) { /*char buffer[ BLOCK_SIZE ]; std::streamsize len; while ( 0 < (len = ifs.readsome( buffer, BLOCK_SIZE )) ) { result.process_bytes( buffer, len ); }*/ char c; while ( ifs.get(c) ) { result.process_byte( c ); } } else { std::cerr << "Failed to open file '" << argv[i] << "'." << std::endl; } } std::cout << std::hex << result.checksum() << std::endl; return EXIT_SUCCESS; } catch ( std::exception &e ) { std::cerr << "Found an exception with '" << e.what() << "'." << std::endl; return EXIT_FAILURE; } catch ( ... ) { std::cerr << "Found an unknown exception." << std::endl; return EXIT_FAILURE; } //================================================================ Note in the "if" statement, I had the construction in it. However, neither one of my compilers took it! Moving the constructor call worked, but I thought my original method should be accepted. One compiler finished after the above 'fix'. The other (a variant of GCC 3.1) complained about missing symbols at link-time; it could not create the global objects hidden in Boost.CRC. (I haven't worked on the code in a long time; there could be quirks on compilers written after Boost.CRC.) When I ran the program under the compiler that worked, the "readsome" function always returned zero! There were no suitable substitutes; the "read" function doesn't tell you how many characters it read (bad if the last block isn't full) and the multi-character "get" functions use delimiters. So this program is stuck at single-character reads at the moment. Maybe I should switch to the stream-buffer method you used. Can you try this out to make sure the problems aren't just mine? Daryle

2 2

RegEx Windows vs Linux
by Mark Sizer 12 Jun '03

12 Jun '03

I compiling the same code on both platforms (same my code, same boost code). Under Windows (MSVC++ 6 w/SP something), this compiles: // these are constructed w/values, it's just ugly here std::string sRegEx(); std::string sMe(); boost::regex regexpPattern( sRegEx ); boost::cmatch mrFound; bool bMatch = boost::regex_search(sMe, mrFound, regexpPattern); Under Linux (gcc 3.3) I get an error message (I added the whitespace): error: could not convert `mrFound' to `boost::match_results< std::__normal_iterator< const char*, std::basic_string< char, std::char_traits<char>, std::allocator<char> > >, std::allocator<char> >&' Digging around a little bit, I found this: template <class iterator, class Allocator> class match_results : yadda yadda and typedef match_results<const char*> cmatch; This certainly SEEMS much simpler than what the error message claims to be looking for. Can anyone help, please? Thanks, - Mark

1 0

Re: [crc] Simple example please
by Daryle Walker 12 Jun '03

12 Jun '03

On Monday, June 9, 2003, at 5:48 PM, Alex Henderson wrote: > I'd like to calculate a value for a cyclic redundancy check (crc) for > a number of files. > > This isn't going to be transmitted anywhere, I simply want to compare > the values to see whether the files are exactly the same. I know I can > simply check byte for byte, but I've got a few thousand files and it's > easier to calculate the crc for each and see whether any are the same > first. > > I've looked at the crc library, but can't get my head round the > example. It seems to test the library rather than show how its used. Yes, the sample program is meant as a test of the library. You can still get an idea of usage from it. There are also short examples in the HTML documentation. > I'm after something like > > std::vector<char> MyStream1; // the whole file (about 500kb) > > boost::SomeCRCTypeThatIsOptimisedForSafetyAndLargeishBlocks<???> x; > > long = x.checkme(MyStream1); > > Could someone please point me to some code where a simple example is > detailed? What's in the documentation is it. Do you have a specific CRC algorithm in mind? If so, you just pick the appropriate template parameters. If not, you can choose one of the samples I provided, like boost::crc_32_type. The optimized CRC function objects can work with a single byte at a time or an array-segment of bytes. By putting your file's data in a std::vector as you have in your example, you limit yourself to just the single-byte computing call, as the elements of a vector may not be contiguous. Just allocate a simple char array and use one of the CRC object's array computing calls or use one of the CRC functions. Based on what you said, I don't think you need the object-wrapping that std::vector gives. Daryle

2 4

Boost::Test v. CppUnit
by Jon Stewart 11 Jun '03

11 Jun '03

Howdy - I've been using CppUnit and various parts of Boost for a little over a year. The 1.3.0 rlease includes support for unit testing, a la CppUnit, JUnit, etc. At first glance, I can't find any fundamental differences between CppUnit and Boost's unit testing framework. I'm sure that CppUnit could benefit from a code review or two by Boost's luminaries, but I'm still surprised that a new framework was created instead of trying to improve CppUnit. Can anyone state a few areas where CppUnit and Boost::test differ? In general, I tend to prefer Boost's solutions over others', but I don't see a clear cut case to be made for Boost over CppUnit, vis a vis unit testing. I'd be happy to change my mind, however. :-) Jon -- Jon Stewart stew1(a)ellipsis.cx

7 8

RE: [Boost-Users] first time boost
by Jim.Hyslop 11 Jun '03

11 Jun '03

G Keshav wrote: > I want to use boost in my MS VIsual Studio project. > Can you please advise stepwise about the procedure. 1) Decide which part of Boost you want to use. 2) download and extract the source from boost.org (follow the instructions there) 3) include the proper headers 4) write your code -- Jim

1 0

first time boost
by G Keshav 11 Jun '03

11 Jun '03

Hi there, I want to use boost in my MS VIsual Studio project. Can you please advise stepwise about the procedure. Thanks and regards, Gagnesh --------------------------------- Do you Yahoo!? Free online calendar with sync to Outlook(TM). [Non-text portions of this message have been removed]

1 0

using shared pointer in a linked data structure
by Zumichu 11 Jun '03

11 Jun '03

Basically I'm having trouble understanding exactly how to use shared_ptr . If I have a class: GraphNode { public: AddChild(shared_ptr<GraphNode> n) { m_Children.push_back(n); shared_ptr<GraphNode> thisptr(this); n->m_Parents.push_back(thisptr); } DeleteChild(shared_ptr<GraphNode> n); private: vector<shared_ptr<GraphNode> > m_Children; vector<shared_ptr<GraphNode> > m_Parents; }; main() { shared_ptr<GraphNode> n1(new GraphNode()); shared_ptr<GraphNode> n2(new GraphNode()); n1->AddChild(n2); } doing it this way gives me a run-time error that seems to have to do with updating the child node's parent vector with the parent node's this pointer. Am I not using the shared_ptr right?

2 1

Re: [crc] Simple example please
by Vladimir Prus 11 Jun '03

11 Jun '03

Daryle, Daryle Walker wrote: > One compiler finished after the above 'fix'. The other (a variant of > GCC 3.1) complained about missing symbols at link-time; it could not > create the global objects hidden in Boost.CRC. (I haven't worked on > the code in a long time; there could be quirks on compilers written > after Boost.CRC.) > > When I ran the program under the compiler that worked, the "readsome" > function always returned zero! There were no suitable substitutes; the > "read" function doesn't tell you how many characters it read (bad if > the last block isn't full) and the multi-character "get" functions use > delimiters. So this program is stuck at single-character reads at the > moment. Maybe I should switch to the stream-buffer method you used. > > Can you try this out to make sure the problems aren't just mine? With gcc 3.3 on Linux, 'readsome' variant, 'get' variant and 'sbumpc' variant all produce the same output. However, I'm not sure that 'readsome' variant should work. Here's what "man std::iostream" tells about 'readsome'. if A > 0, extracts min(A,n) [ A = rdbuf()->in_avail() ] ... The goal is to empty the current buffer, and to not request any more from the external input sequence controlled by the streambuf. Concerning 'in_avail()': If a read position is available, returns the number of characters available for reading before the buffer must be refilled. Otherwise returns the derived showmanyc(). Lastly, about 'showmanyc()': Base class version does nothing, returns zero. So, this all leads to conclusion that 'readsome' is required to read all characted currently available in stream buffer, but may ignore anything else. I believe that the right way is to use 'read' function, together with 'gcount()' with tells how many characters were read by the last unformatted input operation. The main loop will become: do { ifs.read(buffer, BLOCK_SIZE); result.process_bytes(buffer, ifs.gcount()); } while(ifs); Of course, this variant produces the same results for me. Can you try with your compiler? - Volodya P.S. In fact, I still don't understand what 'in_avail()' is good for...

1 0

Re: [crc] Simple example please
by Vladimir Prus 11 Jun '03

11 Jun '03

Daryle, Daryle Walker wrote: > One compiler finished after the above 'fix'. The other (a variant of > GCC 3.1) complained about missing symbols at link-time; it could not > create the global objects hidden in Boost.CRC. (I haven't worked on > the code in a long time; there could be quirks on compilers written > after Boost.CRC.) > > When I ran the program under the compiler that worked, the "readsome" > function always returned zero! There were no suitable substitutes; the > "read" function doesn't tell you how many characters it read (bad if > the last block isn't full) and the multi-character "get" functions use > delimiters. So this program is stuck at single-character reads at the > moment. Maybe I should switch to the stream-buffer method you used. > > Can you try this out to make sure the problems aren't just mine? With gcc 3.3 on Linux, 'readsome' variant, 'get' variant and 'sbumpc' variant all produce the same output. However, I'm not sure that 'readsome' variant should work. Here's what "man std::iostream" tells about 'readsome'. if A > 0, extracts min(A,n) [ A = rdbuf()->in_avail() ] ... The goal is to empty the current buffer, and to not request any more from the external input sequence controlled by the streambuf. Concerning 'in_avail()': If a read position is available, returns the number of characters available for reading before the buffer must be refilled. Otherwise returns the derived showmanyc(). Lastly, about 'showmanyc()': Base class version does nothing, returns zero. So, this all leads to conclusion that 'readsome' is required to read all characted currently available in stream buffer, but may ignore anything else. I believe that the right way is to use 'read' function, together with 'gcount()' with tells how many characters were read by the last unformatted input operation. The main loop will become: do { ifs.read(buffer, BLOCK_SIZE); result.process_bytes(buffer, ifs.gcount()); } while(ifs); Of course, this variant produces the same results for me. Can you try with your compiler? - Volodya P.S. In fact, I still don't understand what 'in_avail()' is good for...

1 0

RE: [Boost-Users] to_simple_string and Windows?
by Tom Matelich 11 Jun '03

11 Jun '03

UNICODE is enabled by the _UNICODE define. Assuming you're still using MSVC 6 (remember to rebuild all often since your dependencies may not getting generated correctly), just go to your Project/Settings/C/C++ tab and in Preprocessor definitions, remove the UNICODE symbol from the list. Otherwise, remove it from your Makefile. > -----Original Message----- > From: adutoit [mailto:adutoit@stonethree.com] > Sent: Tuesday, June 10, 2003 7:01 AM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] to_simple_string and Windows? > > > It is not a compile-time error, but rather a run-time error. > Ie. if I compile any program which utilises > boost::to_simple_string with any > optimisation whatsoever; it simply aborts at the point where I do my > function call to "to_simple_string". That is irrespective of > my using a > type date or ptime as the function argument... > > I must stress again that "to_simple_string" works fine when I > compile it in > Linux. > > O, another question I have. Where do I disable Unicode > support (wchar_t > usage in fact!) alltogether for Boost? > > Previously I had great fun with lexical_cast.hpp which > utilised wchar_t > versions of some of the streaming operators because I had a > silly UNICODE > define as part of my project options. The solution was to > use /Zc:wchar_t > project option in M$VC6. > > But UNICODE defined caused problems in network browsing code > I used which > `normally' returned a LPSTR instead of the LPWSTR if UNICODE > is defined. > Long story. I did a temp hack in lexical_cast.hpp by > # define DISABLE_WIDE_CHAR_SUPPORT > #undef BOOST_NO_INTRINSIC_WCHAR_T > and getting rid of the redefinition of BOOST_NO_INTRINSIC_WCHAR_T. > > Now is there a way to do this cleanly, compile-time so that I > do not need to > keep on hacking the source code? > > Greetings, > Andre. > > > > ----- Original Message ----- > From: "Jeff Garland" <jeff(a)crystalclearsoftware.com> > To: <Boost-Users(a)yahoogroups.com> > Sent: Tuesday, June 10, 2003 2:51 PM > Subject: RE: [Boost-Users] to_simple_string and Windows? > > > > > Darn; here I go replying to my own post again... > > > Anyway; so far I have narrowed the problem down to one of > optimisation. > I > > > did a debug compilation and had no problem. A moment of > reflection led > me > > > to the conclusion that optimisation might have something > to do with it. > For > > > the record; I am using Boost in Windows, with Visual > Studio as IDE only, > and > > > the Intel 7.0 compiler. Oh; and STLport instead of > Windows' crappy STL > > > implementation. > > > > > > I.e. turning on "Maximise speed" optimisation causes > "to_simple_string" > to > > > fail on my build system. > > > > > > I'll try to setup the simplest proggie I can to > illustrate this problem. > > > > > > Any thoughts? > > > > I'm not aware of anyone else having a problem. Perhaps you can post > > the details of the compilation failure? > > > > Jeff > > > > > > Info: <http://www.boost.org> > > Wiki: > <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Get A Free Psychic Reading! Your Online Answer To Life's > Important Questions. > http://us.click.yahoo.com/Lj3uPC/Me7FAA/ySSFAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

2 1

newbie boost thread build under Linux help
by Mark Sizer 11 Jun '03

11 Jun '03

I had such success with Boost under Windows, that I'm now trying to get it up and running under Linux. This is not a happy experience. I got it to work, but this can't be the way it's supposed to be done: I'm using boost_1_30_0. I installed the bjam RPM (boost_jam_3.1.4-1.i386.rpm). bjam "-sTOOLS=gcc" from a bash command line. I had all sorts of very strange error messages, so I set about upgrading my Linux environment. I boostrapped the gcc 3.3 compiler (I had 2.6 something). Same error messages. I upgraded libstdc++ to libstdc++-v3.0.97-gcc-3.1.x.tar.gz (I'm seeing the gcc version mismatch as I type this, but it is the latest libstdc++). The "merging into an existing compiler" instructions seemed really complicated so I installed it and re-bootstrapped the compiler. Got a more sensible error message: Unknown compiler version please run the configure tests and report the results. (from gnu.hpp) I hacked gnu.hpp to allow the 3.3 compiler. The error message changed to being unable to find the std:: headers (first one was <utility> from select_stdlib.hpp). I seem to have at least four versions: /usr/include/g++-2/utility /usr/include/g++-3/utility /usr/include/g++-v3/utility (judging by the dates, this seems the correct one) /usr/local/include/c++/utility Obviously, none of these are in the compiler's include path. bjam "-sTOOLS=gcc" "-sGCC_INCLUDE_DIRECTORY=/usr/include/g++-v3" Wasn't helpful: "bits/c++config.h" can't be found. That's in /usr/include/g++-v3/i686-pc-linux-gnu. However, there doesn't seem to be a way to specify more than one include directory (neither multiple "-s" nor delimited paths in a single "-s" worked). So I copied everything from i686-pc-linux-gnu/bits to ../../bits. It built. This can't be normal. How is this process supposed to work? Thanks, - Mark

2 1

Mutex scoped_lock compile errors
by Darren Vincent Hart 10 Jun '03

10 Jun '03

Esteemed Boost Gurus, I am trying to compile a method with a scoped_lock call. If I use a mutex object declared in the class implementation file (logger.cpp) it builds, if I use a mutex of the same type declared as a private member of the logger class (in logger.h), I get the following compiler error: logger.cpp: In member function `void pel::logger::info(const std::string&, const std::string&, int, const std::string&) const': logger.cpp:36: error: no matching function for call to ` boost::detail::thread::scoped_lock<boost::mutex>::scoped_lock(const boost::mutex&)' /usr/include/boost/thread/detail/lock.hpp:62: error: candidates are: boost::detail::thread::scoped_lock<boost::mutex>::scoped_lock(const boost::detail::thread::scoped_lock<boost::mutex>&) /usr/include/boost/thread/detail/lock.hpp:67: error: boost::detail::thread::scoped_lock<Mutex>::scoped_lock(Mutex&, bool = true) [with Mutex = boost::mutex] make: *** [logger.o] Error 1 The relevant method from the implementation file is as follows: void logger::info(const std::string& msg, const std::string& file, int line, const std::string& function) const { // io_mutex is declared above in the pel namespace boost::mutex::scoped_lock scoped_lock(io_mutex); // no problem // mutex is a private member of the logger class boost::mutex::scoped_lock scoped_lock2(mutex); // line 36, fails std::cout << "...blah..." << std::endl; } Can someone explain why these are treated differently by the compiler ? Thanks, Darren Hart dvhart(a)byu.edu

3 4

RE: [Boost-Users] Struggling with bind
by Jean-Marc Prud'homme 10 Jun '03

10 Jun '03

Hi Paul, _1 is a placeholder argument. When you write bind(&CDocumentAttachments::Execute, _1, _T("print")) you are creating a functor that can be called with a single argument of type CDocumentAttachments. This is what is required by the for_each algorithm. It is equivalent to bind<HINSTANCE>(mem_fn(&CDocumentAttachments::Execute), _1, _T("print")) Look at the mem_fn doc. You still need this kind of functor if you add more arguments to CDocumentAttachments::Execute. This should create the functor you need bind(&CDocumentAttachments::Execute, _1, _T("print"), false) Hope this helps, Jean-Marc -----Original Message----- From: Paul Thompson [mailto:friedegg@ntlworld.com] Sent: Tuesday, June 10, 2003 7:54 AM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Struggling with bind Hi all. I've been using boost::bind to work around deficiencies with std::mem_fun_ref and std::bind2nd under MSVC6. I have a class called CDocumentAttachments which had a member function thus: HINSTANCE Execute(LPCTSTR verb) const; I was using bind with this as follows: for_each(filenames.begin(), filenames.end(), bind(&CDocumentAttachments::Execute, _1, _T("print"))); "filenames" is a const vector of CDocumentAttachments objects. This worked fine. A little later on in development, I changed the function signature for CDocumentAttachments::Execute to: HINSTANCE Execute(LPCTSTR verb, bool visible) const; How will I pass the extra bool to bind? I can't find any examples of passing more than one parameter to a member function. I thought about (among many others) for_each(filenames.begin(), filenames.end(), bind(&CDocumentAttachments::Execute, _2, _T("print"), false)); but the compiler (VC6) complains with two of the following: k:\vc\include\boost\bind.hpp(760) : error C2679: binary '[' : no operator defined which takes a right-hand operand of type 'const class boost::arg<2>' (or there is no acceptable conversion) k:\vc\include\boost\bind\bind_template.hpp(33) : see reference to function template instantiation 'struct HINSTANCE__ *__cdecl boost::_bi::evaluator3<struct HINSTANCE__ *>::eval(const class boost::_bi::list3<class boost::arg<2>,class boost:: _bi::value<char *>,class boost::_bi::value<bool> > &,struct boost::_mfi::cmf2<struct HINSTANCE__ *,class CDocumentAttachments,char const *,bool>,class boost::_bi::list1<class CDocumentAttachments const &> &)' being compiled I know I'm being really thick here, and I'm sure there's something really obvious that I'm missing, but reading through the documentation hasn't helped me. Thank you very much. Paul -- Paul Thompson Programmer McLellan Software Design Ltd. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

to_simple_string and Windows?
by adutoit 10 Jun '03

10 Jun '03

Hi. I have used the boost::date_time library in Linux with no problems, but the same can not be said of my experience with it in Windows... My current pain in Windows is with the "to_simple_string" method used to convert a boost::date_time value to guess what, a string. This works fine in Linux, but not in stupid Windows. The following line just borks: std::cout << to_simple_string(date(2003,4,30)) << std::endl; Any little unknown configuration tricks etc. I need to be aware of here? Has anyone used the "to_simple_string" method without problems in Windows? I'll appreciate any help in this regard. Greetings, A. [Non-text portions of this message have been removed]

2 3

New file uploaded to Boost-Users
by Boost-Users＠yahoogroups.com 10 Jun '03

10 Jun '03

Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the Boost-Users group. File : /uBLA Performance 2.pdf Uploaded by : sumohurd <matt(a)finray.net> Description : Simplistic uBLA Performance chart, second version You can access this file at the URL http://groups.yahoo.com/group/Boost-Users/files/uBLA%20Performance%202.pdf To learn more about file sharing for your group, please visit http://help.yahoo.com/help/us/groups/files Regards, sumohurd <matt(a)finray.net>

1 0

[crc] Simple example please
by Vladimir Prus 10 Jun '03

10 Jun '03

Hi Alex, > I'd like to calculate a value for a cyclic redundancy check (crc) for a > number of files. > > This isn't going to be transmitted anywhere, I simply want to compare the > values to see whether the files are exactly the same. I know I can simply > check byte for byte, but I've got a few thousand files and it's easier to > calculate the crc for each and see whether any are the same first. Here's the function that I use for the same purpose. Might not be optimal, but works: unsigned file_crc(const string& name) { #if defined(__GNUC__) && __GNUC__ < 3 ifstream ifs(name.c_str(), ios::binary); #else ifstream ifs(name.c_str(), ios_base::binary); #endif if (!ifs) return 0; else { using namespace boost; crc_32_type crc32; int c; while( (c = ifs.rdbuf()->sbumpc()) != -1) crc32.process_byte(char(c)); return crc32.checksum(); } } I believe some example of this kind should be included... Daryle, what do you think? HTH, Volodya

3 2

Lapack for uBlas
by Achim Domma 10 Jun '03

10 Jun '03

Hi, does somebody know a Lapack implementation which can be used with uBlas? I need a solver for an linear equation system and would prefer to not rewrite it by hand. Achim

2 3

vector ranges
by cerenoc 10 Jun '03

10 Jun '03

Hello, I just wanted to clarify if the following behavior is correct. As far as I understood, in matrix and vector range function, the 1st argument defines the starting point and the second defines the length of the range. The following code I ran on gcc 2.96 shows that the behavior is different when starting at 0 and starting somewhere else. Is this a bug, or am I misunderstanding something? Thank you, Julian // define some vector r(3) std::cout << r << "\n\n"; boost::numeric::ublas::vector<double> rr = r(range(0, 0)); std::cout << rr << "\n\n"; rr = r(range(0, 1)); std::cout << rr << "\n\n"; rr = r(range(0, 2)); std::cout << rr << "\n\n"; rr = r(range(0, 3)); std::cout << rr << "\n\n"; //rr = r(range(1, 0)); // THIS RESULTS IN ASSERTION ERROR //std::cout << rr << "\n\n"; rr = r(range(1, 1)); std::cout << rr << "\n\n"; rr = r(range(1, 2)); std::cout << rr << "\n\n"; rr = r(range(1, 3)); std::cout << rr << "\n\n"; OUTPUT: [3](0,1,2) [0]() [1](0) [2](0,1) [3](0,1,2) [0]() [1](1) [2](1,2)

3 2

confused by matrix assignment
by cerenoc 10 Jun '03

10 Jun '03

Hi, I'm sorry I am new to this and also not up on the math notation you guys are using. I am confused by the definitions of slices and strides. I am trying to perform a reasonably simple operation of e.g. assigning a vector v(2) to a (sub)matrix m(3,3). In matlab notation, for instance: m = 0 1 2 3 4 5 6 7 8 v = 15 16 m(2, 1:2) = v Resulting in m = 0 1 2 15 16 5 6 7 8 What is the best way to do this with uBLAS? Thank you very much Julian

2 2

RE: [Boost-Users] Re: Tree Object Needed!
by Jim.Hyslop 09 Jun '03

09 Jun '03

Hossein Haeri wrote: > Does the method you mentioned work for my problem in > which there is no ordering? If yes, please explain it > in more detail (with an example). Trees are generally used with ordered sequences, aren't they? If your data are not ordered, then how do you propose to insert them into the tree? What, well, order would they appear in the tree? If you provide a little more information about the problem domain, we can help you figure out the best container to use. -- Jim

4 8

RE: [Boost-Users] Re: Tree Object Needed!
by Mark Storer 09 Jun '03

09 Jun '03

I don't mean to come off like a hard case, and I may well be wrong but... This whole line of questioning has that "homework assignment" smell to it. The initial question was _highly_ school-related: > I need to have some template doing the jobs of an > ordinary BST (Binary Search Tree). Nothing that fancy, > but something at the level we all have been educated > in CS1/FCS1, or similar courses. Does boosts > repository contain such an object? The utter lack of background detail leads me to believe that this is just a toy problem... a homework assignment. And then there's the yahoo email address... most proffesional programmers have @mybusiness addresses, though that doesn't mean everyone here is a proffesional. Oh, and the final bit of oddness: > Why don't I write it myself? Simply, because I want to > optimise the time! How is waiting a week or so for some mailing list to hand you an answer "optimizing the time"? This has just been bothering me, I felt the need to speak out. If I'm wrong, then I offer my heartfelt appoligies. This may be what Mr. Hyslop was trying to dig at, I'm just not a patient or subtle person. And I don't mind appologizing for my mistakes (lots of practice, as you might imaging with this sort of behavior). --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typdef std::disclaimer<Cardiff> Discard;

2 1

Threads Library
by Brian Plummer 09 Jun '03

09 Jun '03

Atomic operations (atomic_add, atomic_subtract etc) are not handled in the Boost Threads library. My guess is that this is because this cannot be accomplished, based on what I know about this topic (which isn't too much), in a portable way. Is this the reason? If not, having these operations in the Threads library would be a big benefit. Thanks, Brian

2 1