/////////////////////////////////////////////////////////////////////////////\r
//\r
// (C) Copyright Olaf Krzikalla 2004-2006.\r
-// (C) Copyright Ion Gaztañaga 2006-2007\r
+// (C) Copyright Ion Gazta�aga 2006-2007\r
//\r
// Distributed under the Boost Software License, Version 1.0.\r
// (See accompanying file LICENSE_1_0.txt or copy at\r
//! <b>Throws</b>: Nothing.\r
//! \r
//! <b>Complexity</b>: Constant.\r
- reverse_iterator rend() \r
+ reverse_iterator rend()\r
{ return reverse_iterator(begin()); }\r
\r
//! <b>Effects</b>: Returns a const_reverse_iterator pointing to the end\r
//! <b>Throws</b>: Nothing.\r
//! \r
//! <b>Complexity</b>: Constant.\r
- const_reverse_iterator rend() const \r
+ const_reverse_iterator rend() const\r
{ return const_reverse_iterator(begin()); }\r
\r
//! <b>Effects</b>: Returns the number of the elements contained in the list.\r
template<class BinaryPredicate, class Destroyer>\r
void unique_and_destroy(BinaryPredicate pred, Destroyer destroyer)\r
{\r
- if(!this->empty()){\r
- iterator first = begin();\r
- iterator after = first;\r
- ++after;\r
- while(after != this->end()){\r
- if(pred(*first, *after)){\r
- pointer p = after.operator->();\r
- after = erase(after);\r
- destroyer(p);\r
+ if(!this->empty()) {\r
+ iterator first = begin();\r
+ iterator after = first;\r
+ ++after;\r
+ while(after != this->end()) {\r
+ if(pred(*first, *after)) {\r
+ pointer p = after.operator->();\r
+ after = erase(after);\r
+ destroyer(p);\r
+ }\r
+ else {\r
+ first = after++;\r
+ }\r
}\r
- else{\r
- first = after++;\r
- }\r
- }\r
- }\r
- }\r
+ }\r
+ }\r
\r
//! <b>Requires</b>: value must be a reference to a value inserted in a list.\r
//! \r