|
Boost : |
Subject: Re: [boost] [sort] Re: [review] Formal review period for Sort library begins today, November 10, and ends Wednesday, November 1
From: Niall Douglas (s_sourceforge_at_[hidden])
Date: 2014-11-10 07:07:50
On 10 Nov 2014 at 10:35, Vladimir Prus wrote:
> Apologies if I'm overly critical, but we're asked to review an
> implementation of an algorithm from Steven's paper from 2002, and as of
> today, neither Google Scholar nor Citeseer can find any references to
> that paper. So, it's not an established algorithm by any means, Boost is
> generally not an algorithms review organization, and so I'm not sure
> it's good for Boost to review the proposed implementation at all.
I want to see scaling benchmarks comparing this implementation with
the traditional STL containers for 0 to 10,000 items, for both single
threaded and concurrent usage (even if that is simply a spinlock
around the library).
If these scaling benchmarks are not provided, I automatically vote
no.
Niall
-- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk