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

Re: [Boost-users] [multi_index] Problem with find() and Hashed_Index
by JOAQUIN LOPEZ MU?Z 03 Dec '05

03 Dec '05

Hello Martin, ----- Mensaje original ----- De: Martin Higham <martinh(a)gmail.com> Fecha: Sábado, Diciembre 3, 2005 11:42 am Asunto: [Boost-users] [multi_index] Problem with find() and Hashed_Index > I have created a multi_index_container inline with one ordered_unique > index and one hashed_unique index as demonstrated in the > documentation > (http://www.boost.org/libs/multi_index/doc/advanced_topics.html#hash_lo okup).I can happily add and retrieve items using find() as indicated. > > However, if I use the =* operator as indicated and there is no > matching record a memory error occurs. > > Therefore I need to assign the find result to an iterator and check > for end(). Can anyone tell me what type this iterator should be? I've > tried many combinations non of which compile. There are several syntaxes to get to the type of the iterator: your_container_type::nth_index<N>::type::iterator your_container_type::index<Tag>::type::iterator your_container_type::nth_index_iterator<N>::type your_container_type::index_iterator<Tag>::type Where N is the 0-based ordinal of the index you're interested in. If the index is tagged, you can also use the <Tag> variations. Does this help? Thanks for using Boost.MultiIndex! Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

How to build Boost on Visual Studio .NET 2003?
by Mingjun Huang 03 Dec '05

03 Dec '05

Hello, I am a newbie for Boost. Could anyone give me some directions on how to build boost on my PC with Visual Studio .NET 2003 installed? Thanks a lot! Best, -Mingjun

4 3

cannot resolve shared_ptr calls
by Steven Solie 03 Dec '05

03 Dec '05

I don't understand why the following program doesn't compile when using smart_ptr but works fine with raw pointers: #include <boost/shared_ptr.hpp> class Base { public: virtual ~Base() {}; }; class Base1 : public Base { public: virtual ~Base1() {}; }; class Base2 : public Base { public: virtual ~Base2() {}; }; class Derived1 : public Base1 {}; class Derived2 : public Base2 {}; typedef boost::shared_ptr<Base> BasePtr; typedef boost::shared_ptr<Base1> Base1Ptr; typedef boost::shared_ptr<Base2> Base2Ptr; typedef boost::shared_ptr<Derived1> Derived1Ptr; typedef boost::shared_ptr<Derived2> Derived2Ptr; void f(BasePtr ptr) {} void f(Base1Ptr ptr) {} void f(Base2Ptr ptr) {} int main() { Derived1Ptr d1(new Derived1); Derived2Ptr d2(new Derived2); f(d1); f(d2); } I see the following compile errors with GCC 3.4.4: smart-test.cpp: In function `int main()': smart-test.cpp:24: error: call of overloaded `f(Derived1Ptr&)' is ambiguous smart-test.cpp:15: note: candidates are: void f(BasePtr) smart-test.cpp:16: note: void f(Base1Ptr) smart-test.cpp:17: note: void f(Base2Ptr) smart-test.cpp:25: error: call of overloaded `f(Derived2Ptr&)' is ambiguous smart-test.cpp:15: note: candidates are: void f(BasePtr) smart-test.cpp:16: note: void f(Base1Ptr) smart-test.cpp:17: note: void f(Base2Ptr) If I remove the extra layer of inheritance it works as it should. #include <boost/shared_ptr.hpp> class Base { public: virtual ~Base() {}; }; class Derived1 : public Base {}; class Derived2 : public Base {}; typedef boost::shared_ptr<Base> BasePtr; typedef boost::shared_ptr<Derived1> Derived1Ptr; typedef boost::shared_ptr<Derived2> Derived2Ptr; void f(BasePtr ptr) {} int main() { Derived1Ptr d1(new Derived1); Derived2Ptr d2(new Derived2); f(d1); f(d2); } As I said earlier, doing the same with raw pointers resolves things as would be expected in both cases. Any ideas? --Steven

2 1

[multi_index] Problem with find() and Hashed_Index
by Martin Higham 03 Dec '05

03 Dec '05

I have created a multi_index_container inline with one ordered_unique index and one hashed_unique index as demonstrated in the documentation (http://www.boost.org/libs/multi_index/doc/advanced_topics.html#hash_lookup) I can happily add and retrieve items using find() as indicated. However, if I use the =* operator as indicated and there is no matching record a memory error occurs. Therefore I need to assign the find result to an iterator and check for end(). Can anyone tell me what type this iterator should be? I've tried many combinations non of which compile. I am using Boost v1.33.0 with Darwin gcc 4.0.1 Thanks Martin

1 0

[string_algo] find_head/find_tail additions
by Yuval Ronen 03 Dec '05

03 Dec '05

Hi. I have a feature I would like to see in the string algo library. The present find_head function gets an unsigned int N and returns the head of the input string with size is at most N. I would like another option that will return the head of the input with size at most original_size minus N. In other words, all the string without the last N characters. if original_size < N the return would be an empty string. The interface for such a functionality might introduce a new function (find_head_but()?), or make the present find_head function accept a signed int N, instead of unsigned int, with a negetive number indicates the new functionality. And of course the same for find_tail. Thanks, Yuval

3 8

Boost Review Wizard's Report: December 1, 2005
by Ronald Garcia 02 Dec '05

02 Dec '05

Review Wizard Status Report Tom Brinkman Ronald Garcia 1) News 2) Review Managers Needed 3) Review Queue 4) Libraries under development //////////////////////////////////////////////////////////////////// 1) News //////////////////////////////////////////////////////////////////// Ronald Garcia has signed on as co-wizard to assist Tom Brinkman. Feel free to contact either of us with questions or review requests. Output Formatters, Singleton, and Interfaces have been removed from the review queue. Reece Dunn, Jason Hise, and Jonathan Turkanis, the respective library authors, do not currently have the time to make the changes necessary prior to a review. We hope to see these libraries updated and resubmitted some time in the not too distant future. We need review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. If you can serve as review manager for any of them, send one of us an email. Note: If you have any suggestions about how we could improve the Review Wizard's status report or if we have forgotten anything, please email "reportbase at gmail dot com" and "garcia at cs dot indiana dot edu". //////////////////////////////////////////////////////////////////// 2) Review Managers Needed //////////////////////////////////////////////////////////////////// There are a few libraries in the review queue in need of review managers. If you would like to volunteer to be a review manager, please contact Ron or Tom. The following libraries still require review manager volunteers: Fixed Strings Intrusive Containers Singleton (Re-review) Fusion Shmem Type Traits (modification) //////////////////////////////////////////////////////////////////// 3) Review Queue //////////////////////////////////////////////////////////////////// asio - December 10 2005 - December 24 2005 Policy Pointer Fixed Strings Intrusive Containers Function Types (mini-re-review) Fusion Shmem Type_Traits asio Author - Christopher Kohlhoff Review Manager - Jeff Garland Download: http://asio.sourceforge.net/ Description: asio is a cross-platform C++ library for network programming that provides developers with a consistent asynchronous I/O model using a modern C++ approach. To use asio's SSL support, OpenSSL is required. OpenSSL is not necessary to use the rest of asio. asio consists only of header files, and so there is no need to build any libraries before using asio in your own applications. asio supports the following platforms and compilers: Win32 using Visual C++ 7.1 and Visual C++ 8.0. Win32 using Borland C++Builder 6 patch 4. Win32 using MinGW. Linux (2.4 or 2.6 kernels) using g++ 3.3 or later. Solaris using g++ 3.3 or later. Mac OS X 10.4 using g++ 3.3 or later. Type_Traits (modification) Author - Alexander Nasonov Review Manager - To be determined Download : You can download it from http://cpp-experiment.sourceforge.net/promote-20050917.tar.gz or browse it online http://cpp-experiment.sourceforge.net/promote-20050917/ Description: Proposal to add promote, integral_promotion and floating_point_promotion class templates to type_traits library. Alexander tried it on different compilers with various success: GNU/Linux (gentoo-hardened): gcc 3.3 and 3.4, Intel 7, 8 and 9 Windows: VC7 free compiler Sparc Solaris: Sun C++ 5.3 and 5.7 See comments at the beginning of promote_enum_test.cpp for what is broken. http://cpp-experiment.sourceforge.net/promote-20050917/libs/ type_traits/test/promote_enum_test.cpp Alexandar used to compile tests on VC6 and I'm pretty sure I can add workarounds if someone is still interested. Actually, it compiled the tests better then VC7. As for Borland 5.5, is_enum is broken and I don't see any reason to support this compiler. Alexandar requests a fast-track review. Policy Pointer Author - David Held & Jonathan Turkanis Review Manager - Gennadiy Rozenthal Download: Boost Sandbox (http://boost-sandbox.sourceforge.net/) under policy_ptr Description: Smart pointers are used to automate memory management by handling the deletion of dynamically allcoated objects (and other resources). They assist in ensuring program correctness, exception safety, and memory integrity. Policy Pointer is a policy-based smart pointer framework designed to accomodate the large number of smart pointer designs. Through the use of policy classes, virtually any smart pointer type can be constructed within this framework. This library is a Boostification of the original Loki::SmartPtr type with significant modifications. Fixed Strings Author - Reece Dunn Review Manager - to be determined Download: Boost Sandbox (http://boost-sandbox.sourceforge.net/) under fixed_string Description: The fixed string library provides buffer overrun protection for static sized strings (char s[ n ]). It provides a C-style string interface for compatibility with C code (for example, porting a C program to C++). There is also a std::string-style interface using a class based on flex_string by Andre Alexandrescu with a few limitations due to the non-resizable nature of the class. Intrusive Containers Author - Olaf Krzikalla Review Manager - to be determined Download: http://people.freenet.de/turtle++/intrusive.zip Description: While intrusive containers were and are widely used in C, they became more and more forgotten in the C++-world due to the presence of the standard containers, which don't support intrusive techniques. Boost.Intrusive not only reintroduces this technique to C++, but also encapsulates the implementation in STL-like interfaces. Hence anyone familiar with standard containers can use intrusive containers with ease. Function Types (mini-re-review) Author - Tobias Schwinger Review Manager - John Maddock Download: http://boost-sandbox.sourceforge.net/vault/ Description: This library provides a metaprogramming facility to classify, decompose and synthesize function-, function pointer-, function reference- and member function pointer types. For the purpose of this documentation, these types are collectively referred to as function types (this differs from the standard definition and redefines the term from a programmer's perspective to refer to the most common types that involve functions). The classes introduced by this library shall conform to the concepts of the Boost Metaprogramming library (MPL). The Function Types library enables the user to: * test an arbitrary type for being a function type of specified kind, * inspect properties of function types, * view and modify sub types of an encapsulated function type with MPL Sequence operations, and * synthesize function types. This library supports variadic functions and can be configured to support non-default calling conventions. Shmem Author - Ion Gaztanaga Review Manager - to be determined Download: Boost Sandbox Vault -> Memory (http://boost-sandbox.sourceforge.net/vault/index.php? direction=0&order=&directory=Memory) http://ice.prohosting.com/newfunk/boost/libs/shmem/doc/html/index.html Description: Shmem offers tools to symplify shared memory usage in applications. These include shared memory creation/destruction and synchronization objects. It also implements dynamic allocation of portions of a shared memory segment and an easy way to construct C++ objects in shared memory. Apart from this, Shmem implements a wide range of STL-like containers and allocators that can be safely placed in shared memory, helpful to implement complex shared memory data-bases and other efficient inter-process communications. Fusion Author - Joel de Guzman Review Manager - to be determined Download: http://spirit.sourceforge.net/dl_more/fusion_v2/ Description: Fusion is a library of heterogenous containers and views and algorithms. A set of heterogenous containers (vector, list, set and map) is provided out of the box along with view classes that present various composable views over the data. The containers and views follow a common sequence concept with an underlying iterator concept that binds it all together, suitably making the algorithms fully generic over all sequence types. The architecture is somewhat modeled after MPL which in turn is modeled after STL. It is code-named "fusion" because the library is the "fusion" of compile time metaprogramming with runtime programming. //////////////////////////////////////////////////////////////////// 4) Libraries under development //////////////////////////////////////////////////////////////////// Please let us know of any libraries you are currently developing that you intend to submit for review. Output Formatters Singleton Interfaces Output Formatters Author - Reece Dunn Download: Boost Sandbox (http://boost-sandbox.sourceforge.net/) under outfmt Description: The I/O formatters library provides an easy and customizable way to input/output arrays, STL arrays, STL collections, sub-arrays from/to STL streams. It allows you to configure how each element in such an array will be written to the stream or read from the stream, while providing reasonable defaults. Singleton Author - Jason Hise Download: http://tinyurl.com/6qvrd (old version from previous review) Description: Singleton is feature rich library: - ensuring single instance of a class and global access point to this instance - with policies specifying: - when the instance gets created (manually, immediatelly, when first used, ...) - how is the instance created (by new, malloc, in static memory, ...) - when the instance gets destroyed (never, by priority, after another singleton, ...) Parametrized singleton called Multiton is provided City::pointer p1("Chicago"); City::pointer p2("Brussels"); will create two different "singletons" of the same type. Another feature is ability to register resources (like shared pointer) who will get destroyed in controlled order, when the application exits. Not yet implemented features are: - MT safety - self-destroying singleton with timeout - bjam compatible tests The library is known to work with several newer compilers, VC7.1 among them. Help with other compilers is welcomed. Interfaces Author - Jonathan Turkanis Download: http://www.kangaroologic.com/interfaces Description: Interfaces provides a macro-based Interface Definition Language (IDL) which can be used to define C++ class types called interfaces. An interface is a lightweight value type associated with a set of named function signatures. An interface instance can be bound at runtime to any object which implements the interface, i.e., to any object of a type with accessible non-static member functions having the same name and signature as the set of functions associated with the interface. The functions of the bound object can then be invoked through the interface instance using the 'dot' operator. Binding is completely non-intrusive: the object's type need not declare any virtual functions or derive from any particluar base class. Current applications of Boost.Interfaces include: * Non-intrusive dynamic polymorphism: interfaces can often be used in place of abstract base classes, and are sometimes much faster (see Performance). * Dynamic inheritance: allows function calls to be forwarded automatically to an object specified at runtime (see Delegation). * Smart Interface Pointers: smart pointers which can manage the lifetime of any object whose type implements a given interface. * Smart References: like smart interface pointers, but the managed object is accessed using the "dot" operator." Tom Brinkman Ronald Garcia Boost Review Wizards

