Alexandre Lision | 8af73cb | 2013-12-10 14:11:20 -0500 | [diff] [blame] | 1 | /* $Id$ */ |
| 2 | /* |
| 3 | * Copyright (C) 2008-2011 Teluu Inc. (http://www.teluu.com) |
| 4 | * Copyright (C) 2003-2008 Benny Prijono <benny@prijono.org> |
| 5 | * |
| 6 | * This program is free software; you can redistribute it and/or modify |
| 7 | * it under the terms of the GNU General Public License as published by |
| 8 | * the Free Software Foundation; either version 2 of the License, or |
| 9 | * (at your option) any later version. |
| 10 | * |
| 11 | * This program is distributed in the hope that it will be useful, |
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 | * GNU General Public License for more details. |
| 15 | * |
| 16 | * You should have received a copy of the GNU General Public License |
| 17 | * along with this program; if not, write to the Free Software |
| 18 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| 19 | */ |
| 20 | #include <pj/array.h> |
| 21 | #include <pj/string.h> |
| 22 | #include <pj/assert.h> |
| 23 | #include <pj/errno.h> |
| 24 | |
| 25 | PJ_DEF(void) pj_array_insert( void *array, |
| 26 | unsigned elem_size, |
| 27 | unsigned count, |
| 28 | unsigned pos, |
| 29 | const void *value) |
| 30 | { |
| 31 | if (count && pos < count) { |
| 32 | pj_memmove( (char*)array + (pos+1)*elem_size, |
| 33 | (char*)array + pos*elem_size, |
| 34 | (count-pos)*elem_size); |
| 35 | } |
| 36 | pj_memmove((char*)array + pos*elem_size, value, elem_size); |
| 37 | } |
| 38 | |
| 39 | PJ_DEF(void) pj_array_erase( void *array, |
| 40 | unsigned elem_size, |
| 41 | unsigned count, |
| 42 | unsigned pos) |
| 43 | { |
| 44 | pj_assert(count != 0); |
| 45 | if (pos < count-1) { |
| 46 | pj_memmove( (char*)array + pos*elem_size, |
| 47 | (char*)array + (pos+1)*elem_size, |
| 48 | (count-pos-1)*elem_size); |
| 49 | } |
| 50 | } |
| 51 | |
| 52 | PJ_DEF(pj_status_t) pj_array_find( const void *array, |
| 53 | unsigned elem_size, |
| 54 | unsigned count, |
| 55 | pj_status_t (*matching)(const void *value), |
| 56 | void **result) |
| 57 | { |
| 58 | unsigned i; |
| 59 | const char *char_array = (const char*)array; |
| 60 | for (i=0; i<count; ++i) { |
| 61 | if ( (*matching)(char_array) == PJ_SUCCESS) { |
| 62 | if (result) { |
| 63 | *result = (void*)char_array; |
| 64 | } |
| 65 | return PJ_SUCCESS; |
| 66 | } |
| 67 | char_array += elem_size; |
| 68 | } |
| 69 | return PJ_ENOTFOUND; |
| 70 | } |
| 71 | |