Lines Matching refs:__f

99     default_searcher(_ForwardIterator __f, _ForwardIterator __l,
101         : __first_(__f), __last_(__l), __pred_(__p) {}
106     operator () (_ForwardIterator2 __f, _ForwardIterator2 __l) const
109         return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj);
121 make_default_searcher( _ForwardIterator __f, _ForwardIterator __l, _BinaryPredicate __p = _BinaryPr…
123     return default_searcher<_ForwardIterator, _BinaryPredicate>(__f, __l, __p);
204     boyer_moore_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
206             : __first_(__f), __last_(__l), __pred_(__pred),
212         for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
213             __skip_->insert(*__f, __i);
220     operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
226         if (__f      == __l )    return make_pair(__l, __l); // empty corpus
227         if (__first_ == __last_) return make_pair(__f, __f); // empty pattern
230         if ( __pattern_length_ > _VSTD::distance(__f, __l))
234         return this->__search(__f, __l);
247     __search(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
249         _RandomAccessIterator2 __cur = __f;
280 …void __compute_bm_prefix ( _Iterator __f, _Iterator __l, _BinaryPredicate __pred, _Container &__pr…
282         const size_t __count = _VSTD::distance(__f, __l);
288             while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
291             if ( __pred ( __f[__k], __f[__i] ))
297     void __build_suffix_table(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
300         const size_t __count = _VSTD::distance(__f, __l);
306             __compute_bm_prefix(__f, __l, __pred, __scratch);
311             __compute_bm_prefix(_RevIter(__l), _RevIter(__f), __pred, __scratch);
331 make_boyer_moore_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
334 …  return boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p);
353     boyer_moore_horspool_searcher(_RandomAccessIterator1 __f, _RandomAccessIterator1 __l,
355             : __first_(__f), __last_(__l), __pred_(__pred),
360             if ( __f != __l )
363                 for ( difference_type __i = 0; __f != __l; ++__f, (void) ++__i )
364                     __skip_->insert(*__f, __pattern_length_ - 1 - __i);
370     operator ()(_RandomAccessIterator2 __f, _RandomAccessIterator2 __l) const
376         if (__f      == __l )    return make_pair(__l, __l); // empty corpus
377         if (__first_ == __last_) return make_pair(__f, __f); // empty pattern
380         if ( __pattern_length_ > _VSTD::distance(__f, __l))
384         return this->__search(__f, __l);
396     __search ( _RandomAccessIterator2 __f, _RandomAccessIterator2 __l ) const {
397         _RandomAccessIterator2 __cur = __f;
424 make_boyer_moore_horspool_searcher( _RandomAccessIterator __f, _RandomAccessIterator __l,
427 …return boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __h…