Internal methods for working with json_type_array objects. Although this is exposed by the json_object_get_array() method, it is not recommended for direct use. More...

Data Structures
struct	array_list

Macros
#define	ARRAY_LIST_DEFAULT_SIZE 32

Typedefs
typedef void	array_list_free_fn(void *data)
typedef struct array_list	array_list

Functions
struct array_list *	array_list_new (array_list_free_fn *free_fn)
struct array_list *	array_list_new2 (array_list_free_fn *free_fn, int initial_size)
void	array_list_free (struct array_list *al)
void *	array_list_get_idx (struct array_list *al, size_t i)
int	array_list_insert_idx (struct array_list al, size_t i, void data)
int	array_list_put_idx (struct array_list al, size_t i, void data)
int	array_list_add (struct array_list al, void data)
size_t	array_list_length (struct array_list *al)
void	array_list_sort (struct array_list arr, int(compar)(const void , const void ))
void *	array_list_bsearch (const void *key, struct array_list arr, int(compar)(const void , const void *))
int	array_list_del_idx (struct array_list *arr, size_t idx, size_t count)
int	array_list_shrink (struct array_list *arr, size_t empty_slots)

Detailed Description

Internal methods for working with json_type_array objects. Although this is exposed by the json_object_get_array() method, it is not recommended for direct use.

Macro Definition Documentation

◆ ARRAY_LIST_DEFAULT_SIZE

#define ARRAY_LIST_DEFAULT_SIZE 32

Typedef Documentation

◆ array_list

typedef struct array_list array_list

◆ array_list_free_fn

typedef void array_list_free_fn(void *data)

Function Documentation

◆ array_list_add()

int array_list_add	(	struct array_list *	al,
		void *	data )

extern

References array_list_add().

Referenced by array_list_add().

◆ array_list_bsearch()

void * array_list_bsearch	(	const void **	key,
		struct array_list *	arr,
		int(*	compar )(const void , const void ) )

extern

References array_list_bsearch().

Referenced by array_list_bsearch().

◆ array_list_del_idx()

int array_list_del_idx	(	struct array_list *	arr,
		size_t	idx,
		size_t	count )

extern

References array_list_del_idx().

Referenced by array_list_del_idx().

◆ array_list_free()

void array_list_free ( struct array_list * al )

extern

References array_list_free().

Referenced by array_list_free().

◆ array_list_get_idx()

void * array_list_get_idx	(	struct array_list *	al,
		size_t	i )

extern

References array_list_get_idx().

Referenced by array_list_get_idx().

◆ array_list_insert_idx()

int array_list_insert_idx	(	struct array_list *	al,
		size_t	i,
		void *	data )

extern

References array_list_insert_idx().

Referenced by array_list_insert_idx().

◆ array_list_length()

size_t array_list_length ( struct array_list * al )

extern

References array_list_length().

Referenced by array_list_length().

◆ array_list_new()

struct array_list * array_list_new ( array_list_free_fn * free_fn )

extern

Allocate an array_list of the default size (32).

Deprecated: Use array_list_new2() instead.

References array_list_new().

Referenced by array_list_new().

◆ array_list_new2()

struct array_list * array_list_new2	(	array_list_free_fn *	free_fn,
		int	initial_size )

extern

Allocate an array_list of the desired size.

If possible, the size should be chosen to closely match the actual number of elements expected to be used. If the exact size is unknown, there are tradeoffs to be made:

too small - the array_list code will need to call realloc() more often (which might incur an additional memory copy).
too large - will waste memory, but that can be mitigated by calling array_list_shrink() once the final size is known.