Can You Help Me Plz!

[kanwar]

Im just hoping that this room will actualy help me so much. Hm, Im Roldan of Philippines still studying Computer Enginnering and we’re given task to make a data structure program that has a menu and in menu.. we can have a choice to select options by which each option realy have huge size of programming codes.

Like Array of LInked List, how should i put that program in the whole fuse program in the menu. Plz help me how to do this. For more clarrification, here is an output illustration:

/ ****MENU*****
Press:

1 to insert node at the beginning.
2 to insert node at the middle.
3 to delete the node.
4 for array of linked list
5 for doubly link list
6. for circularly linked list
7 append linked list
8 to exit./

so plz me here. Send me best websites that will give best and fit answers for my problem. Hope you can help me here.. The core of my problem is the concept of fusing or inserting the huge programs like circularly in a one program…

Thank you and Godbless
Plz do replies coz i need it this week!

[Humayan]

Heres some code I found on my hard drive :
 

#include<iostream.h><br /> //simple list<br /> struct node<br /> {<br />  int i;<br />  node * next;<br /> };<br /> void print ( node * );<br /> void addBack ( int , node *&#038;  , node *&#038; );<br /> void addFront ( int , node *&#038; , node *&#038; );<br /> void destroy ( node *&#038; );<br /> void main()<br /> {<br />  node * head = NULL;<br />  node * tail = NULL;<br />  char choice;<br />  int i;<br />  do<br />  {<br />   cout << "choose an operation: " << endl;<br />   cout << "1. add a node to back of list" << endl;<br />   cout << "2. add a node to front of list" << endl;<br />   cout << "3. print the list. " << endl;<br />   cout << "4. exit " << endl;<br />   cin >> choice;<br />   cin.get();<br />   cout << endl;<br />   switch ( choice )<br />   {<br />    case '1':<br />    {<br />     cout << " enter an integer : " ;<br />     cin >> i;<br />     addBack ( i , head , tail );<br />    };<br />    break;<br />    case '2':<br />    {<br />     cout << " enter an integer : " ;<br />     cin >> i;<br />     addFront ( i , head , tail );<br />    };<br />    break;<br />    case '3':<br />    {<br />     print ( head );<br />    };<br />    break;<br />    case '4':<br />    {<br />     cout <<"goodbye!" << endl;<br />    };<br />    break;<br />    default: cout << "bad choice !" << endl;<br />   <br />   };<br />   cout << endl;<br />  }<br />  while ( choice != '4' );<br />  destroy ( head ); <br />  <br />  <br /> }<br /> void print ( node * r )<br /> {<br />  node * t = r;<br />  cout << "This is the list: " << endl;<br />  <br />  while ( t != NULL )<br />  {<br />   cout << " " << t -> i << " ";<br />   t = t -> next;<br />  }<br />  cout << endl;<br /> }<br /> void addBack ( int n , node *&#038; h  , node *&#038; t )<br /> {<br />  if ( h == NULL )<br />  {<br />   h = t = new node;<br />   t -> i = n;<br />   t -> next = NULL;<br />  }<br />  else<br />  {<br />   <br />   t -> next = new node;<br />   t -> next -> i = n;<br />   t -> next -> next = NULL;<br />   t = t -> next;<br />  <br />  }<br /> }<br /> void addFront ( int n , node *&#038; h , node *&#038; t )<br /> {<br />  if ( h == NULL ) //empty list<br />  {<br />   <br />   h = t = new node;<br />   t -> i = n;<br />   t -> next = NULL;<br />  }<br />  else //add to front<br />  {<br />   node * temp = h;<br />   <br />   h = new node;<br />   h -> i = n;<br />   h -> next = temp;<br />  }<br /> }<br /> void destroy ( node *&#038; h )<br /> {<br />  node * temp;<br />  while ( h != NULL )<br />  {<br />   temp = h;<br />   h = h -> next;<br />   delete temp;<br />  }<br /> }

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121

