forked from root-project/root
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'master' into install-test
- Loading branch information
Showing
114 changed files
with
4,186 additions
and
2,468 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,146 @@ | ||
| /// \file ROOT/TIndexIter.h | ||
| /// \ingroup Base ROOT7 | ||
| /// \author Axel Naumann <axel@cern.ch> | ||
| /// \date 2016-01-19 | ||
| /// \warning This is part of the ROOT 7 prototype! It will change without notice. It might trigger earthquakes. Feedback is welcome! | ||
|
|
||
| /************************************************************************* | ||
| * Copyright (C) 1995-2016, Rene Brun and Fons Rademakers. * | ||
| * All rights reserved. * | ||
| * * | ||
| * For the licensing terms see $ROOTSYS/LICENSE. * | ||
| * For the list of contributors see $ROOTSYS/README/CREDITS. * | ||
| *************************************************************************/ | ||
|
|
||
| #ifndef ROOT7_TIndexIter | ||
| #define ROOT7_TIndexIter | ||
|
|
||
| #include <iterator> | ||
|
|
||
| namespace ROOT { | ||
| namespace Experimental { | ||
| namespace Internal { | ||
|
|
||
| /** | ||
| \class TIndexIter | ||
| Iterates over an index; the REFERENCE is defined by the REFERENCE template parameter. | ||
| Derived classes are expected to implement `const REFERENCE& operator*()` and | ||
| `const POINTER operator->()`. | ||
| */ | ||
|
|
||
| template <class REFERENCE, | ||
| class POINTER = typename std::add_pointer<typename std::remove_reference<REFERENCE>::type>::type> | ||
| class TIndexIter: | ||
| public std::iterator<std::random_access_iterator_tag, REFERENCE, POINTER> { | ||
| size_t fIndex; | ||
| protected: | ||
| static constexpr size_t fgEndIndex = (size_t) -1; | ||
|
|
||
| public: | ||
| TIndexIter(size_t idx): fIndex(idx) {} | ||
|
|
||
| /// Get the current index value. | ||
| size_t GetIndex() const noexcept { return fIndex; } | ||
|
|
||
| ///\{ | ||
| ///\name Index modifiers | ||
| /// ++i | ||
| TIndexIter &operator++() noexcept { | ||
| ++fIndex; | ||
| return *this; | ||
| } | ||
|
|
||
| /// --i | ||
| TIndexIter &operator--() noexcept { | ||
| if (fIndex != fgEndIndex) | ||
| --fIndex; | ||
| return *this; | ||
| } | ||
|
|
||
| /// i++ | ||
| TIndexIter operator++(int) noexcept { | ||
| TIndexIter old(*this); | ||
| ++(*this); | ||
| return old; | ||
| } | ||
|
|
||
| // i-- | ||
| TIndexIter operator--(int) noexcept { | ||
| TIndexIter old(*this); | ||
| --(*this); | ||
| return old; | ||
| } | ||
|
|
||
| TIndexIter &operator+=(int d) noexcept { | ||
| fIndex += d; | ||
| return *this; | ||
| } | ||
|
|
||
| TIndexIter &operator-=(int d) noexcept { | ||
| if (d > fIndex) { | ||
| fIndex = fgEndIndex; | ||
| } else { | ||
| fIndex -= d; | ||
| } | ||
| return *this; | ||
| } | ||
|
|
||
| TIndexIter operator+(int d) noexcept { | ||
| TIndexIter ret(*this); | ||
| ret += d; | ||
| return ret; | ||
| } | ||
|
|
||
| TIndexIter operator-(int d) noexcept { | ||
| TIndexIter ret(*this); | ||
| ret -= d; | ||
| return ret; | ||
| } | ||
| ///\} | ||
| }; | ||
|
|
||
| ///\{ | ||
| ///\name Relational operators. | ||
| template <class REFERENCE, class POINTER> | ||
| bool operator<(TIndexIter<REFERENCE, POINTER> lhs, | ||
| TIndexIter<REFERENCE, POINTER> rhs) noexcept { | ||
| return lhs.GetIndex() < rhs.GetIndex(); | ||
| } | ||
|
|
||
| template <class REFERENCE, class POINTER> | ||
| bool operator>(TIndexIter<REFERENCE, POINTER> lhs, | ||
| TIndexIter<REFERENCE, POINTER> rhs) noexcept { | ||
| return lhs.GetIndex() > rhs.GetIndex(); | ||
| } | ||
|
|
||
| template <class REFERENCE, class POINTER> | ||
| bool operator<=(TIndexIter<REFERENCE, POINTER> lhs, | ||
| TIndexIter<REFERENCE, POINTER> rhs) noexcept { | ||
| return lhs.GetIndex() <= rhs.GetIndex(); | ||
| } | ||
|
|
||
| template <class REFERENCE, class POINTER> | ||
| inline bool operator>=(TIndexIter<REFERENCE, POINTER> lhs, | ||
| TIndexIter<REFERENCE, POINTER> rhs) noexcept { | ||
| return lhs.GetIndex() >= rhs.GetIndex(); | ||
| } | ||
|
|
||
| template <class REFERENCE, class POINTER> | ||
| inline bool operator==(TIndexIter<REFERENCE, POINTER> lhs, | ||
| TIndexIter<REFERENCE, POINTER> rhs) noexcept { | ||
| return lhs.GetIndex() == rhs.GetIndex(); | ||
| } | ||
|
|
||
| template <class REFERENCE, class POINTER> | ||
| inline bool operator!=(TIndexIter<REFERENCE, POINTER> lhs, | ||
| TIndexIter<REFERENCE, POINTER> rhs) noexcept { | ||
| return lhs.GetIndex() != rhs.GetIndex(); | ||
| } | ||
| ///\} | ||
|
|
||
| } | ||
| } | ||
| } | ||
|
|
||
| #endif // ROOT7_TIndexIter |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.