Home
last modified time | relevance | path

Searched refs:trees (Results 1 – 4 of 4) sorted by relevance

/petsc/src/dm/impls/forest/p4est/
H A Dpforest.h519 p4est_tree_t *treeFrom = &(((p4est_tree_t *)p4estFrom->trees->array)[t]); in DMPforestComputeLocalCellTransferSF_loop()
520 p4est_tree_t *treeTo = &(((p4est_tree_t *)p4estTo->trees->array)[t]); in DMPforestComputeLocalCellTransferSF_loop()
603 p4est_tree_t *tree = &(((p4est_tree_t *)p4est->trees->array)[t]); in DMPforestGetRefinementLevel()
926 p4est_tree_t *tree = &(((p4est_tree_t *)p4est->trees->array)[t]); in DMSetUp_pforest()
946 p4est_tree_t *atree = &(((p4est_tree_t *)apforest->forest->trees->array)[t]); in DMSetUp_pforest()
947 p4est_tree_t *tree = &(((p4est_tree_t *)pforest->forest->trees->array)[t]); in DMSetUp_pforest()
2196 p4est_tree_t *treeStart = &(((p4est_tree_t *)p4estC->trees->array)[tStart]); in DMPforestGetCellCoveringSF()
2197 …st_tree_t *treeEnd = (size_t)tEnd < p4estC->trees->elem_count ? &(((p4est_tree_t *)p4estC->t… in DMPforestGetCellCoveringSF()
2453 p4est_tree_t *tree = &(((p4est_tree_t *)p4estC->trees->array)[t]); in DMPforestGetTransferSF_Point()
2490 p4est_tree_t *tree = &(((p4est_tree_t *)p4estC->trees->array)[t]); in DMPforestGetTransferSF_Point()
[all …]
/petsc/src/binding/petsc4py/conf/
H A Depydoc.cfg92 # of a module or class, or one of the special names "trees.html",
/petsc/doc/changes/
H A D323.md61 - Add `PetscKDTree`, an implementation of K-d trees for efficient nearest-neighbor point searches. …
/petsc/doc/
H A Dpetsc.bib13346 title = {Inference of Phylogenetic trees using maximum likelihood},