int main()
{ long i; o_t *o;
printf("starting \n");
o = create_order();
for(i=100000; i>=0; i-- )
insert_bottom( o, p(i) );
for(i=100001; i< 300007; i+=2 )
{ insert_after(o, p(i+1), p(i-1) );
insert_before( o, p(i), p(i+1) );
}
printf("inserted 300000 elements. ");
for(i = 250000; i < 300007; i++ )
delete_o( o, p(i) );
printf("deleted 50000 elements. ");
insert_top( o, p(300006) );
for(i = 250000; i < 300006; i++ )
insert_before( o, p(i) , p(300006) );
printf("reinserted. now testing order\n");
for( i=0; i < 299000; i +=42 )
{ if( compare( o, p(i), p(i+23) ) != 1 )
{ printf(" found error (1) \n"); exit(0);
}
}
for( i=300006; i >57; i -=119 )
{ if( compare( o, p(i), p(i-57) ) != 0 )
{ printf(" found error (0) \n"); exit(0);
}
}
printf("finished. no problem found.\n");
}
int main(void)
{
int i,j=5;
for(i = 0; i<10; i++)
IP_a[i].ip = i+100;
delete_o(j);
for(i = 0; i<10; i++)
cout<<i<<" "<<IP_a[i].ip<<endl;
return 0 ;
}
