Lines Matching refs:__f

115     default_searcher(_ForwardIterator __f, _ForwardIterator __l,
117         : __first_(__f), __last_(__l), __pred_(__p) {}
122     operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const
124         return _VSTD::__search(__f, __l, __first_, __last_, __pred_,
138 make_default_searcher( _ForwardIterator __f, _ForwardIterator __l, _BinaryPredicate __p = _BinaryPr…
140     return default_searcher<_ForwardIterator, _BinaryPredicate>(__f, __l, __p);
222     boyer_moore_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
224             : __first_(__f), __last_(__l), __pred_(__pred),
230         for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
231             __skip_->insert(*__f, __i);
238     operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
246         if (__f      == __l )    return make_pair(__l, __l); // empty corpus
247         if (__first_ == __last_) return make_pair(__f, __f); // empty pattern
250         if ( __pattern_length_ > _VSTD::distance (__f, __l))
254         return this->__search(__f, __l);
267     __search(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
269         _RandomAccessIterator2 __cur = __f;
300 …void __compute_bm_prefix ( _Iterator __f, _Iterator __l, _BinaryPredicate __pred, _Container &__pr…
302         const std::size_t __count = _VSTD::distance(__f, __l);
308             while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
311             if ( __pred ( __f[__k], __f[__i] ))
317     void __build_suffix_table(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
320         const std::size_t __count = _VSTD::distance(__f, __l);
326             __compute_bm_prefix(__f, __l, __pred, __scratch);
331             __compute_bm_prefix(_RevIter(__l), _RevIter(__f), __pred, __scratch);
351 make_boyer_moore_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
354 …  return boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p);
373     boyer_moore_horspool_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
375             : __first_(__f), __last_(__l), __pred_(__pred),
380             if ( __f != __l )
383                 for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
384                     __skip_->insert(*__f, __pattern_length_ - 1 - __i);
390     operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
398         if (__f      == __l )    return make_pair(__l, __l); // empty corpus
399         if (__first_ == __last_) return make_pair(__f, __f); // empty pattern
402         if ( __pattern_length_ > _VSTD::distance (__f, __l))
406         return this->__search(__f, __l);
418     __search ( _RandomAccessIterator2 __f, _RandomAccessIterator2 __l ) const {
419         _RandomAccessIterator2 __cur = __f;
446 make_boyer_moore_horspool_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
449 …return boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __h…