Console Application
-
77F8910E cmp dword ptr [edx+14h],0 after F5 arrow stopes here .... i have just started learning VC++ so i have very less idea abt Debuggers..
Ok, so it is not directly in your code probably. Now, put a breakpoint at the very begining of your program (by going on the line and pressing F9). Then ,put several breakpoints in relevant points in your program. Each time you press F5, the programm will advance to the next bbreakpoint. And there, you can watch to your variables and things like that. Try to play with it and understand how it works, it is really usefull and it will really help you a lot !
-
Ok, so it is not directly in your code probably. Now, put a breakpoint at the very begining of your program (by going on the line and pressing F9). Then ,put several breakpoints in relevant points in your program. Each time you press F5, the programm will advance to the next bbreakpoint. And there, you can watch to your variables and things like that. Try to play with it and understand how it works, it is really usefull and it will really help you a lot !
Thanks for the inforamtion. it will help me a lot.... i will try to do that..
-
program does not produce any output i dnt knwo where it is getting generated.
But you mentioned a compiler error. What is it? It will be a 4-digit number preceded by a C.
"Let us be thankful for the fools. But for them the rest of us could not succeed." - Mark Twain
"There is no death, only a change of worlds." - Native American Proverb
-
Ok, so it is not directly in your code probably. Now, put a breakpoint at the very begining of your program (by going on the line and pressing F9). Then ,put several breakpoints in relevant points in your program. Each time you press F5, the programm will advance to the next bbreakpoint. And there, you can watch to your variables and things like that. Try to play with it and understand how it works, it is really usefull and it will really help you a lot !
It crashes at here:
} while (_findnext (File_handle, &file_s) == 0);
Maxwell Chen
-
But you mentioned a compiler error. What is it? It will be a 4-digit number preceded by a C.
"Let us be thankful for the fools. But for them the rest of us could not succeed." - Mark Twain
"There is no death, only a change of worlds." - Native American Proverb
This instruction at "0X77f8910e" referenced memory at "0xc7c7cf0".The memory could not be "read".
-
This instruction at "0X77f8910e" referenced memory at "0xc7c7cf0".The memory could not be "read".
That's a run-time error, not a compilation error. There's a big difference between the two.
"Let us be thankful for the fools. But for them the rest of us could not succeed." - Mark Twain
"There is no death, only a change of worlds." - Native American Proverb
-
Hi , Thanks for the reply. Can u plz check my code and tell me where the error is and why it is getting generated..?// /// Program to Generate Binary Tree of multiple files and multiple words. #include #include #include #include #include #include #include #include #define MAXWORD 100 struct tnode *addtree(struct tnode *,char *); void treeprint(struct tnode *); #define length (80) struct tnode { char *word; struct tnode *left; struct tnode *right; }; struct tnode *root1 = NULL; struct tnode *talloc(void) { return (struct tnode *) malloc(sizeof(struct tnode)); } char *strdup(char *s) { char *p; p=(char *) malloc(strlen(s)+1); if(p!=NULL) strcpy(p,s); return p; } //addtree add a node with w at or below p struct tnode *addtree(struct tnode *p,char *w) { int cond; if(p==NULL) { p=talloc(); p->word=strdup(w); p->left=p->right=NULL; } else if((cond=strcmp(w,p->word)) == 0) ; else if(cond < 0) p->left=addtree(p->left,w); else p->right=addtree(p->right,w); return p; } // treeprint : in order void treeprint(struct tnode *p) { if(p!=NULL) { treeprint(p->left); printf("%s\n",p->word); treeprint(p->right); } } void ListWords (char *); #define MAX_LEN 100 int main () { char dir[] = "D://Parichay/"; ListWords(dir); printf("\n\n\t\t Binary Tree :- Each Node Contains 1 word.\n\n"); treeprint(root1); return 0; } /////////Function to list words////// void ListWords (char *dir) { struct _finddata_t file_s; long File_handle; char name[MAX_LEN], words[length]; int j,size; _chdir(dir); if( (File_handle = _findfirst( "*", &file_s )) == -1L ) { printf( "No files in current directory!\n" ); } else if (file_s.attrib & _A_NORMAL) { sprintf (name, "%s",dir); //root = addtree (root, name); //////////////// FILE *fp; fp = fopen(name, "r"); if(fp == NULL) { printf("\n\n Message from _A_NORMAL."); printf("\n\nERROR: could not open file"); exit(EXIT_FAILURE); } else while (fscanf(fp, "%s", &words)!= -1) //while not the end of the file { size = strlen(words); /*determines length of each string */ for(j = 0; j
parichaybp wrote:
while (fscanf(fp, "%s", &words)!= -1) //while not the end of the file
fscanf()can also return0, which indicates a potential problem, but thewhileloop would continue. Is this intentional?
"Let us be thankful for the fools. But for them the rest of us could not succeed." - Mark Twain
"There is no death, only a change of worlds." - Native American Proverb
-
Hi , Thanks for the reply. Can u plz check my code and tell me where the error is and why it is getting generated..?// /// Program to Generate Binary Tree of multiple files and multiple words. #include #include #include #include #include #include #include #include #define MAXWORD 100 struct tnode *addtree(struct tnode *,char *); void treeprint(struct tnode *); #define length (80) struct tnode { char *word; struct tnode *left; struct tnode *right; }; struct tnode *root1 = NULL; struct tnode *talloc(void) { return (struct tnode *) malloc(sizeof(struct tnode)); } char *strdup(char *s) { char *p; p=(char *) malloc(strlen(s)+1); if(p!=NULL) strcpy(p,s); return p; } //addtree add a node with w at or below p struct tnode *addtree(struct tnode *p,char *w) { int cond; if(p==NULL) { p=talloc(); p->word=strdup(w); p->left=p->right=NULL; } else if((cond=strcmp(w,p->word)) == 0) ; else if(cond < 0) p->left=addtree(p->left,w); else p->right=addtree(p->right,w); return p; } // treeprint : in order void treeprint(struct tnode *p) { if(p!=NULL) { treeprint(p->left); printf("%s\n",p->word); treeprint(p->right); } } void ListWords (char *); #define MAX_LEN 100 int main () { char dir[] = "D://Parichay/"; ListWords(dir); printf("\n\n\t\t Binary Tree :- Each Node Contains 1 word.\n\n"); treeprint(root1); return 0; } /////////Function to list words////// void ListWords (char *dir) { struct _finddata_t file_s; long File_handle; char name[MAX_LEN], words[length]; int j,size; _chdir(dir); if( (File_handle = _findfirst( "*", &file_s )) == -1L ) { printf( "No files in current directory!\n" ); } else if (file_s.attrib & _A_NORMAL) { sprintf (name, "%s",dir); //root = addtree (root, name); //////////////// FILE *fp; fp = fopen(name, "r"); if(fp == NULL) { printf("\n\n Message from _A_NORMAL."); printf("\n\nERROR: could not open file"); exit(EXIT_FAILURE); } else while (fscanf(fp, "%s", &words)!= -1) //while not the end of the file { size = strlen(words); /*determines length of each string */ for(j = 0; j
parichaybp wrote:
root1 = addtree (root1, words);
Why do you keep reassigning a new value to
root1? That variable should point to the root of the tree no matter what.parichaybp wrote:
#define MAX_LEN 100
Paths can be longer than 100 characters. Use
MAX_PATHinstead.
"Let us be thankful for the fools. But for them the rest of us could not succeed." - Mark Twain
"There is no death, only a change of worlds." - Native American Proverb
-
Hi , Thanks for the reply. Can u plz check my code and tell me where the error is and why it is getting generated..?// /// Program to Generate Binary Tree of multiple files and multiple words. #include #include #include #include #include #include #include #include #define MAXWORD 100 struct tnode *addtree(struct tnode *,char *); void treeprint(struct tnode *); #define length (80) struct tnode { char *word; struct tnode *left; struct tnode *right; }; struct tnode *root1 = NULL; struct tnode *talloc(void) { return (struct tnode *) malloc(sizeof(struct tnode)); } char *strdup(char *s) { char *p; p=(char *) malloc(strlen(s)+1); if(p!=NULL) strcpy(p,s); return p; } //addtree add a node with w at or below p struct tnode *addtree(struct tnode *p,char *w) { int cond; if(p==NULL) { p=talloc(); p->word=strdup(w); p->left=p->right=NULL; } else if((cond=strcmp(w,p->word)) == 0) ; else if(cond < 0) p->left=addtree(p->left,w); else p->right=addtree(p->right,w); return p; } // treeprint : in order void treeprint(struct tnode *p) { if(p!=NULL) { treeprint(p->left); printf("%s\n",p->word); treeprint(p->right); } } void ListWords (char *); #define MAX_LEN 100 int main () { char dir[] = "D://Parichay/"; ListWords(dir); printf("\n\n\t\t Binary Tree :- Each Node Contains 1 word.\n\n"); treeprint(root1); return 0; } /////////Function to list words////// void ListWords (char *dir) { struct _finddata_t file_s; long File_handle; char name[MAX_LEN], words[length]; int j,size; _chdir(dir); if( (File_handle = _findfirst( "*", &file_s )) == -1L ) { printf( "No files in current directory!\n" ); } else if (file_s.attrib & _A_NORMAL) { sprintf (name, "%s",dir); //root = addtree (root, name); //////////////// FILE *fp; fp = fopen(name, "r"); if(fp == NULL) { printf("\n\n Message from _A_NORMAL."); printf("\n\nERROR: could not open file"); exit(EXIT_FAILURE); } else while (fscanf(fp, "%s", &words)!= -1) //while not the end of the file { size = strlen(words); /*determines length of each string */ for(j = 0; j
parichaybp wrote:
if (strcmp (file_s.name, ".") == 0 || strcmp (file_s.name, "..") == 0)
This can be shortened to just a single comparison:
if (file_s.name[0] == '.')
This does nothing for your problem, but it does help to remove unnecessary code.
"Let us be thankful for the fools. But for them the rest of us could not succeed." - Mark Twain
"There is no death, only a change of worlds." - Native American Proverb
-
Hi , Thanks for the reply. Can u plz check my code and tell me where the error is and why it is getting generated..?// /// Program to Generate Binary Tree of multiple files and multiple words. #include #include #include #include #include #include #include #include #define MAXWORD 100 struct tnode *addtree(struct tnode *,char *); void treeprint(struct tnode *); #define length (80) struct tnode { char *word; struct tnode *left; struct tnode *right; }; struct tnode *root1 = NULL; struct tnode *talloc(void) { return (struct tnode *) malloc(sizeof(struct tnode)); } char *strdup(char *s) { char *p; p=(char *) malloc(strlen(s)+1); if(p!=NULL) strcpy(p,s); return p; } //addtree add a node with w at or below p struct tnode *addtree(struct tnode *p,char *w) { int cond; if(p==NULL) { p=talloc(); p->word=strdup(w); p->left=p->right=NULL; } else if((cond=strcmp(w,p->word)) == 0) ; else if(cond < 0) p->left=addtree(p->left,w); else p->right=addtree(p->right,w); return p; } // treeprint : in order void treeprint(struct tnode *p) { if(p!=NULL) { treeprint(p->left); printf("%s\n",p->word); treeprint(p->right); } } void ListWords (char *); #define MAX_LEN 100 int main () { char dir[] = "D://Parichay/"; ListWords(dir); printf("\n\n\t\t Binary Tree :- Each Node Contains 1 word.\n\n"); treeprint(root1); return 0; } /////////Function to list words////// void ListWords (char *dir) { struct _finddata_t file_s; long File_handle; char name[MAX_LEN], words[length]; int j,size; _chdir(dir); if( (File_handle = _findfirst( "*", &file_s )) == -1L ) { printf( "No files in current directory!\n" ); } else if (file_s.attrib & _A_NORMAL) { sprintf (name, "%s",dir); //root = addtree (root, name); //////////////// FILE *fp; fp = fopen(name, "r"); if(fp == NULL) { printf("\n\n Message from _A_NORMAL."); printf("\n\nERROR: could not open file"); exit(EXIT_FAILURE); } else while (fscanf(fp, "%s", &words)!= -1) //while not the end of the file { size = strlen(words); /*determines length of each string */ for(j = 0; j
Have you tried just navigating through the files/folders without adding anything to the tree data structure?
"Let us be thankful for the fools. But for them the rest of us could not succeed." - Mark Twain
"There is no death, only a change of worlds." - Native American Proverb
-
Hi, i written a console application from VC++, program is to generate a binary tree. program will take a directory as a input and generate a binary tree of words.. problem is if i give a small directory with 5 to 10 files program generates the binary tree properly if i select a big folder it gives below error can anyone help with this..??? ===================================================== This instruction at "0X77f8910e" referenced memory at "0xc7c7cf0".The memory could not be "read". Click OK to terminate the program Click on cancel to debug the program OK CANCEL ======================================================= Regards, Parichay.
It crashes at here:
} while (_findnext (File_handle, &file_s) == 0);
Maxwell Chen
-
Hi V2, i have sent again hope u get the solution. /// Program to Generate Binary Tree of multiple files and multiple words. #include #include #include #include #include #include #include #include #define MAXWORD 100 struct tnode *addtree(struct tnode *,char *); void treeprint(struct tnode *); #define length (80) struct tnode { char *word; struct tnode *left; struct tnode *right; }; struct tnode *root1 = NULL; struct tnode *talloc(void) { return (struct tnode *) malloc(sizeof(struct tnode)); } char *strdup(char *s) { char *p; p=(char *) malloc(strlen(s)+1); if(p!=NULL) strcpy(p,s); return p; } //addtree add a node with w at or below p struct tnode *addtree(struct tnode *p,char *w) { int cond; if(p==NULL) { p=talloc(); p->word=strdup(w); p->left=p->right=NULL; } else if((cond=strcmp(w,p->word)) == 0) ; else if(cond < 0) p->left=addtree(p->left,w); else p->right=addtree(p->right,w); return p; } // treeprint : in order void treeprint(struct tnode *p) { if(p!=NULL) { treeprint(p->left); printf("%s\n",p->word); treeprint(p->right); } } void ListWords (char *); #define MAX_LEN 100 int main () { char dir[] = "D://Paruichay//"; ListWords(dir); printf("\n\n\t\t Binary Tree :- Each Node Contains 1 word.\n\n"); treeprint(root1); return 0; } /////////Function to list words////// void ListWords (char *dir) { struct _finddata_t file_s; long File_handle; char name[MAX_LEN], words[length]; int j,size; _chdir(dir); if( (File_handle = _findfirst( "*", &file_s )) == -1L ) { printf( "No files in current directory!\n" ); } else if (file_s.attrib & _A_NORMAL) { sprintf (name, "%s",dir); //root = addtree (root, name); //////////////// FILE *fp; fp = fopen(name, "r"); if(fp == NULL) { printf("\n\n Message from _A_NORMAL."); printf("\n\nERROR: could not open file"); exit(EXIT_FAILURE); } else while (fscanf(fp, "%s", &words)!= -1) //while not the end of the file { size = strlen(words); /*determines length of each string */ for(j = 0; j
Why implement a binary tree yourself? Use
std::setorstd::multiset. Then you get a self balancing binary tree instead of you home spun version which isn't self balancing and thus can degenerate to linear rather then logarithmic performance. Your program is written at an unnecessarily low level - A common mistake with C++ programmers, especially those with a background in C (in my opinion). Steve -
Why implement a binary tree yourself? Use
std::setorstd::multiset. Then you get a self balancing binary tree instead of you home spun version which isn't self balancing and thus can degenerate to linear rather then logarithmic performance. Your program is written at an unnecessarily low level - A common mistake with C++ programmers, especially those with a background in C (in my opinion). SteveStephen Hewitt wrote:
Your program is written at an unnecessarily low level - A common mistake with C++ programmers, especially those with a background in C (in my opinion)
This is so true. It takes time for him to catch up this sense. But maybe he hadn't known the existing one,
std::set, to use. Sometimes it might be of fun to code one's own toy (BTree in this case) to enjoy how it works.
Maxwell Chen
-
It crashes at here:
} while (_findnext (File_handle, &file_s) == 0);
Maxwell Chen
Hi, Can u plz tell me how to correct the error??