summaryrefslogtreecommitdiffstats
path: root/hw1/basic-array.c
blob: 5d5f61e875b8f3a88fbe7ce66803ba4f70cb0d7e (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#include "xwrap.h"
#include <stdlib.h>
#include <string.h>
#include "basic-array.h"

Array* array_create_setmax(int itemsize, int len, int maxlen){
    if(itemsize <= 0 || len < 0 || maxlen < len){
        return NULL;
    }
    Array* arr = (Array*)xmalloc(sizeof(Array));
    if(arr == NULL){
        return NULL;
    }
    arr->arr_itemsize = itemsize;
    arr->arr_curlen = len;
    arr->arr_maxlen = maxlen;
    if(maxlen != 0){
        arr->arr_data = xmalloc(itemsize * maxlen);
        if(arr->arr_data == NULL){
            free(arr);
            return NULL;
        }
    }else{
        arr->arr_data = NULL;
    }
    return arr;
}

Array* array_create(int itemsize, int len){
    return array_create_setmax(itemsize, len, len);
}

void array_free(Array* arr){
    if(arr->arr_data != NULL){
        free(arr->arr_data);
    }
    free(arr);
}

int array_pushback(Array* arr, const void* data){
    if((arr->arr_maxlen) < (arr->arr_curlen + 1)){
        if(arr->arr_maxlen != 0){
            if(array_setmax(arr, arr->arr_maxlen*2) < 0){
                return -1;
            }
        }else{
            if(array_setmax(arr, 1) < 0){
                return -1;
            }
        }
    }
    memcpy(array_vp(arr, arr->arr_curlen), data, arr->arr_itemsize);
    arr->arr_curlen++;
    return 0;
}

int array_setlen(Array* arr, int len){
    if(len > (arr->arr_maxlen)){
        if(array_setmax(arr, len) < 0){
            return -1;
        }else{
            arr->arr_curlen = len;
        }
    }else{
        arr->arr_curlen = len;
        return 0;
    }
    return 0;
}

int array_setmax(Array* arr, int max){
    void* newptr;
    if(arr->arr_data == NULL){
        newptr = xmalloc((arr->arr_itemsize)*max);
        if(newptr == NULL){
            return -1;
        }else{
            arr->arr_maxlen = max;
            arr->arr_data = newptr;
            return 0;
        }
    }
    newptr = realloc(arr->arr_data, (arr->arr_itemsize)*max);
    if(newptr == NULL){
        return -1;
    }else{
        arr->arr_maxlen = max;
        arr->arr_data = newptr;
    }
    return 0;
}

int array_strip(Array* arr){
    if(arr->arr_data == NULL){
        return 0;
    }
    Array* newptr; 
    /* 其實縮小空間營該一定會成功才對......
     * 不過還是保險一點,加個判斷式,別說 memory leak 是我害的
     * 當然也是避免編譯器一直跳 warning
     */
    if((arr->arr_maxlen) > (arr->arr_curlen)){
        arr->arr_maxlen = arr->arr_curlen;
        newptr = realloc(arr->arr_data, (arr->arr_curlen)*(arr->arr_itemsize));
        if(newptr == NULL){
            return -1;
        }
        arr->arr_data = newptr;
    }
    return 0;
}

/* 基本上直接玩 struct 的函式還是少用吧 */
void* array_drop_struct(Array* arr){
    void* toreturn = arr->arr_data;
    free(arr);
    return toreturn;
}

Array* array_make_struct(void* data, int itemsize, int len, int maxlen){
    if(itemsize <= 0 || len < 0 || maxlen < len){
        return NULL;
    }
    Array* arr = (Array*)xmalloc(sizeof(Array));
    if(arr == NULL){
        return NULL;
    }
    arr->arr_itemsize = itemsize;
    arr->arr_curlen = len;
    arr->arr_maxlen = maxlen;
    arr->arr_data = data;
    return arr;
}