Blame src/vector.h

Packit ae9e2a
/*
Packit ae9e2a
 * Copyright (C) the libgit2 contributors. All rights reserved.
Packit ae9e2a
 *
Packit ae9e2a
 * This file is part of libgit2, distributed under the GNU GPL v2 with
Packit ae9e2a
 * a Linking Exception. For full terms see the included COPYING file.
Packit ae9e2a
 */
Packit ae9e2a
#ifndef INCLUDE_vector_h__
Packit ae9e2a
#define INCLUDE_vector_h__
Packit ae9e2a
Packit ae9e2a
#include "common.h"
Packit ae9e2a
Packit ae9e2a
typedef int (*git_vector_cmp)(const void *, const void *);
Packit ae9e2a
Packit ae9e2a
enum {
Packit ae9e2a
	GIT_VECTOR_SORTED = (1u << 0),
Packit ae9e2a
	GIT_VECTOR_FLAG_MAX = (1u << 1),
Packit ae9e2a
};
Packit ae9e2a
Packit ae9e2a
typedef struct git_vector {
Packit ae9e2a
	size_t _alloc_size;
Packit ae9e2a
	git_vector_cmp _cmp;
Packit ae9e2a
	void **contents;
Packit ae9e2a
	size_t length;
Packit ae9e2a
	uint32_t flags;
Packit ae9e2a
} git_vector;
Packit ae9e2a
Packit ae9e2a
#define GIT_VECTOR_INIT {0}
Packit ae9e2a
Packit ae9e2a
int git_vector_init(git_vector *v, size_t initial_size, git_vector_cmp cmp);
Packit ae9e2a
void git_vector_free(git_vector *v);
Packit ae9e2a
void git_vector_free_deep(git_vector *v); /* free each entry and self */
Packit ae9e2a
void git_vector_clear(git_vector *v);
Packit ae9e2a
int git_vector_dup(git_vector *v, const git_vector *src, git_vector_cmp cmp);
Packit ae9e2a
void git_vector_swap(git_vector *a, git_vector *b);
Packit ae9e2a
int git_vector_size_hint(git_vector *v, size_t size_hint);
Packit ae9e2a
Packit ae9e2a
void **git_vector_detach(size_t *size, size_t *asize, git_vector *v);
Packit ae9e2a
Packit ae9e2a
void git_vector_sort(git_vector *v);
Packit ae9e2a
Packit ae9e2a
/** Linear search for matching entry using internal comparison function */
Packit ae9e2a
int git_vector_search(size_t *at_pos, const git_vector *v, const void *entry);
Packit ae9e2a
Packit ae9e2a
/** Linear search for matching entry using explicit comparison function */
Packit ae9e2a
int git_vector_search2(size_t *at_pos, const git_vector *v, git_vector_cmp cmp, const void *key);
Packit ae9e2a
Packit ae9e2a
/**
Packit ae9e2a
 * Binary search for matching entry using explicit comparison function that
Packit ae9e2a
 * returns position where item would go if not found.
Packit ae9e2a
 */
Packit ae9e2a
int git_vector_bsearch2(
Packit ae9e2a
	size_t *at_pos, git_vector *v, git_vector_cmp cmp, const void *key);
