{
__u32 n = (__u32)(ls.size()); // c++11 std::list::size() is O(1)
encode(n, bl);
- for (typename std::list<T>::const_iterator p = ls.begin(); p != ls.end(); ++p)
+ for (auto p = ls.begin(); p != ls.end(); ++p)
encode(*p, bl);
}
template<class T, class Alloc, typename traits=denc_traits<T>>
unsigned pos = bl.length();
unsigned n = 0;
encode(n, bl);
- for (typename std::list<T>::const_iterator p = ls.begin(); p != ls.end(); ++p) {
+ for (auto p = ls.begin(); p != ls.end(); ++p) {
n++;
encode(*p, bl, features);
}
} else {
__u32 n = (__u32)(ls.size()); // FIXME: this is slow on a list.
encode(n, bl);
- for (typename std::list<T>::const_iterator p = ls.begin(); p != ls.end(); ++p)
+ for (auto p = ls.begin(); p != ls.end(); ++p)
encode(*p, bl, features);
}
}
{
__u32 n = (__u32)(ls.size()); // c++11 std::list::size() is O(1)
encode(n, bl);
- for (typename std::list<ceph::shared_ptr<T> >::const_iterator p = ls.begin(); p != ls.end(); ++p)
+ for (auto p = ls.begin(); p != ls.end(); ++p)
encode(**p, bl);
}
template<class T, class Alloc>
{
__u32 n = (__u32)(ls.size()); // c++11 std::list::size() is O(1)
encode(n, bl);
- for (typename std::list<ceph::shared_ptr<T> >::const_iterator p = ls.begin(); p != ls.end(); ++p)
+ for (auto p = ls.begin(); p != ls.end(); ++p)
encode(**p, bl, features);
}
template<class T, class Alloc>
{
__u32 n = (__u32)(s.size());
encode(n, bl);
- for (typename std::set<T>::const_iterator p = s.begin(); p != s.end(); ++p)
+ for (auto p = s.begin(); p != s.end(); ++p)
encode(*p, bl);
}
template<class T, class Comp, class Alloc, typename traits=denc_traits<T>>
inline typename std::enable_if<!traits::supported>::type
encode_nohead(const std::set<T,Comp,Alloc>& s, bufferlist& bl)
{
- for (typename std::set<T,Comp>::const_iterator p = s.begin(); p != s.end(); ++p)
+ for (auto p = s.begin(); p != s.end(); ++p)
encode(*p, bl);
}
template<class T, class Comp, class Alloc, typename traits=denc_traits<T>>
{
__u32 n = (__u32)(s.size());
encode(n, bl);
- for (typename std::multiset<T,Comp>::const_iterator p = s.begin(); p != s.end(); ++p)
+ for (auto p = s.begin(); p != s.end(); ++p)
encode(*p, bl);
}
template<class T, class Comp, class Alloc>
inline typename std::enable_if<!traits::supported>::type
encode_nohead(const std::vector<T,Alloc>& v, bufferlist& bl)
{
- for (typename std::vector<T>::const_iterator p = v.begin(); p != v.end(); ++p)
+ for (auto p = v.begin(); p != v.end(); ++p)
encode(*p, bl);
}
template<class T, class Alloc, typename traits=denc_traits<T>>
{
__u32 n = (__u32)(v.size());
encode(n, bl);
- for (typename std::vector<ceph::shared_ptr<T> >::const_iterator p = v.begin(); p != v.end(); ++p)
+ for (auto p = v.begin(); p != v.end(); ++p)
if (*p)
encode(**p, bl, features);
else
{
__u32 n = (__u32)(v.size());
encode(n, bl);
- for (typename std::vector<ceph::shared_ptr<T> >::const_iterator p = v.begin(); p != v.end(); ++p)
+ for (auto p = v.begin(); p != v.end(); ++p)
if (*p)
encode(**p, bl);
else
{
__u32 n = (__u32)(m.size());
encode(n, bl);
- for (typename std::map<T,U,Comp>::const_iterator p = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl);
encode(p->second, bl);
}
{
__u32 n = (__u32)(m.size());
encode(n, bl);
- for (typename std::map<T,U,Comp>::const_iterator p = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl, features);
encode(p->second, bl, features);
}
!u_traits::supported>::type
encode_nohead(const std::map<T,U,Comp,Alloc>& m, bufferlist& bl)
{
- for (typename std::map<T,U,Comp>::const_iterator p = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl);
encode(p->second, bl);
}
!u_traits::supported>::type
encode_nohead(const std::map<T,U,Comp,Alloc>& m, bufferlist& bl, uint64_t features)
{
- for (typename std::map<T,U,Comp>::const_iterator p = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl, features);
encode(p->second, bl, features);
}
{
__u32 n = (__u32)(m.size());
encode(n, bl);
- for (typename boost::container::flat_map<T,U,Comp>::const_iterator p
- = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl, features);
encode(p->second, bl, features);
}
encode_nohead(const boost::container::flat_map<T,U,Comp,Alloc>& m,
bufferlist& bl)
{
- for (typename boost::container::flat_map<T,U,Comp>::const_iterator p
- = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl);
encode(p->second, bl);
}
encode_nohead(const boost::container::flat_map<T,U,Comp,Alloc>& m,
bufferlist& bl, uint64_t features)
{
- for (typename boost::container::flat_map<T,U,Comp>::const_iterator p
- = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl, features);
encode(p->second, bl, features);
}
{
__u32 n = (__u32)(m.size());
encode(n, bl);
- for (typename std::multimap<T,U,Comp>::const_iterator p = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl);
encode(p->second, bl);
}
{
__u32 n = (__u32)(m.size());
encode(n, bl);
- for (typename unordered_map<T,U,Hash,Pred>::const_iterator p = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl, features);
encode(p->second, bl, features);
}
{
__u32 n = (__u32)(m.size());
encode(n, bl);
- for (typename unordered_map<T,U,Hash,Pred,Alloc>::const_iterator p = m.begin(); p != m.end(); ++p) {
+ for (auto p = m.begin(); p != m.end(); ++p) {
encode(p->first, bl);
encode(p->second, bl);
}
{
__u32 n = (__u32)(m.size());
encode(n, bl);
- for (typename ceph::unordered_set<T,Hash,Pred>::const_iterator p = m.begin(); p != m.end(); ++p)
+ for (auto p = m.begin(); p != m.end(); ++p)
encode(*p, bl);
}
template<class T, class Hash, class Pred, class Alloc>
{
__u32 n = ls.size();
encode(n, bl);
- for (typename std::deque<T>::const_iterator p = ls.begin(); p != ls.end(); ++p)
+ for (auto p = ls.begin(); p != ls.end(); ++p)
encode(*p, bl, features);
}
template<class T, class Alloc>
{
__u32 n = ls.size();
encode(n, bl);
- for (typename std::deque<T>::const_iterator p = ls.begin(); p != ls.end(); ++p)
+ for (auto p = ls.begin(); p != ls.end(); ++p)
encode(*p, bl);
}
template<class T, class Alloc>