* Copyright 1997-2007 by Easy Software Products.
*
* These coded instructions, statements, and computer programs are the
* Copyright 1997-2007 by Easy Software Products.
*
* These coded instructions, statements, and computer programs are the
* When adding an element to a sorted array, non-unique elements are
* appended at the end of the run. For unsorted arrays, the element
* is inserted at the end of the array.
* When adding an element to a sorted array, non-unique elements are
* appended at the end of the run. For unsorted arrays, the element
* is inserted at the end of the array.
cupsArrayFind(cups_array_t *a, /* I - Array */
void *e) /* I - Element */
{
cupsArrayFind(cups_array_t *a, /* I - Array */
void *e) /* I - Element */
{
cupsArrayIndex(cups_array_t *a, /* I - Array */
int n) /* I - Index into array, starting at 0 */
{
cupsArrayIndex(cups_array_t *a, /* I - Array */
int n) /* I - Index into array, starting at 0 */
{
* When inserting an element in a sorted array, non-unique elements are
* inserted at the beginning of the run. For unsorted arrays, the element
* is inserted at the beginning of the array.
* When inserting an element in a sorted array, non-unique elements are
* inserted at the beginning of the run. For unsorted arrays, the element
* is inserted at the beginning of the array.
* 'cupsArraySave()' - Mark the current element for a later cupsArrayRestore.
*
* The save/restore stack is guaranteed to be at least 32 elements deep.
* 'cupsArraySave()' - Mark the current element for a later cupsArrayRestore.
*
* The save/restore stack is guaranteed to be at least 32 elements deep.