18c772234d
time to build a list, since the lists could not contain duplicate keys. These operations are now O(1), and the lists can contain duplicates.
46 lines
776 B
C
46 lines
776 B
C
#include <assert.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <lladd/transactional.h>
|
|
#include <unistd.h>
|
|
|
|
|
|
int main(int argc, char** argv) {
|
|
|
|
assert(argc == 3);
|
|
|
|
int xact_count = atoi(argv[1]);
|
|
int count = atoi(argv[2]);
|
|
int k;
|
|
|
|
/* unlink("storefile.txt");
|
|
unlink("logfile.txt");
|
|
unlink("blob0_file.txt");
|
|
unlink("blob1_file.txt"); */
|
|
|
|
Tinit();
|
|
int xid = Tbegin();
|
|
|
|
recordid hash = TlinkedListCreate(xid, sizeof(int), sizeof(int));
|
|
|
|
Tcommit(xid);
|
|
|
|
int i = 0;
|
|
|
|
for(k = 0; k < xact_count; k++) {
|
|
|
|
xid = Tbegin();
|
|
|
|
for(;i < count *(k+1) ; i++) {
|
|
|
|
TlinkedListInsert(xid, hash, (byte*)&i, sizeof(int), (byte*)&i, sizeof(int));
|
|
|
|
}
|
|
|
|
Tcommit(xid);
|
|
|
|
}
|
|
|
|
Tdeinit();
|
|
|
|
}
|