Reply to thread

Message

<blockquote data-quote="Macbeth" data-source="post: 1483349" data-attributes="member: 11259">For a project in my CS class, I have created the following code to create a binary tree, and use that tree to encrypt information, using the scheme:0 - move one node left1 - move one node right2 - take the information from the current node.Now I know that the code probably has all kinds of logic errors, but at this point it won't compile! I get a &quot;PCH creation point&quot; error every time. in the past this has usually been becuase I missed a semicolon, but damn if I know where that is. So I'm asking for somebody to pleas tell me where this error is coming from! I'll fix the (likely plentifil) logic errors on my own, i just want to know why the damn thing won't compile:CryptoTree.h:[code]#include &lt;cstdlib&gt;#include &lt;ctime&gt;#include &lt;iostream&gt;#include &lt;string&gt;using namespace std;class Node {public:&nbsp; char data;&nbsp; Node *left;&nbsp; Node *right;&nbsp; Node (char inp) {&nbsp; &nbsp; data = inp;&nbsp; &nbsp; left&nbsp; = NULL;&nbsp; &nbsp; right = NULL;&nbsp; }};/*//////////////////////////////*/class CryptoTree {protected:&nbsp; Node *head;&nbsp; Node *nodeSearch (char info) {&nbsp; &nbsp; Node *temp = head;&nbsp; &nbsp; Node *decide = head;&nbsp; &nbsp; while (decide != NULL) {&nbsp; &nbsp; &nbsp; temp = decide;&nbsp; &nbsp; &nbsp; if (info &lt; temp-&gt;data)&nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; decide = decide-&gt;left;&nbsp; &nbsp; &nbsp; } else {&nbsp; &nbsp; &nbsp; &nbsp; decide = decide-&gt;right;&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; int search (Node *position, char info) {&nbsp; &nbsp; if (position != NULL) {&nbsp; &nbsp; &nbsp; if (search (position-&gt;left, info) == 1 || position-&gt;data == info || search (position-&gt;right, info) == 1){&nbsp; &nbsp; return(1);&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; return(0);&nbsp; }&nbsp; string outSearch(Node *pos, char info, string out) {&nbsp; &nbsp; string leftstring = out + &quot;0&quot;;&nbsp; &nbsp; string rightstring = out + &quot;1&quot;;&nbsp; &nbsp; if ( pos != NULL ){&nbsp; &nbsp; &nbsp; if(pos-&gt;data == info){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; return(out);&nbsp; &nbsp; &nbsp; } else {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; out = outSearch(pos-&gt;left, info, leftstring);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; out = outSearch(pos-&gt;right, info, rightstring);&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; return(out);&nbsp; } &nbsp; int treeFull(){&nbsp; &nbsp; &nbsp; int i;&nbsp; &nbsp; for ( i = 48; i &lt; 91; i++) {&nbsp; &nbsp; &nbsp; &nbsp; if( search(head, ((char)i)) == 0){&nbsp; &nbsp; return(0);&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; return(1);&nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; void keyPrint(Node *target, string code) {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; string leftcode = code + &quot;0&quot;;&nbsp; &nbsp; &nbsp; string rightcode = code + &quot;1&quot;;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(target-&gt;left != NULL){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; keyPrint(target-&gt;left, leftcode);&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; cout &lt;&lt; code &lt;&lt; &quot;2 - &quot; &lt;&lt; target-&gt;data &lt;&lt; endl;&nbsp; &nbsp; &nbsp; if(target-&gt;right != NULL){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; keyPrint(target-&gt;right, rightcode);&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; return;&nbsp; }public:&nbsp; CryptoTree () {&nbsp; &nbsp; srand(static_cast&lt;unsigned&gt;(time(0)));&nbsp; &nbsp; char rand;&nbsp; &nbsp; int irand;&nbsp; &nbsp; while(treeFull == 0){&nbsp; &nbsp; &nbsp; &nbsp; irand = (48 + ((int) 43 * rand() / (RAND_MAX + 1.0)));&nbsp; &nbsp; &nbsp; &nbsp; rand = (char)irand;&nbsp; &nbsp; &nbsp; &nbsp; insert(rand);&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; } // constructor&nbsp; void insert (char inp) {&nbsp; &nbsp; Node *temp = new Node (inp);&nbsp; &nbsp; if (head == NULL) {&nbsp; &nbsp; &nbsp; head = temp;&nbsp; &nbsp; } else {&nbsp; &nbsp; &nbsp; Node *seek = nodeSearch (temp-&gt;data);&nbsp;&nbsp; &nbsp; &nbsp; &nbsp; if (temp-&gt;data &lt; seek-&gt;data) {&nbsp; &nbsp; &nbsp; &nbsp; seek-&gt;left = temp;&nbsp; &nbsp; &nbsp; } else {&nbsp; &nbsp; &nbsp; &nbsp; seek-&gt;right = temp;&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; }&nbsp; &nbsp; return;&nbsp; } // insert&nbsp; void returnKey(){&nbsp; &nbsp; &nbsp; string init;&nbsp; &nbsp; &nbsp; init = &quot; &quot;;&nbsp; &nbsp; &nbsp; cout &lt;&lt; &quot;Encryption Key:&quot; &lt;&lt; endl;&nbsp; &nbsp; &nbsp; printKey(head, init);&nbsp; &nbsp; &nbsp; return;&nbsp; }&nbsp; string encrypt(string input){&nbsp; &nbsp; char targ;&nbsp; &nbsp; string starter = &quot;&quot;;&nbsp; &nbsp; int max = input.length();&nbsp; &nbsp; int j;&nbsp; &nbsp; &nbsp; &nbsp; for( j = 0; j &lt; max; j++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; targ = input[j];&nbsp; &nbsp; &nbsp; &nbsp; starter = starter + outSearch(head, targ, starter);&nbsp; &nbsp; }&nbsp; &nbsp; return(starter);&nbsp; }&nbsp; string decrypt(string input){&nbsp; &nbsp; &nbsp; int max;&nbsp; &nbsp; &nbsp; int k;&nbsp; &nbsp; &nbsp; node *trav;&nbsp; &nbsp; &nbsp; string out;&nbsp; &nbsp; &nbsp; trav = head;&nbsp; &nbsp; &nbsp; max = input.length();&nbsp; &nbsp; &nbsp; out = &quot;&quot;; &nbsp; &nbsp; &nbsp; for(k = 0; k &lt; max; k++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(input[k] == 2){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; out = out + (trav-&gt;data);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else if(input[k] == 0){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; trav = trav-&gt;left;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }else{&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; trav = trav-&gt;right;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; return(out);&nbsp; }};[/code]cryptoTest.cpp:[code]#include &quot;Crypto.h&quot;int main() {&nbsp; &nbsp; CryptoTree Trial;&nbsp; &nbsp; Trial.returnKey();&nbsp; &nbsp; return(0);}[/code]I know the lack of commenting is horrible, I was goign to comment it once I had working code. I'll try commenting it now, and post an easier to read version in a while, if nobody can read the code as is.</blockquote>

