/* * Copyright 2016 Facebook, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #pragma once #include #include #include /* * Similar to Python's enumerate(), folly::enumerate() can be used to * iterate a range with a for-range loop, and it also allows to * retrieve the count of iterations so far. * * For example: * * for (auto it : folly::enumerate(vec)) { * // *it is a reference to the current element. Const if vec is const. * // it->member can be used as well. * // it.index contains the iteration count. * } * * If the iteration variable is const, the reference is too. * * for (const auto it : folly::enumerate(vec)) { * // *it is always a const reference. * } * * @author Giuseppe Ottaviano */ namespace folly { namespace detail { template struct MakeConst { using type = const T; }; template struct MakeConst { using type = const T&; }; template struct MakeConst { using type = const T*; }; // Raw pointers don't have an operator->() member function, so the // second overload will be SFINAEd out in that case. Otherwise, the // second is preferred in the partial order for getPointer(_, 0). template auto getPointer(const Iterator& it, long) -> decltype(std::addressof(*it)) { return std::addressof(*it); } template auto getPointer(const Iterator& it, int) -> decltype(it.operator->()) { return it.operator->(); } template class Enumerator { public: explicit Enumerator(Iterator it) : it_(std::move(it)) {} class Proxy { public: using difference_type = ssize_t; using value_type = typename std::iterator_traits::value_type; using reference = typename std::iterator_traits::reference; using pointer = typename std::iterator_traits::pointer; using iterator_category = std::input_iterator_tag; explicit Proxy(const Enumerator* e) : it_(e->it_), index(e->idx_) {} // Non-const Proxy: Forward constness from Iterator. reference operator*() { return *it_; } pointer operator->() { return getPointer(it_, 0); } // Const Proxy: Force const references. typename MakeConst::type operator*() const { return *it_; } typename MakeConst::type operator->() const { return getPointer(it_, 0); } private: const Iterator& it_; public: const size_t index; }; Proxy operator*() const { return Proxy(this); } Enumerator& operator++() { ++it_; ++idx_; return *this; } template bool operator==(const Enumerator& rhs) { return it_ == rhs.it_; } template bool operator!=(const Enumerator& rhs) { return !(*this == rhs); } private: template friend class Enumerator; Iterator it_; size_t idx_ = 0; }; template class RangeEnumerator { Range r_; using BeginIteratorType = decltype(std::declval().begin()); using EndIteratorType = decltype(std::declval().end()); public: explicit RangeEnumerator(Range&& r) : r_(std::forward(r)) {} Enumerator begin() { return Enumerator(r_.begin()); } Enumerator end() { return Enumerator(r_.end()); } }; } // namespace detail template detail::RangeEnumerator enumerate(Range&& r) { return detail::RangeEnumerator(std::forward(r)); } } // namespace folly