PB_DS_CLASS_T_DEC inline typename PB_DS_CLASS_C_DEC::reverse_iterator PB_DS_CLASS_C_DEC:: rbegin() { return (reverse_iterator(m_p_head->m_p_right)); }
DecodeOrderSampleMap::reverse_iterator DecodeOrderSampleMap::reverseFindSampleWithDecodeKey(const KeyType& key) { DecodeOrderSampleMap::iterator found = findSampleWithDecodeKey(key); if (found == end()) return rend(); return --reverse_iterator(found); }
PB_DS_CLASS_T_DEC inline typename PB_DS_CLASS_C_DEC::reverse_iterator PB_DS_CLASS_C_DEC:: rend() { return (reverse_iterator(m_p_head)); }
SampleMap::reverse_iterator SampleMap::reverseFindSampleWithDecodeTime(const MediaTime& time) { SampleMap::iterator found = findSampleWithDecodeTime(time); if (found == decodeEnd()) return reverseDecodeEnd(); return --reverse_iterator(found); }
typename fcppt::container::raw_vector<T, A>::reverse_iterator fcppt::container::raw_vector<T, A>::rend() { return reverse_iterator( this->begin() ); }
/** * \brief Get iterator for a given Node. * \param node_ Node to find. * \return iterator to Node, or rend() otherwise. */ List::reverse_iterator List::rfind(Node* node_) { iterator found = this->find(node_); if (found == this->end()) { return rend(); } else { return reverse_iterator(++found); } }
reverse_iterator rbegin() { // return iterator for beginning of reversed mutable sequence return (reverse_iterator(end())); }
typename List<T, Allocator>::reverse_iterator List<T, Allocator>::rbegin() { std::cout << "rbegin()" << std::endl; return reverse_iterator(end()); }
T const* crbegin() const { return reverse_iterator(cbegin()); }
T* rbegin() const { return reverse_iterator(begin()); }
BiIt rtrim(BiIt first, BiIt last, Pred pred = Pred()) { using reverse_iterator = std::reverse_iterator<BiIt>; return std::find_if_not(reverse_iterator(last), reverse_iterator(first), pred).base(); }
inline reverse_iterator rbegin (void) { return (reverse_iterator (end())); }
//------------------------------------------------------------------------------ // Name: rend //------------------------------------------------------------------------------ Function::reverse_iterator Function::rend() { return reverse_iterator(blocks_.begin()); }
cell_vector::reverse_iterator cell_vector::rend() { return reverse_iterator(begin()); }
inline Array::reverse_iterator Array::rend() { return reverse_iterator(begin()); }
reverse_iterator rbegin() { return reverse_iterator(&t_, pj_rbtree_last(&t_)); }
typename MyFixedSizeArray<VALUE,SIZE>::reverse_iterator MyFixedSizeArray<VALUE,SIZE>::rend() { return reverse_iterator(begin()); }
inline reverse_iterator rend (void) { return (reverse_iterator (begin())); }
//------------------------------------------------------------------------------ // Name: rend //------------------------------------------------------------------------------ BasicBlock::reverse_iterator BasicBlock::rend() { return reverse_iterator(instructions_.begin()); }
forceinline typename SharedArray<T>::reverse_iterator SharedArray<T>::rend(void) { assert(object() != NULL); return reverse_iterator(static_cast<SAO*>(object())->begin()); }
String::reverse_iterator String::rend() const { return reverse_iterator(begin()); }
reverse_iterator operator++(int){ T* tmp=pos; --pos; return reverse_iterator(pos); }
T* rend() const { return reverse_iterator(end()); }
reverse_iterator operator--(int){ T* tmp=pos; ++pos; return reverse_iterator(pos); }
T const* crend() const { return reverse_iterator(cend()); }
reverse_iterator operator+(int _ref){ return reverse_iterator(pos+_ref); }
typename List<T, Allocator>::reverse_iterator List<T, Allocator>::rend() { return reverse_iterator(begin()); }
reverse_iterator operator-(int _ref){ return reverse_iterator(pos-_ref); }
reverse_iterator rend() { // return iterator for end of reversed mutable sequence return (reverse_iterator(begin())); }
MString::reverse_iterator MString::rend() { return reverse_iterator(begin()); }