[QUOTE="Macbeth, post: 1483349, member: 11259"] For a project in my CS class, I have created the following code to create a binary tree, and use that tree to encrypt information, using the scheme: 0 - move one node left 1 - move one node right 2 - take the information from the current node. Now I know that the code probably has all kinds of logic errors, but at this point it won't compile! I get a "PCH creation point" error every time. in the past this has usually been becuase I missed a semicolon, but damn if I know where that is. So I'm asking for somebody to pleas tell me where this error is coming from! I'll fix the (likely plentifil) logic errors on my own, i just want to know why the damn thing won't compile: CryptoTree.h: [code] #include <cstdlib> #include <ctime> #include <iostream> #include <string> using namespace std; class Node { public: char data; Node *left; Node *right; Node (char inp) { data = inp; left = NULL; right = NULL; } }; /*//////////////////////////////*/ class CryptoTree { protected: Node *head; Node *nodeSearch (char info) { Node *temp = head; Node *decide = head; while (decide != NULL) { temp = decide; if (info < temp->data) { decide = decide->left; } else { decide = decide->right; } } int search (Node *position, char info) { if (position != NULL) { if (search (position->left, info) == 1 || position->data == info || search (position->right, info) == 1){ return(1); } } return(0); } string outSearch(Node *pos, char info, string out) { string leftstring = out + "0"; string rightstring = out + "1"; if ( pos != NULL ){ if(pos->data == info){ return(out); } else { out = outSearch(pos->left, info, leftstring); out = outSearch(pos->right, info, rightstring); } } return(out); } int treeFull(){ int i; for ( i = 48; i < 91; i++) { if( search(head, ((char)i)) == 0){ return(0); } } return(1); } void keyPrint(Node *target, string code) { string leftcode = code + "0"; string rightcode = code + "1"; if(target->left != NULL){ keyPrint(target->left, leftcode); } cout << code << "2 - " << target->data << endl; if(target->right != NULL){ keyPrint(target->right, rightcode); } return; } public: CryptoTree () { srand(static_cast<unsigned>(time(0))); char rand; int irand; while(treeFull == 0){ irand = (48 + ((int) 43 * rand() / (RAND_MAX + 1.0))); rand = (char)irand; insert(rand); } } // constructor void insert (char inp) { Node *temp = new Node (inp); if (head == NULL) { head = temp; } else { Node *seek = nodeSearch (temp->data); if (temp->data < seek->data) { seek->left = temp; } else { seek->right = temp; } } return; } // insert void returnKey(){ string init; init = " "; cout << "Encryption Key:" << endl; printKey(head, init); return; } string encrypt(string input){ char targ; string starter = ""; int max = input.length(); int j; for( j = 0; j < max; j++){ targ = input[j]; starter = starter + outSearch(head, targ, starter); } return(starter); } string decrypt(string input){ int max; int k; node *trav; string out; trav = head; max = input.length(); out = ""; for(k = 0; k < max; k++){ if(input[k] == 2){ out = out + (trav->data); }else if(input[k] == 0){ trav = trav->left; }else{ trav = trav->right; } } return(out); } }; [/code] cryptoTest.cpp: [code] #include "Crypto.h" int main() { CryptoTree Trial; Trial.returnKey(); return(0); } [/code] I know the lack of commenting is horrible, I was goign to comment it once I had working code. I'll try commenting it now, and post an easier to read version in a while, if nobody can read the code as is. [/QUOTE]

Verification