Loading include/utils/SortedVector.h +0 −11 Original line number Diff line number Diff line Loading @@ -98,8 +98,6 @@ public: inline const TYPE& itemAt(size_t index) const; //! stack-usage of the vector. returns the top of the stack (last element) const TYPE& top() const; //! same as operator [], but allows to access the vector backward (from the end) with a negative index const TYPE& mirrorItemAt(ssize_t index) const; /*! * modifying the array Loading Loading @@ -199,15 +197,6 @@ const TYPE& SortedVector<TYPE>::itemAt(size_t index) const { return operator[](index); } template<class TYPE> inline const TYPE& SortedVector<TYPE>::mirrorItemAt(ssize_t index) const { const size_t i = index>0 ? index : -index; LOG_FATAL_IF(index>=size(), "%s: index=%u out of range (%u)", __PRETTY_FUNCTION__, int(index), int(size())); return *(array() + i); } template<class TYPE> inline const TYPE& SortedVector<TYPE>::top() const { return *(array() + size() - 1); Loading include/utils/Vector.h +0 −11 Original line number Diff line number Diff line Loading @@ -99,8 +99,6 @@ public: inline const TYPE& itemAt(size_t index) const; //! stack-usage of the vector. returns the top of the stack (last element) const TYPE& top() const; //! same as operator [], but allows to access the vector backward (from the end) with a negative index const TYPE& mirrorItemAt(ssize_t index) const; /*! * modifying the array Loading Loading @@ -283,15 +281,6 @@ const TYPE& Vector<TYPE>::itemAt(size_t index) const { return operator[](index); } template<class TYPE> inline const TYPE& Vector<TYPE>::mirrorItemAt(ssize_t index) const { const size_t i = index>0 ? index : -index; LOG_FATAL_IF(index>=size(), "%s: index=%u out of range (%u)", __PRETTY_FUNCTION__, int(index), int(size())); return *(array() + i); } template<class TYPE> inline const TYPE& Vector<TYPE>::top() const { return *(array() + size() - 1); Loading Loading
include/utils/SortedVector.h +0 −11 Original line number Diff line number Diff line Loading @@ -98,8 +98,6 @@ public: inline const TYPE& itemAt(size_t index) const; //! stack-usage of the vector. returns the top of the stack (last element) const TYPE& top() const; //! same as operator [], but allows to access the vector backward (from the end) with a negative index const TYPE& mirrorItemAt(ssize_t index) const; /*! * modifying the array Loading Loading @@ -199,15 +197,6 @@ const TYPE& SortedVector<TYPE>::itemAt(size_t index) const { return operator[](index); } template<class TYPE> inline const TYPE& SortedVector<TYPE>::mirrorItemAt(ssize_t index) const { const size_t i = index>0 ? index : -index; LOG_FATAL_IF(index>=size(), "%s: index=%u out of range (%u)", __PRETTY_FUNCTION__, int(index), int(size())); return *(array() + i); } template<class TYPE> inline const TYPE& SortedVector<TYPE>::top() const { return *(array() + size() - 1); Loading
include/utils/Vector.h +0 −11 Original line number Diff line number Diff line Loading @@ -99,8 +99,6 @@ public: inline const TYPE& itemAt(size_t index) const; //! stack-usage of the vector. returns the top of the stack (last element) const TYPE& top() const; //! same as operator [], but allows to access the vector backward (from the end) with a negative index const TYPE& mirrorItemAt(ssize_t index) const; /*! * modifying the array Loading Loading @@ -283,15 +281,6 @@ const TYPE& Vector<TYPE>::itemAt(size_t index) const { return operator[](index); } template<class TYPE> inline const TYPE& Vector<TYPE>::mirrorItemAt(ssize_t index) const { const size_t i = index>0 ? index : -index; LOG_FATAL_IF(index>=size(), "%s: index=%u out of range (%u)", __PRETTY_FUNCTION__, int(index), int(size())); return *(array() + i); } template<class TYPE> inline const TYPE& Vector<TYPE>::top() const { return *(array() + size() - 1); Loading