| /external/clang/test/SemaCXX/ |
| cxx0x-deleted-default-ctor.cpp | 108 has_friend hf; variable
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/net/http2/hpack/ |
| hpack_test.go | 120 if hf, ok := d.at(uint64(idx)); !ok {
123 return hf
155 hf HeaderField
175 if gotI, gotMatch := dt.search(tt.hf); gotI != tt.wantI || gotMatch != tt.wantMatch {
176 t.Errorf("d.search(%+v) = %v, %v; want %v, %v", tt.hf, gotI, gotMatch, tt.wantI, tt.wantMatch)
242 hf, err := d.DecodeFull(tt.in)
247 if !reflect.DeepEqual(hf, tt.want) {
248 t.Errorf("%s: Got %v; want %v", tt.name, hf, tt.want)
257 func (dt *dynamicTable) reverseCopy() (hf []HeaderField) {
258 hf = make([]HeaderField, len(dt.ents)
[all...] |
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/net/http2/hpack/ |
| hpack_test.go | 120 if hf, ok := d.at(uint64(idx)); !ok {
123 return hf
155 hf HeaderField
175 if gotI, gotMatch := dt.search(tt.hf); gotI != tt.wantI || gotMatch != tt.wantMatch {
176 t.Errorf("d.search(%+v) = %v, %v; want %v, %v", tt.hf, gotI, gotMatch, tt.wantI, tt.wantMatch)
242 hf, err := d.DecodeFull(tt.in)
247 if !reflect.DeepEqual(hf, tt.want) {
248 t.Errorf("%s: Got %v; want %v", tt.name, hf, tt.want)
257 func (dt *dynamicTable) reverseCopy() (hf []HeaderField) {
258 hf = make([]HeaderField, len(dt.ents)
[all...] |
| /external/libedit/src/ |
| history.c | 1040 TYPE(History) hf;
1042 hf.h_ref = va_arg(va, void *);
1044 hf.h_first = va_arg(va, history_gfun_t);
1045 hf.h_next = va_arg(va, history_gfun_t);
1046 hf.h_last = va_arg(va, history_gfun_t);
1047 hf.h_prev = va_arg(va, history_gfun_t);
1048 hf.h_curr = va_arg(va, history_gfun_t);
1049 hf.h_set = va_arg(va, history_sfun_t);
1050 hf.h_clear = va_arg(va, history_vfun_t);
1051 hf.h_enter = va_arg(va, history_efun_t)
[all...] |
| /external/ltp/testcases/kernel/io/disktest/ |
| io.c | 71 OFF_T FileSeek64(HANDLE hf, OFF_T distance, DWORD MoveMethod)
77 li.LowPart = SetFilePointer(hf, li.LowPart, &li.HighPart, MoveMethod);
|
| /system/libvintf/include/vintf/ |
| parse_string.h | 31 std::ostream &operator<<(std::ostream &os, HalFormat hf);
55 bool parse(const std::string &s, HalFormat *hf);
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| allocator.pass.cpp | 91 typedef test_hash<std::hash<T>> HF;
93 typedef std::unordered_map<T, T, HF, Comp, A> C;
98 assert(c.hash_function() == HF());
110 typedef test_hash<std::hash<T>> HF;
112 typedef std::unordered_map<T, T, HF, Comp, A> C;
115 HF hf(12);
116 C c(2, hf, a);
118 assert(c.hash_function() == hf);
119 assert(!(c.hash_function() == HF()));
[all...] |
| init.pass.cpp | 100 typedef test_hash<std::hash<int>> HF;
102 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
131 typedef test_hash<std::hash<int>> HF;
133 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
135 HF hf(42);
144 }, 12, hf, a);
151 assert(c.hash_function() == hf);
|
| range.pass.cpp | 106 typedef test_hash<std::hash<int>> HF;
108 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
126 assert(c.hash_function() == HF());
138 typedef test_hash<std::hash<int>> HF;
140 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
151 HF hf(42);
153 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a);
160 assert(c.hash_function() == hf);
161 assert(!(c.hash_function() == HF()));
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.cnstr/ |
| allocator.pass.cpp | 91 typedef test_hash<std::hash<T>> HF;
93 typedef std::unordered_multimap<T, T, HF, Comp, A> C;
98 assert(c.hash_function() == HF());
110 typedef test_hash<std::hash<T>> HF;
112 typedef std::unordered_multimap<T, T, HF, Comp, A> C;
115 HF hf(12);
116 C c(2, hf, a);
118 assert(c.hash_function() == hf);
119 assert(!(c.hash_function() == HF()));
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| init.pass.cpp | 96 typedef test_hash<std::hash<T>> HF;
99 typedef std::unordered_multiset<T, HF, Comp, A> C;
117 assert(c.hash_function() == HF());
129 typedef test_hash<std::hash<T>> HF;
132 typedef std::unordered_multiset<T, HF, Comp, A> C;
135 HF hf(43);
143 }, 12, hf, a);
151 assert(c.hash_function() == hf);
152 assert(!(c.hash_function() == HF()));
[all...] |
| range.pass.cpp | 101 typedef test_hash<std::hash<T>> HF;
104 typedef std::unordered_multiset<T, HF, Comp, A> C;
122 assert(c.hash_function() == HF());
134 typedef test_hash<std::hash<T>> HF;
137 typedef std::unordered_multiset<T, HF, Comp, A> C;
147 HF hf(43);
149 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a);
156 assert(c.hash_function() == hf);
157 assert(!(c.hash_function() == HF()));
[all...] |
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| init.pass.cpp | 96 typedef test_hash<std::hash<T>> HF;
99 typedef std::unordered_set<T, HF, Comp, A> C;
117 assert(c.hash_function() == HF());
129 typedef test_hash<std::hash<T>> HF;
132 typedef std::unordered_set<T, HF, Comp, A> C;
135 HF hf(43);
143 }, 12, hf, a);
151 assert(c.hash_function() == hf);
152 assert(!(c.hash_function() == HF()));
[all...] |
| range.pass.cpp | 101 typedef test_hash<std::hash<T>> HF;
104 typedef std::unordered_set<T, HF, Comp, A> C;
122 assert(c.hash_function() == HF());
134 typedef test_hash<std::hash<T>> HF;
137 typedef std::unordered_set<T, HF, Comp, A> C;
147 HF hf(43);
149 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a);
156 assert(c.hash_function() == hf);
157 assert(!(c.hash_function() == HF()));
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
| init.pass.cpp | 98 typedef test_hash<std::hash<int>> HF;
100 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
129 typedef test_hash<std::hash<int>> HF;
131 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
133 HF hf(42);
142 }, 12, hf, a);
149 assert(c.hash_function() == hf);
|
| range.pass.cpp | 104 typedef test_hash<std::hash<int>> HF;
106 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
124 assert(c.hash_function() == HF());
136 typedef test_hash<std::hash<int>> HF;
138 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
149 HF hf(42);
151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a);
158 assert(c.hash_function() == hf);
159 assert(!(c.hash_function() == HF()));
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF;
97 typedef std::unordered_multiset<T, HF, Comp, A> C;
115 assert(c.hash_function() == HF());
127 typedef test_hash<std::hash<T>> HF;
130 typedef std::unordered_multiset<T, HF, Comp, A> C;
133 HF hf(43);
141 }, 12, hf, a);
149 assert(c.hash_function() == hf);
150 assert(!(c.hash_function() == HF()));
[all...] |
| range.pass.cpp | 99 typedef test_hash<std::hash<T>> HF;
102 typedef std::unordered_multiset<T, HF, Comp, A> C;
120 assert(c.hash_function() == HF());
132 typedef test_hash<std::hash<T>> HF;
135 typedef std::unordered_multiset<T, HF, Comp, A> C;
145 HF hf(43);
147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a);
154 assert(c.hash_function() == hf);
155 assert(!(c.hash_function() == HF()));
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
| init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF;
97 typedef std::unordered_set<T, HF, Comp, A> C;
115 assert(c.hash_function() == HF());
127 typedef test_hash<std::hash<T>> HF;
130 typedef std::unordered_set<T, HF, Comp, A> C;
133 HF hf(43);
141 }, 12, hf, a);
149 assert(c.hash_function() == hf);
150 assert(!(c.hash_function() == HF()));
[all...] |
| range.pass.cpp | 99 typedef test_hash<std::hash<T>> HF;
102 typedef std::unordered_set<T, HF, Comp, A> C;
120 assert(c.hash_function() == HF());
132 typedef test_hash<std::hash<T>> HF;
135 typedef std::unordered_set<T, HF, Comp, A> C;
145 HF hf(43);
147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a);
154 assert(c.hash_function() == hf);
155 assert(!(c.hash_function() == HF()));
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| init.pass.cpp | 98 typedef test_hash<std::hash<int>> HF;
100 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
129 typedef test_hash<std::hash<int>> HF;
131 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
133 HF hf(42);
142 }, 12, hf, a);
149 assert(c.hash_function() == hf);
|
| range.pass.cpp | 104 typedef test_hash<std::hash<int>> HF;
106 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
124 assert(c.hash_function() == HF());
136 typedef test_hash<std::hash<int>> HF;
138 typedef std::unordered_map<int, std::string, HF, Comp, A> C;
149 HF hf(42);
151 C c(input_iterator<P*>(arr), input_iterator<P*>(arr + sizeof(arr)/sizeof(arr[0])), 14, hf, a);
158 assert(c.hash_function() == hf);
159 assert(!(c.hash_function() == HF()));
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/unord.multiset.cnstr/ |
| init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF;
97 typedef std::unordered_multiset<T, HF, Comp, A> C;
115 assert(c.hash_function() == HF());
127 typedef test_hash<std::hash<T>> HF;
130 typedef std::unordered_multiset<T, HF, Comp, A> C;
133 HF hf(43);
141 }, 12, hf, a);
149 assert(c.hash_function() == hf);
150 assert(!(c.hash_function() == HF()));
[all...] |
| range.pass.cpp | 99 typedef test_hash<std::hash<T>> HF;
102 typedef std::unordered_multiset<T, HF, Comp, A> C;
120 assert(c.hash_function() == HF());
132 typedef test_hash<std::hash<T>> HF;
135 typedef std::unordered_multiset<T, HF, Comp, A> C;
145 HF hf(43);
147 C c(input_iterator<T*>(arr), input_iterator<T*>(arr + sizeof(arr)/sizeof(arr[0])), 16, hf, a);
154 assert(c.hash_function() == hf);
155 assert(!(c.hash_function() == HF()));
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/unord.set.cnstr/ |
| init.pass.cpp | 94 typedef test_hash<std::hash<T>> HF;
97 typedef std::unordered_set<T, HF, Comp, A> C;
115 assert(c.hash_function() == HF());
127 typedef test_hash<std::hash<T>> HF;
130 typedef std::unordered_set<T, HF, Comp, A> C;
133 HF hf(43);
141 }, 12, hf, a);
149 assert(c.hash_function() == hf);
150 assert(!(c.hash_function() == HF()));
[all...] |
