- Boost - lists.preview.boost.org

Review results missing for boost.log
by Michael Caisse 03 Apr '10

03 Apr '10

In an attempt to reduce the FUD on IRC I pointed people to the review schedule page to find results on the Boost Log review. To my sheepish chagrin the results are not in the table. Not sure who has permissions to update the table. The following link is Volodya's posted review results. http://article.gmane.org/gmane.comp.lib.boost.devel/201541 thanks - michael -- ---------------------------------- Michael Caisse Object Modeling Designs www.objectmodelingdesigns.com

1 0

[GSoC] Heaps & Queues (draft proposal)
by iaml 02 Apr '10

02 Apr '10

Hi everyone. I am Lintao from Sun Yat-sen University, China. This is my first time to send mail on mailing list. I'm a little nervous:-). I am interested in Heaps & Queues provided by Boost in 2010 GSoC. And I have finished my draft proposal after viewing the mailing list these days. Thank you for your comments and suggestions. ====== project proposal ====== In my opinion, most of work is to reuse and rearrange the existing data structure in boost/pending and other data structures which have already existed.[1] The most important thing I should consider is the APIs design of the new library. So for each data structure, it should not only agree to the formulation provided by the BGL, but also should be easy to remember and user-friendly. Besides, I would like to add d-ary heap and splay heap into the new library. Because d-ary heap is a variation of binary heap and has faster running time. As for splay heap, it has the attractive property that recently accessed elements are quick to access again. I think it will be very useful in application software programming. If time permits, I want to add others implementations of heap [2] into the new library. Below is my design to the library APIs. template <class T, class Compare = std::less<T>> class heap{ public: * void insert(T& key);* * void delete(T* key);* * void update(T* t, T& new_key);* T* getRoot(); T* find(T& key); bool empty() const; size_type size() const; void print() const; private: void print_recur() const; protected: T* _root; }; NOTICE: * operations in bold mean it should be implement by the subclass. * operations print and print_recur is optional. But I prefer to include them because it'll be helpful when debugging the programs using this library. The class mentioned above is the base class for all the heap structures in the new library. The classes such as Fibonacci heap, relaxed heap, binomial heap and splay heap should inherit from this abstract class and add additional operations if needed. And I would prefer to use lists rather than vectors (as shown in boost/pending/fibonacci_heap.hpp) to implement it for three reasons. 1. It will save memory since the later needs extra space to store the key to value mapping. 2. Vector requires continuous memory while list doesn’t. It does not matter when the amount of data is small. But when the amount of data becomes large, it will be a tough problem; 3. It takes time to resize and reallocate the memory for vectors. Of course, list implementation has its own drawback such as easy to leak memory and cost more time when searching the heap. From my point of view, it is acceptable comparing with the problems mentioned before. As the adaptor of heaps, the priority queue API may like: template<class T, class Compare = std::less<T>, class Container = fibonacci_heap<T, Compare>> class priority_queue{ public: void push(T& key); T pop(); const T& front() const; T& front(); T* find(T& key); void update(T* t, T& new_key); bool empty() const; size_type size() const; void print() const; private: void print_recur() const; }; [1][2] It means the data structure in this URL: https://svn.boost.org/svn/boost/sandbox/libs/pri_queue/ Thank you for reading.

3 3

[GSoC 2010]: BGL Graph Connectives ideas
by Yaroslav Vorontsov 02 Apr '10

02 Apr '10

