Lines Matching refs:current
42 * The current implementation uses an insertion sort into an array of
50 current, /* Current element */
174 * Find the end of the current delimited string and see if we need to add
245 a->current = -1;
277 * 'cupsArrayCurrent()' - Return the current element in the array.
279 * The current element is undefined until you call @link cupsArrayFind@,
296 * Return the current element...
299 if (a->current >= 0 && a->current < a->num_elements)
300 return (a->elements[a->current]);
382 da->current = a->current;
448 int current, /* Current element */
477 current = a->current;
482 current = a->hash[hash];
484 if (current < 0 || current >= a->num_elements)
485 current = a->current;
490 current = a->current;
494 current = cups_array_find(a, e, current, &diff);
508 while (current > 0 && !(*(a->compare))(e, a->elements[current - 1],
510 current --;
513 a->current = current;
516 a->hash[hash] = current;
518 return (a->elements[current]);
526 a->current = -1;
553 a->current = 0;
560 * 'cupsArrayGetIndex()' - Get the index of the current element.
562 * The current element is undefined until you call @link cupsArrayFind@,
568 int /* O - Index of the current element, starting at 0 */
574 return (a->current);
607 a->current = n;
667 a->current = a->num_elements - 1;
757 a->current = -1;
815 * to set the current element.
834 if (a->current < a->num_elements)
835 a->current ++;
848 * to set the current element.
867 if (a->current >= 0)
868 a->current --;
891 current; /* Current element */
909 current = cups_array_find(a, e, a->current, &diff);
920 (a->freefunc)(a->elements[current], a->data);
922 if (current < a->num_elements)
923 memmove(a->elements + current, a->elements + current + 1,
924 (size_t)(a->num_elements - current) * sizeof(void *));
926 if (current <= a->current)
927 a->current --;
929 if (current < a->insert)
931 else if (current == a->insert)
935 if (current <= a->saved[i])
946 * 'cupsArrayRestore()' - Reset the current element to the last @link cupsArraySave@.
951 void * /* O - New current element */
961 a->current = a->saved[a->num_saved];
963 if (a->current >= 0 && a->current < a->num_elements)
964 return (a->elements[a->current]);
971 * 'cupsArraySave()' - Mark the current element for a later @link cupsArrayRestore@.
973 * The current element is undefined until you call @link cupsArrayFind@,
975 * to set the current element.
991 a->saved[a->num_saved] = a->current;
1026 current; /* Current element */
1027 int diff; /* Comparison with current element */
1087 current = 0; /* Insert at beginning */
1089 current = a->num_elements; /* Append to the end */
1097 current = cups_array_find(a, e, a->insert, &diff);
1102 * Insert after the current element...
1105 current ++;
1111 * the current run of equal elements...
1122 while (current > 0 && !(*(a->compare))(e, a->elements[current - 1],
1124 current --;
1134 current ++;
1136 while (current < a->num_elements &&
1137 !(*(a->compare))(e, a->elements[current], a->data));
1146 if (current < a->num_elements)
1152 memmove(a->elements + current + 1, a->elements + current,
1153 (size_t)(a->num_elements - current) * sizeof(void *));
1155 if (a->current >= current)
1156 a->current ++;
1159 if (a->saved[i] >= current)
1162 DEBUG_printf(("9cups_array_add: insert element at index " CUPS_LLFMT, CUPS_LLCAST current));
1166 DEBUG_printf(("9cups_array_add: append element at " CUPS_LLFMT, CUPS_LLCAST current));
1171 if ((a->elements[current] = (a->copyfunc)(e, a->data)) == NULL)
1178 a->elements[current] = e;
1181 a->insert = current;
1184 for (current = 0; current < a->num_elements; current ++)
1185 DEBUG_printf(("9cups_array_add: a->elements[" CUPS_LLFMT "]=%p", CUPS_LLCAST current, a->elements[current]));
1206 current, /* Current element */
1207 diff; /* Comparison with current element */
1272 current = (left + right) / 2;
1273 diff = (*(a->compare))(e, a->elements[current], a->data);
1275 DEBUG_printf(("9cups_array_find: left=%d, right=%d, current=%d, diff=%d",
1276 left, right, current, diff));
1281 right = current;
1283 left = current;
1294 current = left;
1298 current = right;
1312 for (current = 0; current < a->num_elements; current ++)
1313 if (a->elements[current] == e)
1324 DEBUG_printf(("8cups_array_find: Returning %d, diff=%d", current, diff));
1328 return (current);