/usr/include/libical/icalarray.h is in libical-dev 1.0-1.3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 4 -*- */
/*======================================================================
FILE: icalarray.h
CREATOR: Damon Chaplin 07 March 2001
$Id: icalarray.h,v 1.5 2008-01-15 23:17:40 dothebart Exp $
$Locker: $
(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.fsf.org/copyleft/lesser.html
Or:
The Mozilla Public License Version 1.0. You may obtain a copy of
the License at http://www.mozilla.org/MPL/
======================================================================*/
#ifndef ICALARRAY_H
#define ICALARRAY_H
/** @file icalarray.h
*
* @brief An array of arbitrarily-sized elements which grows
* dynamically as elements are added.
*/
typedef struct _icalarray icalarray;
struct _icalarray {
unsigned int element_size;
unsigned int increment_size;
unsigned int num_elements;
unsigned int space_allocated;
void **chunks;
};
icalarray *icalarray_new (int element_size,
int increment_size);
icalarray *icalarray_copy (icalarray *array);
void icalarray_free (icalarray *array);
void icalarray_append (icalarray *array,
const void *element);
void icalarray_remove_element_at (icalarray *array,
int position);
void *icalarray_element_at (icalarray *array,
int position);
void icalarray_sort (icalarray *array,
int (*compare) (const void *, const void *));
#endif /* ICALARRAY_H */
|