- Boost-users - lists.boost.org

tuple vs SGI/MIPSPro
by Kevin Wheatley 10 Oct '02

10 Oct '02

Hi, I'm starting to get to grips with boost and in particular on the SGI platform. I was trying to use the boost::tuples and found that with the SGI compiler v7.3.1.3m I was getting the following error CC -LANG:std -I/images/src/boost/from_cvs/boost -I/images/src/boost/from_cvs/boost/boost/compatibility/cpp_c_headers/ -o tupple tupple.cpp cc-1239 CC: ERROR File = /images/src/boost/from_cvs/boost/boost/tuple/tuple_io.hpp, Line = 113 "close" is ambiguous. case close : c = i.widen(')'); break; ^ A template was detected during header processing. instantiation of "char boost::tuples::detail::format_info::get_manipulator(std:: basic_ios<char, std::char_traits<char>> &, boost::tuples::detail::format_info::manipulator_type)" at line 437 instantiation of "std::basic_istream<char, std::char_traits<char>> &boost::tuples::detail::extract_and_check_delimiter(std:: basic_istream<char, std::char_traits<char>> &, boost::tuples::detail::format_info::manipulator_type)" at line 511 instantiation of "std::basic_istream<char, std::char_traits<char>> &boost::tuples::operator>>(std::basic_istream<char, std::char_traits<char>> &, boost::tuples::cons<double, boost::tuples::detail::map_tuple_to_cons<double, double, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type>::type> &)" at line 630 of "/usr/include/CC/stl_iterator.h" instantiation of "void std::istream_iterator<density, char, std::char_traits<char>, ptrdiff_t>::_M_read()" at line 604 of "/usr/include/CC/stl_iterator.h" instantiation of "std::istream_iterator<density, char, std::char_traits<char>, ptrdiff_t>::istream_iterator(std::istream_iterator<densit y, char, std::char_traits<char>, ptrdiff_t>::istream_type &)" at line 19 of "tupple.cpp" I'm working with the code from CVS because it compiled better on the SGI, I looked at the code, and basically I think it's getting confused due to my test program including a "using namespace std;" so I modified the tuple_io.hpp to specifically mention detail::format_info::close rather than the bare close and then my example works (I also made explicit the other cases of the switch statement). Is there a more recomended way of doing this? Almost everywhere else in that file the full specification of the enum is given. My code is something like: #include <vector> #include <iostream> #include <algorithm> #include <numeric> #include <iterator> #include "boost/tuple/tuple.hpp" #include "boost/tuple/tuple_comparison.hpp" #include "boost/tuple/tuple_io.hpp" using namespace std; using namespace boost::tuples; typedef tuple<double, double, double> density; int main() { vector<density> v; istream_iterator<density> in(cin); istream_iterator<density> eos; ostream_iterator<density> out(cout); density total; copy(in, eos, back_inserter(v)); copy(v.begin(), v.end(), out); cout << endl; return 0; } Thanks Kevin -- | Kevin Wheatley | These are the opinions of | | Senior Do-er of Technical Things | nobody and are not shared | | Cinesite (Europe) Ltd | by my employers |

1 0

Building regex on AIX w VisualAge
by Tim Daplyn 10 Oct '02

10 Oct '02

Can anyone assist me with this? I've tried every compiler option I can think of combined with disabling BOOST support for a whole bunch of stuff and I still can't get this library to build on AIX. There are just too many compile errors, and I was really hoping I wouldn't have to go modifying the source.

2 1

How to Create Calculated Internal Properties?
by Phillip Ratzloff 10 Oct '02

10 Oct '02

I wish to create an internal calculated property that is derived from existing properties in a vertex or edge. Id also like to be able to access it like any other internal property. For instance, I want a vertex property called weight_sum that would sum the weights for all the out edges and return the answer. I want to be able to use a statement "get(vertex_weight_sum,G,v)" to get the value. Later on, I may decide that I want to cache the value on the vertex (like a normal property) and existing code should work without change. I have been unable to figure out any template class specializations to do this. Additionally, if I try to define the property using the property<> template in the graph declaration it reserves storage for the property, which is undesired. Am I missing something? Is there a way to define a calculated internal property that doesnt reserve storage?

