- Boost - lists.boost.org

[regex] patch for Tru64
by Markus Schöpflin 19 Apr '05

19 Apr '05

Hello, attached patch has just been applied to "regex/v4/sub_match.hpp". This clears the compilation errors currently seen on Tru64 when compiling the regex_time example. Markus Index: sub_match.hpp =================================================================== RCS file: /cvsroot/boost/boost/boost/regex/v4/sub_match.hpp,v retrieving revision 1.14 diff -u -r1.14 sub_match.hpp --- sub_match.hpp 21 Jan 2005 17:22:39 -0000 1.14 +++ sub_match.hpp 19 Apr 2005 15:01:30 -0000 @@ -44,7 +44,8 @@ sub_match(BidiIterator i) : std::pair<BidiIterator, BidiIterator>(i, i), matched(false) {} #if !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS)\ && !BOOST_WORKAROUND(BOOST_MSVC, < 1310)\ - && !BOOST_WORKAROUND(__BORLANDC__, <= 0x0551) + && !BOOST_WORKAROUND(__BORLANDC__, <= 0x0551)\ + && !BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042)) template <class T, class A> operator std::basic_string<value_type, T, A> ()const {

2 1

RE: [boost] Re: Boost to the rescue
by Martin Bonner 19 Apr '05

19 Apr '05

----Original Message---- From: Victor A. Wagner Jr. [mailto:vawjr@rudbek.com] Sent: 19 April 2005 16:03 To: boost(a)lists.boost.org Subject: Re: [boost] Re: Boost to the rescue > I've been using 7.1 since it became available, and haven't > bumped into any optimization problems, and we compile debug with > none, and about everything we can find to turn on in release. > Granted there are only 4 of us, but I don't recall any gotchas. I have. We compile "minimize size", and when bitshifting it gets things wrong. We have found this twice (the first time confirmed by Microsoft), and have had to revert to releasing the existing product with VC5 (Yes: 5 not 6. We never upgraded to VC6 because it was expensive, a resource hog, didn't seem to offer many new features, and a change to how #import work broke huge swathes of our code). -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 441434

1 0

review process
by Gennadiy Rozental 19 Apr '05

19 Apr '05

Hi, I think current approach to review managing is .. not good enough. I understand Tom do not want us delve in all gory details of what is currently going on, but absence on any information is even worse. I believe all behind the scene discussions needs to be brought to minimum. No need to wait for anything. "Show must go on". My personal interest as a review manager for one of the upcoming submissions is to have clear understanding when I need to allocate extra time. And as soon as possible either. This uncertainty is inconvenient at best. Gennadiy

1 0

[hash] Expected behaviour of hashing quiet NaN?
by Markus Schöpflin 19 Apr '05

19 Apr '05

