Home
last modified time | relevance | path

Searched refs:BaseSet (Results 1 – 7 of 7) sorted by relevance

/third_party/boost/libs/intrusive/example/
Ddoc_unordered_set.cpp39 typedef unordered_set<MyClass> BaseSet; typedef
58 BaseSet::bucket_type base_buckets[100]; in main()
64 BaseSet base_set(BaseSet::bucket_traits(base_buckets, 100)); in main()
Ddoc_sg_set.cpp42 < MyClass, compare<std::greater<MyClass> >, floating_point<false> > BaseSet; typedef
56 BaseSet baseset; in main()
70 BaseSet::reverse_iterator rbit(baseset.rbegin()); in main()
Ddoc_avl_set.cpp41 typedef avl_set< MyClass, compare<std::greater<MyClass> > > BaseSet; typedef
55 BaseSet baseset; in main()
71 BaseSet::reverse_iterator rbit(baseset.rbegin()); in main()
Ddoc_set.cpp41 typedef set< MyClass, compare<std::greater<MyClass> > > BaseSet; typedef
55 BaseSet baseset; in main()
71 BaseSet::reverse_iterator rbit(baseset.rbegin()); in main()
Ddoc_treap_set.cpp56 typedef treap_set< MyClass, compare<std::greater<MyClass> > > BaseSet; typedef
71 BaseSet baseset; in main()
82 BaseSet::reverse_iterator rbit(baseset.rbegin()); in main()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DDepthFirstIterator.h70 using BaseSet = SmallPtrSet<NodeRef, SmallSize>; member
71 using iterator = typename BaseSet::iterator;
73 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } in insert()
75 void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); } in insert()
/third_party/python/Misc/
DHISTORY22883 or when you need to use sets as dict keys, and a class BaseSet which