|
Boost : |
Subject: Re: [boost] [Review:Algorithms] is_ordered name
From: JOAQUIN M. LOPEZ MUÃOZ (joaquin_at_[hidden])
Date: 2011-09-24 03:34:59
El 24/09/2011, a las 04:15, Andrew Sutton <asutton.list_at_[hidden]<mailto:asutton.list_at_[hidden]>> escribió:
I spent a few moments trying to think of a noun that means "point at which
ordering stops". There probably is one that's better than "disorder". It's
not quite a "discontinuity", but maybe there is something like that from
maths. I also wondered about a more general word like "failure", since any
predicate can be passed. "find_ordering_failure" maybe? Or even just
"find_unordering" or "find_unorder". Any thoughts?
Isn't this the same as the C++11 is_sorted_until?
Yes! C+11 had is_sorted_until and is_sorted (equivalent to is_sorted_until(first,last)==last). I think the names here should be the same for consistency reasons, and probably the functions should be just aliases to the c++11 ones where applicable.
JoaquÃn M López Muñoz
Telefónica, Investigación y Desarrollo
________________________________
Este mensaje se dirige exclusivamente a su destinatario. Puede consultar nuestra polÃtica de envÃo y recepción de correo electrónico en el enlace situado más abajo.
This message is intended exclusively for its addressee. We only send and receive email on the basis of the terms set out at.
http://www.tid.es/ES/PAGINAS/disclaimer.aspx
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk