1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
/*
* Copyright (C) 2000-2009 the xine project
*
* This file is part of xine, a free video player.
*
* xine is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* xine is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110, USA
*
* Sorted array which grows automatically when you add elements.
* A binary search is used to find the position of a new element.
*
* Example:
* Let's create de comparison method for integers:
*
* int int_comparator(void *a, void *b) {
* if ((int)a < (int)b) {
* return -1;
* } else if ((int)a == (int)b) {
* return 0;
* } else {
* return 1;
* }
* }
*
* Create a sorted array for integers:
* xine_sarray_t *sarray = xine_sarray_new(10, int_comparator);
*
* Add elements:
* xine_sarray_add(sarray, (void*)4);
* xine_sarray_add(sarray, (void*)28);
* xine_sarray_add(sarray, (void*)7);
*
* Find an element:
* int pos = xine_sarray_binary_search(sarray, (void*)7);
* if (pos >= 0)
* FOUND
* else
* NOT FOUND
*
* Delete the array:
* xine_sarray_delete(sarray);
*/
#ifndef XINE_SORTED_ARRAY_H
#define XINE_SORTED_ARRAY_H
#include "array.h"
/* Array type */
typedef struct xine_sarray_s xine_sarray_t;
/* Array element comparator */
typedef int (*xine_sarray_comparator_t)(void*, void*);
/* Constructor */
xine_sarray_t *xine_sarray_new(size_t initial_size, xine_sarray_comparator_t comparator) XINE_MALLOC XINE_PROTECTED;
/* Destructor */
void xine_sarray_delete(xine_sarray_t *sarray) XINE_PROTECTED;
/* Returns the number of element stored in the array */
size_t xine_sarray_size(const xine_sarray_t *sarray) XINE_PROTECTED;
/* Removes all elements from an array */
void xine_sarray_clear(xine_sarray_t *sarray) XINE_PROTECTED;
/* Adds the element into the array
Returns the insertion position */
int xine_sarray_add(xine_sarray_t *sarray, void *value) XINE_PROTECTED;
/* Removes one element from an array at the position specified */
void xine_sarray_remove(xine_sarray_t *sarray, unsigned int position) XINE_PROTECTED;
/* Get the element at the position specified */
void *xine_sarray_get(xine_sarray_t *sarray, unsigned int position) XINE_PROTECTED;
/* Returns the index of the search key, if it is contained in the list.
Otherwise, (-(insertion point) - 1) or ~(insertion point).
The insertion point is defined as the point at which the key would be
inserted into the array. */
int xine_sarray_binary_search(xine_sarray_t *sarray, void *key) XINE_PROTECTED;
#endif
|
