Lines Matching refs:_Hash

126 template<class _Key, class _Value, class _Hash, class _BinaryPredicate, bool /*useArray*/> class _B…
129 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
130 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, false> {
135 std::unordered_map<_Key, _Value, _Hash, _BinaryPredicate> __table;
139 _BMSkipTable(size_t __sz, _Value __default, _Hash __hf, _BinaryPredicate __pred)
158 template<class _Key, typename _Value, class _Hash, class _BinaryPredicate>
159 class _BMSkipTable<_Key, _Value, _Hash, _BinaryPredicate, true> {
170 _BMSkipTable(size_t /*__sz*/, _Value __default, _Hash /*__hf*/, _BinaryPredicate /*__pred*/)
190 class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>,
196 typedef _BMSkipTable<value_type, difference_type, _Hash, _BinaryPredicate,
199 is_same<_Hash, hash<value_type>>::value &&
205 _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate())
327 class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>,
330 boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>
332 _Hash __hf = _Hash(), _BinaryPredicate __p = _BinaryPredicate ())
334 … return boyer_moore_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __hf, __p);
339 class _Hash = hash<typename iterator_traits<_RandomAccessIterator1>::value_type>,
345 typedef _BMSkipTable<value_type, difference_type, _Hash, _BinaryPredicate,
348 is_same<_Hash, hash<value_type>>::value &&
354 _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate())
420 class _Hash = hash<typename iterator_traits<_RandomAccessIterator>::value_type>,
423 boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>
425 _Hash __hf = _Hash(), _BinaryPredicate __p = _BinaryPredicate ())
427 …return boyer_moore_horspool_searcher<_RandomAccessIterator, _Hash, _BinaryPredicate>(__f, __l, __h…