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
|
/* $Id$ */
/*
* Copyright (C)2003-2006 Benny Prijono <benny@prijono.org>
*
* This program 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.
*
* This program 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <pj/array.h>
#include <pj/string.h>
#include <pj/assert.h>
#include <pj/errno.h>
PJ_DEF(void) pj_array_insert( void *array,
unsigned elem_size,
unsigned count,
unsigned pos,
const void *value)
{
if (count && pos < count-1) {
pj_memmove( (char*)array + (pos+1)*elem_size,
(char*)array + pos*elem_size,
(count-pos)*elem_size);
}
pj_memmove((char*)array + pos*elem_size, value, elem_size);
}
PJ_DEF(void) pj_array_erase( void *array,
unsigned elem_size,
unsigned count,
unsigned pos)
{
pj_assert(count != 0);
if (pos < count-1) {
pj_memmove( (char*)array + pos*elem_size,
(char*)array + (pos+1)*elem_size,
(count-pos-1)*elem_size);
}
}
PJ_DEF(pj_status_t) pj_array_find( const void *array,
unsigned elem_size,
unsigned count,
pj_status_t (*matching)(const void *value),
void **result)
{
unsigned i;
const char *char_array = array;
for (i=0; i<count; ++i) {
if ( (*matching)(char_array) == PJ_SUCCESS) {
if (result) {
*result = (void*)char_array;
}
return PJ_SUCCESS;
}
char_array += elem_size;
}
return PJ_ENOTFOUND;
}
|