4 5

Re: [Boost-users] Serialization of ptr_container
by sui tam 02 Dec '05

02 Dec '05

Hi, This is an inquiry to a previous message. Does that mean the serializaion call to the archive: ar & container; typedef container std::vector<container_type *> container_list; will not work? --------------------------------- Yahoo! Personals Let fate take it's course directly to your email. See who's waiting for you Yahoo! Personals

1 0

regex and matchresults
by Tobi 02 Dec '05

02 Dec '05

Hello, this is my my first post to a newsgroup, so i hope it will work... I use the boost regex library, and i was wondereing, why the following code doesn't work. When i output the result of the match, it should output "a", but it didn't, the output was something wrong like "yl". I figured out, that the reasen for this is, that the string sSearchString is just in the scope of the try-block, so it is allready destroyed when i do the output. If i put the declaration of the string above the try block, all works fine, because the searchstring is still existing when i do the output. The matchresult seems to save just a reference to the string. Am i doing sth wrong? I think this is quite dangerous, or is there a way to do this more safe? Thanx, Tobi /////////////////////////////////////////// boost::smatch match; // Match-Ergebnis bool bMatched; try { // Regulaeren Ausdruck anlegen boost::regex sExpr; sExpr.assign( "." ); // Suchstring anlegen std::string sSearchString = "abcdef"; // Matchen bMatched = boost::regex_search(sSearchString,match,sExpr); } catch(runtime_error& er) { m_sLog = er.what(); return; } if( bMatched ) { cout << match[0] << endl; } ///////////////////////////////////////////

