nag_search_vector (m01fsc) (PDF version)
m01 Chapter Contents
m01 Chapter Introduction
NAG C Library Manual

# NAG Library Function Documentnag_search_vector (m01fsc)

## 1  Purpose

nag_search_vector (m01fsc) searches a vector of arbitrary type data objects for the first or last match to a given value.

## 2  Specification

 #include #include
Nag_Boolean  nag_search_vector (Pointer key, const Pointer vec, size_t n, ptrdiff_t stride,
 Integer (*compare)(const Nag_Pointer a, const Nag_Pointer b),
Nag_SortOrder order, Nag_SearchMatch final, Pointer *match, NagError *fail)

## 3  Description

nag_search_vector (m01fsc) searches a sorted vector of $n$ arbitrary type data objects, which are stored in the elements of an array at intervals of length stride. vec must have previously been sorted into the specified order.
The function searches for the first or last match depending on the value of final. It returns Nag_TRUE if an exact match is found and match is set to point at that object. If there is no exact match then Nag_FALSE is returned and match is set to point to either the next later element, if ${\mathbf{final}}=\mathrm{Nag_First}$, or the next earlier element, if ${\mathbf{final}}=\mathrm{Nag_Last}$.

None.

## 5  Arguments

1:     keyPointer Input
On entry: the object to search for.
2:     vec[${\mathbf{n}}$]const Pointer Input
On entry: the array of objects to be searched.
3:     nsize_tInput
On entry: the number $n$ of objects to be searched.
Constraint: ${\mathbf{n}}\ge 0$.
4:     strideptrdiff_tInput
On entry: the increment between data items in vec to be searched.
Note: if stride is positive, vec should point at the first data object; otherwise vec should point at the last data object.
It should be noted that $\left|{\mathbf{stride}}\right|$ must be greater than or equal to size_of (data objects), for the search to be performed successfully. However, the code performs no check for violation of this constraint.
Constraint: $\left|{\mathbf{stride}}\right|>0$.
5:     comparefunction, supplied by the userExternal Function
nag_search_vector (m01fsc) compares two data objects. If its arguments are pointers to a structure, this function must allow for the offset of the data field in the structure (if it is not the first).
The function must return:
 $-1$ if the first data field is less than the second, $\phantom{-}0$ if the first data field is equal to the second, $\phantom{-}1$ if the first data field is greater than the second.
The specification of compare is:
 Integer compare (const Nag_Pointer a, const Nag_Pointer b)
1:     aconst Nag_Pointer Input
On entry: the first data field.
2:     bconst Nag_Pointer Input
On entry: the second data field.
6:     orderNag_SortOrderInput
On entry: specifies whether the array will be sorted into ascending or descending order.
Constraint: ${\mathbf{order}}=\mathrm{Nag_Ascending}$ or $\mathrm{Nag_Descending}$.
7:     finalNag_SearchMatchInput
On entry: specifies whether to search for the first or last match. This also determines the pointer returned if an exact match cannot be found.
Constraint: ${\mathbf{final}}=\mathrm{Nag_First}$ or $\mathrm{Nag_Last}$.
8:     matchPointer *Output
On exit: if an exact match is found this is a pointer to a pointer to the matching data object. If an exact match is not found this is set to point to the nearest object. If ${\mathbf{final}}=\mathrm{Nag_First}$ this is the next later element, otherwise the next earlier element.
9:     failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

## 6  Error Indicators and Warnings

NE_BAD_PARAM
On entry, argument final had an illegal value.
On entry, argument order had an illegal value.
NE_INT_ARG_EQ
On entry, ${\mathbf{stride}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{stride}}=0$.
NE_INT_ARG_GT
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}\le 〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{stride}}=〈\mathit{\text{value}}〉$.
Constraint: $\left|{\mathbf{stride}}\right|\le 〈\mathit{\text{value}}〉$.
These arguments are limited to an implementation-dependent size which is printed in the error message.
NE_INT_ARG_LT
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}\ge 0$.

Not applicable.

## 8  Further Comments

The maximum time taken by the function is approximately proportional to ${\mathrm{log}}_{2}n$.

## 9  Example

The example program reads a key and a list of real numbers, which have been sorted into ascending order. It then searches the list for the first number which matches the key.

### 9.1  Program Text

Program Text (m01fsce.c)

### 9.2  Program Data

Program Data (m01fsce.d)

### 9.3  Program Results

Program Results (m01fsce.r)

nag_search_vector (m01fsc) (PDF version)
m01 Chapter Contents
m01 Chapter Introduction
NAG C Library Manual
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 25, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9131056666374207, "perplexity": 2855.1144603054668}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-27/segments/1435375096208.17/warc/CC-MAIN-20150627031816-00087-ip-10-179-60-89.ec2.internal.warc.gz"}