> > I'm Yaroslav Vorontsov (or simply Jerry Lee :-)), a student of Computer > > Science Department of Voronezh State University, Russia. I'm interested in > > both generic programming and graph theory, and I also would like to > > participate in Google Summer of Code 2010. I had some experience of generic > > programming before when I tried to implement my own generic graph library in > > C# (of course, as a task on one of programming courses at the university). > > I've read that (quote) "The Boost.Graph library is missing connectives...". > > I'm quite familiar with C++ and the idea of generic programming and I'm > > working with some graph theory aspects at the moment, so I want to know: > > what particular skills (in programming, of course) are needed to develop > > graph connectives? > > > > Hi Simply Jerry Lee:), > > Good question. Working on the Boost graph library requires a sound > understanding of its organization and its construction. There are a lot of > techniques used in its construction that are atypical of most OO libraries > (even C# generic data structures). You should be able to identify aspects of > an algorithm that aren't "universally generic" and understand how to > abstract them using templates, types, metaprogramming, etc. > > Most of that can be learned on the job, so to speak, but having a good eye > for abstraction certainly helps. > > Andrew Sutton > andrew.n.sutton(a)gmail.com > > Mr Sutton, Many thanks for your exhaustive explanation! :-) I have some ideas about implementing graph connectives. I think that the best way to implement first four binary operations (union, join, intersection and difference) is to use adjacency matrices. Also I'd like to add an operation which wasn't mentioned in the task proposal. It's ring sum of two graphs. Here is a short description: let A(Va,Ea) and B(Vb,Eb) be two graphs, where Va and Vb are sets of vertices of these graphs and Ea and Eb are sets of edges. The ring sum of A and B is a new graph C=A(+)B which has no isolated vertices and which has edges included only in Ea or in Eb (but not in both sets). It's something like symmetric difference between two sets in the set theory. As for unary operations, adjacency matrices may be useful in the implementation of graph closure, removal of edge and shrinkage of graph. Yaroslav Vorontsov DarthYarius_0990(a)mail.ru

2 1

use case of [move] rvalue reference emulation
by DE 02 Apr '10

02 Apr '10

hi all once i needed to pass around an object of a reference-like type i.e. a class with reference semantics something as trivial as template<typename type> struct ref { typedef typename type::value_type value_type; type &reference; const size_t index; ref(ref &a) : reference(a.reference), index(a.index) {} ref(type &a, size_t i) : reference(a), index(i) {} ref &operator=(const value_type &a) { /*setting value, e.g. 'reference.set(index, a)'*/ return *this; } operator value_type() const {/*return appropriate value, e.g. 'reference.at(index)'*/} }; so an access function returned an object of that ref type by value and no function wanted to take it because eventually a rvalue could not be bound to a non-const reference then an idea of using a rvalue emulation proposed by boost move library came in my mind although it's not a move constructor it allows to construct objects of type 'ref' from rvalues: ref(rv_ref<ref> &a) : reference(a.reference), index(a.index) {} and also a conversion to rv_ref sholud be added: operator rv_ref<ref>&() { return *static_cast<rv_ref<ref>*>(this); } see fully working code example at http://codepad.org/rRM93AFo defining a reference type "rvalue copy assignable" makes it behave almost the same as ordinary c++ references also constness is preserved perfectly and it happend so that all limitations of the emulation only strengthen the design of such reference types (e.g. unavailability of 'type(const type&)' constructor) an example of the application of such reference types may be an advanced map class when you subscript an stl map object like map[key]; a record with the 'key' is created in the map if it's not there already so not to overpopulate our map we write something like value_type value; if (map.is_there(key)) value = map[key]; of course there is no such 'is_there()' member function in an stl map i'm just trying to make my intention clear so were that smart reference typedefed in the map like template</*...*/> class map { public: //... typedef map_ref<map> reference; //... }; it could have slightly better semantics: map[key]; //always does nothing map[key] = new_value; //if there is no record with 'key' -> creates it //assignes 'new_value' to the value of the record value = map[key]; //retrieves a value associated to 'key' in the last case if there is no such record in the map it may return an invalid value or throw an exception anyway i consider this semantics more natural than that of the current std::map not to mention that you may pass a reference to a function: void foo(map::reference a) { a = "42"; } //if there was no record -> creates it //... foo(map[key]); //does not create record at this point and it will work flawlessly -- Pavel P.S. if you notice a grammar mistake or weird phrasing in my message please point it out

1 1

[contract] Released Contract Programming Library on SourceForge
by Lorenzo Caminiti 02 Apr '10

02 Apr '10

Hi all, I have released on SourceForge a library that implements Contract Programming (a.k.a. Design by Contract(TM) ) for C++. I am considering to submit this library to Boost (as Boost.Contract). Contract++ Library * Download http://sourceforge.net/projects/dbcpp/ * Documentation http://dbcpp.sourceforge.net/ * Examples http://dbcpp.sourceforge.net/contract__/examples.html Comments? Regards, Lorenzo

2 9

[mpl] has_function
by Lorenzo Caminiti 02 Apr '10

02 Apr '10

