Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "lists.h"
- #include <iostream>
- int main(){
- std::cout << "Lista pusta\n";
- DoubleLinkedList l1;
- l1.printForward();
- l1.printReverse();
- l1.find(5);
- l1.remove(NULL);
- l1.clear();
- l1.begin();
- l1.end();
- l1.printForward();
- l1.printReverse();
- LegalLinkedList l2=l1.toLegal();
- l2.printForward();
- l2.printReverse();
- l2.find(5);
- l2.remove(NULL);
- l2.clear();
- l2.begin();
- l2.end();
- l2.printForward();
- l2.printReverse();
- DoubleLinkedList l3 = l2.toDouble();
- l3.printForward();
- l3.printReverse();
- l3.find(5);
- l3.remove(NULL);
- l3.clear();
- l3.begin();
- l3.end();
- l3.printForward();
- l3.printReverse();
- std::cout << "Lista 1elementowa\n";
- DoubleLinkedList l4;
- l4.add(5, l4.begin());
- l4.printForward();
- l4.printReverse();
- l4.remove(l4.find(5));
- l4.printForward();
- l4.printReverse();
- l4.add(5, l4.end());
- l4.printForward();
- l4.printReverse();
- l4.remove(l4.find(5));
- l4.printForward();
- l4.printReverse();
- l4.add(5, l4.begin());
- l4.add(10,l4.begin());
- l4.find(5);
- l4.add(4, l4.begin());
- l4.add(6, l4.find(4));
- l4.add(7, l4.end());
- l4.printForward();
- l4.printReverse();
- l4.remove(NULL);
- l4.remove(l4.begin());
- l4.remove(l4.find(7));
- l4.remove(l4.end());
- l4.printForward();
- l4.printReverse();
- l4.add(8, NULL);
- l4.add(9, l4.begin());
- l4.printForward();
- l4.printReverse();
- LegalLinkedList l5= l4.toLegal();
- l4.clear();
- l4.printForward();
- l4.printReverse();
- l5.add(5, l5.begin());
- l5.printForward();
- l5.printReverse();
- l5.remove(l5.find(5));
- l5.printForward();
- l5.printReverse();
- l5.add(5, l5.end());
- l5.printForward();
- l5.printReverse();
- l5.remove(l5.find(5));
- l5.printForward();
- l5.printReverse();
- l5.add(5, l5.begin());
- l5.add(10,l5.begin());
- l5.find(5);
- l5.add(4, l5.begin());
- l5.add(6, l5.find(4));
- l5.add(7, l5.end());
- l5.printForward();
- system("PAUSE");
- return 0;
- }
Add Comment
Please, Sign In to add comment