December 2003 - Boost-users

boost::shared_ptr and stl algorithms
by Bill Eidson 15 Apr '05

15 Apr '05

std::vector< boost::shared_ptr<T> > TVec; I want to write a function object to run std::for_each. to do somework against members of T and accumulate results in functor. My attempts have failed in VC7 with memory errors in my operator() method. struct fo { bool operator()( boost::shared_ptr<T>& t ) { return true; } }; Thanks in advance bille

5 9

Will libraries built on WinNT run on Win98? (MinGW)
by Reed Hedges 31 Mar '05

31 Mar '05

I know that Win98 is not really supported, but is there any chance that libraries (specifically thread and regex) that were build on WinNT using MinGW work on Win98 (in MinGW)? My guess is no, but has anyone tried it? thanks reed

2 1

Problem Building boost for cygwin g++ with stlport on WinXP
by Markus Ruettimann 06 Jan '04

06 Jan '04

Hi all I'm an enthusiastic user of boost since quite a long time. I used MSVC6.0 so far. How ever, I changed to cygwin g++ 3.3.1 for project reasons. I have succesfuly built the latest STLPort version (4.6) and I also use it successfully. How ever, I am not able to build the toolset gcc-stlport. There are errors in the threadding lib and elsewhere, and such ugly things as "to long path names" errors in the console. Does anybody know how to build this toolset and link them together as one static lib? I use boost-1.30.2 with cygwin g++ 3.3.1 on winXP professional. PS: When I build the bjam stuff, what builds without any errors, it uses the MSVC compiler (the output it creates looks like this). Is this a problem? Thanks for your help Markus. -- Using M2, Opera's revolutionary e-mail client: http://www.opera.com/m2/

2 3

how to get started? (not in documentation)
by Tom Weber 01 Jan '04

01 Jan '04

Hello, I downloaded boost today so regard me as a newbie. Boost seems great, but the documentation doesn't mention how I should install boost on my system (redhat 9), and how to link against the built libraries. Sure I can include it in every project (though it's huge!), and make the makefiles link into strange locations such as libs/test/build/bin/libboost_unit_test_framework.a/gcc/debug/runtime-link-static/threading-single/libboost_unit_test_framework.a Is there an easier way? Why aren't packages like boost-[devel-]VERSION.PLATFORM.rpm made? Why aren't all built libraries put in the same directory, with a simple path name? Why isn't the thread library built statically? Is putting a "lib" section with BOOST_THREAD_BUILD_STATIC=1 in the Jamfile a legal fix? (seems to work) Also... I think boost should have a network library. Can anyone recommend a platform-independent network library? I'm thankful for any answer... -- Cheers, Tom Weber http://www.dd.chalmers.se/~np98towe/

6 7

using regex for in-place string modification
by Scott Meyers 29 Dec '03

29 Dec '03

I want to use regex to modify a string in place. In particular, I've read the contents of a file into a string, now I want to do some search/replace functions on the string, then write the modified string back out to the original file. I've looked through the regex documentation, including the October 2001 DDJ article, but I don't see any way to modify a string in place. From what I can tell, regex_merge looks like it does the kind of thing I want, except it doesn't seem to modify in place. I'd prefer to avoid creating two strings of each file's contents, one before regex processsing, one after. Is there functionality in regex that will let me modify a string in place? Thanks, Scott

7 8

problem with regex_fwd.hpp
by Stefan Shishkov 29 Dec '03

29 Dec '03

Hi, I had a small problem using boost::regexp on MS VC 6.0, boost 1.30.2. In one of my headers I included regex_fwd.hpp. The compilation failed with: ..\boost-1.30.2\boost/detail/allocator.hpp(215): error C2065: 'assert': undeclared identifier Allocator.hpp does not include <cassert> probably relying that it will be included before it. I solved this problem by including <cassert> before regex_fwd.hpp but may be it is better to change allocator.hpp? Or probably something is wrong with my configuration? Best regards Stefan

2 1

error C2668 with <boost/regex.hpp>
by Yiftah Frechter 28 Dec '03

28 Dec '03

Hi guys, I'm trying to use boost regex with VC6 Receiving the following error: error C2668: 'sprintf' : ambiguous call to overloaded function there is no "using namespace std" in my code. Appreciate any help. Yiftah

2 1

undirected graph cycle
by magh＠lehigh.edu 27 Dec '03

27 Dec '03

Is there any easy way to use DFS visitors to return a cycle in an undirected graph? The examples show how to detect if a cycle exists. How do you actually extract it? For my instance, I am dealing with an undirected graph that is a 1-tree, i.e., I know there is exactly one cycle. Thanks, Matt ------------------------------------------------- This mail sent through IMP: http://horde.org/imp/

1 0

date_time: number of days between dates
by Lars Schouw 25 Dec '03

25 Dec '03

I found a solution: long no_days(boost::gregorian::date d1, boost::gregorian::date d2) { using namespace boost::gregorian; using namespace boost::posix_time; date_period dp(d1, d2); return dp.length().days(); } --------------------------------- Do you Yahoo!? Yahoo! Photos - Get your photo on the big screen in Times Square

2 1

date_time converting from date to number of days
by Lars Schouw 24 Dec '03

24 Dec '03