Hello all, Is there a way I can check if a class has a given member function using metaprogramming? What I need is to check at compile-time if a function is overriding a virtual function or not. In the example below, z::f is overriding x::f but not y::f (which does not exist) and the compiler knows that -- is there a way I can extract that information from the compiler? struct has_function<class Base, ... /* other parameters */ > { ... /* some implementation */ }; struct x { virtual void f() {} }; struct y { virtual void g() {} }; struct z: x, y { void f() { cout << has_function<x, &z::f>::value << endl; // print 1 cout << has_function<y, &z::f>::value << endl; // print 0 } }; (This does not compile -- I do not know how to program it so it compiles -- but it should give the idea of what I am looking for.) Thank you very much. Lorenzo

16 27

Re: [boost] [GSOC] summary of BigInt library details
by Ankit Malpani 02 Apr '10

02 Apr '10

hello all, thanks for the prompt replies. here are some issues (some carry forwarded from previous mail) which need addressing. [Scott McMurray wrote] >For example, GMP has a function mpz_addmul(x,y,z) that we would rather >write as x += y*z; > >My idea for the use of Boost.Proto is for its expression template >transformation features to rewrite the easy-to-use syntax to take >advantage of such optimized backend features. thank you, that really clarified the issue rearding basing the frotend off Boost.Proto. My question is - boost already has done work for handling big_integral [boost/mpl/math/big_integral/] (saw it in archives dating back to 2005 refer [1] ) so which backend option is more advisable:- a) use these functions based off boost/mpl/math/big_integral/. if so can someone please give a link to its documentation. or b) use a backend developed by me .(probably with the help non boost.math but standard c++ libraries) [Bruno Lalande wrote:] >So to summarize, I can see 3 distinct actions: >1) implement your BigInt backend >2) provide a Boost.Math binding compliant interface for this backend >3) implement a frontend for Boost.Math binding based on Boost.Proto thanks for summing it up so precisely :) could u please elaborate more on point 2, does it mean that the interface being provided should be similar to those provided by Boost.Math ? here is my refined project idea once again:- 1. provide the frontend which takes care of expressions like z += y*z (using Boost.Proto) 2. implement backend using :- a) an implementation developed by me (using simple standard c++ library functions). or b) using boost/mpl/math/big_integral/ . (if so please give me a link to its documentation) moreover, is there any Boost specific format to be followed for submission of the project idea? i hope the community and gsoc mentors will help me out with these queries soon. [1] http://lists.boost.org/Archives/boost/2005/10/subject.php Cheers! Ankit Malpani 3rd Year Undergraduate | BE. Hons Computer Science BITS Pilani Goa Campus

2 1

[1.43.0] Change of release schedule
by Beman Dawes 02 Apr '10

02 Apr '10

To allow a large block of weekend time for last tweaks, from now on the release schedule is going to be changed to the first Monday of the second month of each quarter. Updated calendar 1.43.0: http://www.boost.org/development/index.html General date info: http://svn.boost.org/trac/boost/wiki/ReleaseSchedule --Release managers

1 0

[range][string_algo] Conflict between algorithm names
by Jeremiah Willcock 02 Apr '10

02 Apr '10

When I try to include both Boost.Range algorithms (in the current trunk version) and Boost.Algorithm, using a file such as the following: #include <boost/algorithm/string.hpp> #include <boost/range/algorithm.hpp> I receive several errors about duplicate definitions. I am using gcc 4.1.2 on Linux. ./boost/range/algorithm/find.hpp:28: error: ‘template<class SinglePassRange, class Value> typename boost::range_iterator::type boost::find(SinglePassRange&, const Value&)’ conflicts with previous using declaration ‘template<class RangeT, class FinderT> boost::iterator_range<typename boost::range_iterator<C>::type> boost::algorithm::find(RangeT&, const FinderT&)’ ./boost/range/algorithm/lexicographical_compare.hpp:28: error: ‘template<class SinglePassRange1, class SinglePassRange2> bool boost::lexicographical_compare(const SinglePassRange1&, const SinglePassRange2&)’ conflicts with previous using declaration ‘template<class Range1T, class Range2T> bool boost::algorithm::lexicographical_compare(const Range1T&, const Range2T&)’ ./boost/range/algorithm/lexicographical_compare.hpp:42: error: ‘template<class SinglePassRange1, class SinglePassRange2, class BinaryPredicate> bool boost::lexicographical_compare(const SinglePassRange1&, const SinglePassRange2&, BinaryPredicate)’ conflicts with previous using declaration ‘template<class Range1T, class Range2T, class PredicateT> bool boost::algorithm::lexicographical_compare(const Range1T&, const Range2T&, PredicateT)’ The using declarations mentioned in the error message are in files such as boost/algorithm/string/find.hpp. Is there a workaround or easy fix for this? -- Jeremiah Willcock

