mirror of
https://github.com/boostorg/container.git
synced 2026-01-19 04:02:17 +00:00
Correct indentation for erase/erase_if
This commit is contained in:
@@ -3071,9 +3071,9 @@ deque(InputIterator, InputIterator, Allocator const&) -> deque<typename iterator
|
||||
template <class T, class A, class O, class U>
|
||||
inline typename deque<T, A, O>::size_type erase(deque<T, A, O>& c, const U& v)
|
||||
{
|
||||
typename deque<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
typename deque<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -3082,9 +3082,9 @@ inline typename deque<T, A, O>::size_type erase(deque<T, A, O>& c, const U& v)
|
||||
template <class T, class A, class O, class Pred>
|
||||
inline typename deque<T, A, O>::size_type erase_if(deque<T, A, O>& c, Pred pred)
|
||||
{
|
||||
typename deque<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
typename deque<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
} //namespace container
|
||||
|
||||
@@ -3046,9 +3046,9 @@ class devector
|
||||
template <class T, class A, class O, class U>
|
||||
inline typename devector<T, A, O>::size_type erase(devector<T, A, O>& c, const U& v)
|
||||
{
|
||||
typename devector<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
typename devector<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -3057,9 +3057,9 @@ inline typename devector<T, A, O>::size_type erase(devector<T, A, O>& c, const U
|
||||
template <class T, class A, class O, class Pred>
|
||||
inline typename devector<T, A, O>::size_type erase_if(devector<T, A, O>& c, Pred pred)
|
||||
{
|
||||
typename devector<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
typename devector<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
}} // namespace boost::container
|
||||
|
||||
@@ -1493,9 +1493,9 @@ class list
|
||||
template <class T, class A, class U>
|
||||
inline typename list<T, A>::size_type erase(list<T, A>& c, const U& v)
|
||||
{
|
||||
typename list<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(equal_to_value<U>(v));
|
||||
return old_size - c.size();
|
||||
typename list<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(equal_to_value<U>(v));
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -1504,9 +1504,9 @@ inline typename list<T, A>::size_type erase(list<T, A>& c, const U& v)
|
||||
template <class T, class A, class Pred>
|
||||
inline typename list<T, A>::size_type erase_if(list<T, A>& c, Pred pred)
|
||||
{
|
||||
typename list<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(pred);
|
||||
return old_size - c.size();
|
||||
typename list<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(pred);
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
|
||||
|
||||
@@ -1664,9 +1664,9 @@ class slist
|
||||
template <class T, class A, class U>
|
||||
inline typename slist<T, A>::size_type erase(slist<T, A>& c, const U& v)
|
||||
{
|
||||
typename slist<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(equal_to_value<U>(v));
|
||||
return old_size - c.size();
|
||||
typename slist<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(equal_to_value<U>(v));
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -1675,9 +1675,9 @@ inline typename slist<T, A>::size_type erase(slist<T, A>& c, const U& v)
|
||||
template <class T, class A, class Pred>
|
||||
inline typename slist<T, A>::size_type erase_if(slist<T, A>& c, Pred pred)
|
||||
{
|
||||
typename slist<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(pred);
|
||||
return old_size - c.size();
|
||||
typename slist<T, A>::size_type old_size = c.size();
|
||||
c.remove_if(pred);
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
#ifndef BOOST_CONTAINER_NO_CXX17_CTAD
|
||||
|
||||
@@ -681,9 +681,9 @@ class small_vector
|
||||
template <class T, std::size_t N, class A, class O, class U>
|
||||
inline typename small_vector<T, N, A, O>::size_type erase(small_vector<T, N, A, O>& c, const U& v)
|
||||
{
|
||||
typename small_vector<T, N, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
typename small_vector<T, N, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -692,9 +692,9 @@ inline typename small_vector<T, N, A, O>::size_type erase(small_vector<T, N, A,
|
||||
template <class T, std::size_t N, class A, class O, class Pred>
|
||||
inline typename small_vector<T, N, A, O>::size_type erase_if(small_vector<T, N, A, O>& c, Pred pred)
|
||||
{
|
||||
typename small_vector<T, N, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
typename small_vector<T, N, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
}}
|
||||
|
||||
@@ -2257,9 +2257,9 @@ stable_vector(InputIterator, InputIterator, Allocator const&) ->
|
||||
template <class T, class A, class U>
|
||||
inline typename stable_vector<T, A>::size_type erase(stable_vector<T, A>& c, const U& v)
|
||||
{
|
||||
typename stable_vector<T, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
typename stable_vector<T, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -2268,9 +2268,9 @@ inline typename stable_vector<T, A>::size_type erase(stable_vector<T, A>& c, con
|
||||
template <class T, class A, class Pred>
|
||||
inline typename stable_vector<T, A>::size_type erase_if(stable_vector<T, A>& c, Pred pred)
|
||||
{
|
||||
typename stable_vector<T, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
typename stable_vector<T, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
} //namespace container {
|
||||
|
||||
@@ -1339,9 +1339,9 @@ inline void swap(static_vector<V, C1, O1> & x, static_vector<V, C2, O2> & y
|
||||
template <class T, std::size_t N, class O, class U>
|
||||
inline typename static_vector<T, N, O>::size_type erase(static_vector<T, N, O>& c, const U& v)
|
||||
{
|
||||
typename static_vector<T, N, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
typename static_vector<T, N, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -1350,9 +1350,9 @@ inline typename static_vector<T, N, O>::size_type erase(static_vector<T, N, O>&
|
||||
template <class T, std::size_t N, class O, class Pred>
|
||||
inline typename static_vector<T, N, O>::size_type erase_if(static_vector<T, N, O>& c, Pred pred)
|
||||
{
|
||||
typename static_vector<T, N, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
typename static_vector<T, N, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
}} // namespace boost::container
|
||||
|
||||
@@ -3556,9 +3556,9 @@ getline(std::basic_istream<CharT, Traits>& is, basic_string<CharT,Traits,Allocat
|
||||
template <class T, class Tr, class A, class U>
|
||||
inline typename basic_string<T, Tr, A>::size_type erase(basic_string<T, Tr, A>& c, const U& v)
|
||||
{
|
||||
typename basic_string<T, Tr, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
typename basic_string<T, Tr, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove(c.begin(), c.end(), v), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
//! <b>Effects</b>: Erases all elements that satisfy the predicate pred from the container c.
|
||||
@@ -3567,9 +3567,9 @@ inline typename basic_string<T, Tr, A>::size_type erase(basic_string<T, Tr, A>&
|
||||
template <class T, class Tr, class A, class Pred>
|
||||
inline typename basic_string<T, Tr, A>::size_type erase_if(basic_string<T, Tr, A>& c, Pred pred)
|
||||
{
|
||||
typename basic_string<T, Tr, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
typename basic_string<T, Tr, A>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
}}
|
||||
|
||||
@@ -3368,9 +3368,9 @@ inline typename vector<T, A, O>::size_type erase(vector<T, A, O>& c, const U& v)
|
||||
template <class T, class A, class O, class Pred>
|
||||
inline typename vector<T, A, O>::size_type erase_if(vector<T, A, O>& c, Pred pred)
|
||||
{
|
||||
typename vector<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
typename vector<T, A, O>::size_type old_size = c.size();
|
||||
c.erase(boost::container::remove_if(c.begin(), c.end(), pred), c.end());
|
||||
return old_size - c.size();
|
||||
}
|
||||
|
||||
}} //namespace boost::container
|
||||
|
||||
Reference in New Issue
Block a user