#include<iostream.h><br /> //simple list<br /> struct node<br /> {<br />  int i;<br />  node * next;<br /> };<br /> void print ( node * );<br /> void addBack ( int , node *&#038;  , node *&#038; );<br /> void addFront ( int , node *&#038; , node *&#038; );<br /> void destroy ( node *&#038; );<br /> void main()<br /> {<br />  node * head = NULL;<br />  node * tail = NULL;<br />  char choice;<br />  int i;<br />  do<br />  {<br />   cout << "choose an operation: " << endl;<br />   cout << "1. add a node to back of list" << endl;<br />   cout << "2. add a node to front of list" << endl;<br />   cout << "3. print the list. " << endl;<br />   cout << "4. exit " << endl;<br />   cin >> choice;<br />   cin.get();<br />   cout << endl;<br />   switch ( choice )<br />   {<br />    case '1':<br />    {<br />     cout << " enter an integer : " ;<br />     cin >> i;<br />     addBack ( i , head , tail );<br />    };<br />    break;<br />    case '2':<br />    {<br />     cout << " enter an integer : " ;<br />     cin >> i;<br />     addFront ( i , head , tail );<br />    };<br />    break;<br />    case '3':<br />    {<br />     print ( head );<br />    };<br />    break;<br />    case '4':<br />    {<br />     cout <<"goodbye!" << endl;<br />    };<br />    break;<br />    default: cout << "bad choice !" << endl;<br />   <br />   };<br />   cout << endl;<br />  }<br />  while ( choice != '4' );<br />  destroy ( head ); <br />  <br />  <br /> }<br /> void print ( node * r )<br /> {<br />  node * t = r;<br />  cout << "This is the list: " << endl;<br />  <br />  while ( t != NULL )<br />  {<br />   cout << " " << t -> i << " ";<br />   t = t -> next;<br />  }<br />  cout << endl;<br /> }<br /> void addBack ( int n , node *&#038; h  , node *&#038; t )<br /> {<br />  if ( h == NULL )<br />  {<br />   h = t = new node;<br />   t -> i = n;<br />   t -> next = NULL;<br />  }<br />  else<br />  {<br />   <br />   t -> next = new node;<br />   t -> next -> i = n;<br />   t -> next -> next = NULL;<br />   t = t -> next;<br />  <br />  }<br /> }<br /> void addFront ( int n , node *&#038; h , node *&#038; t )<br /> {<br />  if ( h == NULL ) //empty list<br />  {<br />   <br />   h = t = new node;<br />   t -> i = n;<br />   t -> next = NULL;<br />  }<br />  else //add to front<br />  {<br />   node * temp = h;<br />   <br />   h = new node;<br />   h -> i = n;<br />   h -> next = temp;<br />  }<br /> }<br /> void destroy ( node *&#038; h )<br /> {<br />  node * temp;<br />  while ( h != NULL )<br />  {<br />   temp = h;<br />   h = h -> next;<br />   delete temp;<br />  }<br /> }

[Humayan]

Heres a quick translation into c:
 

#include < stdlib.h ><br /> #include < stdio.h ><br /> //simple list<br /> typedef struct nodeType<br /> {<br />  int i;<br />  struct nodeType * next;<br /> } node;<br /> void print ( node * );<br /> void addBack ( int , node **  , node ** );<br /> void addFront ( int , node ** , node ** );<br /> void destroy ( node ** );<br /> void main()<br /> {<br />  node * head = NULL;<br />  node * tail = NULL;<br />  char choice;<br />  char newline;<br />  int i;<br />  do<br />  {<br />   printf ( "choose an operation: n" );<br />   printf ( "1. add a node to back of list n" );<br />   printf ( "2. add a node to front of list n" );<br />   printf ( "3. print the list. n" );<br />   printf ( "4. exit n" );<br />   choice = getchar ();<br />   newline = getchar ();<br />   printf ( "n" );<br />   switch ( choice )<br />   {<br />    case '1':<br />    {<br />     printf ( "enter an integer : n" );<br />     scanf ( "%d",&#038; i );<br />     addBack ( i , &#038; head , &#038; tail );<br />     newline = getchar ();<br />    };<br />    break;<br />    case '2':<br />    {<br />     printf ( "enter an integer : n" );<br />     scanf ( "%d",&#038; i );<br />     addFront ( i , &#038; head , &#038; tail );<br />     newline = getchar ();<br />    };<br />    break;<br />    case '3':<br />    {<br />     print ( head );<br />    };<br />    break;<br />    case '4':<br />    {<br />     printf ( "goodbye! n" );<br />    };<br />    break;<br />    default: printf ( "bad choice ! n" );<br />   <br />   };<br />   printf ( "n" );<br />  }<br />  while ( choice != '4' );<br />  destroy ( &#038; head ); <br />  <br />  <br /> }<br /> void print ( node * r )<br /> {<br />  node * t = r;<br />  printf ( "This is the list: n" );<br />  <br />  while ( t != NULL )<br />  {<br />   printf ( "%c" ," " );<br />   printf ( "%i" , t -> i );<br />   printf ( "%c" , " " );<br />   t = t -> next;<br />  }<br />  printf ( "n" );<br /> }<br /> void addBack ( int n , node ** h  , node ** t )<br /> {<br />  if ( ( * h  ) == NULL )<br />  {<br />   ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br />   ( * t ) -> i = n;<br />   ( * t ) -> next = NULL;<br />  }<br />  else<br />  {<br />   <br />   ( * t ) -> next = malloc ( sizeof ( node ) );<br />   ( * t ) -> next -> i = n;<br />   ( * t ) -> next -> next = NULL;<br />   ( * t ) = ( * t ) -> next;<br />  <br />  }<br /> }<br /> void addFront ( int n , node ** h , node ** t )<br /> {<br />  if ( ( * h ) == NULL ) //empty list<br />  {<br />   <br />   ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br />   ( * t ) -> i = n;<br />   ( * t ) -> next = NULL;<br />  }<br />  else //add to front<br />  {<br />   node * temp = ( * h );<br />   <br />   ( * h ) = malloc ( sizeof ( node ) );<br />   ( * h ) -> i = n;<br />   ( * h ) -> next = temp;<br />  }<br /> }<br /> void destroy ( node ** h )<br /> {<br />  node * temp;<br />  while ( ( * h ) != NULL )<br />  {<br />   temp = ( * h );<br />   ( * h ) = ( * h ) -> next;<br />   free ( temp );<br />  }<br /> }

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127

