Searched refs:ARITY (Results 1 – 1 of 1) sorted by relevance
25 #define ARITY (1 << B) /* tree branching factor */ macro29 …if (p < ARITY) return (PetscInt)(loc != 1); /* Parent(1) is 0, otherwise fix entries ending up in … in Parent()49 right = PetscMin(left + ARITY - 1, h->end - 1); in MinChild()70 h->alloc = maxsize + ARITY; /* We waste all but one slot (loc=1) in the first ARITY slots */ in PetscHeapCreate()84 if (1 < h->end && h->end < ARITY) h->end = ARITY; in PetscHeapAdd()114 if (h->end == ARITY) h->end = 2; /* Skip over hole */ in PetscHeapPop()