1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/array.c Thu Jul 04 20:07:31 2019 +0200
1.3 @@ -0,0 +1,107 @@
1.4 +/*
1.5 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
1.6 + *
1.7 + * Copyright 2019 Mike Becker, Olaf Wintermann All rights reserved.
1.8 + *
1.9 + * Redistribution and use in source and binary forms, with or without
1.10 + * modification, are permitted provided that the following conditions are met:
1.11 + *
1.12 + * 1. Redistributions of source code must retain the above copyright
1.13 + * notice, this list of conditions and the following disclaimer.
1.14 + *
1.15 + * 2. Redistributions in binary form must reproduce the above copyright
1.16 + * notice, this list of conditions and the following disclaimer in the
1.17 + * documentation and/or other materials provided with the distribution.
1.18 + *
1.19 + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.20 + * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.21 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.22 + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
1.23 + * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.24 + * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.25 + * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.26 + * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.27 + * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.28 + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.29 + * POSSIBILITY OF SUCH DAMAGE.
1.30 + */
1.31 +
1.32 +#include "ucx/array.h"
1.33 +
1.34 +
1.35 +UcxArray ucx_array_new(size_t capacity, size_t elemsize) {
1.36 + return ucx_array_new_a(capacity, elemsize, ucx_default_allocator());
1.37 +}
1.38 +
1.39 +UcxArray ucx_array_new_a(size_t capacity, size_t elemsize,
1.40 + UcxAllocator* allocator) {
1.41 + UcxArray array;
1.42 +
1.43 + return array;
1.44 +}
1.45 +
1.46 +UcxArray ucx_array_clone(UcxArray array) {
1.47 + UcxArray clone;
1.48 +
1.49 + return clone;
1.50 +}
1.51 +
1.52 +int ucx_array_equals(UcxArray array1, UcxArray array2,
1.53 + cmp_func cmpfnc, void* data) {
1.54 +
1.55 + return 1;
1.56 +}
1.57 +
1.58 +void ucx_array_free(UcxArray *array) {
1.59 +
1.60 +}
1.61 +
1.62 +int ucx_array_append(UcxArray *array, void *data) {
1.63 + return 1;
1.64 +}
1.65 +
1.66 +int ucx_array_prepend(UcxArray *array, void *data) {
1.67 + return 1;
1.68 +}
1.69 +
1.70 +int ucx_array_concat(UcxArray *array1, const UcxArray *array2) {
1.71 + return 1;
1.72 +}
1.73 +
1.74 +void *ucx_array_at(UcxArray array, size_t index) {
1.75 + return NULL;
1.76 +}
1.77 +
1.78 +size_t ucx_array_find(UcxArray array, void *elem, cmp_func cmpfnc, void *data) {
1.79 +
1.80 + return 0;
1.81 +}
1.82 +
1.83 +int ucx_array_contains(UcxArray array, void *elem, cmp_func cmpfnc, void *data) {
1.84 + return ucx_array_find(array, elem, cmpfnc, data) != array.size;
1.85 +}
1.86 +
1.87 +int ucx_array_sort(UcxArray array, cmp_func cmpfnc, void *data) {
1.88 + return 1;
1.89 +}
1.90 +
1.91 +void ucx_array_remove(UcxArray *array, size_t index) {
1.92 +
1.93 +}
1.94 +
1.95 +void ucx_array_remove_fast(UcxArray *array, size_t index) {
1.96 +
1.97 +}
1.98 +
1.99 +int ucx_array_shrink(UcxArray* array) {
1.100 + return 1;
1.101 +}
1.102 +
1.103 +int ucx_array_resize(UcxArray* array, size_t capacity) {
1.104 + return 1;
1.105 +}
1.106 +
1.107 +int ucx_array_reserve(UcxArray* array, size_t capacity) {
1.108 + return 1;
1.109 +}
1.110 +