2 1

MingW bug
by Andre Tampubolon 02 Dec '05

02 Dec '05

This is my first Boost program #include <iostream> #include <cstdlib> #include <boost\random.hpp> using namespace std; using namespace boost; typedef boost::mt19937 BaseGenerator; typedef boost::uniform_real<double> Distribution; typedef boost::variate_generator<BaseGenerator,Distribution> Generator; double boostDoubleRand() { static BaseGenerator base; static Distribution dist; static Generator rng(base,dist); return rng(); } int main() { cout << "expect 5 numbers within the interval [0,1)" << endl; for (int i = 0; i < 5; i++) { cout << boostDoubleRand() << "\n"; } cout << endl; return 0; } Compiled using Borland C++ 5.6.4 and it works well. But when I compile it using MingW GCC, it only prints "expect 5 numbers within the interval [0,1)" and not the 5 random numbers. Why ? --------------------------------- Yahoo! FareChase - Search multiple travel sites in one click.

2 4

trying to use Boost.Program_options
by Chen Jiusheng 02 Dec '05

02 Dec '05

Hi Boost_UsersAll, I am trying to compile "...\libs\program_options\example\first.cpp" with VC6.0(sp6) and when I do it I get the following errors. I am sure that Boost1.33.0 has been successfully installed on my Windows XP machine. Any ideas/suggestions would be very helpful! 　　　　　　　　Best regards！ ///////////////////////////////////////////////////////////////////////////////////// d:\work\algos\boost\boost_1_33_0\boost\program_options\options_description.hpp(156) : error C2258: illegal pure syntax, must be '= 0' d:\work\algos\boost\boost_1_33_0\boost\program_options\options_description.hpp(156) : error C2252: 'm_default_line_length' : pure specifier can only be specified for functions d:\work\algos\boost\boost_1_33_0\boost\program_options\options_description.hpp(159) : error C2065: 'm_default_line_length' : undeclared identifier d:\work\mfa\codes\libcleml_1.0.1\mfa_tests\first.cpp(27) : error C2660: 'parse_command_line' : function does not take 3 parameters d:\work\mfa\codes\libcleml_1.0.1\mfa_tests\first.cpp(37) : fatal error C1903: unable to recover from previous error(s); stopping compilation Error executing cl.exe. first.obj - 5 error(s), 0 warning(s)

2 1