#include < stdlib.h ><br /> #include < stdio.h ><br /> //simple list<br /> typedef struct nodeType<br /> {<br />  int i;<br />  struct nodeType * next;<br /> } node;<br /> void print ( node * );<br /> void addBack ( int , node **  , node ** );<br /> void addFront ( int , node ** , node ** );<br /> void destroy ( node ** );<br /> void main()<br /> {<br />  node * head = NULL;<br />  node * tail = NULL;<br />  char choice;<br />  char newline;<br />  int i;<br />  do<br />  {<br />   printf ( "choose an operation: n" );<br />   printf ( "1. add a node to back of list n" );<br />   printf ( "2. add a node to front of list n" );<br />   printf ( "3. print the list. n" );<br />   printf ( "4. exit n" );<br />   choice = getchar ();<br />   newline = getchar ();<br />   printf ( "n" );<br />   switch ( choice )<br />   {<br />    case '1':<br />    {<br />     printf ( "enter an integer : n" );<br />     scanf ( "%d",&#038; i );<br />     addBack ( i , &#038; head , &#038; tail );<br />     newline = getchar ();<br />    };<br />    break;<br />    case '2':<br />    {<br />     printf ( "enter an integer : n" );<br />     scanf ( "%d",&#038; i );<br />     addFront ( i , &#038; head , &#038; tail );<br />     newline = getchar ();<br />    };<br />    break;<br />    case '3':<br />    {<br />     print ( head );<br />    };<br />    break;<br />    case '4':<br />    {<br />     printf ( "goodbye! n" );<br />    };<br />    break;<br />    default: printf ( "bad choice ! n" );<br />   <br />   };<br />   printf ( "n" );<br />  }<br />  while ( choice != '4' );<br />  destroy ( &#038; head ); <br />  <br />  <br /> }<br /> void print ( node * r )<br /> {<br />  node * t = r;<br />  printf ( "This is the list: n" );<br />  <br />  while ( t != NULL )<br />  {<br />   printf ( "%c" ," " );<br />   printf ( "%i" , t -> i );<br />   printf ( "%c" , " " );<br />   t = t -> next;<br />  }<br />  printf ( "n" );<br /> }<br /> void addBack ( int n , node ** h  , node ** t )<br /> {<br />  if ( ( * h  ) == NULL )<br />  {<br />   ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br />   ( * t ) -> i = n;<br />   ( * t ) -> next = NULL;<br />  }<br />  else<br />  {<br />   <br />   ( * t ) -> next = malloc ( sizeof ( node ) );<br />   ( * t ) -> next -> i = n;<br />   ( * t ) -> next -> next = NULL;<br />   ( * t ) = ( * t ) -> next;<br />  <br />  }<br /> }<br /> void addFront ( int n , node ** h , node ** t )<br /> {<br />  if ( ( * h ) == NULL ) //empty list<br />  {<br />   <br />   ( * h ) = ( * t ) = malloc ( sizeof ( node ) );<br />   ( * t ) -> i = n;<br />   ( * t ) -> next = NULL;<br />  }<br />  else //add to front<br />  {<br />   node * temp = ( * h );<br />   <br />   ( * h ) = malloc ( sizeof ( node ) );<br />   ( * h ) -> i = n;<br />   ( * h ) -> next = temp;<br />  }<br /> }<br /> void destroy ( node ** h )<br /> {<br />  node * temp;<br />  while ( ( * h ) != NULL )<br />  {<br />   temp = ( * h );<br />   ( * h ) = ( * h ) -> next;<br />   free ( temp );<br />  }<br /> }

[kanwar]

Mr Cman how can I insert the stack programs in the menu programs that I asked u last time?

[Humayan]

You want to add a stack to the program? Heres a stack I wrote for another project:
 