5 10

[range] Merging algorithms into release branch and <boost/detail/algorithm.hpp>
by Jeremiah Willcock 02 Apr '10

02 Apr '10

The release branch's version of <boost/detail/algorithm.hpp> contains several range versions of STL algorithms that duplicate those in the new version of Boost.Range. The trunk version has removed these duplicate algorithms (in r60919), using Boost.Range instead. This note is to inform whoever merges the algorithms in Boost.Range into the release branch to merge r60919 as well to avoid duplicate function errors. -- Jeremiah Willcock

1 0

GSOC 2010 :BOOST Heaps and Queues
by shivaraaj kotini 02 Apr '10

02 Apr '10

Hi all, Im Shivaraaj, Im from Birla Institute of Technology Science (B.I.T.S) pilani, India. I recently came across GSOC 2010 and Im very interested in it.Though Im late I dont want to give up and continue discussing ideas before submitting an application. Im very much interested in BOOST Heaps and Queues project. My idea was to create a replica of JSDL api in BOOST (not completely but the useful part related to our project) and providing more features by adding 'mutable' to the objects created and there by we can do updations to existing objects. I feel we can inherit and create a lot of standard data structures apart from heaps. And within heaps we can create all different types of heaps and pull under a common interface. Thank You, Shivaraaj Kotini.

2 1

Release 1.12 of the C++ Middleware Writer on line
by Brian Wood 01 Apr '10

01 Apr '10

B"H Release 1.12 of the C++ Middleware Writer is now on line. This release fixes several bugs and adds support for the following: 1. Multiple inheritance, but we don't support virtual inheritance yet. G-d willing, we'll add that later. 2. boost::scoped_ptr, auto_ptr/unique_ptr. 3. Accounts An account is now needed to use the command line interface of the C++ Middleware Writer. When an account is created, a directory will be associated with the account. That directory is reused with each request and only the input files that have changed since your last request are transmitted. The command line interface config file, direct.cfg, refers to an Account-Number. That file has to be updated after you set up an account. Use this page -- http://webEbenezer.net/cgi-bin/account.cgi -- to set up an account. Setting up an account is currently trivial -- no questions asked -- just click the button. There's an example of the multiple inheritance and scoped_ptr support here -- http://webEbenezer.net/release/112.example . Cheers, Brian Wood http://www.webEbenezer.net (651) 251-9384

1 0

Transfer of Maintenance Rights
by Stewart, Robert 01 Apr '10

01 Apr '10

Dave asked for a policy proposal for how Boost library maintenance rights may be transferred. Edward Diener declined, so I'll offer one and go a little further while I'm at it. Consider the following as a replacement for the text at <http://www.boost.org/community/reviews.html#Maintainer>. _____________________________ Library Author's Responsibilities By submitting a library to Boost, you agree to put the library and its documentation under a Boost-compatible license, if it is accepted. If your library is accepted, you are free to change it any way you wish. Indeed, we encourage you to make constant improvements. However, because peer review is an important part of the Boost process, please consider getting Boost community feedback before making substantial changes to the interface of your library. Furthermore, if your library is accepted, you agree to be the library maintainer or to find a qualified volunteer to serve in your stead. You may, of course, assemble a qualified group to act as maintainers of your library, regardless of whether you continue to be a maintainer. Library Maintainer's Rights and Responsibilities As a library maintainer, you agree to provide timely support to users of the library, and to fix bugs and release those fixes in a timely fashion. You also agree to consider making library enhancements and improvements. Note that others may offer and even commit patches to a library you maintain, provided the patch is posted to the Boost Developer's mailing list for approval and is not rejected by anyone within a reasonable time. If you find that you can no longer fulfill your responsibilities as maintainer of a library, you are responsible to advertise this to the Boost community. If you are the sole maintainer, you are responsible to find a replacement. If for some reason you fail to fulfill your responsibilities as maintainer of a library, as judged by the Boost community, whether through willful neglect or otherwise, you agree to allow the Boost community to provide a suitable replacement. _____ Rob Stewart robert.stewart(a)sig.com Software Engineer, Core Software using std::disclaimer; Susquehanna International Group, LLP http://www.sig.com IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