I want to find the number of days in-between two days. What is the easiest way to do this? I am using the date_time lib and want to find the number of days from the time_t started. ptime timet_start(date(1970,1,1)); ptime t(d); time_duration diff = t - timet_start; ptime t123(diff); // timeval tv; //drop off the fractional seconds... // tv.tv_sec = diff.ticks()/time_duration::rep_type::res_adjust(); return 0; // return difference.days; Lars Schouw --------------------------------- Do you Yahoo!? Yahoo! Photos - Get your photo on the big screen in Times Square

1 0

lexical_cast and whitespace, part 2
by Miro Jurisic 18 Dec '03

18 Dec '03

I was trying to do the following: class MyString; std::istream oprator>>(std::istream&, MyString&); std::string s1 = "Hello, World"; MyString s2 = lexical_cast <MyString> (s); It doesn't work. The reason for it failing is: a. the semantics of operator>>(std::istream&, MyString&) are identical to the semantics of operator>>(std::istream&, std::string&) b. the semantics of operator>>(std::istream&, std::string&) are to read the stream up to the first whitespace (as per the stream locale) c. lexical_cast uses (via lexical_stream) operator>>(std::istream&, MyString&) to read the data into MyString The upshot of this is that lexical_cast writes "Hello, World" to the stream (via operator<<(std::ostream&, const std::string&)), reads off "Hello," to MyString (via operator>>(std::istream&, MyString&)), and then throws a bad lexical_cast after noticing there's data left on the stream. The natural question is why it is that this works when converting to a std::string; it seems that it should have the same problem. The answer is that boost::detail::lexical_stream has a lexical_stream::operator>>(std::string&) which ignores whitespace, thus working around the problem if (and only if) the target type of the cast is std::string. Attempting to use lexical_cast with any string type other than std::string fails when the source data contains (non-trailing) whitespace. This is suboptimal. I am going to try a workaround shortly, by partially specializing lexical_stream, but that's just a workaround. I don't see any way to do this without a. breaking the lexical_cast abstraction barrier (as I am about to do) or b. making the semantics of operator>>(istream&, MyString&) differ from those of operator>>(istream&, std::string&) I don't think either of those is the rigt answer. Is there one? Shouldn't there be one? Thanks, meeroh

1 0

Problems with Multi Threaded Version
by Zeros and Ones 18 Dec '03

18 Dec '03

So far I was using the Single Threaded Run Time Library and had no trouble with Boost, however I switched to useing the Run Time Versions just now and found that nothing seemed to work and the error that I get is: "Boost_Regex_vc7_mdid.dll was not found. Re-installing the application may fix this problem" However, the instructions on the website state : "Finally when you use regex++ it is only necessary for you to add the <boost> root directory to your list of include directories for that project. It is not necessary for you to manually add a .lib file to the project; the headers will automatically select the correct .lib file for your build mode and tell the linker to include it. " Im using VC7, and I cant understand why I get this error, do I need to change some setting while linking to the multi threaded versions? For now, I copied the two dll's _boost_regex_vc7_mdid.dll and _boost_regex_vc7_mdi.dll to my working directory and I have a working application, but Im foxed and I would like to know what im doing wrong! Thanks. "Zeros Bits and Bytes"

1 0

BGL and reversing / moving edges
by joshrose 17 Dec '03

17 Dec '03

G'day, I was hoping someone might be able to tell me if they've run into any situations using BGL where they needed to move (or reverse (i.e. flip the source and target)) an edge within a graph implemented as an adjacency_list. I'm working on an implementation of an algorithm for max. weight bipartite matching ("the assignment problem"), and one of the assumptions in the algorithm is that non-matched edges are directed from one subgraph, A, to the other subgraph, B, and matched edges are directed the other way. Over the course of growing the matching, a simple way to add and remove edges from the candidate set is just to reverse the edge, thus the need for some way to reverse the edge within BGL. I don't think I can just remove and then re-add the edge in the other direction, primarily because doing so will (I believe) invalidate any edge_descriptors referring to that edge. In particular, there are property maps keeping track of the weight of edges, the predecessors of certain nodes, etc. that use edge descriptors as keys. I've spent a fair bit of time reading the documentation and looking through the implementation of adjacency_lists (incl. edge_list_impl), and I'm not really sure of a way to either move an edge directly within a graph, or even to create a new edge from another s.t. they have the same edge_descriptor (in general a bad thing, probably). Anyone have any thoughts on this? Thanks, -Josh

4 10

Re: [Boost-users] Newbie question: block read inputs to regex
by annirak＠shaw.ca 17 Dec '03

17 Dec '03

----- Original Message ----- From: John Maddock <john(a)johnmaddock.co.uk> Date: Saturday, December 13, 2003 4:06 am Subject: Re: [Boost-users] Newbie question: block read inputs to regex > > I'm using regex_grep() to search through file contents for > matches. I > want to read the file in blocks to keep memory use down for large > files.What I want to know is whether there is some way of adding > the next block of > memory to the grep where the last one left off. > > > > The best solution I can come up with is using some sort of > double-buffering scheme, but that would take an awful lot of > memory copies > and searching some text multiple times. Both things I would > prefer to > avoid. > > > > What can I do? > > Have you looked at the partial match examples - there is one that > searches a > file in chunks. > > John. Ah, thank you, somehow I had missed that. --Brendan

1 0

Boost Software License: redistribute modified works?
by Steve M. Robbins 16 Dec '03

