/*
** Copyright (C) 2005-2026 Carnegie Mellon University
**
** @OPENSOURCE_LICENSE_START@
**
** SiLK 3.24
**
** Copyright 2025 Carnegie Mellon University.
**
** NO WARRANTY. THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING
** INSTITUTE MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON
** UNIVERSITY MAKES NO WARRANTIES OF ANY KIND, EITHER EXPRESSED OR
** IMPLIED, AS TO ANY MATTER INCLUDING, BUT NOT LIMITED TO, WARRANTY OF
** FITNESS FOR PURPOSE OR MERCHANTABILITY, EXCLUSIVITY, OR RESULTS
** OBTAINED FROM USE OF THE MATERIAL. CARNEGIE MELLON UNIVERSITY DOES NOT
** MAKE ANY WARRANTY OF ANY KIND WITH RESPECT TO FREEDOM FROM PATENT,
** TRADEMARK, OR COPYRIGHT INFRINGEMENT.
**
** Licensed under a GNU GPL 2.0-style license, please see LICENSE.txt or
** contact permission@sei.cmu.edu for full terms.
**
** [DISTRIBUTION STATEMENT A] This material has been approved for public
** release and unlimited distribution.  Please see Copyright notice for
** non-US Government use and distribution.
**
** This Software includes and/or makes use of Third-Party Software each
** subject to its own license.
**
** DM25-0915
**
** @OPENSOURCE_LICENSE_END@
*/

/*
 *  skvector.h
 *
 *    Implementation of a resizeable array.
 *
 */
