IIT Bombay Data Structures and Algorithms Prof Ajit

IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering IIT Bombay Session: Text Editor using 2 Stacks (Program) Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 1

Functions IIT Bombay 1. 2. 3. 4. 5. 6. 7. 8. 9. insert. Word insert. Character delete. Character back. Space. Character move. Cursor move. Left move. Right replace examine. Top Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 2

Program IIT Bombay Class ‘text. Editor’ with member variables and its member functions class text. Editor { private: stack<char> left. Stack; //Left stack<char> right. Stack; //Right stack public: void insert. Word(char word[]); void insert. Character(character); bool delete. Character(); bool back. Space. Character(); void move. Cursor(int position); void move. Left(int position); void move. Right(int position); void find. And. Replace. Char(char find. What, char replace. With); void examine. Top(); }; //End of class Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 3

Program IIT Bombay void text. Editor: : examine. Top(){ if(left. Stack. empty()) cout << "left. Stack: emptyt"; else cout << "left. Stack: " << left. Stack. top() << ", " << left. Stack. size() << "tt"; if(right. Stack. empty()) cout << "right. Stack: emptyn"; else cout << "right. Stack: " << right. Stack. top() << ", " << right. Stack. size() << endl; } //End of function Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 4

Program IIT Bombay void text. Editor: : insert. Word(char word[]) { int i=0; while(word[i]!='') { insert. Character(word[i]); i++; } } //End of function void text. Editor: : insert. Character(character){ left. Stack. push(character); } //End of function Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 5

Program IIT Bombay bool text. Editor: : delete. Character(){ if (right. Stack. empty()) return false; else right. Stack. pop(); return true; }//End of function Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay bool text. Editor: : back. Space. Character(){ if (left. Stack. empty()) return false; else left. Stack. pop(); return true; }//End of function 6

Program IIT Bombay void text. Editor: : move. Cursor(int position){ int left. Size, right. Size, count; left. Size = left. Stack. size(); right. Size = right. Stack. size(); if (position < left. Size) move. Left(position); else { count = position - left. Size; move. Right(count); } }//End of function Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay void text. Editor: : move. Left(int position){ int left. Size; left. Size = left. Stack. size(); while(position!=left. Size) { right. Stack. push(left. Stack. top()); left. Stack. pop(); left. Size = left. Stack. size(); } }//End of function 7

Program IIT Bombay void text. Editor: : move. Right(int count){ int right. Size, i=1; right. Size = right. Stack. size(); if (count > right. Size) cout << "Cannot move the cursor, right, to the specified position"; else { while(i<=count) { left. Stack. push(right. Stack. top()); right. Stack. pop(); i++; } //End of while } //End of else }//End of function Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 8

Program IIT Bombay void text. Editor: : find. And. Replace. Char(char find. What, char replace. With){ int count=1, original. Cursor. Poistion = left. Stack. size(); move. Cursor(0); //Move characters from left stack to right stack //Move characters from right stack to left stack and examine while(!right. Stack. empty()) { if(right. Stack. top()==find. What) { delete. Character(); insert. Character(replace. With); } else move. Cursor(count); count++; } //End of while move. Cursor(original. Cursor. Poistion); //Retain the original cursor position } //End of function Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 9

Program IIT Bombay int main() { int i=0; char text[80]; text. Editor txt; cout << "Enter the word to be inserted: "; cin. getline(text, 80); txt. insert. Word(text); cout << "Inserting the word: "; txt. examine. Top(); Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay cout << "Move cursor to the position 14: "; txt. move. Cursor(14); txt. examine. Top(); cout << "Move cursor to the position 17: "; txt. move. Cursor(17); txt. examine. Top(); for(i=0; i<3; i++){ if(!txt. delete. Character()) cout << "There is nothing to delete. Move your cursor accordingly to delete the character"; else cout << "Delete characters using DEL: "; txt. examine. Top(); } 10

Program IIT Bombay for(i=0; i<7; i++){ if(!txt. back. Space. Character()) cout << "There is nothing to delete. Move your cursor accordingly to delete the character"; else cout << "Delete characters using Backspace: "; txt. examine. Top(); } txt. find. And. Replace. Char('t', 'T'); cout << "Replace occurrences of t with T: "; txt. examine. Top(); return 0; } //End of main Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 11

Output IIT Bombay Enter the word to be inserted: Data. Structures Inserting the word: left. Stack: s, 14 right. Stack: empty Enter the word to be inserted: And. Algorithms Inserting the word: left. Stack: s, 27 right. Stack: empty Move cursor to the position 14: left. Stack: s, 14 right. Stack: A, 13 Move cursor to the position 17: left. Stack: d, 17 right. Stack: A, 10 Delete characters using DEL: left. Stack: d, 17 right. Stack: l, 9 Delete characters using DEL: left. Stack: d, 17 right. Stack: g, 8 Delete characters using DEL: left. Stack: d, 17 right. Stack: o, 7 Delete characters using Backspace: left. Stack: n, 16 right. Stack: o, 7 Delete characters using Backspace: left. Stack: A, 15 right. Stack: o, 7 Delete characters using Backspace: left. Stack: s, 14 right. Stack: o, 7 Delete characters using Backspace: left. Stack: e, 13 right. Stack: o, 7 Delete characters using Backspace: left. Stack: r, 12 right. Stack: o, 7 Delete characters using Backspace: left. Stack: u, 11 right. Stack: o, 7 Delete characters using Backspace: left. Stack: t, 10 right. Stack: o, 7 Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay Replace occurrences of t with T: left. Stack: T, 10 right. Stack: o, 7 12

IIT Bombay Thank you Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay 13