Packit ae9e2a
Packit ae9e2a
/** Binary search for matching entry using internal comparison function */
Packit ae9e2a
GIT_INLINE(int) git_vector_bsearch(size_t *at_pos, git_vector *v, const void *key)
Packit ae9e2a
{
Packit ae9e2a
	return git_vector_bsearch2(at_pos, v, v->_cmp, key);
Packit ae9e2a
}
Packit ae9e2a
Packit ae9e2a
GIT_INLINE(void *) git_vector_get(const git_vector *v, size_t position)
Packit ae9e2a
{
Packit ae9e2a
	return (position < v->length) ? v->contents[position] : NULL;
Packit ae9e2a
}
Packit ae9e2a
Packit ae9e2a
#define GIT_VECTOR_GET(V,I) ((I) < (V)->length ? (V)->contents[(I)] : NULL)
Packit ae9e2a
Packit ae9e2a
GIT_INLINE(size_t) git_vector_length(const git_vector *v)
Packit ae9e2a
{
Packit ae9e2a
	return v->length;
Packit ae9e2a
}
Packit ae9e2a
Packit ae9e2a
GIT_INLINE(void *) git_vector_last(const git_vector *v)
Packit ae9e2a
{
Packit ae9e2a
	return (v->length > 0) ? git_vector_get(v, v->length - 1) : NULL;
Packit ae9e2a
}
Packit ae9e2a
Packit ae9e2a
#define git_vector_foreach(v, iter, elem)	\
Packit ae9e2a
	for ((iter) = 0; (iter) < (v)->length && ((elem) = (v)->contents[(iter)], 1); (iter)++ )
Packit ae9e2a
Packit ae9e2a
#define git_vector_rforeach(v, iter, elem)	\
Packit ae9e2a
	for ((iter) = (v)->length - 1; (iter) < SIZE_MAX && ((elem) = (v)->contents[(iter)], 1); (iter)-- )
Packit ae9e2a
Packit ae9e2a
int git_vector_insert(git_vector *v, void *element);
Packit ae9e2a
int git_vector_insert_sorted(git_vector *v, void *element,
Packit ae9e2a
	int (*on_dup)(void **old, void *new));
Packit ae9e2a
int git_vector_remove(git_vector *v, size_t idx);
Packit ae9e2a
void git_vector_pop(git_vector *v);
Packit ae9e2a
void git_vector_uniq(git_vector *v, void  (*git_free_cb)(void *));
Packit ae9e2a
Packit ae9e2a
void git_vector_remove_matching(
Packit ae9e2a
	git_vector *v,
Packit ae9e2a
	int (*match)(const git_vector *v, size_t idx, void *payload),
Packit ae9e2a
	void *payload);
Packit ae9e2a
Packit ae9e2a
int git_vector_resize_to(git_vector *v, size_t new_length);
Packit ae9e2a
int git_vector_insert_null(git_vector *v, size_t idx, size_t insert_len);
Packit ae9e2a
int git_vector_remove_range(git_vector *v, size_t idx, size_t remove_len);
Packit ae9e2a
Packit ae9e2a
int git_vector_set(void **old, git_vector *v, size_t position, void *value);
Packit ae9e2a
Packit ae9e2a
/** Check if vector is sorted */
Packit ae9e2a
#define git_vector_is_sorted(V) (((V)->flags & GIT_VECTOR_SORTED) != 0)
Packit ae9e2a
Packit ae9e2a
/** Directly set sorted state of vector */
Packit ae9e2a
#define git_vector_set_sorted(V,S) do { \
Packit ae9e2a
	(V)->flags = (S) ? ((V)->flags | GIT_VECTOR_SORTED) : \
Packit ae9e2a
		((V)->flags & ~GIT_VECTOR_SORTED); } while (0)
Packit ae9e2a
Packit ae9e2a
/** Set the comparison function used for sorting the vector */
Packit ae9e2a
GIT_INLINE(void) git_vector_set_cmp(git_vector *v, git_vector_cmp cmp)
Packit ae9e2a
{
Packit ae9e2a
	if (cmp != v->_cmp) {
Packit ae9e2a
		v->_cmp = cmp;
Packit ae9e2a
		git_vector_set_sorted(v, 0);
Packit ae9e2a
	}
Packit ae9e2a
}
Packit ae9e2a
Packit ae9e2a
/* Just use this in tests, not for realz. returns -1 if not sorted */
Packit ae9e2a
int git_vector_verify_sorted(const git_vector *v);
Packit ae9e2a
Packit ae9e2a
/**
Packit ae9e2a
 * Reverse the vector in-place.
Packit ae9e2a
 */
Packit ae9e2a
void git_vector_reverse(git_vector *v);
Packit ae9e2a
Packit ae9e2a
#endif