Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
706b5c5
commit baf71e2
Showing
51 changed files
with
8,080 additions
and
176 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,42 @@ | ||
|
|
||
| Copyright (c) 2009-2012 Eric Haszlakiewicz | ||
|
|
||
| Permission is hereby granted, free of charge, to any person obtaining a | ||
| copy of this software and associated documentation files (the "Software"), | ||
| to deal in the Software without restriction, including without limitation | ||
| the rights to use, copy, modify, merge, publish, distribute, sublicense, | ||
| and/or sell copies of the Software, and to permit persons to whom the | ||
| Software is furnished to do so, subject to the following conditions: | ||
|
|
||
| The above copyright notice and this permission notice shall be included | ||
| in all copies or substantial portions of the Software. | ||
|
|
||
| THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
| FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
| AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
| LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
| OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
| SOFTWARE. | ||
|
|
||
| ---------------------------------------------------------------- | ||
|
|
||
| Copyright (c) 2004, 2005 Metaparadigm Pte Ltd | ||
|
|
||
| Permission is hereby granted, free of charge, to any person obtaining a | ||
| copy of this software and associated documentation files (the "Software"), | ||
| to deal in the Software without restriction, including without limitation | ||
| the rights to use, copy, modify, merge, publish, distribute, sublicense, | ||
| and/or sell copies of the Software, and to permit persons to whom the | ||
| Software is furnished to do so, subject to the following conditions: | ||
|
|
||
| The above copyright notice and this permission notice shall be included | ||
| in all copies or substantial portions of the Software. | ||
|
|
||
| THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
| FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
| AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
| LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
| OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
| SOFTWARE. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,146 @@ | ||
| /* | ||
| * $Id: arraylist.c,v 1.4 2006/01/26 02:16:28 mclark Exp $ | ||
| * | ||
| * Copyright (c) 2004, 2005 Metaparadigm Pte. Ltd. | ||
| * Michael Clark <michael@metaparadigm.com> | ||
| * | ||
| * This library is free software; you can redistribute it and/or modify | ||
| * it under the terms of the MIT license. See COPYING for details. | ||
| * | ||
| */ | ||
|
|
||
| #include "config.h" | ||
|
|
||
| #include <limits.h> | ||
|
|
||
| #ifdef STDC_HEADERS | ||
| # include <stdlib.h> | ||
| # include <string.h> | ||
| #endif /* STDC_HEADERS */ | ||
|
|
||
| #if defined(HAVE_STRINGS_H) && !defined(_STRING_H) && !defined(__USE_BSD) | ||
| # include <strings.h> | ||
| #endif /* HAVE_STRINGS_H */ | ||
|
|
||
| #ifndef SIZE_T_MAX | ||
| #if SIZEOF_SIZE_T == SIZEOF_INT | ||
| #define SIZE_T_MAX UINT_MAX | ||
| #elif SIZEOF_SIZE_T == SIZEOF_LONG | ||
| #define SIZE_T_MAX ULONG_MAX | ||
| #elif SIZEOF_SIZE_T == SIZEOF_LONG_LONG | ||
| #define SIZE_T_MAX ULLONG_MAX | ||
| #else | ||
| #error Unable to determine size of size_t | ||
| #endif | ||
| #endif | ||
|
|
||
| #include "arraylist.h" | ||
|
|
||
| struct array_list* | ||
| array_list_new(array_list_free_fn *free_fn) | ||
| { | ||
| struct array_list *arr; | ||
|
|
||
| arr = (struct array_list*)calloc(1, sizeof(struct array_list)); | ||
| if(!arr) return NULL; | ||
| arr->size = ARRAY_LIST_DEFAULT_SIZE; | ||
| arr->length = 0; | ||
| arr->free_fn = free_fn; | ||
| if(!(arr->array = (void**)calloc(sizeof(void*), arr->size))) { | ||
| free(arr); | ||
| return NULL; | ||
| } | ||
| return arr; | ||
| } | ||
|
|
||
| extern void | ||
| array_list_free(struct array_list *arr) | ||
| { | ||
| size_t i; | ||
| for(i = 0; i < arr->length; i++) | ||
| if(arr->array[i]) arr->free_fn(arr->array[i]); | ||
| free(arr->array); | ||
| free(arr); | ||
| } | ||
|
|
||
| void* | ||
| array_list_get_idx(struct array_list *arr, size_t i) | ||
| { | ||
| if(i >= arr->length) return NULL; | ||
| return arr->array[i]; | ||
| } | ||
|
|
||
| static int array_list_expand_internal(struct array_list *arr, size_t max) | ||
| { | ||
| void *t; | ||
| size_t new_size; | ||
|
|
||
| if(max < arr->size) return 0; | ||
| /* Avoid undefined behaviour on size_t overflow */ | ||
| if( arr->size >= SIZE_T_MAX / 2 ) | ||
| new_size = max; | ||
| else | ||
| { | ||
| new_size = arr->size << 1; | ||
| if (new_size < max) | ||
| new_size = max; | ||
| } | ||
| if (new_size > (~((size_t)0)) / sizeof(void*)) return -1; | ||
| if (!(t = realloc(arr->array, new_size*sizeof(void*)))) return -1; | ||
| arr->array = (void**)t; | ||
| (void)memset(arr->array + arr->size, 0, (new_size-arr->size)*sizeof(void*)); | ||
| arr->size = new_size; | ||
| return 0; | ||
| } | ||
|
|
||
| int | ||
| array_list_put_idx(struct array_list *arr, size_t idx, void *data) | ||
| { | ||
| if (idx > SIZE_T_MAX - 1 ) return -1; | ||
| if(array_list_expand_internal(arr, idx+1)) return -1; | ||
| if(idx < arr->length && arr->array[idx]) | ||
| arr->free_fn(arr->array[idx]); | ||
| arr->array[idx] = data; | ||
| if(arr->length <= idx) arr->length = idx + 1; | ||
| return 0; | ||
| } | ||
|
|
||
| int | ||
| array_list_add(struct array_list *arr, void *data) | ||
| { | ||
| return array_list_put_idx(arr, arr->length, data); | ||
| } | ||
|
|
||
| void | ||
| array_list_sort(struct array_list *arr, int(*sort_fn)(const void *, const void *)) | ||
| { | ||
| qsort(arr->array, arr->length, sizeof(arr->array[0]), sort_fn); | ||
| } | ||
|
|
||
| void* array_list_bsearch(const void **key, struct array_list *arr, | ||
| int (*sort_fn)(const void *, const void *)) | ||
| { | ||
| return bsearch(key, arr->array, arr->length, sizeof(arr->array[0]), | ||
| sort_fn); | ||
| } | ||
|
|
||
| size_t | ||
| array_list_length(struct array_list *arr) | ||
| { | ||
| return arr->length; | ||
| } | ||
|
|
||
| int | ||
| array_list_del_idx( struct array_list *arr, size_t idx, size_t count ) | ||
| { | ||
| size_t i, stop; | ||
|
|
||
| stop = idx + count; | ||
| if ( idx >= arr->length || stop > arr->length ) return -1; | ||
| for ( i = idx; i < stop; ++i ) { | ||
| if ( arr->array[i] ) arr->free_fn( arr->array[i] ); | ||
| } | ||
| memmove( arr->array + idx, arr->array + stop, (arr->length - stop) * sizeof(void*) ); | ||
| arr->length -= count; | ||
| return 0; | ||
| } |
Oops, something went wrong.