12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455 |
- /*======================================================================
- FILE: icalarray.h
- CREATOR: Damon Chaplin 07 March 2001
- (C) COPYRIGHT 2001, Ximian, Inc.
- This program is free software; you can redistribute it and/or modify
- it under the terms of either:
- The LGPL as published by the Free Software Foundation, version
- 2.1, available at: http://www.gnu.org/licenses/lgpl-2.1.html
- Or:
- The Mozilla Public License Version 1.0. You may obtain a copy of
- the License at http://www.mozilla.org/MPL/
- ======================================================================*/
- /** @file icalarray.h
- *
- * @brief An array of arbitrarily-sized elements which grows
- * dynamically as elements are added.
- */
- #ifndef ICALARRAY_H
- #define ICALARRAY_H
- #include "libical_ical_export.h"
- typedef struct _icalarray icalarray;
- struct _icalarray
- {
- size_t element_size;
- size_t increment_size;
- size_t num_elements;
- size_t space_allocated;
- void **chunks;
- };
- LIBICAL_ICAL_EXPORT icalarray *icalarray_new(size_t element_size, size_t increment_size);
- LIBICAL_ICAL_EXPORT icalarray *icalarray_copy(icalarray *array);
- LIBICAL_ICAL_EXPORT void icalarray_free(icalarray *array);
- LIBICAL_ICAL_EXPORT void icalarray_append(icalarray *array, const void *element);
- LIBICAL_ICAL_EXPORT void icalarray_remove_element_at(icalarray *array, size_t position);
- LIBICAL_ICAL_EXPORT void *icalarray_element_at(icalarray *array, size_t position);
- LIBICAL_ICAL_EXPORT void icalarray_sort(icalarray *array,
- int (*compare) (const void *, const void *));
- #endif /* ICALARRAY_H */
|