Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 33) sorted by relevance

12

/petsc/src/vec/is/utils/
H A Dkdtree.c47 PetscErrorCode PetscKDTreeDestroy(PetscKDTree *tree) in PetscKDTreeDestroy() argument
50 if (*tree == NULL) PetscFunctionReturn(PETSC_SUCCESS); in PetscKDTreeDestroy()
51 PetscCall(PetscFree((*tree)->stems)); in PetscKDTreeDestroy()
52 PetscCall(PetscFree((*tree)->leaves)); in PetscKDTreeDestroy()
53 PetscCall(PetscFree((*tree)->bucket_indices)); in PetscKDTreeDestroy()
54 PetscCall(PetscFree((*tree)->coords_owned)); in PetscKDTreeDestroy()
55 PetscCall(PetscFree(*tree)); in PetscKDTreeDestroy()
86 PetscKDTree tree; member
91 static inline int PetscKDTreeSortFunc(PetscCount left, PetscCount right, PetscKDTree tree, uint8_t … in PetscKDTreeSortFunc() argument
93 const PetscReal *coords = tree->coords; in PetscKDTreeSortFunc()
[all …]
/petsc/src/sys/logging/handler/impls/nested/
H A Dlognested.c290 …OrderDepthFirst(PetscInt num_nodes, PetscInt parent, PetscNestedEventNode tree[], PetscInt *num_de… in PetscLogNestedEventNodesOrderDepthFirst() argument
298 if (tree[node].parent == parent) { in PetscLogNestedEventNodesOrderDepthFirst()
300 PetscNestedEventNode tmp = tree[start_loc]; in PetscLogNestedEventNodesOrderDepthFirst()
301 tree[start_loc] = tree[node]; in PetscLogNestedEventNodesOrderDepthFirst()
302 tree[node] = tmp; in PetscLogNestedEventNodesOrderDepthFirst()
303 …scLogNestedEventNodesOrderDepthFirst(num_nodes - start_loc - 1, tree[start_loc].id, &tree[start_lo… in PetscLogNestedEventNodesOrderDepthFirst()
304 tree[start_loc].num_descendants = num_this_descendants; in PetscLogNestedEventNodesOrderDepthFirst()
325 PetscNestedEventNode *tree; in PetscLogNestedCreatePerfNodes() local
329 PetscCall(PetscCalloc1(num_nodes, &tree)); in PetscLogNestedCreatePerfNodes()
331 tree[node].id = node; in PetscLogNestedCreatePerfNodes()
[all …]
H A Dxmlviewer.c310 …*parent_node, PetscEventPerfInfo *parent_info, const PetscNestedEventNode tree[], PetscEventPerfIn… in PetscLogNestedTreePrint() argument
319 for (PetscInt node = 0; node < num_nodes; node += 1 + tree[node].num_descendants) { in PetscLogNestedTreePrint()
320 …PetscAssert(tree[node].parent == parent_node->id, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Failed tree in… in PetscLogNestedTreePrint()
326 for (PetscInt i = 0, node = 0; node < num_nodes; i++, node += 1 + tree[node].num_descendants) { in PetscLogNestedTreePrint()
384 PetscCall(PetscNestedNameGetBase(tree[node].name, &base_name)); in PetscLogNestedTreePrint()
386 …PetscLogNestedTreePrint(viewer, total_time, threshold_time, &tree[node], &perf[node], &tree[node +… in PetscLogNestedTreePrint()
390 …PetscLogNestedTreePrint(viewer, total_time, threshold_time, &tree[node], &perf[node], &tree[node +… in PetscLogNestedTreePrint()
399 static PetscErrorCode PetscLogNestedTreePrintTop(PetscViewer viewer, PetscNestedEventTree *tree, Pe… in PetscLogNestedTreePrintTop() argument
409 main_stage = &tree->nodes[0]; in PetscLogNestedTreePrintTop()
410 tree_rem = &tree->nodes[1]; in PetscLogNestedTreePrintTop()
[all …]
/petsc/src/vec/is/utils/tests/
H A Dex1.c21 PetscKDTree tree; in main() local
49 PetscCall(PetscKDTreeCreate(num_coords, dim, coords, copy_mode, bucket_size, &tree)); in main()
51 if (view_tree) PetscCall(PetscKDTreeView(tree, NULL)); in main()
59 …PetscCall(PetscKDTreeQueryPointsNearestNeighbor(tree, num_coords, coords, PETSC_MACHINE_EPSILON * … in main()
75 …PetscCall(PetscKDTreeQueryPointsNearestNeighbor(tree, num_rand_points, rand_points, 0., indices, d… in main()
111 PetscCall(PetscKDTreeDestroy(&tree)); in main()
/petsc/share/petsc/saws/js/
H A Dtree.js73 var tree = d3.layout.tree()
81 var nodes = tree.nodes(treeData);
82 var links = tree.links(nodes);
/petsc/src/vec/is/sf/utils/
H A Dsfcoord.c185 PetscKDTree tree; in PetscSFSetGraphFromCoordinates() local
189 …all(PetscKDTreeCreate(num_targets, dim, target_coords, PETSC_USE_POINTER, PETSC_DETERMINE, &tree)); in PetscSFSetGraphFromCoordinates()
191 …PetscCall(PetscKDTreeQueryPointsNearestNeighbor(tree, nleaves, leafcoords, tol, indices, distances… in PetscSFSetGraphFromCoordinates()
207 PetscCall(PetscKDTreeDestroy(&tree)); in PetscSFSetGraphFromCoordinates()
/petsc/share/petsc/saws/
H A Ddocumentation16 The second option, Tree, toggles the display of the solver tree.
18 The tree diagram shows the structure of the solver. A horizontal split indicates multigrid levels. …
22 … shows the logical block structure of the matrix. The colors are coordinated with the tree diagram.
55 …trix properties are stored using an object called "matInfo" since using a tree structure to store …
/petsc/src/binding/petsc4py/docs/source/
H A Dinstall.rst13 Install from the PETSc source tree
17 PETSc source tree and set the `PETSC_DIR <petsc:doc_multi>` and `PETSC_ARCH
H A Dpetsc_python_types.rst10 … in `src/petsc4py/PETSc/libpetsc4py.pyx <https://gitlab.com/petsc/petsc/-/tree/release/src/binding…
12 The scripts used here can be found at `demo/python_types <https://gitlab.com/petsc/petsc/-/tree/rel…
/petsc/src/ksp/ksp/tutorials/output/
H A Dex82_1.out41 block tree consistency: TRUE
90 block tree consistency: TRUE
135 block tree consistency: TRUE
/petsc/src/ksp/ksp/tests/output/
H A Dex81_1.out21 INFOG(5) (estimated maximum front size in the complete tree): 1
22 INFOG(6) (number of nodes in the complete tree): 4
70 INFOG(5) (estimated maximum front size in the complete tree): 1
71 INFOG(6) (number of nodes in the complete tree): 4
H A Dex81_2.out33 INFOG(5) (estimated maximum front size in the complete tree): 1
34 INFOG(6) (number of nodes in the complete tree): 2
101 INFOG(5) (estimated maximum front size in the complete tree): 1
102 INFOG(6) (number of nodes in the complete tree): 2
/petsc/src/dm/impls/forest/p4est/
H A Dpforest.h603 p4est_tree_t *tree = &(((p4est_tree_t *)p4est->trees->array)[t]); in DMPforestGetRefinementLevel() local
604 maxlevelloc = PetscMax((PetscInt)tree->maxlevel, maxlevelloc); in DMPforestGetRefinementLevel()
926 p4est_tree_t *tree = &(((p4est_tree_t *)p4est->trees->array)[t]); in DMSetUp_pforest() local
927 PetscInt numQuads = (PetscInt)tree->quadrants.elem_count, i; in DMSetUp_pforest()
928 p4est_quadrant_t *quads = (p4est_quadrant_t *)tree->quadrants.array; in DMSetUp_pforest()
947 p4est_tree_t *tree = &(((p4est_tree_t *)pforest->forest->trees->array)[t]); in DMSetUp_pforest() local
949 PetscInt numQuads = (PetscInt)tree->quadrants.elem_count; in DMSetUp_pforest()
951 p4est_quadrant_t *quads = (p4est_quadrant_t *)tree->quadrants.array; in DMSetUp_pforest()
2453 p4est_tree_t *tree = &(((p4est_tree_t *)p4estC->trees->array)[t]); in DMPforestGetTransferSF_Point() local
2456 …PetscCall(PetscMemcpy(&coverQuadsSend[count], tree->quadrants.array, tree->quadrants.elem_count * … in DMPforestGetTransferSF_Point()
[all …]
/petsc/doc/tutorials/
H A Dindex.md17 directories throughout the PETSc `src/` tree.
/petsc/src/dm/impls/plex/tests/output/
H A Dex1_0.out2 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Sorting vertices by a bsp-tree.
6 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Number of tree nodes: 2.
7 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Maximum tree node size: 4.
8 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Maximum tree depth: 0.
/petsc/src/dm/impls/plex/tutorials/output/
H A Dex1f90_1.out2 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Sorting vertices by a bsp-tree.
6 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Number of tree nodes: 2.
7 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Maximum tree node size: 4.
8 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Maximum tree depth: 0.
H A Dex1_1.out2 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Sorting vertices by a bsp-tree.
6 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Number of tree nodes: 2.
7 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Maximum tree node size: 4.
8 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Maximum tree depth: 0.
/petsc/doc/developers/
H A Dmrfork.md56 - `URL with branchname` = `https://gitlab.com/paul.kuehner/petsc/-/tree/add-tao-get-constraints` ("…
H A Dbuildsystem.md141 The `configure.py` script constructs a tree of configure modules and
168 The `config/package/Configure.py` module determines how the tree of
185 The `Dump` method runs over the tree of configure modules, and outputs
224 a section named for the package. The second task is to build the tree of
H A Ddocumentation.md9 - Good documentation should be like a bonsai tree: alive, on display, frequently tended, and as sma…
210 - Decide where in `doc/images` a new image should go. Use the structure of the `doc/` tree as a gui…
H A Dtesting.md164 require runtime files that are maintained in the source tree.
492 of this file but still maintain it in the source tree.
649 REPLACE=1 Replace the output in PETSC_DIR source tree (-m to test scripts)
651 ALT=1 Replace 'alt' output in PETSC_DIR source tree (-M to test scripts)
/petsc/src/dm/impls/plex/tests/
H A Dex3.c27 PetscBool tree; /* Test tree routines */ member
205 options->tree = PETSC_FALSE; in ProcessOptions()
225 …PetscCall(PetscOptionsBool("-tree", "Test tree routines", "ex3.c", options->tree, &options->tree, … in ProcessOptions()
327 if (user->tree) { in CreateMesh()
818 if (user->tree) { in CheckInterpolation()
975 if (dim == 2 && user.constraints == PETSC_FALSE && user.tree == PETSC_FALSE && k == 0) { in main()
/petsc/doc/manual/
H A Dtests.md68 the same directory as the source tree underneath. For testing installs,
71 label is used to denote where it can be found within the source tree.
/petsc/lib/petsc/bin/maint/petsclinter/petsclinter/
H A DREADME.rst5 the linter walks through the abstract syntax tree (AST) of a parsed file looking for nodes
/petsc/
H A Dmakefile494 -${OMAKE_SELF} ACTION=cleanhtml PETSC_DIR=${PETSC_DIR} tree

12