Lines Matching full:current
34 * The current implementation uses an insertion sort into an array of
42 current, /* Current element */ member
165 * Find the end of the current delimited string and see if we need to add in _cupsArrayAddStrings()
224 void **e; /* Current element */ in cupsArrayClear()
236 a->current = -1; in cupsArrayClear()
268 * 'cupsArrayCurrent()' - Return the current element in the array.
270 * The current element is undefined until you call @link cupsArrayFind@,
287 * Return the current element... in cupsArrayCurrent()
290 if (a->current >= 0 && a->current < a->num_elements) in cupsArrayCurrent()
291 return (a->elements[a->current]); in cupsArrayCurrent()
324 void **e; /* Current element */ in cupsArrayDelete()
373 da->current = a->current; in cupsArrayDup()
439 int current, /* Current element */ in cupsArrayFind() local
468 current = a->current; in cupsArrayFind()
473 current = a->hash[hash]; in cupsArrayFind()
475 if (current < 0 || current >= a->num_elements) in cupsArrayFind()
476 current = a->current; in cupsArrayFind()
481 current = a->current; in cupsArrayFind()
485 current = cups_array_find(a, e, current, &diff); in cupsArrayFind()
499 while (current > 0 && !(*(a->compare))(e, a->elements[current - 1], in cupsArrayFind()
501 current --; in cupsArrayFind()
504 a->current = current; in cupsArrayFind()
507 a->hash[hash] = current; in cupsArrayFind()
509 return (a->elements[current]); in cupsArrayFind()
517 a->current = -1; in cupsArrayFind()
544 a->current = 0; in cupsArrayFirst()
551 * 'cupsArrayGetIndex()' - Get the index of the current element.
553 * The current element is undefined until you call @link cupsArrayFind@,
559 int /* O - Index of the current element, starting at 0 */
565 return (a->current); in cupsArrayGetIndex()
598 a->current = n; in cupsArrayIndex()
658 a->current = a->num_elements - 1; in cupsArrayLast()
748 a->current = -1; in cupsArrayNew3()
806 * to set the current element.
825 if (a->current < a->num_elements) in cupsArrayNext()
826 a->current ++; in cupsArrayNext()
839 * to set the current element.
858 if (a->current >= 0) in cupsArrayPrev()
859 a->current --; in cupsArrayPrev()
882 current; /* Current element */ in cupsArrayRemove() local
900 current = cups_array_find(a, e, a->current, &diff); in cupsArrayRemove()
911 (a->freefunc)(a->elements[current], a->data); in cupsArrayRemove()
913 if (current < a->num_elements) in cupsArrayRemove()
914 memmove(a->elements + current, a->elements + current + 1, in cupsArrayRemove()
915 (size_t)(a->num_elements - current) * sizeof(void *)); in cupsArrayRemove()
917 if (current <= a->current) in cupsArrayRemove()
918 a->current --; in cupsArrayRemove()
920 if (current < a->insert) in cupsArrayRemove()
922 else if (current == a->insert) in cupsArrayRemove()
926 if (current <= a->saved[i]) in cupsArrayRemove()
937 * 'cupsArrayRestore()' - Reset the current element to the last @link cupsArraySave@.
942 void * /* O - New current element */
952 a->current = a->saved[a->num_saved]; in cupsArrayRestore()
954 if (a->current >= 0 && a->current < a->num_elements) in cupsArrayRestore()
955 return (a->elements[a->current]); in cupsArrayRestore()
962 * 'cupsArraySave()' - Mark the current element for a later @link cupsArrayRestore@.
964 * The current element is undefined until you call @link cupsArrayFind@,
966 * to set the current element.
982 a->saved[a->num_saved] = a->current; in cupsArraySave()
1017 current; /* Current element */ in cups_array_add() local
1018 int diff; /* Comparison with current element */ in cups_array_add()
1078 current = 0; /* Insert at beginning */ in cups_array_add()
1080 current = a->num_elements; /* Append to the end */ in cups_array_add()
1088 current = cups_array_find(a, e, a->insert, &diff); in cups_array_add()
1093 * Insert after the current element... in cups_array_add()
1096 current ++; in cups_array_add()
1102 * the current run of equal elements... in cups_array_add()
1113 while (current > 0 && !(*(a->compare))(e, a->elements[current - 1], in cups_array_add()
1115 current --; in cups_array_add()
1125 current ++; in cups_array_add()
1127 while (current < a->num_elements && in cups_array_add()
1128 !(*(a->compare))(e, a->elements[current], a->data)); in cups_array_add()
1137 if (current < a->num_elements) in cups_array_add()
1143 memmove(a->elements + current + 1, a->elements + current, in cups_array_add()
1144 (size_t)(a->num_elements - current) * sizeof(void *)); in cups_array_add()
1146 if (a->current >= current) in cups_array_add()
1147 a->current ++; in cups_array_add()
1150 if (a->saved[i] >= current) in cups_array_add()
1153 DEBUG_printf(("9cups_array_add: insert element at index " CUPS_LLFMT, CUPS_LLCAST current)); in cups_array_add()
1157 DEBUG_printf(("9cups_array_add: append element at " CUPS_LLFMT, CUPS_LLCAST current)); in cups_array_add()
1162 if ((a->elements[current] = (a->copyfunc)(e, a->data)) == NULL) in cups_array_add()
1169 a->elements[current] = e; in cups_array_add()
1172 a->insert = current; in cups_array_add()
1175 for (current = 0; current < a->num_elements; current ++) in cups_array_add()
1176 …tf(("9cups_array_add: a->elements[" CUPS_LLFMT "]=%p", CUPS_LLCAST current, a->elements[current])); in cups_array_add()
1197 current, /* Current element */ in cups_array_find() local
1198 diff; /* Comparison with current element */ in cups_array_find()
1262 current = (left + right) / 2; in cups_array_find()
1263 diff = (*(a->compare))(e, a->elements[current], a->data); in cups_array_find()
1265 DEBUG_printf(("9cups_array_find: left=%d, right=%d, current=%d, diff=%d", in cups_array_find()
1266 left, right, current, diff)); in cups_array_find()
1271 right = current; in cups_array_find()
1273 left = current; in cups_array_find()
1284 current = left; in cups_array_find()
1288 current = right; in cups_array_find()
1302 for (current = 0; current < a->num_elements; current ++) in cups_array_find()
1303 if (a->elements[current] == e) in cups_array_find()
1314 DEBUG_printf(("8cups_array_find: Returning %d, diff=%d", current, diff)); in cups_array_find()
1318 return (current); in cups_array_find()