ucx: src/array.c@bc81faa9afda (annotated)

src/array.c@bc81faa9afda (annotated)

src/array.c

Thu, 04 Jul 2019 20:07:31 +0200

author: Mike Becker <universe@uap-core.de>
date: Thu, 04 Jul 2019 20:07:31 +0200
branch: feature/array
changeset 334: bc81faa9afda
parent 323: src/list.c@b8c49e7a1dba
child 336: 6d7aa8a1a3b3
permissions: -rw-r--r--

adds array interface and tests

 /*
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
  *
  * Copyright 2019 Mike Becker, Olaf Wintermann All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are met:
  *
  *   1. Redistributions of source code must retain the above copyright
  *      notice, this list of conditions and the following disclaimer.
  *
  *   2. Redistributions in binary form must reproduce the above copyright
  *      notice, this list of conditions and the following disclaimer in the
  *      documentation and/or other materials provided with the distribution.
  *
  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  * POSSIBILITY OF SUCH DAMAGE.
  */
 #include "ucx/array.h"
 UcxArray ucx_array_new(size_t capacity, size_t elemsize) {
     return ucx_array_new_a(capacity, elemsize, ucx_default_allocator());
 }
 UcxArray ucx_array_new_a(size_t capacity, size_t elemsize,
         UcxAllocator* allocator) {
     UcxArray array;
     return array;
 }
 UcxArray ucx_array_clone(UcxArray array) {
     UcxArray clone;
     return clone;
 }
 int ucx_array_equals(UcxArray array1, UcxArray array2,
         cmp_func cmpfnc, void* data) {
     return 1;
 }
 void ucx_array_free(UcxArray *array) {
 }
 int ucx_array_append(UcxArray *array, void *data) {
     return 1;
 }
 int ucx_array_prepend(UcxArray *array, void *data) {
     return 1;
 }
 int ucx_array_concat(UcxArray *array1, const UcxArray *array2) {
     return 1;
 }
 void *ucx_array_at(UcxArray array, size_t index) {
     return NULL;
 }
 size_t ucx_array_find(UcxArray array, void *elem, cmp_func cmpfnc, void *data) {
     return 0;
 }
 int ucx_array_contains(UcxArray array, void *elem, cmp_func cmpfnc, void *data) {
     return ucx_array_find(array, elem, cmpfnc, data) != array.size;
 }
 int ucx_array_sort(UcxArray array, cmp_func cmpfnc, void *data) {
     return 1;
 }
 void ucx_array_remove(UcxArray *array, size_t index) {
 }
 void ucx_array_remove_fast(UcxArray *array, size_t index) {
 }
 int ucx_array_shrink(UcxArray* array) {
     return 1;
 }
 int ucx_array_resize(UcxArray* array, size_t capacity) {
     return 1;
 }
 int ucx_array_reserve(UcxArray* array, size_t capacity) {
     return 1;
 }

Mercurial > hg > ucx / annotate

src/array.c@bc81faa9afda (annotated)

src/array.c