Lines Matching full:temp
8 #define HeapSortDown(p, k, size, temp) \
13 if (temp >= p[s]) break; \
15 } p[k] = temp; }
26 UInt32 temp = p[i];
28 HeapSortDown(p, k, size, temp)
36 UInt32 temp = p[size];
38 HeapSortDown(p, k, size, temp)
44 UInt32 temp = p[size];
48 HeapSortDown(p, k, size, temp)
51 UInt32 temp = p[size];
53 if (size > 2 && p[2] < temp)
56 p[2] = temp;
59 p[1] = temp;
72 UInt64 temp = p[i];
74 HeapSortDown(p, k, size, temp)
82 UInt64 temp = p[size];
84 HeapSortDown(p, k, size, temp)
90 UInt64 temp = p[size];
94 HeapSortDown(p, k, size, temp)
97 UInt64 temp = p[size];
99 if (size > 2 && p[2] < temp)
102 p[2] = temp;
105 p[1] = temp;
110 #define HeapSortRefDown(p, vals, n, size, temp) \
111 { size_t k = n; UInt32 val = vals[temp]; for (;;) { \
117 } p[k] = temp; }
128 UInt32 temp = p[i];
129 HeapSortRefDown(p, vals, i, size, temp);
135 UInt32 temp = p[size];
137 HeapSortRefDown(p, vals, 1, size, temp);