25 51

GSOC Proposal :
by abhijith reddy 01 Apr '10

01 Apr '10

Hello I am Abhijith Reddy a 3rd year undergrad student from India and my idea for this year's GSOC is to implement an efficient prime factorization (large numbers) class that could be integrated into the Math and numerics library of Boost. I have been working on this since 2-3 months as i am currently doing a project on it, so i already have most of the code however its written in a different language(PIKE) since it supports bigint (uses GMP). So for this project I have to implement my own mini bigint class as well. This class will be relatively smaller compared to any full fledged bigint libraries since the numbers dealt here are relatively small (less than 50 digits) and always positive, so complex algorithms used in normal bigint libraries like (karatsuba,fft based multiplication) can be avoided. So i want to know the scope of this project and any other tips/suggestions would be helpful. Thank you

1 0

GSoC: Boost.Graph library - Graph Connectives
by Yaroslav Vorontsov 01 Apr '10

01 Apr '10

Hello everyone! I'm Yaroslav Vorontsov (or simply Jerry Lee :-)), a student of Computer Science Department of Voronezh State University, Russia. I'm interested in both generic programming and graph theory, and I also would like to participate in Google Summer of Code 2010. I had some experience of generic programming before when I tried to implement my own generic graph library in C# (of course, as a task on one of programming courses at the university). I've read that (quote) "The Boost.Graph library is missing connectives...". I'm quite familiar with C++ and the idea of generic programming and I'm working with some graph theory aspects at the moment, so I want to know: what particular skills (in programming, of course) are needed to develop graph connectives? Thanks in advance, Yaroslav

2 2

[bgl] Reconnecting an edge
by Matthias Walter 01 Apr '10

01 Apr '10

Hi! Is there any way to reconnect an edge in a graph? I'm interested in doing so while retaining a property map. Thus remove_edge and add_edge are not a solution, I think. If not, may it worth to add such a concept? best regards Matthias Walter

3 3

[GSoC 2010] Boost.Graph topology generators
by Omair Mohammed Abdullah 01 Apr '10

01 Apr '10

Hi, I am interested in implementing topology generators for Boost.Graph. I have a few questions: What is the scope of this project? Is it expeced to implement the common topologies with detection methods or more? For example, are generators like PLOD, Erdos-Renyi and small-world are already there. Are we supposed to extend them?

2 1

GSOC 2010 :BOOST Heaps and Queues
by shivaraaj kotini 01 Apr '10

01 Apr '10

Hi all, Im Shivaraaj, Im from Birla Institute of Technology Science (B.I.T.S) pilani, India. I recently came across GSOC 2010 and Im very interested in it.Though Im late I dont want to give up and continue discussing ideas before submitting an application. Im very much interested in BOOST Heaps and Queues project. My idea was to create a replica of JSDL api in BOOST

1 0

Second iteration of Boost.XInt library uploaded, requesting further comments
by Chad Nelson 01 Apr '10

01 Apr '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've just uploaded the second iteration of the Boost.XInt library to the Boost Vault. I very much appreciate all of the comments and suggestions everyone has offered on the first one, and I've incorporated a number of them. Maybe I'm just a masochist, but please take a look and let me know what you think. - -- Chad Nelson Oak Circle Software, Inc. * * * -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkuypFUACgkQp9x9jeZ9/wRD3wCeMKRKaeml9UzhMNTpl15RvBFE pw8AniN8kkXNEFelgY4VYtWNzaCi88cV =lHLU -----END PGP SIGNATURE-----

5 13

[lock-free] CDS -yet another lock-free library
by Khiszinsky, Maxim 01 Apr '10

01 Apr '10