Currently "functional/hash - hash_float_test" fails on Tru64/CXX6.5 (See http://tinyurl.com/8opfo) The reason of the failure is that QNaN and 0 give the same hash code on this platform. I was wondering what the expected hash of QNAN actually should be. Is it some platform dependent value? I put some traces in hash_detail::float_hash_value(), and the cause for the same hash value for 0 and QNAN seems to be that static_cast<int>(QNAN) gives 0 which then results in a call of hash_combine(0, 0) for both 0 and QNAN. Does anybody know what the expected result of static_cast<int>(QNAN) is? My guess is that either I should get a floating point exception for this expression or that the return value is unspecified and errno is set to [EDOM], but this is pure speculation on my side. Markus

3 7

Proposal: intrusive containers
by Olaf Krzikalla 19 Apr '05

19 Apr '05

Hi, I have finished the first version of my STL-like intrusive containers and I want to propose the idea for boost. For detailed informations please visit: http://people.freenet.de/turtle++/intrusive.html Best regards Olaf Krzikalla

2 2

patch for numeric_cast
by Toon Knapen 19 Apr '05

19 Apr '05

Currently following situation does not generate a bad_numeric_cast. <test> unsigned int ui = std::numeric_limits< unsigned int >::max() ; int i = boost::numeric_cast< int >( ui ) ; </test> Nevertheless 'i' is -1 instead of some very big number. To catch this kind of error, I propose to apply following patch to boost/cast.hpp (in attachment). The current implementation casts the value for to the target-type and back to the original type and verifies that it is still the same value. For the example above, the intermediate result will be -1 although casting it back to the original type will result in the original value. So the patch verifies that this intermediate result will not be negative. If the patch is accepted I will also add a test in the current regression-test of numeric_cast. toon -- Check out our training program on acoustics and register on-line at http://www.fft.be/?id=35

1 0

async socket i/o [long]
by Michel André 18 Apr '05

18 Apr '05

There has been some discussion on this on the list lately. Is there anyone working on it. I have been pondering an interface that supports both async and blocking io combined. And an event dispatching model that can handle several types of dispatching mechanism through a the same interface to provide for a lot of differnet implementations. At heart of this is an io_stream base class that should serve as base for classes like tcp_stream and udp_stream. class io_stream : public event::event_handler { public: // blocking read virtual io_result read( void* buffer, size_t byteCount) = 0; // blocking write virtual io_result write( const void* buffer, size_t byteCount) = 0; // asynchrounous read. virtual io_result async_read( void* buffer, size_t byteCount, boost::function<void(const io_result&)>) = 0; // asynchrounous write. virtual io_result async_write( const void* buffer, size_t byteCount, boost::function<void(const io_result&)>) = 0; virtual void close() = 0; protected: }; the event_handler interface is at heart of event handling and dispatching. class event_handler { ublic: virtual ~event_handler(); // returns a pointer to the dispatcher the source // is attached to or NULL if the source isn't attached. event_dispatcher* dispatcher(); protected: enum event_type_t { read_event, // A read can be done without blocking read_done_event, // An async read is completely done write_event, // A write can be done without blocking write_done_event, // An async write is completely done connect_event, accept_event }; typedef std::bitset<6> event_set_t; // returns the current set of events we want to receive event_set_t event_filter() const; // updates the current event set by oring // current filter and the set provided void update_event_filter(event_set_t set); // an opaque handle to the underlying source virtual void* handle() = 0; /// callack when event occurs. /// event - type of event dispatched /// bytes - number of bytes affected by the event /// size_t(-1) if unknown. /// error - an event specific error code 0 if no error /// eventData - a void* pointer that contains opaque /// data supplied when initiating the operation NULL of none /// is supplied or not available void dispatch_event( event_type_t event, size_t bytes, unsigned int error, void* eventData) = 0; private: event_handler(const event_handler&); event_handler& operator=(const event_handler&); }; From this we could be notified both of full async completes or just ready to write and ready to receive. And when a concrete io_stream implementation receives notification it can check on the flags if the read have completed or of we must do a read or write to fullfill the pending operation that must be stored within the implementation. This makes for implementations of the event dispatcher (including simple select, kqueue, iocp or some other mechanism both edge and level triggered). The event dispatcher interface looks like: class event_dispatcher { public: /// attaches an event handler to an dispatcher /// all dispatchable events for the event handlers /// handle will go through this dispatcher. an event handler /// and its associated handle is attached /// to a specific dispatcher throughout its life time virtual void attach(event_handler& source); /// Removes an event handler from set. notifications /// wont be sent to this dispatcher to the event handler /// after this point. virtual void detach(event_handler& source); /// notify the event_dispatcher that the event filter /// has changed for the given source virtual void notify(event_handler& source); /// dispatch pending events blocks timeoutSecs waiting /// for event. returns true if an event was dispatched /// during the call. virtual bool dispatch_event(unsigned int timeoutMsecs); /// adds a callback to be called asynchrounously the next /// as soon as possible. virtual void asynch_dispatch(boost::function<void> callback); }; This can be implemented in various ways through simple select for single threaded version, and leader follower select for multithreaded with several threads hanging in dispatch_events and handling and event and promoting a new leader to catch next set. And it could be implemented using io completion ports or kqueue for scalable variants. To top this of we have connector and acceptor base classes class connector : public event::event_handler { public: std::auto_ptr<net::io_stream> connect_stream() = 0; void async_connect_stream( boost::function<void(const io_result&, std::auto_ptr<net::io_stream>)> callback) = 0; }; class acceptor : public event::event_handler { public: std::auto_ptr<net::io_stream> accept_stream() = 0; void async_accept_stream( boost::function< void(const io_result&, std::auto_ptr<net::io_stream>)> callback) = 0; }; And tcp_acceptor and tcp_connector to implement these for tcp. Eg the tcp acceptor: class tcp_acceptor : public acceptor { public: acceptor(const ip_endpoint& localEndPoint); acceptor(event::event_dispatcher& dispatcher, const ip_endpoint& localEndPoint); std::auto_ptr<net::tcp_stream> accept() = 0; void async_accept( boost::function<void(const io_result&, std::auto_ptr<net::tcp_stream>)> callback) = 0; /// Acceptor functions std::auto_ptr<net::io_stream> connect_stream() = 0; void async_connect_stream( boost::function<void(const io_result&, std::auto_ptr<net::io_stream>)> callback) = 0; }; I think these interfaces would allow for a range of implementations under the same umbrella. The os dependent sockets part should be handled by a socket facade class. The io_result class is a helper class that handles reporting of the actual result and eventual error outcome of an operation. It combines error codes and exception throwing. // encapulates a result of an net operation // throws an io_error if none of the following // members haven't been called before destruction: // failed,success,error_code,throw_exception. struct io_result { enum error_code_t { e_success, e_cancelled, // operation was cancelled e_pending_io // an net operation of the specified type is already pending }; error_code_t error_code() const; bool failed() const; bool success() const; void throw_exception() const; // bytes transferred by the last operation size_t byte_count() const; }; So this is the outline of an interface that I think could serve as a foundation for a net library. I will try to go about and implement prototype for this using both select and iocp. But there are some things to iron out such as thread saftey and such (since it will necessary to at least having several threads blocking in dispatch_event at least the event_dispatcher would have to be thread safe and probably parts of the event source d). What are your initial thaugths on this, implementatble? flexible enough? efficient enough? What are you others doing in this field? And maybe we should do something together instead if we are sitting in different cornes hacking on something similar. I know for one i need help with boost.build, how to produce documentation according to boost standard, multi platform testing and the like ;). Regards /Michel

4 18

Re: [boost] Re: Boost to the rescue
by brangdon＠cix.compulink.co.uk 18 Apr '05

18 Apr '05

In-Reply-To: <6.2.0.14.2.20050417091210.0840a328(a)mail.rudbek.com> vawjr(a)rudbek.com (Victor A. Wagner Jr.) wrote (abridged): > > The shear size of boost bothers me in that I don't want to burden > > my source code control system unnecessarily. > > 21 meg isn't that much (for the headers) Actually it's quite a lot. This is a "new tool" issue - once any new tool is incorporated into the code, we have to keep it around for ever, even if it proves useless and we stop using it 6 months later. It's a barrier to entry, and it would be a lower barrier if boost took 1 meg or 10k. Basically I am supporting the idea of splitting boost into a collection of small, independent packages. I don't know how big the subset I selected was, but it was probably nearer 10k. From memory it was operator.hpp, smart_ptr.hpp and static_assert.hpp, plus whatever they depend on (which I discovered by repeatedly attempting to compile). I didn't want to include anything I couldn't see an immediate use for. Instead I encouraged my colleagues to view the website and add anything they wanted from it. Nobody has yet done so, which I suppose weakens the claim that a small subset will lead to a bigger one. > > The dependency issue bothers me too. > > You'd seriously rather that people copy/paste code to reduce > dependencies? There's a trade-off. It depends on the size and complexity of the library code. For example, I once experimented with using operators.hpp to generate != from ==. The benefit seemed borderline. There is a hump involved in using 3rd party code, and for a one-line routine: inline bool operator!=( const MyType &a, const MyType &b ) { return !(a == b); } it hardly seems worth it. Operators.hpp has over 900 lines of code, full of #ifdef's for various compilers, templates and inheritance. To understand it you need to know about subtle language issues: for example how the inline "friend" generate non-member functions, or the nuances of the empty base class optimisation. The documentation is long and complicated. None of this can be understood at a glance, where-as the hand-written version above can. > > I've had code break because a boost header somewhere redefined min > > and max. > > where? when? A few weeks ago. Probably using boost 1.31 - I'm not at work to check. I don't recall which header I #included. Probably shared_ptr.hpp. > the real problem is that MicroSloth [...] #define min and max as > a result of using windows.h !!!! I know. The point remains. Experienced programmers know that using any 3rd partly library can introduce problems. Boost is no exception. -- Dave Harris, Nottingham, UK.

5 5

[test] unused test file?
by Vladimir Prus 18 Apr '05

18 Apr '05

It looks like libs/test/test/unit_test_suite_ex_test.cpp is not used by any test. It was previously used by the unit_test_suite_ex_test test, but that test was remove in revision 1.26 of libs/test/test/Jamfile. Should the above file be remove too? - Volodya

2 1

RE: [boost] How to merge set<int>
by Eyal Farago 18 Apr '05

18 Apr '05

if you want to use the std::merge algorithm: set<int> c; std::merge(a.begin(), a.end(), b.begin(),b.end(),std::inserter(c, c.end()); but there is a simpler way to do it: set<int> c(a); //copy c'tor c.insert(b.begin(),b.end()); eyal. -----Original Message----- From: zlf [mailto:zlfcn@hotmail.com] Sent: Monday, April 18, 2005 6:52 AM To: boost(a)lists.boost.org Subject: [boost] How to merge set<int> Hi, I have to sets(set<int> a,b). How to use function [merge] to merge the two sets to another one(set<int> c)? thx zlf _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1