Lines Matching defs:ValueType
72 typedef ValueArg ValueType;
73 typedef ListHashSetIterator<ValueType, inlineCapacity, HashArg> iterator;
74 typedef ListHashSetConstIterator<ValueType, inlineCapacity, HashArg> const_iterator;
76 friend class ListHashSetConstIterator<ValueType, inlineCapacity, HashArg>;
94 ValueType& first();
95 const ValueType& first() const;
97 ValueType& last();
98 const ValueType& last() const;
101 iterator find(const ValueType&);
102 const_iterator find(const ValueType&) const;
103 bool contains(const ValueType&) const;
114 pair<iterator, bool> add(const ValueType&);
116 pair<iterator, bool> insertBefore(const ValueType& beforeValue, const ValueType& newValue);
117 pair<iterator, bool> insertBefore(iterator it, const ValueType&);
119 void remove(const ValueType&);
254 typedef ValueArg ValueType;
255 typedef ValueType& ReferenceType;
256 typedef ValueType* PointerType;
297 typedef ValueArg ValueType;
298 typedef const ValueType& ReferenceType;
299 typedef const ValueType* PointerType;
361 template<typename ValueType, size_t inlineCapacity, typename HashFunctions>
364 typedef ListHashSetNode<ValueType, inlineCapacity> Node;
365 typedef ListHashSetNodeAllocator<ValueType, inlineCapacity> NodeAllocator;
367 static unsigned hash(const ValueType& key) { return HashFunctions::hash(key); }
368 static bool equal(Node* const& a, const ValueType& b) { return HashFunctions::equal(a->m_value, b); }
369 static void translate(Node*& location, const ValueType& key, NodeAllocator* allocator)
496 inline typename ListHashSet<T, inlineCapacity, U>::iterator ListHashSet<T, inlineCapacity, U>::find(const ValueType& value)
498 typedef ListHashSetTranslator<ValueType, inlineCapacity, HashFunctions> Translator;
499 ImplTypeIterator it = m_impl.template find<ValueType, Translator>(value);
506 inline typename ListHashSet<T, inlineCapacity, U>::const_iterator ListHashSet<T, inlineCapacity, U>::find(const ValueType& value) const
508 typedef ListHashSetTranslator<ValueType, inlineCapacity, HashFunctions> Translator;
509 ImplTypeConstIterator it = m_impl.template find<ValueType, Translator>(value);
515 template<typename ValueType, size_t inlineCapacity, typename T, typename Translator>
518 typedef ListHashSetNode<ValueType, inlineCapacity> Node;
524 template<typename ValueType, size_t inlineCapacity, typename U>
526 inline typename ListHashSet<ValueType, inlineCapacity, U>::iterator ListHashSet<ValueType, inlineCapacity, U>::find(const T& value)
528 typedef ListHashSetTranslatorAdapter<ValueType, inlineCapacity, T, HashTranslator> Adapter;
535 template<typename ValueType, size_t inlineCapacity, typename U>
537 inline typename ListHashSet<ValueType, inlineCapacity, U>::const_iterator ListHashSet<ValueType, inlineCapacity, U>::find(const T& value) const
539 typedef ListHashSetTranslatorAdapter<ValueType, inlineCapacity, T, HashTranslator> Adapter;
546 template<typename ValueType, size_t inlineCapacity, typename U>
548 inline bool ListHashSet<ValueType, inlineCapacity, U>::contains(const T& value) const
550 typedef ListHashSetTranslatorAdapter<ValueType, inlineCapacity, T, HashTranslator> Adapter;
555 inline bool ListHashSet<T, inlineCapacity, U>::contains(const ValueType& value) const
557 typedef ListHashSetTranslator<ValueType, inlineCapacity, HashFunctions> Translator;
558 return m_impl.template contains<ValueType, Translator>(value);
562 pair<typename ListHashSet<T, inlineCapacity, U>::iterator, bool> ListHashSet<T, inlineCapacity, U>::add(const ValueType &value)
564 typedef ListHashSetTranslator<ValueType, inlineCapacity, HashFunctions> Translator;
565 pair<typename ImplType::iterator, bool> result = m_impl.template add<ValueType, NodeAllocator*, Translator>(value, m_allocator.get());
572 pair<typename ListHashSet<T, inlineCapacity, U>::iterator, bool> ListHashSet<T, inlineCapacity, U>::insertBefore(iterator it, const ValueType& newValue)
574 typedef ListHashSetTranslator<ValueType, inlineCapacity, HashFunctions> Translator;
575 pair<typename ImplType::iterator, bool> result = m_impl.template add<ValueType, NodeAllocator*, Translator>(newValue, m_allocator.get());
583 pair<typename ListHashSet<T, inlineCapacity, U>::iterator, bool> ListHashSet<T, inlineCapacity, U>::insertBefore(const ValueType& beforeValue, const ValueType& newValue)
598 inline void ListHashSet<T, inlineCapacity, U>::remove(const ValueType& value)
689 template<bool, typename ValueType, typename HashTableType>
701 deleteAllValues<true, typename ListHashSet<T, inlineCapacity, U>::ValueType>(collection.m_impl);
