Searched refs:hash (Results 1 - 25 of 829) sorted by relevance

1234567891011>>

/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/6_containers/hash/requirements/
H A Dexplicit_instantiation.cc22 // 6.3.3 class template hash
29 // Verify that we can instantiate hash for every required type.
30 template class hash<bool>;
31 template class hash<char>;
32 template class hash<signed char>;
33 template class hash<unsigned char>;
34 template class hash<short>;
35 template class hash<int>;
36 template class hash<long>;
37 template class hash<unsigne
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/
H A D56278.cc25 struct hash : std::hash<int> struct in inherits:std::hash
27 hash() { } function in struct:hash
30 std::unordered_set<int, hash>::local_iterator i;
H A D56267.cc25 struct hash : std::hash<int> struct in inherits:std::hash
27 hash& operator=(const hash&) = delete;
32 std::unordered_set<int, hash> s{ 0, 1, 2 };
/haiku-buildtools/gcc/libstdc++-v3/testsuite/20_util/hash/requirements/
H A Dexplicit_instantiation.cc25 // Verify that we can instantiate hash for every required type.
26 template class std::hash<bool>; member in class:std
27 template class std::hash<char>; member in class:std
28 template class std::hash<signed char>; member in class:std
29 template class std::hash<unsigned char>; member in class:std
30 template class std::hash<char16_t>; member in class:std
31 template class std::hash<char32_t>; member in class:std
32 template class std::hash<short>; member in class:std
33 template class std::hash<int>; member in class:std
34 template class std::hash<lon member in class:std
35 template class std::hash<unsigned short>; member in class:std
36 template class std::hash<unsigned int>; member in class:std
37 template class std::hash<unsigned long>; member in class:std
38 template class std::hash<float>; member in class:std
39 template class std::hash<double>; member in class:std
40 template class std::hash<long double>; member in class:std
41 template class std::hash<void*>; member in class:std
42 template class std::hash<std::string>; member in class:std
43 template class std::hash<std::error_code>; member in class:std
46 template class std::hash<wchar_t>; member in class:std
47 template class std::hash<std::wstring>; member in class:std
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A Dpr31345-1.c7 int hash, thash, head[2], off; local
10 (hash) = 19780211;
12 (hash) = (hash) + (kbuf)[_DP_i];
14 (hash) = ((hash) * 43321879) & 0x7FFFFFFF;
18 if (hash > thash) {}
19 else if (hash < thash)
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dunion1.C9 hash(const double d) function
21 hash (3.1415);
/haiku-buildtools/gcc/libstdc++-v3/libsupc++/
H A Dhash_bytes.cc25 // This file defines Hash_bytes, a primitive used for defining hash
30 // exactly the same interface but using a different hash algorithm,
31 // Fowler / Noll / Vo (FNV) Hash (type FNV-1a). The Murmur hash
32 // function apears to be better in both speed and hash quality, and
72 // Implementation of Murmur hash for 32-bit size_t.
77 size_t hash = seed ^ len; local
80 // Mix 4 bytes at a time into the hash.
87 hash *= m;
88 hash ^= k;
97 hash
114 _Fnv_hash_bytes(const void* ptr, size_t len, size_t hash) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A Dpr41750.c1 /* PR 41750 - IPA-SRA used to pass hash->sgot by value rather than by
6 int hash; member in struct:bfd_link_hash_table
18 struct foo_link_hash_table *hash; member in struct:foo_link_info
26 info->hash->sgot = abfd;
32 struct foo_link_hash_table *hash)
37 got = hash->sgot;
40 dynobj = hash->dynobj;
42 hash->dynobj = dynobj = abfd;
45 got = hash->sgot;
53 return get_got (abfd, info, info->hash);
31 get_got(int *abfd, struct foo_link_info *info, struct foo_link_hash_table *hash) argument
57 struct foo_link_hash_table hash; variable in typeref:struct:foo_link_hash_table
[all...]
/haiku-buildtools/cloog/test/
H A Ddurbin_e_s.good.c2 extern void hash(int);
10 #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); }
11 #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); }
12 #define S3(i,j,k) { hash(
[all...]
H A Dequality2.good.c2 extern void hash(int);
10 #define S1(i0,i1,i2,i3,i4,i5,i6,i7,i8,i9,i10) { hash(1); hash(i0); hash(i1); hash(i2); hash(i3); hash(i4); hash(i5); hash(i6); hash(i
[all...]
H A Dwalters.good.c2 extern void hash(int);
10 #define S1(i,div36,div37,div38) { hash(1); hash(i); hash(div36); hash(div37); hash(div38); }
11 #define S2(i,div36,div37,div38) { hash(2); hash(i); hash(div36); hash(div3
[all...]
H A Dblock2.good.c2 extern void hash(int);
10 #define S1(i,j) { hash(1); hash(i); hash(j); }
11 #define S2(i,j) { hash(2); hash(i); hash(j); }
12 #define S3(i,j) { hash(3); hash(i); hash(
[all...]
H A Dforwardsub-2-1-2-3.good.c2 extern void hash(int);
10 #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); }
11 #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); }
12 #define S3(i,j) { hash(
[all...]
H A Dlub.good.c2 extern void hash(int);
10 #define S1(i,j) { hash(1); hash(i); hash(j); }
11 #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); }
12 #define S3(i,j,k) { hash(3); hash(
[all...]
H A Dlevenshtein-1-2-3.good.c2 extern void hash(int);
10 #define S1(i,j) { hash(1); hash(i); hash(j); }
11 #define S2(i,j) { hash(2); hash(i); hash(j); }
12 #define S3(i,j) { hash(3); hash(i); hash(
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/
H A Dpr37928.c3 int get_state(int size, int *node, int *hash) argument
6 while(hash[i])
8 if(node[hash[i]] == 0)
9 return hash[i]-1;
19 int gate1(int size, int *node, int *hash) argument
25 j = get_state(size,node, hash);
/haiku-buildtools/gcc/libstdc++-v3/src/c++98/
H A Dhash_tr1.cc1 // std::tr1::hash definitions -*- C++ -*-
29 #include "hash-long-double-tr1-aux.cc"
38 hash<string>::operator()(string __s) const
39 { return _Fnv_hash::hash(__s.data(), __s.length()); }
43 hash<const string&>::operator()(const string& __s) const
44 { return _Fnv_hash::hash(__s.data(), __s.length()); }
49 hash<wstring>::operator()(wstring __s) const
50 { return _Fnv_hash::hash(__s.data(), __s.length() * sizeof(wchar_t)); }
54 hash<const wstring&>::operator()(const wstring& __s) const
55 { return _Fnv_hash::hash(__
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/requirements/explicit_instantiation/
H A D3.cc24 template class std::unordered_map<int, int, hash<int>, equal_to<int>,
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multimap/requirements/explicit_instantiation/
H A D3.cc24 template class std::unordered_multimap<int, int, hash<int>, equal_to<int>,
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_multiset/requirements/explicit_instantiation/
H A D3.cc24 template class std::unordered_multiset<int, hash<int>, equal_to<int>,
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_set/requirements/explicit_instantiation/
H A D3.cc24 template class std::unordered_set<int, hash<int>, equal_to<int>,
/haiku-buildtools/gcc/libstdc++-v3/testsuite/30_threads/thread/id/
H A Dhash.cc25 // thread::id hash
26 std::hash<std::thread::id> h1;
/haiku-buildtools/gcc/gcc/
H A Drtlhash.h1 /* Register Transfer Language (RTL) hash functions.
28 extern void add_rtx (const_rtx, hash &);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/6_containers/headers/functional/
H A Dsynopsis.cc29 template <class T> struct hash;
/haiku-buildtools/cloog/test/non_optimal/
H A Dusvd_e_t.good.c2 extern void hash(int);
10 #define S1(i,j,k) { hash(1); hash(i); hash(j); hash(k); }
11 #define S2(i,j,k) { hash(2); hash(i); hash(j); hash(k); }
12 #define S3(i,j,k) { hash(
[all...]

Completed in 430 milliseconds

1234567891011>>