Lines Matching refs:__f

117     default_searcher(_ForwardIterator __f, _ForwardIterator __l, 
119         : __first_(__f), __last_(__l), __pred_(__p) {}
124     operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const
126         return _VSTD::__search(__f, __l, __first_, __last_, __pred_,
140 make_default_searcher( _ForwardIterator __f, _ForwardIterator __l, _BinaryPredicate __p = _BinaryPr…
142     return default_searcher<_ForwardIterator, _BinaryPredicate>(__f, __l, __p);
225     boyer_moore_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, 
227             : __first_(__f), __last_(__l), __pred_(__pred),
233         for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
234             __skip_->insert(*__f, __i);
241     operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
249         if (__f      == __l )    return make_pair(__l, __l); // empty corpus
250         if (__first_ == __last_) return make_pair(__f, __f); // empty pattern
253         if ( __pattern_length_ > _VSTD::distance (__f, __l)) 
257         return this->__search(__f, __l);
270     __search(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
272         _RandomAccessIterator2 __cur = __f;
303 …void __compute_bm_prefix ( _Iterator __f, _Iterator __l, _BinaryPredicate __pred, _Container &__pr…
305         const std::size_t __count = _VSTD::distance(__f, __l);
311             while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
314             if ( __pred ( __f[__k], __f[__i] ))
320     void __build_suffix_table(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, 
323         const std::size_t __count = _VSTD::distance(__f, __l);
329             __compute_bm_prefix(__f, __l, __pred, __scratch);
334             __compute_bm_prefix(_RevIter(__l), _RevIter(__f), __pred, __scratch);
354 make_boyer_moore_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l, 
357 …  return boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p);
377     boyer_moore_horspool_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l, 
379             : __first_(__f), __last_(__l), __pred_(__pred),
384             if ( __f != __l )
387                 for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
388                     __skip_->insert(*__f, __pattern_length_ - 1 - __i);
394     operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
402         if (__f      == __l )    return make_pair(__l, __l); // empty corpus
403         if (__first_ == __last_) return make_pair(__f, __f); // empty pattern
406         if ( __pattern_length_ > _VSTD::distance (__f, __l)) 
410         return this->__search(__f, __l);
422     __search ( _RandomAccessIterator2 __f, _RandomAccessIterator2 __l ) const {
423         _RandomAccessIterator2 __cur = __f;
450 make_boyer_moore_horspool_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l, 
453 …return boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __h…