Ticket #4209: unordered-visualizers.dat

File unordered-visualizers.dat, 3.4 KB (added by Daniel James, 12 years ago)

Visualizer for the unordered containers

Line 
1[Visualizer]
2
3boost::unordered_set<*,*,*,*>{
4 preview (
5 #(
6 "[", $c.table_.size_, "](",
7 #array (
8 expr : $c.table_.buckets_[$i],
9 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
10 )
11 : #list(head : $e.next_, next : next_)
12 : (*($T1*)(boost::unordered_detail::value_base<$T1> *)(boost::unordered_detail::hash_node<std::allocator<$T1>,boost::unordered_detail::ungrouped> *)&$e)
13 , ")"
14 )
15 )
16
17 children (
18 #(
19 [raw members]: [$c,!],
20 #array (
21 expr : $c.table_.buckets_[$i],
22 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
23 )
24 : #list(head : $e.next_, next : next_)
25 : (*($T1*)(boost::unordered_detail::value_base<$T1> *)(boost::unordered_detail::hash_node<std::allocator<$T1>,boost::unordered_detail::ungrouped> *)&$e)
26 )
27 )
28}
29
30boost::unordered_map<*,*,*,*,*>{
31 preview (
32 #(
33 "[", $c.table_.size_, "](",
34 #array (
35 expr : $c.table_.buckets_[$i],
36 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
37 )
38 : #list( head : $e.next_, next : next_ )
39 : ((std::pair<$T1 const ,$T2> *)(boost::unordered_detail::value_base<std::pair<$T1 const ,$T2> > *)(boost::unordered_detail::hash_node<std::allocator<std::pair<$T1 const ,$T2> >,boost::unordered_detail::ungrouped> *)&$e)
40 , ")"
41 )
42 )
43
44 children (
45 #(
46 [raw members]: [$c,!],
47 #array (
48 expr : $c.table_.buckets_[$i],
49 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
50 )
51 : #list(head : $e.next_, next : next_)
52 : ((std::pair<$T1 const ,$T2> *)(boost::unordered_detail::value_base<std::pair<$T1 const ,$T2> > *)(boost::unordered_detail::hash_node<std::allocator<std::pair<$T1 const ,$T2> >,boost::unordered_detail::ungrouped> *)&$e))
53 )
54 )
55}
56
57boost::unordered_multiset<*,*,*,*>{
58 preview (
59 #(
60 "[", $c.table_.size_, "](",
61 #array (
62 expr : $c.table_.buckets_[$i],
63 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
64 )
65 : #list(head : $e.next_, next : next_)
66 : (*($T1*)(boost::unordered_detail::value_base<$T1> *)(boost::unordered_detail::hash_node<std::allocator<$T1>,boost::unordered_detail::grouped> *)&$e)
67 , ")"
68 )
69 )
70
71 children (
72 #(
73 [raw members]: [$c,!],
74 #array (
75 expr : $c.table_.buckets_[$i],
76 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
77 )
78 : #list(head : $e.next_, next : next_)
79 : (*($T1*)(boost::unordered_detail::value_base<$T1> *)(boost::unordered_detail::hash_node<std::allocator<$T1>,boost::unordered_detail::grouped> *)&$e)
80 )
81 )
82}
83
84boost::unordered_multimap<*,*,*,*,*>{
85 preview (
86 #(
87 "[", $c.table_.size_, "](",
88 #array (
89 expr : $c.table_.buckets_[$i],
90 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
91 )
92 : #list( head : $e.next_, next : next_ )
93 : ((std::pair<$T1 const ,$T2> *)(boost::unordered_detail::value_base<std::pair<$T1 const ,$T2> > *)(boost::unordered_detail::hash_node<std::allocator<std::pair<$T1 const ,$T2> >,boost::unordered_detail::grouped> *)&$e)
94 , ")"
95 )
96 )
97
98 children (
99 #(
100 [raw members]: [$c,!],
101 #array (
102 expr : $c.table_.buckets_[$i],
103 size : #if($c.table_.size_ == 0)(0) #else ($c.table_.bucket_count_)
104 )
105 : #list(head : $e.next_, next : next_)
106 : ((std::pair<$T1 const ,$T2> *)(boost::unordered_detail::value_base<std::pair<$T1 const ,$T2> > *)(boost::unordered_detail::hash_node<std::allocator<std::pair<$T1 const ,$T2> >,boost::unordered_detail::grouped> *)&$e))
107 )
108 )
109}