| /dports/databases/grass7/grass-7.8.6/lib/vector/diglib/ |
| H A D | spindex_rw.c | 133 if (0 >= dig__fwrite_port_I(&(t->nodecard), 1, fp)) in dig_Wr_spidx_head()
373 if (0 >= dig__fread_port_I(&(t->nodecard), 1, fp)) in dig_Rd_spidx_head()
375 ptr->Node_spidx->nodecard = t->nodecard; in dig_Rd_spidx_head()
376 ptr->Line_spidx->nodecard = t->nodecard; in dig_Rd_spidx_head()
377 ptr->Area_spidx->nodecard = t->nodecard; in dig_Rd_spidx_head()
378 ptr->Isle_spidx->nodecard = t->nodecard; in dig_Rd_spidx_head()
745 s[top].branch_id = t->nodecard; in rtree_write_from_memory()
862 s[top].branch_id = t->nodecard; in rtree_write_from_file()
1013 s[top].branch_id = t->nodecard; in rtree_load_to_memory()
1138 s[top].branch_id = t->nodecard; in rtree_load_to_file()
[all …]
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/rtree/ |
| H A D | card.c | 32 return set_max(&(t->nodecard), new_max); in RTreeSetNodeMax()
40 return t->nodecard; in RTreeGetNodeMax()
|
| H A D | index.c | 103 new_rtree->nodecard = MAXCARD; in RTreeCreateTree()
145 new_rtree->nodecard = MAXCARD; in RTreeCreateTree()
158 new_rtree->min_node_fill = (new_rtree->nodecard - 2) / 2; in RTreeCreateTree()
162 new_rtree->minfill_node_split = (new_rtree->nodecard - 1) / 2; in RTreeCreateTree()
248 RTreeDestroyNode(t->root, t->root->level ? t->nodecard : t->leafcard); in RTreeDestroyTree()
|
| H A D | indexm.c | 55 for (i = s[top].branch_id; i < t->nodecard; i++) { in RTreeSearchM()
68 s[top].branch_id = t->nodecard; in RTreeSearchM()
285 for (i = s[top].branch_id; i < t->nodecard; i++) { in RTreeDeleteRect2M()
299 s[top].branch_id = t->nodecard; in RTreeDeleteRect2M()
369 for (i = 0; i < t->nodecard; i++) { in RTreeDeleteRectM()
394 for (i = 0; i < t->nodecard; i++) { in RTreeDeleteRectM()
|
| H A D | indexf.c | 60 for (i = s[top].branch_id; i < t->nodecard; i++) { in RTreeSearchF()
74 s[top].branch_id = t->nodecard; in RTreeSearchF()
327 for (i = s[top].branch_id; i < t->nodecard; i++) { in RTreeDeleteRect2F()
342 s[top].branch_id = t->nodecard; in RTreeDeleteRect2F()
422 for (i = 0; i < t->nodecard; i++) { in RTreeDeleteRectF()
447 for (i = 0; i < t->nodecard; i++) { in RTreeDeleteRectF()
|
| H A D | node.c | 141 for (i = 0; i < t->nodecard; i++) { in RTreeNodeCover()
186 bestoverlap = t->nodecard + 1; in RTreePickLeafBranch()
190 for (i = 0; i < t->nodecard; i++) { in RTreePickLeafBranch()
248 for (i = 0; i < t->nodecard; i++) { in RTreePickBranch()
273 assert(n && i >= 0 && i < t->nodecard); in RTreeDisconnectBranch()
623 maxkids = (n->level > 0 ? t->nodecard : t->leafcard); in RTreePrintNode()
|
| H A D | card.h | 28 #define MAXKIDS(level, t) ((level) > 0 ? (t)->nodecard : (t)->leafcard)
|
| H A D | rtree.h | 146 int nodecard; /* max number of childs in node */ member
|
| H A D | split.c | 43 maxkids = t->nodecard; in RTreeGetBranches()
|
| /dports/devel/ga/ga-5.8/comex/src-mpi-mt/ |
| H A D | groups.c | 478 int matched,midplane,nodecard,computecard; in xgethostid() local
488 &rack_row, &rack_col, &midplane, &nodecard, &computecard); in xgethostid()
491 (int)rack_row, (int)rack_col, midplane, nodecard, computecard); in xgethostid()
|
| /dports/devel/ga/ga-5.8/comex/src-mpi-pt/ |
| H A D | groups.c | 514 int matched,midplane,nodecard,computecard; in xgethostid() local
524 &rack_row, &rack_col, &midplane, &nodecard, &computecard); in xgethostid()
527 (int)rack_row, (int)rack_col, midplane, nodecard, computecard); in xgethostid()
|
| /dports/devel/ga/ga-5.8/comex/src-mpi-pr/ |
| H A D | groups.c | 626 int matched,midplane,nodecard,computecard; in xgethostid() local
636 &rack_row, &rack_col, &midplane, &nodecard, &computecard); in xgethostid()
639 (int)rack_row, (int)rack_col, midplane, nodecard, computecard); in xgethostid()
|
| /dports/databases/grass7/grass-7.8.6/lib/vector/ |
| H A D | vectorlib_indices.dox | 112 <tr><td>nodecard</td><td>I</td><td>1</td><td>%Node card (?)</td></tr>
|
| /dports/sysutils/slurm-wlm/slurm-20.02.7/ |
| H A D | NEWS | 10791 -- BLUEGENE - Fixed race condition where if a nodecard has an error on an
|