/****************************************************************<br /> * File Name : c:programshelpshell.cpp<br /> * Date : December,26,2007<br /> * Comments : new project<br /> * Compiler/Assembler :<br /> * Program Shell Generated At: 3:08:45 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> #include < iostream ><br /> //#include < string.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> using namespace std;<br /> struct stackNode<br /> {<br />  fretNode * current;<br />  fretNode * first;<br />  fretNode * last;<br />  int repeats;<br />  stackNode * next;<br /> };<br /> struct stateNode<br /> {<br />     fretNode * fp;<br />     fretNode * cp;<br />     fretNode * cfp;<br />     fretNode * cbp;<br />     stackNode * cs;<br />     stackNode * fs;<br />     stateNode * next;<br /> };<br />  <br /> <br /> //>>>>>>>>>>>>>>>>>>>>>>>> GLOBAL DATA <<<<<<<<<<<<<<<<<<<<<<<<<<br />     bool stackError = false;<br /> //<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<br />  <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br />  bool push  ( stackNode *&#038; stack , fretNode * current , fretNode * first , fretNode * last , int repeats );<br />  bool pop   ( stackNode *&#038; stack );<br />  void clear ( stackNode *&#038; stack );<br />  bool copy ( stackNode *&#038; destination , stackNode * source );<br />    // stackNode * clone ( stackNode * stackToClone );<br />     bool pushState ( stateNode *&#038; stack , fretNode * currentPattern , fretNode * currentFrontPattern , fretNode * currentBackPattern , stackNode * currentStack , stackNode * frontStack );<br />     bool popState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack );<br />  void clear ( stateNode *&#038; stack );<br />  bool copy ( stateNode *&#038; destination , stateNode * source );<br />     void setState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack );<br /> //##################################################################################<br />  <br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : push<br />  Parameters :<br />   current a(n) fretNode * ( fretNode * )  ,<br />   first a(n) fretNode * ( fretNode * )  ,<br />   last a(n) fretNode * ( fretNode * )  ,<br />   repeats a(n) int<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool push ( stackNode *&#038; stack , fretNode * current , fretNode * first , fretNode * last , int repeats )<br /> {<br />     stackNode * s = new stackNode;<br />     if ( ! s )<br />     {<br />         stackError = true;<br />         return false;<br />     }<br />     s -> current = current;<br />     s -> first = first;<br />     s -> last = last;<br />     s -> repeats = repeats;<br />     s -> next = stack;<br />  stack = s;<br />  <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : pop<br />  Parameters :<br />   void<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool pop ( stackNode *&#038; stack  )<br /> {<br />     if ( stack )<br />     {<br />         stackNode * temp = stack;<br />         stack = stack -> next;<br />         delete temp;<br />       <br />         return true;<br />     }<br />     return false;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : clear<br />  Parameters :<br />   void<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void clear ( stackNode *&#038; stack )<br /> {<br />     stackNode * temp;<br />    <br />     while ( stack )<br />     {<br />         temp = stack;<br />         stack = stack -> next;<br />         delete temp;<br />     }<br />     stack = 0;<br />     return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : copy<br />  Parameters :<br />   destination a(n) stackNode * ( stackNode * )  ,<br />   source a(n) stackNode ( stackNode )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool copy ( stackNode *&#038; destination , stackNode * source )<br /> {<br />     int i = 0;<br />     stackNode * last = 0;<br />    <br />     destination = 0;<br />    <br />     while ( source )<br />     {<br />         stackNode * s = new stackNode;<br />         if ( ! s )<br />         {<br />             stackError = true;<br />             return false;<br />         }<br />         if ( i == 0 )<br />         {<br />             destination = s;<br />             i ++;<br />         }<br />         if ( last )<br />             last -> next = s;<br />        <br />        <br />         s -> current = source -> current;<br />         s -> first = source -> first;<br />      s -> last = source -> last;<br />         s -> repeats = source -> repeats;<br />         s -> next = 0;<br />         last = s;<br />         source = source -> next;<br />  }<br />  <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : pushState<br />  Parameters :<br />   stack a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   frontPattern a(n) stateNode * ( stateNode * )  ,<br />   currentPattern a(n) stateNode * ( stateNode * )  ,<br />   currentFrontPattern a(n) stateNode * ( stateNode * )  ,<br />   currentBackPattern a(n) stateNode * ( stateNode * )  ,<br />   currentStack a(n) stackNode * ( stackNode * )  ,<br />   frontStack a(n) stackNode * ( stackNode * )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool pushState ( stateNode *&#038; stack , fretNode * currentPattern , fretNode * currentFrontPattern , fretNode * currentBackPattern , stackNode * currentStack , stackNode * frontStack )<br /> {<br />    <br />     stateNode * s = new stateNode;<br />     if ( ! s )<br />     {<br />         stackError = true;<br />         return false;<br />     }<br />    <br />    // s -> fp = frontPattern;<br />     s -> cp = currentPattern;<br />     s -> cfp = currentFrontPattern;<br />     s -> cbp = currentBackPattern;<br />     copy ( s -> cs , currentStack );<br />     copy ( s -> fs , frontStack );<br />     s -> next = stack;<br />     stack = s;<br /> <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : popState<br />  Parameters :<br />   stack a(n) stackNode * ( stackNode * )  ,<br />   frontPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentFrontPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentBackPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentStack a(n) stackNode *&#038; ( stackNode *&#038; )  ,<br />   frontStack a(n) stackNode *&#038; ( stackNode *&#038; )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool popState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack )<br /> {<br />     if ( stack == 0 )<br />     {<br />         return false;<br />     }<br />    <br />    // frontPattern = stack -> fp;<br />     currentPattern = stack -> cp;<br />     currentFrontPattern = stack -> cfp;<br />     currentBackPattern = stack -> cbp;<br />     currentStack = stack -> cs;<br />     frontStack = stack -> fs;<br />     stack = stack -> next;<br />    <br />     return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : clear<br />  Parameters :<br />   void<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void clear ( stateNode *&#038; stack )<br /> {<br />     stateNode * temp;<br />    <br />     while ( stack )<br />     {<br />         temp = stack;<br />         stack = stack -> next;<br />         clear ( temp -> cs );<br />         clear ( temp -> fs );<br />         delete temp;<br />     }<br />     stack = 0;<br />     return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : copy<br />  Parameters :<br />   destination a(n) stackNode * ( stackNode * )  ,<br />   source a(n) stackNode ( stackNode )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool copy ( stateNode *&#038; destination , stateNode * source )<br /> {<br />     int i = 0;<br />     stateNode * last = 0;<br />    <br />     destination = 0;<br />     while ( source )<br />     {<br />         stateNode * s = new stateNode;<br />         if ( ! s )<br />         {<br />             stackError = true;<br />             return false;<br />         }<br />         if ( i == 0 )<br />         {<br />             destination = s;<br />             i ++;<br />         }<br />         if ( last )<br />             last -> next = s;<br />        <br />         //s -> fp = source -> fp;<br />         s -> cp = source -> cp;<br />         s -> cfp = source -> cfp;<br />      s -> cbp = source -> cbp;<br />         copy ( s -> cs , source -> cs );<br />         copy ( s -> fs , source -> fs );<br />         s -> next = 0;<br />         last = s;<br />         source = source -> next;<br />  }<br />  <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : setState<br />  Parameters :<br />   stack a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentPattern a(n) fretNode *&#038; ( fretNode *&#038; )  ,<br />   currentFrontPattern a(n) fretNode *&#038; ( fretNode *&#038; )  ,<br />   currentBackPattern a(n) fretNode *&#038; ( fretNode *&#038; )  ,<br />   currentStack a(n) stackNode *&#038; ( stackNode *&#038; )  ,<br />   frontStack a(n) stackNode *&#038; ( stackNode *&#038; )<br /> <br />  Returns: user defined type , void<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void setState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack )<br /> {<br />     currentPattern = stack -> cp;<br />     currentFrontPattern = stack -> cfp;<br />  currentBackPattern = stack -> cbp;<br />     currentStack = stack -> cs;<br />     frontStack = stack -> fs;<br />  return;<br /> }

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330

/****************************************************************<br /> * File Name : c:programshelpshell.cpp<br /> * Date : December,26,2007<br /> * Comments : new project<br /> * Compiler/Assembler :<br /> * Program Shell Generated At: 3:08:45 p.m.<br /> =-=-=-=-=-=-=-=--=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/<br /> <br /> #include < iostream ><br /> //#include < string.h ><br /> //#include < conio.h ><br /> //#include < math.h ><br /> //#include < iomanip ><br /> //#include < ctype.h ><br /> using namespace std;<br /> struct stackNode<br /> {<br />  fretNode * current;<br />  fretNode * first;<br />  fretNode * last;<br />  int repeats;<br />  stackNode * next;<br /> };<br /> struct stateNode<br /> {<br />     fretNode * fp;<br />     fretNode * cp;<br />     fretNode * cfp;<br />     fretNode * cbp;<br />     stackNode * cs;<br />     stackNode * fs;<br />     stateNode * next;<br /> };<br />  <br /> <br /> //>>>>>>>>>>>>>>>>>>>>>>>> GLOBAL DATA <<<<<<<<<<<<<<<<<<<<<<<<<<br />     bool stackError = false;<br /> //<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<br />  <br /> //@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@ FUNCTION PROTOTYPES @@@@@@@@@@@@@@@@@@@@@@@@@@<br />  bool push  ( stackNode *&#038; stack , fretNode * current , fretNode * first , fretNode * last , int repeats );<br />  bool pop   ( stackNode *&#038; stack );<br />  void clear ( stackNode *&#038; stack );<br />  bool copy ( stackNode *&#038; destination , stackNode * source );<br />    // stackNode * clone ( stackNode * stackToClone );<br />     bool pushState ( stateNode *&#038; stack , fretNode * currentPattern , fretNode * currentFrontPattern , fretNode * currentBackPattern , stackNode * currentStack , stackNode * frontStack );<br />     bool popState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack );<br />  void clear ( stateNode *&#038; stack );<br />  bool copy ( stateNode *&#038; destination , stateNode * source );<br />     void setState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack );<br /> //##################################################################################<br />  <br /> <br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : push<br />  Parameters :<br />   current a(n) fretNode * ( fretNode * )  ,<br />   first a(n) fretNode * ( fretNode * )  ,<br />   last a(n) fretNode * ( fretNode * )  ,<br />   repeats a(n) int<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool push ( stackNode *&#038; stack , fretNode * current , fretNode * first , fretNode * last , int repeats )<br /> {<br />     stackNode * s = new stackNode;<br />     if ( ! s )<br />     {<br />         stackError = true;<br />         return false;<br />     }<br />     s -> current = current;<br />     s -> first = first;<br />     s -> last = last;<br />     s -> repeats = repeats;<br />     s -> next = stack;<br />  stack = s;<br />  <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : pop<br />  Parameters :<br />   void<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool pop ( stackNode *&#038; stack  )<br /> {<br />     if ( stack )<br />     {<br />         stackNode * temp = stack;<br />         stack = stack -> next;<br />         delete temp;<br />       <br />         return true;<br />     }<br />     return false;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : clear<br />  Parameters :<br />   void<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void clear ( stackNode *&#038; stack )<br /> {<br />     stackNode * temp;<br />    <br />     while ( stack )<br />     {<br />         temp = stack;<br />         stack = stack -> next;<br />         delete temp;<br />     }<br />     stack = 0;<br />     return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : copy<br />  Parameters :<br />   destination a(n) stackNode * ( stackNode * )  ,<br />   source a(n) stackNode ( stackNode )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool copy ( stackNode *&#038; destination , stackNode * source )<br /> {<br />     int i = 0;<br />     stackNode * last = 0;<br />    <br />     destination = 0;<br />    <br />     while ( source )<br />     {<br />         stackNode * s = new stackNode;<br />         if ( ! s )<br />         {<br />             stackError = true;<br />             return false;<br />         }<br />         if ( i == 0 )<br />         {<br />             destination = s;<br />             i ++;<br />         }<br />         if ( last )<br />             last -> next = s;<br />        <br />        <br />         s -> current = source -> current;<br />         s -> first = source -> first;<br />      s -> last = source -> last;<br />         s -> repeats = source -> repeats;<br />         s -> next = 0;<br />         last = s;<br />         source = source -> next;<br />  }<br />  <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : pushState<br />  Parameters :<br />   stack a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   frontPattern a(n) stateNode * ( stateNode * )  ,<br />   currentPattern a(n) stateNode * ( stateNode * )  ,<br />   currentFrontPattern a(n) stateNode * ( stateNode * )  ,<br />   currentBackPattern a(n) stateNode * ( stateNode * )  ,<br />   currentStack a(n) stackNode * ( stackNode * )  ,<br />   frontStack a(n) stackNode * ( stackNode * )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool pushState ( stateNode *&#038; stack , fretNode * currentPattern , fretNode * currentFrontPattern , fretNode * currentBackPattern , stackNode * currentStack , stackNode * frontStack )<br /> {<br />    <br />     stateNode * s = new stateNode;<br />     if ( ! s )<br />     {<br />         stackError = true;<br />         return false;<br />     }<br />    <br />    // s -> fp = frontPattern;<br />     s -> cp = currentPattern;<br />     s -> cfp = currentFrontPattern;<br />     s -> cbp = currentBackPattern;<br />     copy ( s -> cs , currentStack );<br />     copy ( s -> fs , frontStack );<br />     s -> next = stack;<br />     stack = s;<br /> <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : popState<br />  Parameters :<br />   stack a(n) stackNode * ( stackNode * )  ,<br />   frontPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentFrontPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentBackPattern a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentStack a(n) stackNode *&#038; ( stackNode *&#038; )  ,<br />   frontStack a(n) stackNode *&#038; ( stackNode *&#038; )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool popState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack )<br /> {<br />     if ( stack == 0 )<br />     {<br />         return false;<br />     }<br />    <br />    // frontPattern = stack -> fp;<br />     currentPattern = stack -> cp;<br />     currentFrontPattern = stack -> cfp;<br />     currentBackPattern = stack -> cbp;<br />     currentStack = stack -> cs;<br />     frontStack = stack -> fs;<br />     stack = stack -> next;<br />    <br />     return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : clear<br />  Parameters :<br />   void<br /> <br />  Returns: Void type<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void clear ( stateNode *&#038; stack )<br /> {<br />     stateNode * temp;<br />    <br />     while ( stack )<br />     {<br />         temp = stack;<br />         stack = stack -> next;<br />         clear ( temp -> cs );<br />         clear ( temp -> fs );<br />         delete temp;<br />     }<br />     stack = 0;<br />     return;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : copy<br />  Parameters :<br />   destination a(n) stackNode * ( stackNode * )  ,<br />   source a(n) stackNode ( stackNode )<br /> <br />  Returns: user defined type , bool<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> bool copy ( stateNode *&#038; destination , stateNode * source )<br /> {<br />     int i = 0;<br />     stateNode * last = 0;<br />    <br />     destination = 0;<br />     while ( source )<br />     {<br />         stateNode * s = new stateNode;<br />         if ( ! s )<br />         {<br />             stackError = true;<br />             return false;<br />         }<br />         if ( i == 0 )<br />         {<br />             destination = s;<br />             i ++;<br />         }<br />         if ( last )<br />             last -> next = s;<br />        <br />         //s -> fp = source -> fp;<br />         s -> cp = source -> cp;<br />         s -> cfp = source -> cfp;<br />      s -> cbp = source -> cbp;<br />         copy ( s -> cs , source -> cs );<br />         copy ( s -> fs , source -> fs );<br />         s -> next = 0;<br />         last = s;<br />         source = source -> next;<br />  }<br />  <br />  return true;<br /> }<br /> /******************************* FUNCTION DEFINITION ******************************<br />  Name : setState<br />  Parameters :<br />   stack a(n) stateNode *&#038; ( stateNode *&#038; )  ,<br />   currentPattern a(n) fretNode *&#038; ( fretNode *&#038; )  ,<br />   currentFrontPattern a(n) fretNode *&#038; ( fretNode *&#038; )  ,<br />   currentBackPattern a(n) fretNode *&#038; ( fretNode *&#038; )  ,<br />   currentStack a(n) stackNode *&#038; ( stackNode *&#038; )  ,<br />   frontStack a(n) stackNode *&#038; ( stackNode *&#038; )<br /> <br />  Returns: user defined type , void<br />  Comments:<br />  <br /> ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++*/<br /> void setState ( stateNode *&#038; stack , fretNode *&#038; currentPattern , fretNode *&#038; currentFrontPattern , fretNode *&#038; currentBackPattern , stackNode *&#038; currentStack , stackNode *&#038; frontStack )<br /> {<br />     currentPattern = stack -> cp;<br />     currentFrontPattern = stack -> cfp;<br />  currentBackPattern = stack -> cbp;<br />     currentStack = stack -> cs;<br />     frontStack = stack -> fs;<br />  return;<br /> }

[kanwar]

fREN, i know u know file handling..! we got difficulty in our file handling. We have the search,create account,browse but we dont know how to update our account! How is that Mr Cman!

[Author]

Posts