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
|
/* ************************************************************************ */
/* */
/* Neko Virtual Machine */
/* Copyright (c)2005 Motion-Twin */
/* */
/* This library is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU Lesser General Public */
/* License as published by the Free Software Foundation; either */
/* version 2.1 of the License, or (at your option) any later version. */
/* */
/* This library is distributed in the hope that it will be useful, */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU */
/* Lesser General Public License or the LICENSE file for more details. */
/* */
/* ************************************************************************ */
#include <string.h>
#include "objtable.h"
int otable_remove( objtable *t, field id ) {
int min = 0;
int max = t->count;
int mid;
field cid;
objcell *c = t->cells;
if( !max )
return 0;
while( min < max ) {
mid = (min + max) >> 1;
cid = c[mid].id;
if( cid < id )
min = mid + 1;
else if( cid > id )
max = mid;
else {
t->count--;
while( mid < t->count ) {
c[mid] = c[mid+1];
mid++;
}
c[mid].v = val_null;
return 1;
}
}
return 0;
}
void otable_optimize( objtable *t ) {
int max = t->count;
int i;
int cur = 0;
objcell *c = t->cells;
for(i=0;i<max;i++) {
value v = c[i].v;
if( v != val_null )
c[cur++] = c[i];
}
for(i=cur;i<max;i++)
c[i].v = NULL;
t->count = cur;
}
void otable_replace( objtable *t, field id, value data ) {
int min = 0;
int max = t->count;
int mid;
field cid;
objcell *c = t->cells;
while( min < max ) {
mid = (min + max) >> 1;
cid = c[mid].id;
if( cid < id )
min = mid + 1;
else if( cid > id )
max = mid;
else {
c[mid].v = data;
return;
}
}
mid = (min + max) >> 1;
c = (objcell*)alloc(sizeof(objcell)*(t->count + 1));
min = 0;
while( min < mid ) {
c[min] = t->cells[min];
min++;
}
c[mid].id = id;
c[mid].v = data;
while( min < t->count ) {
c[min+1] = t->cells[min];
min++;
}
t->cells = c;
t->count++;
}
void otable_copy( objtable *t, objtable *target ) {
target->count = t->count;
target->cells = (objcell*)alloc(sizeof(objcell)*t->count);
memcpy(target->cells,t->cells,sizeof(objcell)*t->count);
}
void otable_iter(objtable *t, void f( value data, field id, void *), void *p ) {
int i;
int n = t->count;
objcell *c = t->cells;
for(i=0;i<n;i++)
f(c[i].v,c[i].id,p);
}
/* ************************************************************************ */
|
