int main(void) {
int in[NSTR];
int i, j;
unsigned seed = 0;
for (i = 0; i < NSTR; i++) in[i] = 0;
array = NULL;
arraylen = arraysize = 0;
tree = newtree234(mycmp);
cmp = mycmp;
verify();
for (i = 0; i < 10000; i++) {
j = randomnumber(&seed);
j %= NSTR;
printf("trial: %d\n", i);
if (in[j]) {
printf("deleting %s (%d)\n", strings[j], j);
deltest(strings[j]);
in[j] = 0;
} else {
printf("adding %s (%d)\n", strings[j], j);
addtest(strings[j]);
in[j] = 1;
}
}
while (arraylen > 0) {
j = randomnumber(&seed);
j %= arraylen;
deltest(array[j]);
}
return 0;
}
int main(void) {
int in[NSTR];
int i, j, k;
unsigned seed = 0;
for (i = 0; i < NSTR; i++) in[i] = 0;
array = NULL;
arraylen = arraysize = 0;
tree = newtree234(mycmp);
cmp = mycmp;
verify();
for (i = 0; i < 10000; i++) {
j = randomnumber(&seed);
j %= NSTR;
printf("trial: %d\n", i);
if (in[j]) {
printf("deleting %s (%d)\n", strings[j], j);
deltest(strings[j]);
in[j] = 0;
} else {
printf("adding %s (%d)\n", strings[j], j);
addtest(strings[j]);
in[j] = 1;
}
findtest();
}
while (arraylen > 0) {
j = randomnumber(&seed);
j %= arraylen;
deltest(array[j]);
}
freetree234(tree);
tree = newtree234(NULL);
cmp = NULL;
verify();
for (i = 0; i < 1000; i++) {
printf("trial: %d\n", i);
j = randomnumber(&seed);
j %= NSTR;
k = randomnumber(&seed);
k %= count234(tree)+1;
printf("adding string %s at index %d\n", strings[j], k);
addpostest(strings[j], k);
}
while (count234(tree) > 0) {
printf("cleanup: tree size %d\n", count234(tree));
j = randomnumber(&seed);
j %= count234(tree);
printf("deleting string %s from index %d\n", array[j], j);
delpostest(j);
}
return 0;
}
int16_t main (void)
{
// clear_results();
// Q16convtest();
clear_results();
floattest();
multtest();
clear_results();
divtest();
clear_results();
addtest();
clear_results();
sqrttest();
return 0 ;
}
int main(int argc, char **argv) {
long long nthreads = 0;
long long iterations = 0;
while (1) {
static struct option long_options[] =
{
{ "threads", optional_argument, 0, 't' },
{ "iter", optional_argument, 0, 'i' },
{ "sync", optional_argument, 0, 's' },
{ "yield", optional_argument, 0, 'y' },
{ 0, 0, 0, 0 }
};
int option_index = 0;
int c = getopt_long(argc, argv, "", long_options, &option_index);
/* Detect the end of options */
if (c == -1) {
break;
}
switch (c)
{
/* nthreads */
case 't':
if(optarg) { //threads=<something>
nthreads = atoi(optarg);
}
else {
nthreads = 1; //default 1
}
break;
/* niterations */
case 'i':
if(optarg) {
iterations = atoi(optarg);
}
else {
iterations = 1;
}
break;
/* sync option
m = mutex
s = spinlock
c = compare and swap */
case 's':
if (optarg) {
sync = *optarg; //sdfslfdslflsd
}
else {
fprintf(stderr, "Invalid sync option\n");
exit(1);
}
break;
/* yield option */
case 'y':
if (optarg) {
opt_yield = atoi(optarg);
}
else {
opt_yield = 1;
}
break;
default:
break;
}
}
addtest(nthreads, iterations);
return 0;
}
int main(void) {
int in[NSTR];
int i, j, k;
unsigned seed = 0;
for (i = 0; i < NSTR; i++) in[i] = 0;
array = NULL;
arraylen = arraysize = 0;
tree = newtree234(mycmp);
cmp = mycmp;
verify();
for (i = 0; i < 10000; i++) {
j = randomnumber(&seed);
j %= NSTR;
printf("trial: %d\n", i);
if (in[j]) {
printf("deleting %s (%d)\n", strings[j], j);
deltest(strings[j]);
in[j] = 0;
} else {
printf("adding %s (%d)\n", strings[j], j);
addtest(strings[j]);
in[j] = 1;
}
findtest();
}
while (arraylen > 0) {
j = randomnumber(&seed);
j %= arraylen;
deltest(array[j]);
}
freetree234(tree);
/*
* Now try an unsorted tree. We don't really need to test
* delpos234 because we know del234 is based on it, so it's
* already been tested in the above sorted-tree code; but for
* completeness we'll use it to tear down our unsorted tree
* once we've built it.
*/
tree = newtree234(NULL);
cmp = NULL;
verify();
for (i = 0; i < 1000; i++) {
printf("trial: %d\n", i);
j = randomnumber(&seed);
j %= NSTR;
k = randomnumber(&seed);
k %= count234(tree)+1;
printf("adding string %s at index %d\n", strings[j], k);
addpostest(strings[j], k);
}
while (count234(tree) > 0) {
printf("cleanup: tree size %d\n", count234(tree));
j = randomnumber(&seed);
j %= count234(tree);
printf("deleting string %s from index %d\n", array[j], j);
delpostest(j);
}
return 0;
}
