fileview::const_reverse_iterator fileview::rend() const { return const_reverse_iterator(begin()); }
inline ss_typename_type_ret_k associative_value_sequence<A>::const_reverse_iterator associative_value_sequence<A>::rend() const { return const_reverse_iterator(m_container.rend()); }
const_reverse_iterator rend()const{return const_reverse_iterator(&Data[0]);}
const _CListOfCHXString_::reverse_iterator _CListOfCHXString_::rend() const { return const_reverse_iterator(*((const _CListOfCHXString_Node *)&m_locnREnd)); }
cell_vector::const_reverse_iterator cell_vector::crend() const { return const_reverse_iterator(cbegin()); }
inline const_reverse_iterator rend (void) const { return (const_reverse_iterator (begin())); }
const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
const_reverse_iterator rcend() const noexcept { return const_reverse_iterator(cbegin()); }
/// @brief Operator - /// @param[in] n Number to sub /// @return a copy of the iterator after operation const_reverse_iterator operator -(std::size_t const n) const { std::size_t i = m_i + n; if (i > p_data->size()) { i = p_data->size(); } return const_reverse_iterator(*p_data, i); }
typename tree< T , A >::const_reverse_iterator tree< T , A >::rend() const { return const_reverse_iterator( begin() ); }
typename List<T, Allocator>::const_reverse_iterator List<T, Allocator>::rend() const { return const_reverse_iterator(begin()); }
typename List<T, Allocator>::const_reverse_iterator List<T, Allocator>::rbegin() const { std::cout << "rbegin() const" << std::endl; return const_reverse_iterator(end()); }
constexpr const_reverse_iterator rend() const noexcept { return const_reverse_iterator(begin()); }
/** * \brief Get an iterator to the beginning of the List. * \return requested iterator. */ List::const_reverse_iterator List::rend() const { return const_reverse_iterator(this->begin()); }
// Get an iterator to the end of the queue template <typename T> typename AQueue<T>::const_reverse_iterator AQueue<T>::rbegin (void) const { return const_reverse_iterator(*this,decrement(tail_)); }
typename MyFixedSizeArray<VALUE,SIZE>::const_reverse_iterator MyFixedSizeArray<VALUE,SIZE>::rend() const { return const_reverse_iterator(begin()); }
// Get an iterator pointing to the beginning of the queue template <typename T> typename AQueue<T>::const_reverse_iterator AQueue<T>::rend (void) const { return const_reverse_iterator(*this,decrement(head_)); }
inline Array::const_reverse_iterator Array::rend() const { return const_reverse_iterator(begin()); }
PB_DS_CLASS_T_DEC inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator PB_DS_CLASS_C_DEC:: rend() const { return const_reverse_iterator(m_p_head); }
//------------------------------------------------------------------------------ // Name: rend //------------------------------------------------------------------------------ Function::const_reverse_iterator Function::rend() const { return const_reverse_iterator(blocks_.begin()); }
const _CListOfCHXString_::reverse_iterator _CListOfCHXString_::rbegin() const { return const_reverse_iterator(*(m_locnEnd.prev())); }
forceinline typename SharedArray<T>::const_reverse_iterator SharedArray<T>::rbegin(void) const { assert(object() != NULL); return const_reverse_iterator(static_cast<SAO*>(object())->end()); }
const_reverse_iterator rbegin()const{return const_reverse_iterator(Data[0].back);}