16 Dec '03

Hi, I've a question for the drafters of the Boost Software License - Version 1.0 - August 17th, 2003. Put yourself in the position of someone who wants to redistribute a modified version of Boost. For example, the linux distributors like Debian. The license begins with the permission grant: Permission is hereby granted, free of charge, to any person or organization obtaining a copy of the software and accompanying documentation covered by this license (the "Software") to use, reproduce, display, distribute, execute, and transmit the Software, and to prepare derivative works of the Software, and to permit third-parties to whom the Software is furnished to do so, all subject to the following: [... a restriction and a disclaimer paragraph ...] As I read this, "the Software" means "the unmodified tar or zip file obtained from boost.org". Is that correct? I'm permitted to "prepare derivative works of the Software", but the license doesn't specify what I may do with my derivative works. Clearly, I may distribute "the Software", but may I distribute the derivative work? Some licenses (e.g. the BSD and the GPL) make it clear that the terms apply to both the software and to derivative works. Shouldn't the boost license do likewise? -Steve

2 1

building boost libraries on Solaris
by K. Herman Chen 16 Dec '03

16 Dec '03

Has anyone built Boost Libraries using Sun/Solaris CC? I first built bjam using gcc on Solaris. But in the next step, 'bjam "-sTOOLS=CC"' (ie Solaris CC), it failed miserably. Since CC is not in the Supported Toolsets, does it mean I cannot build Boost libraries using Sun/Solaris CC? Any pointers would be appreciated. Thanks. herman

3 2

msvc-stlport creates name mangled functions with std:: not _STL::
by John Bustard 16 Dec '03

16 Dec '03

I can't seem to link with the filesystem lib when built with the following options: rem Get environment right for compiler -- comment out after first run rem "C:\Program Files\Microsoft Visual Studio\VC98\Bin\VCVARS32.BAT" rem Setup for Boost.Python rem Setup for Boost 'toolset' set STLPORT_PATH=C:\ set STLPORT_4.6_PATH=C:\STLport-4.6 set STLPORT_VERSION=4.6 bin.ntx86\bjam "-sTOOLS=msvc-stlport" "-sBUILD=<stlport-iostream>on" the name mangled function that is exported is ?leaf@path@filesystem@boost@@QBE?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ but the function that msvc tries to link with is: ?leaf@path@filesystem@boost@@QBE?AV?$basic_string@DV?$char_traits@D@_STL@@V? $allocator@D@2@@_STL@@XZ Two things I've noticed that are a bit wierd are that the boost libs are put in stlport-4.5.3 directory even when built with the options directing it to 4.6. Also stlport has an option to put itself in the std namespace but merely #defines std as _STL so I would have expected the exported function from the boost library to be _STL not std. Any ideas, thanks John

2 1

generate_random_graph
by Matthew Galati 16 Dec '03

16 Dec '03

Newbie Question Can someone post a simple example of how to generate a random graph? I do not understand what needs to be sent in the 4th argument for RandNumGen. To keep it simple, how would I generate a random graph on 10 vertices and 20 edges? generate_random_graph(g, 10, 20, ?, false, false); Thanks, Matt

2 1

Couldn't find status of Thread Priority...
by Brian Carlson 15 Dec '03

15 Dec '03

I was searching the boost site, and saw that in the Nov '02 timeframe that thread priority was not implemented. Is that still the case? I'm on XP and want to have one of my logging threads have a lower priority. Thanks, Brian

1 0

RE: [Boost-users] find japanese character with boost regex++
by Ben Hutchings 15 Dec '03

15 Dec '03

John Maddock <john(a)johnmaddock.co.uk> wrote: <snip> > It might be best to add a facility to add new character classes as a > list of characters and ranges to include, something like: > > register_character_class("myname", "d-f"); > > Then we add all the Unicode block ranges as standard for wide > character regexes. Aside from the unified Han characters (kanji/hanzi), characters of the same category generally aren't neatly grouped together in Unicode. The 128-character blocks tend to correspond to locales, communities of use or specific legacy encodings and not to categories. You need a look-up table (or more efficiently two levels of table) to check character categories.

2 1

find japanese character with boost regex++
by jschmid 15 Dec '03

15 Dec '03

Hi, I have just discovered the incredible boost and regex++ libraries but I have encountered some difficulties... I read that the japanese special encoding is handled in regex++, specially using wide char wchar characters. In the regex++ faq, it is presented the system of class , ex. [[:space]], in order to define a set of characters with a same property. I have been looking for a kind of [[:Japanese characters]] class. Actually I have a text with a lot of strange characters and japanese one ( Hiragana, katakan, Kanji everything..!) and I want to find these japanese sentence in order to translate them and replace in the text. I need hence a way in order to identify a japanese sentence . A kind of function const bool isJap( const wchar ) const would be fine. So if somebody has any idea or a some links, I would appreciate it! Thanks! Schmid

3 6

Re: Using graph library in VC++ 6.0 -> Change stl library?
by rohou 15 Dec '03

15 Dec '03

Using Boost graph library in VC++ 6.0, do I have to change the stl dlivered with VC6.0? What is the service pack I should use? Thanks, Boris

1 0

Boost::shared_ptr and memory leaks
by INsideR 15 Dec '03

15 Dec '03