Hi, I'd like to present to boost community the CDS (Concurrent Data Structure) C++ library at libcds.sourceforge.net. It is an attempt to generalize well-known lock-free (and a few lock-based) data structures discovered by famous researches (M.Michael, N.Shavit and others). The library is mostly header-based, only the kernel of light-weight memory managers is resided in small dynamic library. The CDS library supports a set of modern processor architectures: x86, amd64, ia64, sparc; compiler supported is GCC 4 and MS Visual C++ 2008. The last CDS release 0.6.0 is developed close to C++ Memory Model proposal. I need the recommendations from boost community about : 1. Are the atomic primitives implemented correct for each of supported processor?.. I'm not an expert in this area... 2. Is the memory order constraint (from C++1x proposal) choosed correctly for lock-free data structure implementation?.. I known it is very large and magic question. Maybe, somebody analyzes the library code and find the errors. And I be very glad if anybody joins to CDS project. It is very interesting area of computing science with nonstandard algorithms and crazy implementation (and debugging notably).

9 35

[GSoC] Boost.XML proposal: 1st draft
by Ilie Halip 01 Apr '10

01 Apr '10

Hi, I almost finished writing the first draft of my project proposal (boost.xml). It has about everything except the schedule, for which I need a bit more time. I expect it to be finished in 2-3 hours from now. You can find the draft here: http://docs.google.com/View?docID=0Aa-6sdK9e3RZZGQydHd2ODVfNGZmdmtoNmM2 Please provide feedback. Thanks, Ilie.

1 0

GSOC Application Dates.
by swagat konchada 31 Mar '10

31 Mar '10

Does Boost suggest submitting the proposals for GSOC'10 as early as possible? Or is it ok if I take time? -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

2 1

GSOC BigInt Numeric_adaptor
by swagat konchada 31 Mar '10

31 Mar '10

> swagat konchada wrote: > > > If we consider performance issues based on design, planning the > > BigInt architecture could be designed in two ways > > > > 1. 3 layers to allow optional binding to Boost's own bigint, > > GMP, or anyother bigint library, for the user during compile > > time. > > > > 2. 2 layers if we plan to limit Boost.Bigint's options to only > > itself and GMP. > > [snip] >IMO you should look at the discussion on a numeric_adaptor by Barend Gehrels and some draft code mentioned in > http://archive.freebsd.se/?ml=freebsd-questions&a=2007-05&m=11343770<http://archive.freebsd.se/?ml=freebsd-questions&a=2007-05&m=11343770> >to get some idea of the problem and a plausible framework which might include 'BoostsOwnBigInt' as an alternative to GMP >etc. >Paul >PS But you should also be aware that another xInt project is being discussed on this group. I checked out the numeric_adaptor scheme. It has used the GMP library and the CLN library's API to optionally provide some basic arithmetic operators on arbitrary precision decimal numbers(it was surprising since i expected adaptation for integer operations first, though i realise that there'd be no much change in the code). The main idea of the numeric_adaptor scheme though is the to_traits struct, which would cast the library dependent types to Boost's types by using explicit templates(i hope this is the right term). In fact the scheme paves the way for a direct start of the implementation of Bigint since it provided the core design(the very expression template system which was called for) of an optional BigInt library. Making this expression template system exhaustive and make it work with any one of the libraries(GMP ofcourse), must be our priority. @Paul. A. Bristow : I am also following the discussion on Xint, and would comment on it asap. Suggestions and criticism please! -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

1 0

[intrusive doc] slist says that both push_front and push_back are constant-time
by Andy Venikov 31 Mar '10

31 Mar '10

The doc for slist says that if using non-constant size semantics, the size of the slist is the size of a single pointer. That means that either push_front or push_back cannot be constant time since we first need to find it. Am I missing something? Thanks, Andy.

2 2

[1.43.0] Cutoff for major code changes approaching
by Beman Dawes 31 Mar '10

31 Mar '10

The cutoff date for major code changes is this weekend, so please complete any pending merges to the release branch. Also, now might be a good time to check the release regression tests and inspection reports to make sure your library is in good shape: http://beta.boost.org/development/tests/release/developer/summary.html http://boost.cowic.de/rc/inspect-snapshot.html PS: The beta is scheduled for April 17th, and the release for May 1. The calendar can be seen at: http://www.boost.org/development/index.html -- The Release Managers, Beman Dawes Daniel James Eric Niebler Rene Rivera Vladimir Prus

1 0