Lines Matching defs:pos
30 int pos;
34 pos = heap->size++;
35 while (pos > 0 && heap->gt(p, ptrs[(pos-1)/2])) {
36 ptrs[pos] = ptrs[(pos-1)/2];
37 pos = (pos-1)/2;
39 ptrs[pos] = p;
52 pos = 0;
55 int left = 2 * pos + 1;
56 int right = 2 * pos + 2;
57 int largest = pos;
62 if (largest == pos)
65 ptrs[pos] = ptrs[largest];
67 pos = largest;