forked from y-mitsui/DpBayesianNet
/
laa.c
63 lines (61 loc) · 1.3 KB
/
laa.c
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include "dpBayesianNetwork.h"
#include "laa.h"
/*
連想配列
探索効率は線形
*/
Associate* makeLAA(int arraySize,int patternSize){
Associate *result=Calloc(Associate,1);
result->keys=Calloc(int,arraySize*patternSize);
result->patternSize=patternSize;
result->array=Calloc(void*,arraySize);
return result;
}
int searchLAA(Associate* laa,int *pattern){
int i,j;
for(i=0;i<laa->numKeys;i++){
for(j=0;j<laa->patternSize;j++){
if(laa->keys[i*laa->patternSize+j]!=pattern[j]) break;
}
if(j==laa->patternSize){
return i;
}
}
return -1;
}
void* getLAA(Associate* laa,int *pattern){
int i,j;
for(i=0;i<laa->numKeys;i++){
for(j=0;j<laa->patternSize;j++){
if(laa->keys[i*laa->patternSize+j]!=pattern[j]) break;
}
if(j==laa->patternSize){
return laa->array[i];
}
}
return NULL;
}
void setLAA(Associate* laa,int *pattern,void* data){
int i,j;
for(i=0;i<laa->numKeys;i++){
for(j=0;j<laa->patternSize;j++){
if(laa->keys[i*laa->patternSize+j]!=pattern[j]) break;
}
if(j==laa->patternSize){
break;
}
}
laa->array[i]=data;
if(i==laa->numKeys){
memcpy(&laa->keys[i*laa->patternSize],pattern,sizeof(int)*laa->patternSize);
laa->numKeys++;
}
}
void freeLAA(Associate* laa){
free(laa->keys);
free(laa->array);
}