cdcontainers - data containers and data structures for C

Library of data containers and data structures for C programming language. The cdcontainers interface is similar to C ++ STL. The library contains the following data containers:

• cdc_array - dynamic array. See array.h.
• cdc_list - doubly linked list. See list.h.
• cdc_circular_array - circular array. See circular-array.h.
• cdc_heap - binary heap. See heap.h.
• cdc_binomial_heap - binomial heap. See binomial-heap.h.
• cdc_pairing_heap - pairing heap. See pairing-heap.h.
• cdc_hash_table - hash table with collisions resolved by chaining. See hash-table.h.
• cdc_avl_tree - avl tree. See avl-tree.h.
• cdc_splay_tree - splay tree. See splay-tree.h.
• cdc_treap - сartesian tree. See treap.h.

and following adapters:

• cdc_deque (Can work with: cdc_array, cdc_list, cdc_circular_array). See deque.h.
• cdc_stack (Can work with: cdc_array, cdc_list, cdc_circular_array). See stack.h.
• cdc_queue (Can work with: cdc_array, cdc_list, cdc_circular_array). See queue.h.
• cdc_priority_queue (Can work with: cdc_heap, cdc_binomial_heap, cdc_pairing_heap). See priority-queue.h.
• cdc_map (Can work with: cdc_avl_tree, cdc_splay_tree, cdc_treap). See map.h.

Example usage array:

// The MIT License (MIT)
// Copyright (c) 2017 Maksim Andrianov
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.

// Program to find first n prime numbers.
#define CDC_USE_SHORT_NAMES
#include <cdcontainers/cdc.h>

#include <stdio.h>

// This function based on the Sieve of Eratosthenes.
// https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
array_t *find_uint_prime_numbers(unsigned int n)
{
  array_t *numbers = NULL;
  if (array_ctor(&numbers, NULL /* data info */) != CDC_STATUS_OK)
    return NULL;

  array_reserve(numbers, n + 1);
  for (unsigned int i = 0; i < n + 1; ++i)
    array_push_back(numbers, CDC_FROM_UINT(i));

  array_t *prime_numbers = NULL;
  if (array_ctor(&prime_numbers, NULL /* data info */) != CDC_STATUS_OK) {
    array_dtor(numbers);
    return NULL;
  }

  for (unsigned int p = 2; p < n + 1; ++p) {
    void *val = array_get(numbers, p);
    if (CDC_TO_UINT(val) != 0) {
      if (array_push_back(prime_numbers, val) != CDC_STATUS_OK) {
        array_dtor(prime_numbers);
        array_dtor(numbers);
        return NULL;
      }

      for (unsigned int i = p * p; i < n + 1; i += p)
        array_set(numbers, i, CDC_FROM_UINT(0));
    }
  }

  array_dtor(numbers);
  return prime_numbers;
}

int main(int argc, char **argv)
{
  CDC_UNUSED(argc);
  CDC_UNUSED(argv);

  array_t *prime_numbers = find_uint_prime_numbers(1000);
  if (!prime_numbers)
    return EXIT_FAILURE;

  for (unsigned i = 0; i < array_size(prime_numbers); ++i)
    printf("%u ", CDC_TO_UINT(array_get(prime_numbers, i)));

  printf("\n");
  array_dtor(prime_numbers);
  return EXIT_SUCCESS;
}