ordered_map.hpp - OpenGrok cross reference for /third_party/json/include/nlohmann/ordered

Lines Matching refs:it
45     // otherwise older compilers choke on it (GCC <= 5.5, xcode <= 9.4)
56         for (auto it = this->begin(); it != this->end(); ++it)
58             if (m_compare(it->first, key))
60                 return {it, false};
71         for (auto it = this->begin(); it != this->end(); ++it)
73             if (m_compare(it->first, key))
75                 return {it, false};
108         for (auto it = this->begin(); it != this->end(); ++it)
110             if (m_compare(it->first, key))
112                 return it->second;
123         for (auto it = this->begin(); it != this->end(); ++it)
125             if (m_compare(it->first, key))
127                 return it->second;
136         for (auto it = this->begin(); it != this->end(); ++it)
138             if (m_compare(it->first, key))
140                 return it->second;
151         for (auto it = this->begin(); it != this->end(); ++it)
153             if (m_compare(it->first, key))
155                 return it->second;
164         for (auto it = this->begin(); it != this->end(); ++it)
166             if (m_compare(it->first, key))
169                 for (auto next = it; ++next != this->end(); ++it)
171                     it->~value_type(); // Destroy but keep allocation
172                     new (&*it) value_type{std::move(*next)};
185         for (auto it = this->begin(); it != this->end(); ++it)
187             if (m_compare(it->first, key))
190                 for (auto next = it; ++next != this->end(); ++it)
192                     it->~value_type(); // Destroy but keep allocation
193                     new (&*it) value_type{std::move(*next)};
235         //               it       it + elements_affected
237         for (auto it = first; std::next(it, elements_affected) != Container::end(); ++it)
239             it->~value_type(); // destroy but keep allocation
240             new (&*it) value_type{std::move(*std::next(it, elements_affected))}; // "move" next element to it
255         // use this iterator, because it may have been invalidated by the
262         for (auto it = this->begin(); it != this->end(); ++it)
264             if (m_compare(it->first, key))
276         for (auto it = this->begin(); it != this->end(); ++it)
278             if (m_compare(it->first, key))
288         for (auto it = this->begin(); it != this->end(); ++it)
290             if (m_compare(it->first, key))
292                 return it;
302         for (auto it = this->begin(); it != this->end(); ++it)
304             if (m_compare(it->first, key))
306                 return it;
314         for (auto it = this->begin(); it != this->end(); ++it)
316             if (m_compare(it->first, key))
318                 return it;
331         for (auto it = this->begin(); it != this->end(); ++it)
333             if (m_compare(it->first, value.first))
335                 return {it, false};
349         for (auto it = first; it != last; ++it)
351             insert(*it);