1 0

using weak_ptr and shared_ptr for singleton
by Stephan Born 09 Oct '02

09 Oct '02

Hello! I do some experiments on shared_ptr and weak_ptr. So I tried to use them for a singleton-class, which does not need an explicit singleton::release_instance method. The singleton-instance will be destroyed everytime the last external shared_ptr holding the instance goes out of scope. Is this a valid usage for weak_ptr? Are there any traps I do not see using these smart_ptrs in this context? The drawback of using shared_ptr with singleton is the need for a public destructor. But this is dangerous....it is possible to write singleton::singleton_ptr first_ptr = singleton::instance(); delete first_ptr.get(); Declaring the destructor as private is only possible when defining boost::checked_delete as friend of the singleton-class. ( there is a thread on comp.lang.c++.moderated with the topic 'specialization of function template as friend with MSVC6SP5 not possible' which deals with this problem of friendship... ) But then it is still possible to write the following code singleton::singleton_ptr first_ptr = singleton::instance(); boost:checked_delete( first_ptr.get() ); OK, it's very unlikely to do it by chance, but it is possible. Is there a way to allow destruction of the instance only to shared_ptr? <code> #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <boost/utility.hpp> class singleton : boost::noncopyable { public: typedef boost::shared_ptr< singleton > singleton_ptr; static singleton_ptr instance() { singleton_ptr tmp; if( s_instance.expired() ) { tmp.reset( new singleton ); s_instance = tmp; } else { tmp = boost::make_shared( s_instance ); } return tmp; } void foo() { // do something i++; } // like to make it private in order to prohibit delete on it, // but boost::shared_ptr<> can't handle it....so sad :( ~singleton(){}; private: typedef boost::weak_ptr< singleton > internal_singleton_ptr; singleton(){}; int i; static internal_singleton_ptr s_instance; }; singleton::internal_singleton_ptr singleton::s_instance; int main() { { singleton::singleton_ptr first_ptr = singleton::instance(); { singleton::singleton_ptr second_ptr = singleton::instance(); second_ptr->foo(); } first_ptr->foo(); } singleton::singleton_ptr another_ptr = singleton::instance(); another_ptr->foo(); return 0; } </code> Regards, Stephan -- --------------------------------------------------------------- Dipl.-Inf. (FH) Stephan Born | beusen Solutions GmbH fon: +49 30 549932-0 | Landsberger Allee 366 fax: +49 30 549932-21 | 12681 Berlin mailto:stephan.born@beusen.de | Germany --------------------------------------------------------------- PGP-Key verfügbar | PGP-Key available ---------------------------------------------------------------

3 6

Regex Access violation in BCB5
by Tim Daplyn 09 Oct '02

09 Oct '02

I've used a previous version of the boost regex library before and have just upgraded to the latest version. Built the libs and dll fine, but now I get a A/V when calling any boost code. I've even set up a vanilla console app with all the Borland default settings and the following code: #include "boost/regex.hpp" int main(int argc, char* argv[]) { boost::wregex regExpr2(L"bill.*"); bool result; result = boost::regex_match(L"freddy", regExpr2); result = boost::regex_match(L"billabong", regExpr2); return 0; } And it blows up on the first regex_match!! I can't figure out what's going on - I know it's linking to the _sdi version of the lib because it complains about it being missing if I remove it, and the dlls are on the path and are loaded as soon as this mini-app starts up. It makes no difference whether I build through the command line or in BCB GUI. Please help!! Thanks, Tim D.

1 0

building smart_ptr as a separate library
by Nik Kolev 07 Oct '02

07 Oct '02

Hi everybody: Is it possible to build/integrate just the smart_ptr part of boost. If yes I would greatly apreciate your suggestions on how this is to be accomplished. Thanks, Nik

2 1

RE: [Boost-Users] Iterator adapters and maps
by scleary＠jerviswebb.com 04 Oct '02

04 Oct '02

