-
Notifications
You must be signed in to change notification settings - Fork 0
/
Corrupt.h
137 lines (130 loc) · 3.19 KB
/
Corrupt.h
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
134
135
136
137
#ifndef CORRUPT_H
#define CORRUPT_H
#include "Random.h"
#include "Triple.h"
#include "Reader.h"
INT corrupt_head(INT id, INT h, INT r) {
INT lef, rig, mid, ll, rr;
lef = lefHead[h] - 1;
rig = rigHead[h];
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainHead[mid].r >= r) rig = mid; else
lef = mid;
}
ll = rig;
lef = lefHead[h];
rig = rigHead[h] + 1;
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainHead[mid].r <= r) lef = mid; else
rig = mid;
}
rr = lef;
INT tmp = rand_max(id, entityTotal - (rr - ll + 1));
if (tmp < trainHead[ll].t) return tmp;
if (tmp > trainHead[rr].t - rr + ll - 1) return tmp + rr - ll + 1;
lef = ll, rig = rr + 1;
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainHead[mid].t - mid + ll - 1 < tmp)
lef = mid;
else
rig = mid;
}
return tmp + lef - ll + 1;
}
INT corrupt_tail(INT id, INT t, INT r) {
INT lef, rig, mid, ll, rr;
lef = lefTail[t] - 1;
rig = rigTail[t];
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainTail[mid].r >= r) rig = mid; else
lef = mid;
}
ll = rig;
lef = lefTail[t];
rig = rigTail[t] + 1;
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainTail[mid].r <= r) lef = mid; else
rig = mid;
}
rr = lef;
INT tmp = rand_max(id, entityTotal - (rr - ll + 1));
if (tmp < trainTail[ll].h) return tmp;
if (tmp > trainTail[rr].h - rr + ll - 1) return tmp + rr - ll + 1;
lef = ll, rig = rr + 1;
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainTail[mid].h - mid + ll - 1 < tmp)
lef = mid;
else
rig = mid;
}
return tmp + lef - ll + 1;
}
INT corrupt_rel(INT id, INT h, INT t) {
INT lef, rig, mid, ll, rr;
lef = lefRel[h] - 1;
rig = rigRel[h];
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainRel[mid].t >= t) rig = mid; else
lef = mid;
}
ll = rig;
lef = lefRel[h];
rig = rigRel[h] + 1;
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainRel[mid].t <= t) lef = mid; else
rig = mid;
}
rr = lef;
INT tmp = rand_max(id, relationTotal - (rr - ll + 1));
if (tmp < trainRel[ll].r) return tmp;
if (tmp > trainRel[rr].r - rr + ll - 1) return tmp + rr - ll + 1;
lef = ll, rig = rr + 1;
while (lef + 1 < rig) {
mid = (lef + rig) >> 1;
if (trainRel[mid].r - mid + ll - 1 < tmp)
lef = mid;
else
rig = mid;
}
return tmp + lef - ll + 1;
}
bool _find(INT h, INT t, INT r) {
INT lef = 0;
INT rig = tripleTotal - 1;
INT mid;
while (lef + 1 < rig) {
INT mid = (lef + rig) >> 1;
if ((tripleList[mid]. h < h) || (tripleList[mid]. h == h && tripleList[mid]. r < r) || (tripleList[mid]. h == h && tripleList[mid]. r == r && tripleList[mid]. t < t)) lef = mid; else rig = mid;
}
if (tripleList[lef].h == h && tripleList[lef].r == r && tripleList[lef].t == t) return true;
if (tripleList[rig].h == h && tripleList[rig].r == r && tripleList[rig].t == t) return true;
return false;
}
INT corrupt(INT h, INT r){
INT ll = tail_lef[r];
INT rr = tail_rig[r];
INT loop = 0;
INT t;
while(1) {
t = tail_type[rand(ll, rr)];
if (not _find(h, t, r)) {
// printf("r:%ld\tt:%ld\n", r, t);
return t;
} else {
loop ++;
if (loop >= 1000){
// printf("drop\n");
return corrupt_head(0, h, r);
}
}
}
}
#endif