arrays.h

/*
 * SPDX-FileCopyrightText: © 2018-2022 Alexandros Theodotou <alex@zrythm.org>
 *
 * SPDX-License-Identifier: LicenseRef-ZrythmLicense
 */
 
#ifndef __UTILS_ARRAYS_H__
#define __UTILS_ARRAYS_H__
 
#define array_index_of(_array, size, element) \
  _array_index_of ((void **) _array, size, (void *) element)
 
#define array_append(_array, size, element) (_array)[(size)++] = element;
 
#define array_double_append(arr1, arr2, size, el1, el2) \
  arr1[size] = el1; \
  arr2[size] = el2; \
  size++;
 
#define array_insert(_array, size, pos, element) \
  for (int ii = size; ii > pos; ii--) \
    { \
      _array[ii] = _array[ii - 1]; \
    } \
  _array[pos] = element; \
  size++;
 
#define array_double_insert(arr1, arr2, size, pos, el1, el2) \
  for (int ii = size; ii > pos; ii--) \
    { \
      arr1[ii] = arr1[ii - 1]; \
      arr2[ii] = arr2[ii - 1]; \
    } \
  arr1[pos] = el1; \
  arr2[pos] = el2; \
  size++;
 
NONNULL void
_array_double_size_if_full (
  void **  arr_ptr,
  size_t   count,
  size_t * max_sz,
  size_t   el_size);
 
#define array_double_size_if_full(_array, count, size, type) \
  ((size_t) (count) < (size_t) (size) \
     ? ({}) \
     : _array_double_size_if_full ( \
       (void **) &_array, (size_t) (count), &size, sizeof (type)))
 
#define array_delete(_array, size, element) \
  for (size_t ii = 0; ii < (size_t) size; ii++) \
    { \
      if ((void *) _array[ii] == (void *) element) \
        { \
          --size; \
          for (size_t jj = ii; jj < (size_t) size; jj++) \
            { \
              _array[jj] = _array[jj + 1]; \
            } \
          break; \
        } \
    }
 
#define array_delete_confirm(_array, size, element, confirm) \
  confirm = false; \
  for (size_t ii = 0; ii < (size_t) size; ii++) \
    { \
      if ((void *) _array[ii] == (void *) element) \
        { \
          confirm = true; \
          --size; \
          for (size_t jj = ii; jj < (size_t) size; jj++) \
            { \
              _array[jj] = _array[jj + 1]; \
            } \
          break; \
        } \
    }
 
#define array_delete_primitive(_array, size, element) \
  for (int ii = 0; ii < size; ii++) \
    { \
      if (_array[ii] == element) \
        { \
          --size; \
          for (int jj = ii; jj < size; jj++) \
            { \
              _array[jj] = _array[jj + 1]; \
            } \
          break; \
        } \
    }
 
#define array_delete_return_pos(_array, size, element, pos) \
  for (int ii = 0; ii < size; ii++) \
    { \
      if (_array[ii] == element) \
        { \
          pos = ii; \
          --size; \
          for (int jj = ii; jj < size; jj++) \
            { \
              _array[jj] = _array[jj + 1]; \
            } \
          break; \
        } \
    }
 
#define array_double_delete(array1, array2, size, element1, element2) \
  for (int ii = 0; ii < size; ii++) \
    { \
      if (array1[ii] == element1) \
        { \
          --size; \
          for (int jj = ii; jj < size; jj++) \
            { \
              array1[jj] = array1[jj + 1]; \
              array2[jj] = array2[jj + 1]; \
            } \
          break; \
        } \
    }
 
#define array_contains_cmp(_array, size, element, cmp, equal_val, pointers) \
  _array_contains_cmp ( \
    (void **) _array, size, (void *) element, (int (*) (void *, void *)) cmp, \
    equal_val, pointers)
 
#define array_contains(_array, size, element) \
  _array_contains ((void **) _array, size, (void *) element)
 
#define array_dynamic_swap(arr1, sz1, arr2, sz2) \
  _array_dynamic_swap ( \
    (void ***) arr1, (size_t *) sz1, (void ***) arr2, (size_t *) sz2)
 
void
_array_dynamic_swap (void *** arr1, size_t * sz1, void *** arr2, size_t * sz2);
 
static inline int
array_contains_int (int * _array, int size, int element)
{
  for (int i = 0; i < size; i++)
    {
      if (_array[i] == element)
        return 1;
    }
  return 0;
}
 
void
array_shuffle (void * _array, size_t n, size_t size);
 
NONNULL WARN_UNUSED_RESULT int
_array_contains (void ** _array, int size, void * element);
 
int
_array_contains_cmp (
  void ** _array,
  int     size,
  void *  element,
  int (*cmp) (void *, void *),
  int equal_val,
  int pointers);
 
int
_array_index_of (void ** _array, int size, void * element);
 
void
array_sort_alphabetically (char ** _array, int size, int case_sensitive);
 
void
array_sort_float (float * _array, int size);
 
void
array_sort_long (long * _array, int size);
 
#define array_get_count(_arr, _sz) _array_get_count ((void **) _arr, _sz)
 
size_t
_array_get_count (void ** _array, size_t element_size);
 
#endif /* __UTILS_ARRAYS_H__ */