Lines Matching refs:size
8 #define HeapSortDown(p, k, size, temp) \
11 if (s > size) break; \
12 if (s < size && p[s + 1] > p[s]) s++; \
17 void HeapSort(UInt32 *p, size_t size)
19 if (size <= 1)
23 size_t i = size / 2;
28 HeapSortDown(p, k, size, temp)
36 UInt32 temp = p[size];
37 p[size--] = p[1];
38 HeapSortDown(p, k, size, temp)
40 while (size > 1);
42 while (size > 3)
44 UInt32 temp = p[size];
46 p[size--] = p[1];
48 HeapSortDown(p, k, size, temp)
51 UInt32 temp = p[size];
52 p[size] = p[1];
53 if (size > 2 && p[2] < temp)
63 void HeapSort64(UInt64 *p, size_t size)
65 if (size <= 1)
69 size_t i = size / 2;
74 HeapSortDown(p, k, size, temp)
82 UInt64 temp = p[size];
83 p[size--] = p[1];
84 HeapSortDown(p, k, size, temp)
86 while (size > 1);
88 while (size > 3)
90 UInt64 temp = p[size];
92 p[size--] = p[1];
94 HeapSortDown(p, k, size, temp)
97 UInt64 temp = p[size];
98 p[size] = p[1];
99 if (size > 2 && p[2] < temp)
110 #define HeapSortRefDown(p, vals, n, size, temp) \
113 if (s > size) break; \
114 if (s < size && vals[p[s + 1]] > vals[p[s]]) s++; \
119 void HeapSortRef(UInt32 *p, UInt32 *vals, size_t size)
121 if (size <= 1)
125 size_t i = size / 2;
129 HeapSortRefDown(p, vals, i, size, temp);
135 UInt32 temp = p[size];
136 p[size--] = p[1];
137 HeapSortRefDown(p, vals, 1, size, temp);
139 while (size > 1);