#ifndef _SKVECTOR_H
#define _SKVECTOR_H
#ifdef __cplusplus
extern "C" {
#endif

#include <silk/silk.h>

RCSIDENTVAR(rcsID_SKVECTOR_H, "$SiLK: skvector.h 8e6b8cae8a2c 2026-04-21 19:03:04Z mthomas $");

#include <silk/silk_types.h>

/**
 *  @file
 *
 *    Implementation of sk_vector_t, a simple growable array.
 *
 *    Elements in a vector are accessed by a numeric index.  The
 *    minimum index is 0.
 *
 *    The size of an individual element in the vector is specified
 *    when the vector is created.  This is the element_size.
 *
 *    Operations that add and get elements to and from the vector copy
 *    data in multiples of the element_size.
 *
 *    A vector has a maximum number of items it can hold without
 *    needing to reallocate its iternal memory.  This is the capacity.
 *    Appending an item to the vector automatically grows the capacity
 *    as needed, but other functions that insert into the vector do
 *    not modify the capacity.
 *
 *    A vector also knows the numeric index of the last element in its
 *    internal memory.  One more than this value is the count of
 *    elements in the vector.
 *
 *    This file is part of libsilk.
 */

/* typedef struct sk_vector_st sk_vector_t; // silk_types.h */


/**
 *    Creates a new vector where the size of each element is
 *    'element_size' bytes.
 *
 *    Does not allocate space for the elements; that is, the initial
 *    capacity of the vector is 0.
 *
 *    Returns the new vector or NULL if 'element_size' is 0 or the
 *    allocation fails.
 *
 *    The caller should use skVectorDestroy() to free the vector once
 *    it is no longer needed.
 *
 *    Other functions that create a new vector are
 *    skVectorNewFromArray() and skVectorClone().
 */
sk_vector_t *
skVectorNew(
    size_t              element_size);


/**
 *    Creates a new vector where the size of each element is
 *    'element_size' bytes, allocates enough space for 'count'
 *    elements, and copies ('count' * 'element_size') bytes from
 *    'array' into the vector.  This is equivalent to calling
 *    skVectorNew() and skVectorAppendFromArray().
 *
 *    Returns the new vector or NULL on allocation error or if
 *    'element_size' is 0.  Returns an empty vector when 'count' is 0
 *    or 'array' is NULL.
 *
 *    The caller should use skVectorDestroy() to free the vector once
 *    it is no longer needed.
 *
 *    Other functions that create a new vector are skVectorNew() and
 *    skVectorClone().
 */
sk_vector_t *
skVectorNewFromArray(
    size_t              element_size,
    const void         *array,
    size_t              count);


/**
 *    Creates a new vector having the same element size as vector 'v',
 *    copies the contents of 'v' into it, and returns the new vector.
 *    The capacity of the new vector is set to the count of the number
 *    of elements in 'v'.
 *
 *    Returns the new vector or NULL on allocation error.
 *
 *    The caller should use skVectorDestroy() to free the vector once
 *    it is no longer needed.
 *
 *    Other functions that create a new vector are skVectorNew() and
 *    skVectorNewFromArray().
 */
sk_vector_t *
skVectorClone(
    const sk_vector_t  *v);


/**
 *    Destroys the vector, v, freeing all memory that the vector
 *    manages.  Does nothing if 'v' is NULL.
 *
 *    If the vector contains pointers, it is the caller's
 *    responsibility to free the elements of the vector before
 *    destroying it.
 */
void
skVectorDestroy(
    sk_vector_t        *v);


/**
 *    Sets the capacity of the vector 'v' to 'capacity', growing or
 *    shrinking the spaced allocated for the elements as required.
 *
 *    When shrinking a vector that contains pointers, it is the
 *    caller's responsibility to free the items before changing its
 *    capacity.
 *
 *    Returns 0 on success or -1 for an allocation error.
 *
 *    See also skVectorGetCapacity().
 */
int
skVectorSetCapacity(
    sk_vector_t        *v,
    size_t              capacity);


/**
 *    Zeroes all memory for the elements of the vector 'v' and sets
 *    the count of elements in the vector to zero.  Does not change
 *    the capacity of the vector.
 *
 *    If the vector contains pointers, it is the caller's
 *    responsibility to free the elements of the vector before
 *    clearing it.
 */
void
skVectorClear(
    sk_vector_t        *v);


/**
 *    Returns the element size that was specified when the vector 'v'
 *    was created via skVectorNew() or skVectorNewFromArray().
 */
size_t
skVectorGetElementSize(
    const sk_vector_t  *v);


/**
 *    Returns the capacity of the vector 'v', i.e., the number of
 *    elements the vector can hold without requiring a re-allocation.
 *
 *    The functions skVectorInsertValue() and skVectorSetValue()
 *    return -1 when their 'position' argument is not less than the
 *    value returned by this function.
 *
 *    See also skVectorSetCapacity().
 */
size_t
skVectorGetCapacity(
    const sk_vector_t  *v);


/**
 *    Returns the number elements that have been added to the vector
 *    'v'.  (Technically, returns one more than the highest position
 *    currently in use in 'v'.)
 *
 *    The functions skVectorGetValue() and skVectorGetValuePointer()
 *    return -1 when their 'position' argument is not less than the
 *    value returned by this function.
 */
size_t
skVectorGetCount(
    const sk_vector_t  *v);


/**
 *    Copies the data at 'value' into the vector 'v' at position
 *    skVectorGetCount(v), increasing the capacity of the 'v' if
 *    necessary.  Returns 0 on success or -1 for an allocation error.
 */
int
skVectorAppendValue(
    sk_vector_t        *v,
    const void         *value);

/**
 *    Copies the data from 'src' into the vector 'dst' at position
 *    skVectorGetCount(v), increasing the capacity of the vector 'dst'
 *    if necessary.  Returns 0 on success or -1 for an allocation
 *    error.
 */
int
skVectorAppendVector(
    sk_vector_t        *dst,
    const sk_vector_t  *src);

/**
 *    Copies the data from 'array' into the vector 'v' at position
 *    skVectorGetCount(v), increasing the capacity of the 'v' if
 *    necessary.  Returns 0 on success or -1 for an allocation error.
 *
 *    See also skVectorNewFromArray().
 */
int
skVectorAppendFromArray(
    sk_vector_t        *v,
    const void         *array,
    size_t              count);


/**
 *    Copies the data in vector 'v' at 'position' to the location
 *    pointed at by 'out_element'.  The first position in the vector
 *    is position 0.  Returns 0 on success or -1 if 'position' is not
 *    less than skVectorGetCount(v).
 *
 *    See also skVectorGetValuePointer(), which returns a pointer to
 *    the element without needing to copy the contents of the element.
 *
 *    To get multiple values from a vector, consider using
 *    skVectorGetMultipleValues(), skVectorToArray(), or
 *    skVectorToArrayAlloc().  This function is equivalent to
 *
 *    -1 + skVectorGetMultipleValues(out_element, v, position, 1);
 *
 *    To get a value and also remove it from the vector, use
 *    skVectorRemoveValue().
 */
int
skVectorGetValue(
    void               *out_element,
    const sk_vector_t  *v,
    size_t              position);


/**
 *    Returns a pointer to the data item in vector 'v' at 'position'.
 *    The first position in the vector is position 0.  Returns NULL if
 *    'position' is not less than skVectorGetCount(v).
 *
 *    The caller should not cache this value, since any addition to
 *    the vector may result in a re-allocation that could make the
 *    pointer invalid.
 *
 *    See also skVectorGetValue().
 */
void *
skVectorGetValuePointer(
    const sk_vector_t  *v,
    size_t              position);


/**
 *    Copies the data at 'value' into the vector 'v' at 'position',
 *    where 0 denotes the first position in the vector.
 *
 *    If 'position' is less than the value skVectorGetCount(), the
 *    previous element at that position is overwritten.  If the vector
 *    contains pointers, it is the caller's responsibility to free the
 *    element at that position prior to overwriting it.
 *
 *    Use skVectorInsertValue() to insert a value at a position
 *    without overwriting the existing data.
 *
 *    The value 'position' must be within the current capacity of the
 *    vector (that is, less than the value skVectorGetCapacity())
 *    since the vector will not grow to support data at 'position'.
 *    If 'position' is too large, -1 is returned.
 *
 *    When 'position' is greater than or equal to skVectorGetCount()
 *    and less than skVectorGetCapacity(), the count of elements in
 *    'v' is set to 1+'position' and the bytes for the elements from
 *    skVectorGetCount() to 'position' are set to '\0'.
 *
 *    Return 0 on success or -1 if 'position' is too large.
 */
int
skVectorSetValue(
    sk_vector_t        *v,
    size_t              position,
    const void         *value);


/**
 *    Copies the data at 'value' into the vector 'v' at position
 *    'position', where 0 is the first position in the vector.
 *
 *    If 'position' is less than the value skVectorGetCount(),
 *    elements from 'position' to skVectorGetCount(v) are moved one
 *    location higher, increasing the capacity of the vector if
 *    necessary.
 *
 *    When 'position' is not less than skVectorGetCount(v), this
 *    function is equivalent to skVectorSetValue(v, position, value),
 *    which requires 'position' to be within the current capacity of
 *    the vector.  See skVectorSetValue() for details.
 *
 *    Returns 0 on success.  Returns -1 on allocation error or if
 *    'position' is not less than skVectorGetCapacity().
 *
 *    Since SiLK 3.11.0.
 */
int
skVectorInsertValue(
    sk_vector_t        *v,
    size_t              position,
    const void         *value);


/**
 *    Copies the data in vector 'v' at 'position' to the location
 *    pointed at by 'out_element' and then removes that element from
 *    the vector.  The first position in the vector is position 0.
 *    The 'out_element' parameter may be NULL.
 *
 *    All elements in 'v' from 'position' to skVectorGetCount(v) are
 *    moved one location lower.  If the vector contains pointers, it
 *    is the caller's responsibility to free the removed item.  Does
 *    not change the capacity of the vector.
 *
 *    Returns 0 on success.  Returns -1 if 'position' is not less than
 *    skVectorGetCount(v).
 *
 *    Use skVectorGetValue() to get a value without removing it from
 *    the vector.
 *
 *    Since SiLK 3.11.0.
 */
int
skVectorRemoveValue(
    sk_vector_t        *v,
    size_t              position,
    void               *out_element);


/**
 *    Copies up to 'num_elements' data elements starting at
 *    'start_position' from vector 'v' to the location pointed at by
 *    'out_array'.  The first position in the vector is position 0.
 *
 *    It is the caller's responsibility to ensure that 'out_array' can
 *    hold 'num_elements' elements of size skVectorGetElementSize(v).
 *
 *    Returns the number of elements copied into the array.  Returns
 *    fewer than 'num_elements' if the end of the vector is reached.
 *    Returns 0 if 'start_position' is not less than
 *    skVectorGetCount(v).
 *
 *    See also skVectorToArray() and skVectorToArrayAlloc().
 */
size_t
skVectorGetMultipleValues(
    void               *out_array,
    const sk_vector_t  *v,
    size_t              start_position,
    size_t              num_elements);


/**
 *    Copies the data in the vector 'v' to the C-array 'out_array'.
 *    This is equivalent to:
 *
 *    skVectorGetMultipleValues(out_array, v, 0, skVectorGetCount(v));
 *
 *    It is the caller's responsibility to ensure that 'out_array' is
 *    large enough to hold skVectorGetCount(v) elements of size
 *    skVectorGetElementSize(v).
 *
 *    See also skVectorToArrayAlloc().
 */
void
skVectorToArray(
    void               *out_array,
    const sk_vector_t  *v);


/**
 *    Allocates an array large enough to hold all the elements of the
 *    vector 'v', copies the elements from 'v' into the array, and
 *    returns the array.
 *
 *    The caller must free() the array when it is no longer required.
 *
 *    The function returns NULL if the vector is empty or if the array
 *    could not be allocated.
 *
 *    This function is equivalent to:
 *
 *    a = malloc(skVectorGetElementSize(v) * skVectorGetCount(v));
 *    skVectorGetMultipleValues(a, v, 0, skVectorGetCount(v));
 *
 *    See also skVectorToArray().
 */
void *
skVectorToArrayAlloc(
    const sk_vector_t  *v);


#ifdef __cplusplus
}
#endif
#endif /* _SKVECTOR_H */

/*
** Local Variables:
** mode:c
** indent-tabs-mode:nil
** c-basic-offset:4
** End:
*/
