Lines Matching refs:Index
68 unsigned int Index, NumOfEntries;
91 Index = ((RedInput[i] >> (8 - BITS_PER_PRIM_COLOR)) <<
96 ColorArrayEntries[Index].Count++;
158 /* Finally scan the input buffer again and put the mapped index in the
162 Index = ((RedInput[i] >> (8 - BITS_PER_PRIM_COLOR)) <<
167 Index = ColorArrayEntries[Index].NewColorIndex;
168 OutputBuffer[i] = Index;
169 if (MaxRGBError[0] < ABS(OutputColorMap[Index].Red - RedInput[i]))
170 MaxRGBError[0] = ABS(OutputColorMap[Index].Red - RedInput[i]);
171 if (MaxRGBError[1] < ABS(OutputColorMap[Index].Green - GreenInput[i]))
172 MaxRGBError[1] = ABS(OutputColorMap[Index].Green - GreenInput[i]);
173 if (MaxRGBError[2] < ABS(OutputColorMap[Index].Blue - BlueInput[i]))
174 MaxRGBError[2] = ABS(OutputColorMap[Index].Blue - BlueInput[i]);
202 unsigned int i, j, Index = 0, NumEntries, MinColor, MaxColor;
214 Index = i;
223 /* Split the entry Index into two along the axis SortRGBAxis: */
229 NewColorSubdiv[Index].NumEntries);
232 for (j = 0, QuantizedColor = NewColorSubdiv[Index].QuantizedColors;
233 j < NewColorSubdiv[Index].NumEntries && QuantizedColor != NULL;
248 qsort(SortArray, NewColorSubdiv[Index].NumEntries,
252 for (j = 0; j < NewColorSubdiv[Index].NumEntries - 1; j++)
254 SortArray[NewColorSubdiv[Index].NumEntries - 1]->Pnext = NULL;
255 NewColorSubdiv[Index].QuantizedColors = QuantizedColor = SortArray[0];
259 Sum = NewColorSubdiv[Index].Count / 2 - QuantizedColor->Count;
285 NewColorSubdiv[Index].Count -= Count;
287 NewColorSubdiv[Index].NumEntries - NumEntries;
288 NewColorSubdiv[Index].NumEntries = NumEntries;
291 NewColorSubdiv[Index].RGBMin[j];
293 NewColorSubdiv[Index].RGBWidth[j];
300 NewColorSubdiv[Index].RGBWidth[SortRGBAxis] =
301 MaxColor - NewColorSubdiv[Index].RGBMin[SortRGBAxis];
