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
|
#include <stdio.h>
#include "str.h"
#include <stdlib.h>
#include <string.h>
#include "lua.h"
#include "parray.h"
parray_t* parray_init(){
parray_t* awa = malloc(sizeof * awa);
awa->P = malloc(sizeof * awa->P);
awa->len = 0;
return awa;
}
void parray_set(parray_t* p, char* key, void* value){
for(int i = 0; i != p->len; i++){
if(strcmp(p->P[i].key->c, key) == 0){
p->P[p->len - 1].value = value;
return;
}
}
p->len++;
p->P = realloc(p->P, sizeof * p->P * (p->len + 1));
p->P[p->len - 1].key = str_init(key);
p->P[p->len - 1].value = value;
}
void* parray_get(parray_t* p, char* key){
for(int i = 0; i != p->len; i++){
if(strcmp(p->P[i].key->c, key) == 0){
return p->P[i].value;
}
}
return NULL;
}
void parray_lclear(parray_t* p){
free(p->P);
free(p);
}
void parray_clear(parray_t* p, int clear_val){
for(int i = 0; i != p->len; i++){
str_free(p->P[i].key);
if(clear_val) free(p->P[i].value);
}
parray_lclear(p);
}
int fmatch(char* s, char* p) {
int slen = strlen(s);
int plen = strlen(p);
int sidx = 0, pidx = 0, lastWildcardIdx = -1, sBacktrackIdx = -1, nextToWildcardIdx = -1;
for(;sidx < slen;) {
if (pidx < plen && (p[pidx] == '?' || p[pidx] == s[sidx])) {
sidx++;
pidx++;
} else if (pidx < plen && p[pidx] == '*') {
lastWildcardIdx = pidx;
nextToWildcardIdx = ++pidx;
sBacktrackIdx = sidx;
} else if (lastWildcardIdx == -1) {
return 0;
} else {
pidx = nextToWildcardIdx;
sidx = sBacktrackIdx++;
}
}
for(int i = pidx; i < plen; i++) if(p[i] != '*') return 0;
return 1;
}
parray_t* parray_find(parray_t* p, char* match){
parray_t* ret = malloc(sizeof * ret);
ret->P = malloc(sizeof * ret->P * p->len);
ret->len = 0;
for(int i = 0; i != p->len; i++){
if(fmatch(match, p->P[i].key->c)){
ret->P[ret->len] = p->P[i];
ret->len++;
}
}
return ret;
}
|