I think the problem is in the definition of Select2ndRef; if you use: template<class pair_type> struct Select2ndRef { typedef pair_type argument_type; typedef typename pair_type::second_type result_type; result_type & operator()(pair_type & source) const { return source.second; } }; then your code will compile. This has to do with an unusual meaning of "result_type" for projection iterator adaptors. -Steve

2 1

Use a shared_ptr as a 'backpointer'?
by dick.bridges＠tais.com 04 Oct '02

04 Oct '02

I run into situations where it's useful for an object to have a 'backpointer' to the object instance that created it (example below). Is there a pattern/idiom for doing this using shared_ptr? Or maybe I need to re-think the idea of the backpointer in the first place? class Bar; class Foo { public: Foo(Bar* b) : p(b){} private: Foo() : p(0){} shared_ptr<Bar> p; } class Bar { void doit() { new Foo(???); // <<< new Foo(this) obviously won't work. } }

3 2

[BGL]: 2 desgin questions
by Björn Lindberg 03 Oct '02

03 Oct '02

I have two questions regarding the design of the BGL. I'm interested in this to get a better understanding of the design choices, which influences how I use the BGL and how I'm building on it. 1) Why is a lot of the function arguments made by value rather than reference? As an example, consider the BFS algorithm, where the documentation states that "[1] Since the visitor parameter is passed by value, if your visitor contains state then any changes to the state during the algorithm will be made to a copy of the visitor object, not the visitor object passed in. Therefore you may want the visitor to hold this state by pointer or reference." It would be much easier to use the visitor objects for keeping state throughout the algorithm if it was passed by reference instead. 2) Non-constness. It seems impossible to use BGL together with code that is "const-correct". If, for instance, I have a function implementing some kind of examining algorithm on a graph (so the graph is passed to it as const), and this algorithm uses breadth_first_search with a visitor that doesn't modify the graph, it still can't be const when passed to breadth_first_search. This only leaves the options of either (i) casting away constness in the call, which is bad because it could introduce bugs later on, or (ii) leaving out const altogether which is not good either. Maybe I've just misunderstood something and this is possible, or perhaps it is impossible to implement BGL in this way? Björn

2 2

boost build on redhat7.3
by Alkis Evlogimenos 03 Oct '02

03 Oct '02

Hi, I just compiled boost from cvs. I am using an x86 with redhat linux 7.3. I also have STLport 4.5.3 installed. I compiled against STLport using this command: bjam "-sTOOLS=gcc-stlport" "-sSTLPORT_INCLUDE_DIRECTORY=include/stlport" "-sSTLPORT_LIB_DIRECTORY=lib" "-sSTLPORT_ROOT=/usr" and against gcc using the following: bjam "-sTOOLS=gcc" Both builds finish with success (compiling with j4 leaves 2 targets behind but they succeed after a reinvocation). Now I enter status/ and compile regression using the following: g++ -I.. regression.cpp -o regression Modify compiler.cfg to look like: linux gcc-296 GCC 2.96 g++ -c -Wall -W -ftemplate-depth-30 -I%include %source g++ -o boosttmp.exe -Wall -W -ftemplate-depth-30 -I%include %source -lrt GNU <a href="http://gcc.gnu.org/">GCC</a> 2.96 linux gcc-296-stlport GCC 2.96 STLport 4.5 g++ -c -Wall -W -ftemplate-depth-30 -isystem /usr/include/stlport -I%include %source -lstlport_gcc g++ -o boosttmp.exe -Wall -W -ftemplate-depth-30 -isystem /usr/include/stlport -I%include %source -lrt -lstlport_gcc GNU <a href="http://gcc.gnu.org/">GCC</a> 2.96 <a href="http://www.stlport.org/">STLport</a> 4.5 and finally run regression as follows: ./regression -o cs-rh7.3.html Attached is a gzipped log of the regression run. The text was 429Kb so I didn't paste it to this email :-) It seems that the testing frameworks has some problems (libs/config/test/config_test.cpp fails). Am I doing something wrong here? Any help is appreciated. Thanks, -- Alkis [Non-text portions of this message have been removed]

1 1