HomeSort by relevance Sort by last modified time
    Searched defs:ListHashSet (Results 1 - 3 of 3) sorted by null

  /external/chromium_org/tools/clang/blink_gc_plugin/tests/heap/
stubs.h 94 class ListHashSet {};
191 class HeapListHashSet : public ListHashSet<T, void, void, HeapAllocator> { };
  /external/chromium_org/third_party/WebKit/Source/platform/heap/
Visitor.h 45 #include "wtf/ListHashSet.h"
301 void trace(const ListHashSet<T, inlineCapacity, U>& hashSet)
303 OffHeapCollectionTraceTrait<ListHashSet<T, inlineCapacity, U> >::trace(this, hashSet);
503 struct OffHeapCollectionTraceTrait<ListHashSet<T, inlineCapacity, HashFunctions> > {
504 typedef WTF::ListHashSet<T, inlineCapacity, HashFunctions> ListHashSet;
506 static void trace(Visitor* visitor, const ListHashSet& set)
510 ListHashSet& iterSet = const_cast<ListHashSet&>(set);
511 for (typename ListHashSet::iterator it = iterSet.begin(), end = iterSet.end(); it != end; ++it
    [all...]
  /external/chromium_org/third_party/WebKit/Source/wtf/
ListHashSet.h 32 // ListHashSet: Just like HashSet, this class provides a Set
39 // guaranteed safe against mutation of the ListHashSet, except for
42 template<typename Value, size_t inlineCapacity, typename HashFunctions, typename Allocator> class ListHashSet;
56 // Don't declare a destructor for HeapAllocated ListHashSet.
74 // Note that for a ListHashSet you cannot specify the HashTraits as a
77 template<typename ValueArg, size_t inlineCapacity = 256, typename HashArg = typename DefaultHash<ValueArg>::Hash, typename AllocatorArg = ListHashSetAllocator<ValueArg, inlineCapacity> > class ListHashSet
78 : public ListHashSetDestructorBase<ListHashSet<ValueArg, inlineCapacity, HashArg, AllocatorArg>, AllocatorArg, AllocatorArg::isGarbageCollected> {
80 WTF_USE_ALLOCATOR(ListHashSet, Allocator);
100 typedef ListHashSetIterator<ListHashSet> iterator;
101 typedef ListHashSetConstIterator<ListHashSet> const_iterator
    [all...]

Completed in 80 milliseconds