Skip to content

Update main.cpp #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
adityaabhas wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update main.cpp #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
140 changes: 70 additions & 70 deletions main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,87 +1,87 @@
#include <iostream>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdio>
#include <cstring>
#include "bpt.h"

using namespace std;

int insert_count ;

void usage()
{
printf( "Usage:\n" ) ;
printf( "Insert operation: insert [key] [value]\n" ) ;
printf( "Delete operation: delete [key]\n" ) ;
printf( "Query operation: query [key]\n" ) ;
using namespace std;
int insert_count ;
void usage()
{
printf( "Usage:\n" ) ;
printf( "Insert operation: insert [key] [value]\n" ) ;
printf( "Delete operation: delete [key]\n" ) ;
printf( "Query operation: query [key]\n" ) ;
}

int main()
{
FILE *fp = fopen( "test" , "r" ) ;
if ( fp == NULL )
{
cout << "." << endl;
return 0 ;
}

initial_bpt() ;
int f_num ;
char tmp_c[ 10 ] ;
insert_count = 0 ;

while ( fscanf( fp , "%d%s" ,&f_num , tmp_c ) != EOF )
{
char *f_value = ( char * ) new char[ strlen( tmp_c ) + 1 ] ;
{
FILE *fp = fopen( "test" , "r" ) ;
if ( fp == NULL )
{
cout << "." << endl;
return 0 ;
}
initial_bpt() ;
int f_num ;
char tmp_c[ 10 ] ;
insert_count = 0 ;
while ( fscanf( fp , "%d%s" ,&f_num , tmp_c ) != EOF )
{
char *f_value = ( char * ) new char[ strlen( tmp_c ) + 1 ] ;
strcpy( f_value , tmp_c ) ;
if ( insert_in_bpt( f_num , f_value ) )
{
printf( "Insert %d %s OK!\n" , f_num , f_value ) ;
printf( "Insert %d %s OK!\n" , f_num , f_value ) ;
insert_count ++ ;
} else
printf( "Ignore %d %s\n" , f_num , f_value ) ;
}
fclose( fp ) ;

printf( "B plus tree build OK.\n" ) ;
printf( "node_cout is : %d\n" , node_count ) ;
printf( "insert_count is : %d\n" , insert_count ) ;
printf( "splite_count is : %d\n" , splite_count ) ;

while ( 1 )
{
usage() ;
scanf( "%s" , tmp_c ) ;
if ( strcmp( tmp_c , "insert" ) == 0 )
{
scanf( "%d%s" , &f_num , tmp_c ) ;
char *f_value = ( char * ) new char[ strlen( tmp_c ) + 1 ] ;
printf( "Ignore %d %s\n" , f_num , f_value ) ;
}
fclose( fp ) ;
printf( "B plus tree build OK.\n" ) ;
printf( "node_cout is : %d\n" , node_count ) ;
printf( "insert_count is : %d\n" , insert_count ) ;
printf( "splite_count is : %d\n" , splite_count ) ;
while ( 1 )
{
usage() ;
scanf( "%s" , tmp_c ) ;
if ( strcmp( tmp_c , "insert" ) == 0 )
{
scanf( "%d%s" , &f_num , tmp_c ) ;
char *f_value = ( char * ) new char[ strlen( tmp_c ) + 1 ] ;
strcpy( f_value , tmp_c ) ;
if ( insert_in_bpt( f_num , f_value ) )
{
//printf( "Insert %d %s OK!\n" , f_num , f_value ) ;
//printf( "Insert %d %s OK!\n" , f_num , f_value ) ;
insert_count ++ ;
} else
//printf( "Ignore %d %s\n" , f_num , f_value ) ;

} else
if ( strcmp( tmp_c , "delete" ) == 0 )
{
scanf( "%d" , &f_num ) ;
if ( delete_in_bpt( f_num ) )
printf( "Delete %d OK!\n" , f_num ) ;
else
printf( "can't delete key%d\n" , f_num ) ;
} else
if ( strcmp( tmp_c , "query" ) == 0 )
{
scanf( "%d" , &f_num ) ;
char *tmp_c = query_in_bpt( f_num ) ;
if ( tmp_c == NULL )
printf( "can't find key%d\n" , f_num ) ;
else
printf( "value of key%d is : %s\n" , f_num , tmp_c ) ;
} else usage() ;
}
} //else
//printf( "Ignore %d %s\n" , f_num , f_value ) ;
} else
if ( strcmp( tmp_c , "delete" ) == 0 )
{
scanf( "%d" , &f_num ) ;
if ( delete_in_bpt( f_num ) )
printf( "Delete %d OK!\n" , f_num ) ;
else
printf( "can't delete key%d\n" , f_num ) ;
} else
if ( strcmp( tmp_c , "query" ) == 0 )
{
scanf( "%d" , &f_num ) ;
char *tmp_c = query_in_bpt( f_num ) ;
if ( tmp_c == NULL )
printf( "can't find key%d\n" , f_num ) ;
else
printf( "value of key%d is : %s\n" , f_num , tmp_c ) ;
} else usage() ;
}

return 0;
}