Hello, I have wrote simple programm: using namespace boost; shared_ptr<int> a(new int(10)); shared_ptr<int> b; b=a; a.reset(new int(20)); std::cout<<"a=="<<*a<<" b=="<<*b; return 0; Checking this programm with DevPartner BoundsChecker, i found memory leak: Type Quantity Total (bytes) Allocation Location Sequence Leak exiting program 1 84 setlocale - [setlocal.c, line 547 (Boostt.exe)] 9 Memory Leak Exiting Program: Address 0x00E44F88 (84) allocated by _malloc_dbg. <if ( (ptloci = _malloc_crt( sizeof(threadlocinfo) )) == NULL )> Where is the problem? May be i write incorrect code? Best Wishes, Yury mailto:insider83@inbox.lv

2 1

problem with shared_ptr
by Eyal Fink 14 Dec '03

14 Dec '03

I am using boost share_ptr and I have a very strange problem. it looks to me more like a compiler problem but since it is a boost code I decided to post it here. I haven't succeeded to creating a small example which I can post here and demonstrate the problem (I know it is hard to help that way but I am working on creating an example) so I will just describe it. The symptom is that the shared_ptr call the delete on a random pointer. Going into the shared_ptr and shared_count objects, I sow that the ptr field of sp_counted_base_impl has a wrong value. I have added prints out all over the code and saw that inside the constructor of sp_counted_base_impl the value is set correctly but on the return when I try to look at the value and it is a wrong value. adding some more prints I saw that inside the shared_count constructor: template<class P, class D> shared_count(P p, D d) when casting pi_ to (sp_counted_base_impl<P, D>*) and calling a member function, the sizeof(*this) in side the member function is not the same every time (resulting with a different address to ptr and thus different value). the problem occurs only when compiling -O I am attaching the two file I have changes (shared_count.hpp is from boost/detail/) and the prints there created. I am sorry I can't supplied a complete example, this problems can just disappear when I remove any object file from the compilation. my configuration: compiler: gcc version 3.2 20020903 (Red Hat Linux 8.0 3.2-7) OS: Red Hat Linux release 8.0 (Psyche) boost: boost-1.30.2 any help will be appreciated #ifndef BOOST_SHARED_PTR_HPP_INCLUDED #define BOOST_SHARED_PTR_HPP_INCLUDED // // shared_ptr.hpp // // (C) Copyright Greg Colvin and Beman Dawes 1998, 1999. // Copyright (c) 2001, 2002, 2003 Peter Dimov // // Permission to copy, use, modify, sell and distribute this software // is granted provided this copyright notice appears in all copies. // This software is provided "as is" without express or implied // warranty, and with no claim as to its suitability for any purpose. // // See http://www.boost.org/libs/smart_ptr/shared_ptr.htm for documentation. // #include <boost/config.hpp> // for broken compiler workarounds #if defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) #include <boost/detail/shared_ptr_nmt.hpp> #else #include <boost/assert.hpp> #include <boost/checked_delete.hpp> #include <boost/throw_exception.hpp> #include <boost/detail/shared_count.hpp> #include <boost/detail/workaround.hpp> #include <memory> // for std::auto_ptr #include <algorithm> // for std::swap #include <functional> // for std::less #include <typeinfo> // for std::bad_cast #include <iosfwd> // for std::basic_ostream #ifdef BOOST_MSVC // moved here to work around VC++ compiler crash # pragma warning(push) # pragma warning(disable:4284) // odd return type for operator-> #endif namespace boost { template<class T> class weak_ptr; template<class T> class enable_shared_from_this; namespace detail { struct static_cast_tag {}; struct dynamic_cast_tag {}; struct polymorphic_cast_tag {}; template<class T> struct shared_ptr_traits { typedef T & reference; }; template<> struct shared_ptr_traits<void> { typedef void reference; }; #if !defined(BOOST_NO_CV_VOID_SPECIALIZATIONS) template<> struct shared_ptr_traits<void const> { typedef void reference; }; #endif // enable_shared_from_this support template<class T, class Y> void sp_enable_shared_from_this(boost::enable_shared_from_this<T> * pe, Y * px, shared_count const & pn) { if(pe != 0) pe->_internal_weak_this._internal_assign(px, pn); } inline void sp_enable_shared_from_this(void const *, void const *, shared_count const &) { } } // namespace detail // // shared_ptr // // An enhanced relative of scoped_ptr with reference counted copy semantics. // The object pointed to is deleted when the last shared_ptr pointing to it // is destroyed or reset. // template<class T> class shared_ptr { private: // Borland 5.5.1 specific workaround typedef shared_ptr<T> this_type; public: typedef T element_type; typedef T value_type; typedef T * pointer; typedef typename detail::shared_ptr_traits<T>::reference reference; shared_ptr(): px(0), pn() // never throws in 1.30+ { } template<class Y> explicit shared_ptr(Y * p): px(p), pn(p, checked_deleter<Y>()) // Y must be complete // Eyal Fink changed that!!! //shared_ptr(Y * p): px(p), pn(p, checked_deleter<Y>()) // Y must be complete { print_ptrs(); detail::sp_enable_shared_from_this(p, p, pn); print_ptrs(); } void print_ptrs() { //cout <<"px= "<<px<<" ptr= "<< pn.get_ptr(p, checked_deleter<Y>())<<endl; } // ~shared_ptr() // { // print_ptrs(); // } // // Requirements: D's copy constructor must not throw // // shared_ptr will release p by calling d(p) // template<class Y, class D> shared_ptr(Y * p, D d): px(p), pn(p, d) { detail::sp_enable_shared_from_this(p, p, pn); } // generated copy constructor, assignment, destructor are fine... // except that Borland C++ has a bug, and g++ with -Wsynth warns #if defined(__BORLANDC__) || defined(__GNUC__) shared_ptr & operator=(shared_ptr const & r) // never throws { px = r.px; pn = r.pn; // shared_count::op= doesn't throw return *this; } #endif template<class Y> explicit shared_ptr(weak_ptr<Y> const & r): pn(r.pn) // may throw { // it is now safe to copy r.px, as pn(r.pn) did not throw px = r.px; } template<class Y> shared_ptr(shared_ptr<Y> const & r): px(r.px), pn(r.pn) // never throws { } template<class Y> shared_ptr(shared_ptr<Y> const & r, detail::static_cast_tag): px(static_cast<element_type *>(r.px)), pn(r.pn) { } template<class Y> shared_ptr(shared_ptr<Y> const & r, detail::dynamic_cast_tag): px(dynamic_cast<element_type *>(r.px)), pn(r.pn) { if(px == 0) // need to allocate new counter -- the cast failed { pn = detail::shared_count(); } } template<class Y> shared_ptr(shared_ptr<Y> const & r, detail::polymorphic_cast_tag): px(dynamic_cast<element_type *>(r.px)), pn(r.pn) { if(px == 0) { boost::throw_exception(std::bad_cast()); } } #ifndef BOOST_NO_AUTO_PTR template<class Y> explicit shared_ptr(std::auto_ptr<Y> & r): px(r.get()), pn() { Y * tmp = r.get(); pn = detail::shared_count(r); detail::sp_enable_shared_from_this(tmp, tmp, pn); } #endif #if !defined(BOOST_MSVC) || (BOOST_MSVC > 1200) template<class Y> shared_ptr & operator=(shared_ptr<Y> const & r) // never throws { px = r.px; pn = r.pn; // shared_count::op= doesn't throw return *this; } #endif #ifndef BOOST_NO_AUTO_PTR template<class Y> shared_ptr & operator=(std::auto_ptr<Y> & r) { this_type(r).swap(*this); return *this; } #endif void reset() // never throws in 1.30+ { this_type().swap(*this); } template<class Y> void reset(Y * p) // Y must be complete { BOOST_ASSERT(p == 0 || p != px); // catch self-reset errors this_type(p).swap(*this); } template<class Y, class D> void reset(Y * p, D d) { this_type(p, d).swap(*this); } reference operator* () const // never throws { BOOST_ASSERT(px != 0); return *px; } T * operator-> () const // never throws { BOOST_ASSERT(px != 0); return px; } T * get() const // never throws { return px; } // implicit conversion to "bool" #if defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x530) operator bool () const { return px != 0; } #else typedef T * (this_type::*unspecified_bool_type)() const; operator unspecified_bool_type() const // never throws { return px == 0? 0: &this_type::get; } #endif // operator! is redundant, but some compilers need it bool operator! () const // never throws { return px == 0; } bool unique() const // never throws { return pn.unique(); } long use_count() const // never throws { return pn.use_count(); } void swap(shared_ptr<T> & other) // never throws { std::swap(px, other.px); pn.swap(other.pn); } template<class Y> bool _internal_less(shared_ptr<Y> const & rhs) const { return pn < rhs.pn; } void * _internal_get_deleter(std::type_info const & ti) const { return pn.get_deleter(ti); } // Tasteless as this may seem, making all members public allows member templates // to work in the absence of member template friends. (Matthew Langston) #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS private: template<class Y> friend class shared_ptr; template<class Y> friend class weak_ptr; #endif T * px; // contained pointer detail::shared_count pn; // reference counter }; // shared_ptr template<class T, class U> inline bool operator==(shared_ptr<T> const & a, shared_ptr const & b) { return a.get() == b.get(); } template<class T, class U> inline bool operator!=(shared_ptr<T> const & a, shared_ptr const & b) { return a.get() != b.get(); } #if __GNUC__ == 2 && __GNUC_MINOR__ <= 96 // Resolve the ambiguity between our op!= and the one in rel_ops template<class T> inline bool operator!=(shared_ptr<T> const & a, shared_ptr<T> const & b) { return a.get() != b.get(); } #endif template<class T, class U> inline bool operator<(shared_ptr<T> const & a, shared_ptr const & b) { return a._internal_less(b); } template<class T> inline void swap(shared_ptr<T> & a, shared_ptr<T> & b) { a.swap(b); } template<class T, class U> shared_ptr<T> static_pointer_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::static_cast_tag()); } template<class T, class U> shared_ptr<T> dynamic_pointer_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::dynamic_cast_tag()); } // shared_*_cast names are deprecated. Use *_pointer_cast instead. template<class T, class U> shared_ptr<T> shared_static_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::static_cast_tag()); } template<class T, class U> shared_ptr<T> shared_dynamic_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::dynamic_cast_tag()); } template<class T, class U> shared_ptr<T> shared_polymorphic_cast(shared_ptr const & r) { return shared_ptr<T>(r, detail::polymorphic_cast_tag()); } template<class T, class U> shared_ptr<T> shared_polymorphic_downcast(shared_ptr const & r) { BOOST_ASSERT(dynamic_cast<T *>(r.get()) == r.get()); return shared_static_cast<T>(r); } // get_pointer() enables boost::mem_fn to recognize shared_ptr template<class T> inline T * get_pointer(shared_ptr<T> const & p) { return p.get(); } // operator<< #if defined(__GNUC__) && (__GNUC__ < 3) template<class Y> std::ostream & operator<< (std::ostream & os, shared_ptr<Y> const & p) { os << p.get(); return os; } #else # if defined(BOOST_MSVC) && BOOST_WORKAROUND(BOOST_MSVC, <= 1200 && __SGI_STL_PORT) // MSVC6 has problems finding std::basic_ostream through the using declaration in namespace _STL using std::basic_ostream; template<class E, class T, class Y> basic_ostream<E, T> & operator<< (basic_ostream<E, T> & os, shared_ptr<Y> const & p) # else template<class E, class T, class Y> std::basic_ostream<E, T> & operator<< (std::basic_ostream<E, T> & os, shared_ptr<Y> const & p) # endif { os << p.get(); return os; } #endif // get_deleter (experimental) #if defined(__GNUC__) && (__GNUC__ < 3) // g++ 2.9x doesn't allow static_cast<X const *>(void *) template<class D, class T> D * get_deleter(shared_ptr<T> const & p) { void const * q = p._internal_get_deleter(typeid(D)); return const_cast<D *>(static_cast<D const *>(q)); } #else template<class D, class T> D * get_deleter(shared_ptr<T> const & p) { return static_cast<D *>(p._internal_get_deleter(typeid(D))); } #endif } // namespace boost #ifdef BOOST_MSVC # pragma warning(pop) #endif #endif // #if defined(BOOST_NO_MEMBER_TEMPLATES) && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) #endif // #ifndef BOOST_SHARED_PTR_HPP_INCLUDED #ifndef BOOST_DETAIL_SHARED_COUNT_HPP_INCLUDED #define BOOST_DETAIL_SHARED_COUNT_HPP_INCLUDED #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // detail/shared_count.hpp // // Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd. // // Permission to copy, use, modify, sell and distribute this software // is granted provided this copyright notice appears in all copies. // This software is provided "as is" without express or implied // warranty, and with no claim as to its suitability for any purpose. // #include <boost/config.hpp> #if defined(BOOST_SP_USE_STD_ALLOCATOR) && defined(BOOST_SP_USE_QUICK_ALLOCATOR) # error BOOST_SP_USE_STD_ALLOCATOR and BOOST_SP_USE_QUICK_ALLOCATOR are incompatible. #endif #include <boost/checked_delete.hpp> #include <boost/throw_exception.hpp> #include <boost/detail/lightweight_mutex.hpp> #if defined(BOOST_SP_USE_QUICK_ALLOCATOR) #include <boost/detail/quick_allocator.hpp> #endif #include <memory> // std::auto_ptr, std::allocator #include <functional> // std::less #include <exception> // std::exception #include <new> // std::bad_alloc #include <typeinfo> // std::type_info in get_deleter #include <cstddef> // std::size_t #ifdef __BORLANDC__ # pragma warn -8026 // Functions with excep. spec. are not expanded inline # pragma warn -8027 // Functions containing try are not expanded inline #endif namespace boost { // Debug hooks #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) void sp_scalar_constructor_hook(void * px, std::size_t size, void * pn); void sp_array_constructor_hook(void * px); void sp_scalar_destructor_hook(void * px, std::size_t size, void * pn); void sp_array_destructor_hook(void * px); #endif // The standard library that comes with Borland C++ 5.5.1 // defines std::exception and its members as having C calling // convention (-pc). When the definition of bad_weak_ptr // is compiled with -ps, the compiler issues an error. // Hence, the temporary #pragma option -pc below. The version // check is deliberately conservative. #if defined(__BORLANDC__) && __BORLANDC__ == 0x551 # pragma option push -pc #endif class bad_weak_ptr: public std::exception { public: virtual char const * what() const throw() { return "boost::bad_weak_ptr"; } }; #if defined(__BORLANDC__) && __BORLANDC__ == 0x551 # pragma option pop #endif namespace detail { class sp_counted_base { private: typedef detail::lightweight_mutex mutex_type; public: sp_counted_base(): use_count_(1), weak_count_(1) { } virtual ~sp_counted_base() // nothrow { } virtual void *get_ptr() { exit(-1); } virtual void set_ptr(void *ptr) { //cout <<"we are not supposed to be here!"<<endl; exit(-1); } // dispose() is called when use_count_ drops to zero, to release // the resources managed by *this. virtual void dispose() = 0; // nothrow // destruct() is called when weak_count_ drops to zero. virtual void destruct() // nothrow { delete this; } virtual void * get_deleter(std::type_info const & ti) = 0; void add_ref() { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif if(use_count_ == 0 && weak_count_ != 0) boost::throw_exception(boost::bad_weak_ptr()); ++use_count_; ++weak_count_; } void release() // nothrow { { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif long new_use_count = --use_count_; if(new_use_count != 0) { --weak_count_; return; } } dispose(); weak_release(); } void weak_add_ref() // nothrow { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif ++weak_count_; } void weak_release() // nothrow { long new_weak_count; { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif new_weak_count = --weak_count_; } if(new_weak_count == 0) { destruct(); } } long use_count() const // nothrow { #if defined(BOOST_HAS_THREADS) mutex_type::scoped_lock lock(mtx_); #endif return use_count_; } private: sp_counted_base(sp_counted_base const &); sp_counted_base & operator= (sp_counted_base const &); // inv: use_count_ <= weak_count_ long use_count_; long weak_count_; #if defined(BOOST_HAS_THREADS) mutable mutex_type mtx_; #endif }; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) template<class T> void cbi_call_constructor_hook(sp_counted_base * pn, T * px, checked_deleter<T> const &, int) { boost::sp_scalar_constructor_hook(px, sizeof(T), pn); } template<class T> void cbi_call_constructor_hook(sp_counted_base *, T * px, checked_array_deleter<T> const &, int) { boost::sp_array_constructor_hook(px); } template<class P, class D> void cbi_call_constructor_hook(sp_counted_base *, P const &, D const &, long) { } template<class T> void cbi_call_destructor_hook(sp_counted_base * pn, T * px, checked_deleter<T> const &, int) { boost::sp_scalar_destructor_hook(px, sizeof(T), pn); } template<class T> void cbi_call_destructor_hook(sp_counted_base *, T * px, checked_array_deleter<T> const &, int) { boost::sp_array_destructor_hook(px); } template<class P, class D> void cbi_call_destructor_hook(sp_counted_base *, P const &, D const &, long) { } #endif // // Borland's Codeguard trips up over the -Vx- option here: // #ifdef __CODEGUARD__ # pragma option push -Vx- #endif template<class P, class D> class sp_counted_base_impl: public sp_counted_base { private: D del; // copy constructor must not throw P ptr; // copy constructor must not throw sp_counted_base_impl(sp_counted_base_impl const &); sp_counted_base_impl & operator= (sp_counted_base_impl const &); typedef sp_counted_base_impl<P, D> this_type; public: // pre: initial_use_count <= initial_weak_count, d(p) must not throw sp_counted_base_impl(P p, D d): ptr(p), del(d) { cout <<"IN sp_counted_base_impl ocnstructro ptr="<<ptr<<" p="<<p<<endl; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) detail::cbi_call_constructor_hook(this, p, d, 0); #endif cout <<"sizeof(*this)= "<<sizeof(*this)<<endl; cout <<"IN sp_counted_base_impl end ocnstructro ptr=" <<ptr<<" ptr addr: "<<&ptr<<" p="<<p<<endl; } virtual void dispose() // nothrow { #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) detail::cbi_call_destructor_hook(this, ptr, del, 0); #endif //cout <<"IN boost::dispose ptr="<<ptr<<endl; del(ptr); } P get_ptr() { cout <<"this= "<<this<<" ptr in get_ptr= "<<ptr<<endl; cout <<"sizeof(*this)= "<<sizeof(*this)<<endl; cout <<"ptr addr: "<<&ptr<<endl; return ptr; } void set_ptr(P _ptr) { cout <<"this= "<<this<<" setting ptr to: "<<_ptr<<endl; ptr=_ptr; cout <<"sizeof(*this)= "<<sizeof(*this)<<endl; cout <<"ptr= "<<ptr<<endl; cout <<"ptr addr: "<<&ptr<<endl; } virtual void * get_deleter(std::type_info const & ti) { return ti == typeid(D)? &del: 0; } #if defined(BOOST_SP_USE_STD_ALLOCATOR) void * operator new(std::size_t) { return std::allocator<this_type>().allocate(1, static_cast<this_type *>(0)); } void operator delete(void * p) { std::allocator<this_type>().deallocate(static_cast<this_type *>(p), 1); } #endif #if defined(BOOST_SP_USE_QUICK_ALLOCATOR) void * operator new(std::size_t) { return quick_allocator<this_type>::alloc(); } void operator delete(void * p) { quick_allocator<this_type>::dealloc(p); } #endif }; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) int const shared_count_id = 0x2C35F101; int const weak_count_id = 0x298C38A4; #endif class weak_count; class shared_count { private: sp_counted_base * pi_; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) int id_; #endif friend class weak_count; public: shared_count(): pi_(0) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { } template<class P, class D> shared_count(P p, D d): pi_(0) #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { cout <<"in shared_count: p= "<<p<<endl; #ifndef BOOST_NO_EXCEPTIONS try { pi_ = new sp_counted_base_impl<P, D>(p, d); cout <<"return from new sp_counted_base_impl1: p= "<ptr= "<<pi_->get_ptr()<<endl; } catch(...) { d(p); // delete p throw; } #else pi_ = new sp_counted_base_impl<P, D>(p, d); cout <<"return from new sp_counted_base_impl2: p= "<ptr= "<<pi_->get_ptr()<<endl; if(pi_ == 0) { d(p); // delete p boost::throw_exception(std::bad_alloc()); } #endif ((sp_counted_base_impl<P, D>*)pi_)->set_ptr(p); cout <<"after fix: pi_->ptr= " <<((sp_counted_base_impl<P, D>*)pi_)->get_ptr()<<endl; cout <<"end of shared_count: ptr= "<<pi_->get_ptr()<<endl; } #ifndef BOOST_NO_AUTO_PTR // auto_ptr<Y> is special cased to provide the strong guarantee template<class Y> explicit shared_count(std::auto_ptr<Y> & r): pi_(new sp_counted_base_impl< Y *, checked_deleter<Y> >(r.get(), checked_deleter<Y>())) #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { r.release(); } #endif ~shared_count() // nothrow { if(pi_ != 0) pi_->release(); #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) id_ = 0; #endif } shared_count(shared_count const & r): pi_(r.pi_) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) pi_->add_ref(); } explicit shared_count(weak_count const & r); // throws bad_weak_ptr when r.use_count() == 0 shared_count & operator= (shared_count const & r) // nothrow { sp_counted_base * tmp = r.pi_; if(tmp != 0) tmp->add_ref(); if(pi_ != 0) pi_->release(); pi_ = tmp; return *this; } void swap(shared_count & r) // nothrow { sp_counted_base * tmp = r.pi_; r.pi_ = pi_; pi_ = tmp; } long use_count() const // nothrow { return pi_ != 0? pi_->use_count(): 0; } bool unique() const // nothrow { return use_count() == 1; } friend inline bool operator==(shared_count const & a, shared_count const & b) { return a.pi_ == b.pi_; } friend inline bool operator<(shared_count const & a, shared_count const & b) { return std::less<sp_counted_base *>()(a.pi_, b.pi_); } void * get_deleter(std::type_info const & ti) const { return pi_? pi_->get_deleter(ti): 0; } template<class P, class D> P get_ptr() { return pi_?((sp_counted_base_impl<P, D>*)pi_)->get_ptr() : 0; } void set_ptr(void *ptr) { if(pi_) pi_->set_ptr(ptr); } }; #ifdef __CODEGUARD__ # pragma option pop #endif class weak_count { private: sp_counted_base * pi_; #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) int id_; #endif friend class shared_count; public: weak_count(): pi_(0) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(weak_count_id) #endif { } weak_count(shared_count const & r): pi_(r.pi_) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) pi_->weak_add_ref(); } weak_count(weak_count const & r): pi_(r.pi_) // nothrow #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) pi_->weak_add_ref(); } ~weak_count() // nothrow { if(pi_ != 0) pi_->weak_release(); #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) id_ = 0; #endif } weak_count & operator= (shared_count const & r) // nothrow { sp_counted_base * tmp = r.pi_; if(tmp != 0) tmp->weak_add_ref(); if(pi_ != 0) pi_->weak_release(); pi_ = tmp; return *this; } weak_count & operator= (weak_count const & r) // nothrow { sp_counted_base * tmp = r.pi_; if(tmp != 0) tmp->weak_add_ref(); if(pi_ != 0) pi_->weak_release(); pi_ = tmp; return *this; } void swap(weak_count & r) // nothrow { sp_counted_base * tmp = r.pi_; r.pi_ = pi_; pi_ = tmp; } long use_count() const // nothrow { return pi_ != 0? pi_->use_count(): 0; } friend inline bool operator==(weak_count const & a, weak_count const & b) { return a.pi_ == b.pi_; } friend inline bool operator<(weak_count const & a, weak_count const & b) { return std::less<sp_counted_base *>()(a.pi_, b.pi_); } }; inline shared_count::shared_count(weak_count const & r): pi_(r.pi_) #if defined(BOOST_SP_ENABLE_DEBUG_HOOKS) , id_(shared_count_id) #endif { if(pi_ != 0) { pi_->add_ref(); } else { boost::throw_exception(boost::bad_weak_ptr()); } } } // namespace detail } // namespace boost #ifdef __BORLANDC__ # pragma warn .8027 // Functions containing try are not expanded inline # pragma warn .8026 // Functions with excep. spec. are not expanded inline #endif #endif // #ifndef BOOST_DETAIL_SHARED_COUNT_HPP_INCLUDED in shared_count: p= 0x8127738 IN sp_counted_base_impl ocnstructro ptr=0x8127738 p=0x8127738 sizeof(*this)= 44 IN sp_counted_base_impl end ocnstructro ptr=0x8127738 ptr addr: 0x8127fd8 p=0x81 27738 this= 0x8127fb0 ptr in get_ptr= 0 sizeof(*this)= 20 ptr addr: 0x8127fc0 return from new sp_counted_base_impl1: p= 0x8127738 pi_->ptr= 0 this= 0x8127fb0 setting ptr to: 0x8127738 sizeof(*this)= 44 ptr= 0x8127738 ptr addr: 0x8127fd8 this= 0x8127fb0 ptr in get_ptr= 0 sizeof(*this)= 20 ptr addr: 0x8127fc0 after fix: pi_->ptr= 0 this= 0x8127fb0 ptr in get_ptr= 0 sizeof(*this)= 20 ptr addr: 0x8127fc0 end of shared_count: ptr= 0

2 2

Newbie question: block read inputs to regex
by annirak＠shaw.ca 13 Dec '03

13 Dec '03

I'm using regex_grep() to search through file contents for matches. I want to read the file in blocks to keep memory use down for large files. What I want to know is whether there is some way of adding the next block of memory to the grep where the last one left off. The best solution I can come up with is using some sort of double-buffering scheme, but that would take an awful lot of memory copies and searching some text multiple times. Both things I would prefer to avoid. What can I do? --Brendan

3 2