Home
last modified time | relevance | path

Searched refs:hash (Results 1 – 25 of 29) sorted by relevance

12

/petsc/include/petsc/private/
H A Dpetscfptimpl.h79 for (unsigned long i = 0, hash = PetscFPTHashPointer(key); i < PetscFPTData->tablesize; ++i) { in PetscFPTAdd() local
80 if (PetscFPTData->functionpointer[hash] == key) { in PetscFPTAdd()
81 PetscFPTData->functionname[hash] = (char *)data; in PetscFPTAdd()
83 } else if (!PetscFPTData->functionpointer[hash]) { in PetscFPTAdd()
85 PetscFPTData->functionpointer[hash] = key; in PetscFPTAdd()
86 PetscFPTData->functionname[hash] = (char *)data; in PetscFPTAdd()
89 hash = (hash == (PetscFPTData->tablesize - 1)) ? 0 : hash + 1; in PetscFPTAdd()
102 unsigned long hash, ii = 0; in PetscFPTFind() local
106 hash = PetscFPTHashPointer(key); in PetscFPTFind()
108 if (!PetscFPTData->functionpointer[hash]) break; in PetscFPTFind()
[all …]
H A Dpcbddcgraphhashmap.h8 PetscHash_t hash; in PCBDDCGraphNodeHash() local
9 hash = PetscHashCombine(PetscHashInt(node->count), PetscHashInt(node->which_dof)); in PCBDDCGraphNodeHash()
10 hash = PetscHashCombine(hash, PetscHashInt(node->special_dof)); in PCBDDCGraphNodeHash()
11 …for (PetscInt i = 0; i < node->count; i++) hash = PetscHashCombine(hash, PetscHashInt(node->neighb… in PCBDDCGraphNodeHash()
12 hash = PetscHashCombine(hash, PetscHashInt(node->local_groups_count)); in PCBDDCGraphNodeHash()
14 …for (PetscInt i = 0; i < node->local_groups_count; i++) hash = PetscHashCombine(hash, PetscHashInt… in PCBDDCGraphNodeHash()
16 return hash; in PCBDDCGraphNodeHash()
H A Dhashset.txt18 PetscHSet<T>Create - Create a hash set
25 . ht - The hash set
33 PetscHSet<T>Destroy - Destroy a hash set
40 . ht - The hash set
48 PetscHSet<T>Reset - Reset a hash set
55 . ht - The hash set
63 PetscHSet<T>Duplicate - Duplicate a hash set
70 . ht - The source hash set
73 . ht - The duplicated hash set
88 + ht - The hash set to which elements are added
[all …]
H A Dhashmap.txt20 PetscHMap<T>Create - Create a hash table
27 . ht - The hash table
35 PetscHMap<T>CreateWithSize - Create a hash table with a given initial size
42 . n - The size of the hash table
45 . ht - The hash table
56 PetscHMap<T>Destroy - Destroy a hash table
63 . ht - The hash table
71 PetscHMap<T>Reset - Reset a hash table
78 . ht - The hash table
86 PetscHMap<T>Duplicate - Duplicate a hash table
[all …]
H A Dhashtable.h247 static inline PetscHash_t PetscHashCombine(PetscHash_t seed, PetscHash_t hash) in PetscHashCombine() argument
251 return seed ^ (hash + (seed << 6) + (seed >> 2)); in PetscHashCombine()
/petsc/config/PETSc/options/
H A Darch.py71 def makeDependency(self,hash,hashfile,hashfilepackages): argument
75 if hash:
76 self.framework.hash = hash
107 hash = 'Uname: '+platform.uname().system+' '+platform.uname().processor+'\n'
108 hash += 'PATH=' + os.environ.get('PATH', '') + '\n'
110 hash += 'args:\n' + '\n'.join(' '+a for a in sorted(args.values())) + '\n'
125 hash += '\n'.join(sorted(chash.splitlines()))
140 m.update(hash.encode('utf-8'))
188 self.makeDependency(hash,hashfile,hashfilepackages)
196 self.makeDependency(hash,hashfile,hashfilepackages)
[all …]
/petsc/lib/petsc/bin/maint/
H A Dabicheck.py50 hash = subprocess.check_output(['grep', '^#define PETSC_VERSION_GIT', petscconf])
51 hash = hash.split("\"")[1]
83 file.write(branch + ' (' + hash +')')
/petsc/src/mat/tests/
H A Dex183.c29 PetscInt m, n, N, bs, rstart, rend, i, j, k, total_subdomains, hash, nsubdomains = 1; in main() local
49 hash = 7; in main()
50 … to be relatively prime to M = size*m (total matrix size)", "ISCreateGeneral", hash, &hash, &flg)); in main()
101 idx = (j * hash); in main()
119 if (permute_indices) PetscCall(PetscViewerASCIIPrintf(viewer, " (hash=%" PetscInt_FMT ")", hash)); in main()
/petsc/src/mat/tests/output/
H A Dex182_15.out16 [1] <mat:seqaij> MatSetUp_Seq_Hash(): Using hash-based MatSetValues() for MATSEQAIJ because no prea…
17 [1] <mat:seqaij> MatSetUp_Seq_Hash(): Using hash-based MatSetValues() for MATSEQAIJ because no prea…
H A Dex182_12.out16 [1] <mat:seqaij> MatSetUp_Seq_Hash(): Using hash-based MatSetValues() for MATSEQAIJ because no prea…
17 [1] <mat:seqaij> MatSetUp_Seq_Hash(): Using hash-based MatSetValues() for MATSEQAIJ because no prea…
/petsc/src/vec/is/is/tutorials/output/
H A Dex4_2.out5 type: hash
/petsc/doc/manualpages/MANSECHeaders/
H A DPetscH3 PETSc provides an extensible variety of hash sets and maps based on the khash system.
H A DDMLabel6 Insertion is amortized $O(1)$ since hash tables are used,
/petsc/src/sys/objects/
H A Doptions.c42 unsigned int hash = 0; in PetscOptHash() local
44 hash += PetscToLower(*key++); in PetscOptHash()
45 hash += hash << 10; in PetscOptHash()
46 hash ^= hash >> 6; in PetscOptHash()
48 hash += hash << 3; in PetscOptHash()
49 hash ^= hash >> 11; in PetscOptHash()
50 hash += hash << 15; in PetscOptHash()
51 return hash; in PetscOptHash()
/petsc/include/petsc/private/cpp/
H A Dunordered_map.hpp622 const auto hash = hash_function()(key); in find_and_emplace_final_() local
623 auto i = hash & mask; in find_and_emplace_final_()
725 const auto hash = hash_function()(key); in khash_find_() local
726 auto i = hash & mask; in khash_find_()
975 const auto hash = hash_function()(PETSC_OPTIONAL_GET_KEY(key)); in resize() local
976 auto j = hash & new_mask; in resize()
1211 template <typename K, typename T, typename H = std::hash<K>,
H A Dobject_pool.hpp31 struct hash<::Petsc::memory::align_val_t> { struct
/petsc/lib/petsc/bin/maint/petsclinter/petsclinter/classes/
H A D_src_pos.py70 return hash((self.source_location.file, self.offset))
287 return hash((self.__start(), self.__end()))
H A D_cursor.py184 return hash(self.__cursor.hash)
H A D_linter.py73 cursor_id = cursor.hash
/petsc/doc/changes/
H A D323.md73 - Add `MatCopyHashToXAIJ()` which allows assembling an XAIJ matrix in hash table form into another …
74 - Add `MatResetHash()` which allows resetting an XAIJ matrix to use a hash table
/petsc/include/
H A Dpetscsys.h2900 unsigned int c, hash = 5381; in PetscStrHash() local
2902 while ((c = (unsigned int)*str++)) hash = ((hash << 5) + hash) + c; /* hash * 33 + c */ in PetscStrHash()
2903 return hash; in PetscStrHash()
/petsc/config/BuildSystem/config/
H A DsetsOrdered.py361 result ^= hash(elt)
/petsc/src/sys/tests/
H A Dex64.cxx21 std::hash<T> hasher; in hash_combine()
30 struct hash<type> { \
/petsc/src/dm/impls/forest/p4est/
H A Dpforest.h112 uint32_t hash = 0; in DMPforestHash() local
124 hash ^= k; in DMPforestHash()
125 hash = DMPROT32(hash, r2) * m + n; in DMPforestHash()
128 hash ^= len; in DMPforestHash()
129 hash ^= (hash >> 16); in DMPforestHash()
130 hash *= 0x85ebca6b; in DMPforestHash()
131 hash ^= (hash >> 13); in DMPforestHash()
132 hash *= 0xc2b2ae35; in DMPforestHash()
133 hash ^= (hash >> 16); in DMPforestHash()
135 return hash; in DMPforestHash()
/petsc/src/dm/impls/plex/
H A Dplexgeometry.c1249 PetscBool hash = mesh->useHashLocation, reuse = PETSC_FALSE; in DMLocatePoints_Plex() local
1267 …PetscCheck(ltype != DM_POINTLOCATION_NEAREST || hash, PetscObjectComm((PetscObject)dm), PETSC_ERR_… in DMLocatePoints_Plex()
1301 if (hash) { in DMLocatePoints_Plex()
1354 if (hash) { in DMLocatePoints_Plex()
1397 if (hash) PetscCall(ISRestoreIndices(mesh->lbox->cells, &boxCells)); in DMLocatePoints_Plex()
1398 if (ltype == DM_POINTLOCATION_NEAREST && hash && numFound < numPoints) { in DMLocatePoints_Plex()
1442 if (hash) { in DMLocatePoints_Plex()

12