ADHOC/replicant-frameworks_native
3
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

am 317357fd: Merge "get rid of mirrorItemAt() which isn\'t used anywhere" into jb-mr1-dev

Browse Source 
* commit '317357fdf7a2b542dfdaa06f42ff7f5f0153f9a3':
  get rid of mirrorItemAt() which isn't used anywhere
This commit is contained in:
Mathias Agopian 2012-08-20 16:49:41 -07:00 committed by Android Git Automerger
commit 186e2bd064
2 changed files with 0 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
include/utils/SortedVector.h
View File

@ -98,8 +98,6 @@ public:
inline const TYPE& itemAt(size_t index) const; inline const TYPE& itemAt(size_t index) const;
//! stack-usage of the vector. returns the top of the stack (last element) //! stack-usage of the vector. returns the top of the stack (last element)
const TYPE& top() const; 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 * modifying the array
@ -199,15 +197,6 @@ const TYPE& SortedVector<TYPE>::itemAt(size_t index) const {
return operator[](index); 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 template<class TYPE> inline
const TYPE& SortedVector<TYPE>::top() const { const TYPE& SortedVector<TYPE>::top() const {
return *(array() + size() - 1); return *(array() + size() - 1);

11
include/utils/Vector.h
View File

@ -99,8 +99,6 @@ public:
inline const TYPE& itemAt(size_t index) const; inline const TYPE& itemAt(size_t index) const;
//! stack-usage of the vector. returns the top of the stack (last element) //! stack-usage of the vector. returns the top of the stack (last element)
const TYPE& top() const; 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 * modifying the array
@ -283,15 +281,6 @@ const TYPE& Vector<TYPE>::itemAt(size_t index) const {
return operator[](index); 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 template<class TYPE> inline
const TYPE& Vector<TYPE>::top() const { const TYPE& Vector<TYPE>::top() const {
return *(array() + size() - 1); return *(array() + size() - 1);