/*
* Function: int main(int argc, char args[])
* Description: process main function
* Input: argc: parameter number
* args: parameter value array
* Output: none
* Return: function exit status
* Others: none
*/
int main( )
{
int depth = 0;
Bt * bt = create_bt( );
char a[10][10] = { "2", "8", "1", "3", "9", "4", "7", "5", "6", "0" };
char *b[10];
int i;
Bt_Entry* entry;
for( i = 0; i < 10; i++ )
{
b[i] = a[i];
}
init_bt( bt, b, 10, strcmp );
printf("pre order for this bt\n");
pre_order(bt->root,show_string);
printf("in order for this bt\n");
in_order( bt->root, show_string );
printf("post order for this bt\n");
post_order(bt->root,show_string);
printf("level order for this bt\n");
level_order(bt->root,show_string);
special_level_order(bt->root,2,show_string);
depth = calc_tree_depth( bt->root );
printf( "depth is %d\n", depth );
entry = get_entry( bt->root, "3", strcmp );
if( entry )
{
printf( "entry item is %s\n", entry->item );
} else
{
printf( "entry is NULL\n" );
}
set_entry( bt->root, "3", "33", strcmp );
in_order( bt->root, show_string );
entry = get_parent( bt->root, "33", strcmp );
printf( "parent item is %s\n", entry->item );
entry = get_right( bt->root, "5", strcmp );
if( entry )
{
printf( "right item is %s\n", entry->item );
}
entry = get_left( bt->root, "8", strcmp );
if( entry )
{
printf( "left item is %s\n", entry->item );
}
destroy_bt( bt, NULL );
}
void init_bts2(t_linkedlist **bts, t_bunny_pixelarray *buff)
{
append_elem(bts, init_bt(buff, buttons_erase(),
&on_eraser_click));
append_elem(bts, init_bt(buff, buttons_more_border(),
&on_plus_click));
append_elem(bts, init_bt(buff, buttons_less_border(),
&on_less_click));
append_elem(bts, init_bt(buff, buttons_clean_border(),
&on_reset_workplan_click));
append_elem(bts, init_bt(buff, buttons_color(),
&on_palette_click));
append_elem(bts, init_bt(buff, buttons_load(),
&on_load_tkp_click));
append_elem(bts, init_bt(buff, buttons_save(),
&on_save_tkp_click));
append_elem(bts, init_bt(buff, buttons_load_bmp(),
&on_load_bmp_click));
}
void sinsp_curl::init()
{
if(!m_curl)
{
throw sinsp_exception("Cannot initialize CURL.");
}
check_error(curl_easy_setopt(m_curl, CURLOPT_FORBID_REUSE, 1L));
if(m_ssl)
{
init_ssl(m_curl, m_ssl);
}
if(m_bt)
{
init_bt(m_curl, m_bt);
}
enable_debug(m_curl, m_debug);
}
void init_bts(t_linkedlist **bts, t_bunny_pixelarray *buff)
{
*bts = NULL;
append_elem(bts, init_bt(buff, buttons_pen_border(),
&on_pen_click));
append_elem(bts, init_bt(buff, buttons_circle_border(),
&on_circle_click));
append_elem(bts, init_bt(buff, buttons_empty_circle_border(),
&on_empty_circle_click));
append_elem(bts, init_bt(buff, buttons_square_border(),
&on_square_click));
append_elem(bts, init_bt(buff, buttons_empty_square_border(),
&on_empty_square_click));
append_elem(bts, init_bt(buff, buttons_line_border(),
&on_line_click));
init_bts2(bts, buff);
}
int identity(){
binary_tree *tree = init_bt();
read_db_to_tree(tree);
node* tmp;
char buffer[50];
float fbuff;
int cmd;
FILE *f;
while(1){
printf("########################\n");
printf("# 1. Print In-Order #\n");
printf("# 2. Search #\n");
printf("# 3. Modify #\n");
printf("# 4. Delete #\n");
printf("# 5. Exit #\n");
printf("########################\n");
printf("Enter your choice: ");
scanf("%d",&cmd);
switch (cmd){
case 1:
inorder(tree->root);
break;
case 2:
printf("Enter IDENTITY NUMBER: ");
scanf("%s",&buffer);
tmp = bt_search(buffer, tree->root);
if (tmp != NULL) {
printf("\nResult: ");
print_node(tmp);
printf("\n");
}
break;
case 3:
printf("Enter IDENTITY: ");
scanf("%s", &buffer);
tmp = bt_search(buffer, tree->root);
if (tmp != NULL){
printf("Enter Name: ");
scanf("%s",&buffer);
strcpy(tmp->data->name, buffer);
printf("Enter Sirname: ");
scanf("%s",&buffer);
strcpy(tmp->data->sirname, buffer);
printf("Enter Average Grade: ");
scanf("%f",&fbuff);
tmp->data->avg_grade = fbuff;
printf("\n\n");
print_node(tmp);
}
fflush(stdin);
break;
case 4:
printf("Enter IDENTITY: ");
scanf("%s",&buffer);
delete_element(buffer, tree->root);
break;
case 5:
// Clear the previous database file
f = fopen("student_database.txt", "w");
fclose(f);
print_preorder(tree->root);
return 0;
default:
printf("Bad Command\n");
break;
}
}
}
