29-APR

Author: thakursaurabh1998

.gitignore

@@ -0,0 +1,3 @@
+.vscode/c_cpp_properties.json
+.vscode/launch.json
+.vscode/settings.json

.vscode/tasks.json

@@ -0,0 +1,17 @@
+{
+    "version": "2.0.0",
+    "tasks": [
+        {
+            "label": "build hello world",
+            "type": "shell",
+            "command": "g++",
+            "args": [
+                "${relativeFile}"
+            ],
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            }
+        }
+    ]
+}

README.md

@@ -3,9 +3,23 @@
 > This repo contains all the C++ programs that are made as part of Object Oriented Programming subject.
 
 [Read More about __Standard Template Library(STL)__](https://www.geeksforgeeks.org/the-c-standard-template-library-stl/)
+
+
 [Read More about __Templates__](https://www.geeksforgeeks.org/templates-cpp/)
 
 ______
+29-APR
+------
+##Standard tempelate library (STL)
+
+  1. [__Vectors__ in detail](../master/stlvector.cpp)
+  1. [__List__ in detail](../master/stllist.cpp)
+  1. [__Map__ in detail](../master/stlmap.cpp)
+  1. [__Multimap__ in detail](../master/stlmultimap.cpp)
+  1. [__Dequeue__ in detail](../master/stldequeue.cpp)
+  1. [__Set__ in detail](../master/stlset.cpp)
+  1. [__Multiset__ in detail](../master/stlmultiset.cpp)
+
 4-APR
 ------
   1. [__Map__ (STL) example](../master/map.cpp)

cincout.cpp

@@ -0,0 +1,44 @@
+#include<iostream>
+#include<cstring>
+using namespace std;
+
+int main()
+{
+    char ch;
+    int count=0;
+    // do {
+    //     ch = cin.get();
+    //     cout.put(ch);
+    //     count++;
+    //     cout << "No. of char: " << count << endl;
+    // } while(ch!='0');
+    // cout << "Out of loop" << endl;
+
+    // char *str1 = "C++";
+    // char *str2 = "Programming";
+    // int m = strlen(str1);
+    // int n = strlen(str2);
+    // for(int i=1;i<=n;i++)
+    // {
+    //     cout.write(str2,i);
+    //     cout << endl;
+    // }
+    // for(int i=n;i>0;i--)
+    // {
+    //     cout.write(str2,i);
+    //     cout << endl;
+    // }
+    // cout.write(str1,m).write(str2,n);
+    // cout << endl;
+    // cout.write(str1,10);
+
+    int x = 155;
+    int y = 50;
+
+    cout.width(5);
+    cout << x ;
+    cout.width(10);
+    cout << y << endl;
+
+    return 0;
+}

map.cpp

@@ -4,6 +4,7 @@
 using namespace std;
 
 typedef map<string, int> phonemap;
+typedef pair<string,int> pairing;
 int main()
 {
 	string name;
@@ -18,7 +19,8 @@ int main()
 	}
 
 	phone["abc"] = 1111;
-	phone.insert(pair<string,int>("Bose", 5555));
+	phone.insert(pairing("Bose", 5555));
+	phone["hello"] = 4343;
 
 	int n = phone.size();
 	cout << n << endl;

ques14.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+template <class T>
+class object
+{
+    vector <T> arr;
+public:
+    void get(int n);
+    void sort();
+    void put();
+};
+
+template <class T>
+void object<T>::get(int n)
+{
+    T temp;
+    for(int i=0;i<n;i++)
+    {
+        cin >> temp;
+        arr.push_back(temp);
+    }
+}
+
+template <class T>
+void object<T>::sort()
+{
+    int n = arr.size();
+    T temp;
+    for(int i=0;i<n;i++)
+        for(int j=0;j<n-i-1;j++)
+            if(arr[j] > arr[j+1])
+            {
+                temp = arr[j];
+                arr[j] = arr[j+1];
+                arr[j+1] = temp;
+            }
+}
+
+template <class T>
+void object<T>::put()
+{
+    int n = arr.size();
+    for(int i=0;i<n;i++)
+        cout << arr.at(i) << endl;
+}
+
+int main()
+{
+    object<float> i;
+    i.get(6);
+    i.sort();
+    i.put();
+
+    return 0;
+}

ques15.cpp

@@ -0,0 +1,67 @@
+#include <iostream>
+#include <set>
+#include <string>
+using namespace std;
+class person
+{
+private:
+    string lastName;
+    string firstName;
+    long phoneNumber;
+public:
+    person() : lastName("blank"), firstName("blank"), phoneNumber(0L)
+    { }
+    person(string lname, string fname, long pho) : lastName(lname), firstName(fname), phoneNumber(pho)
+    { }
+    friend bool operator<(const person&, const person&);
+    void display()
+    {
+        cout << endl << lastName << "\t" << firstName
+        << "\tPhone: " << phoneNumber;
+    }
+    long get_phone() const { return phoneNumber; }
+};
+
+bool operator < (const person& p1, const person& p2)
+{
+    if(p1.lastName == p2.lastName)
+        return (p1.firstName < p2.firstName) ? true : false;
+    return (p1.lastName < p2.lastName) ? true : false;
+}
+
+class comparePersons
+{
+public:
+    bool operator() (const person* ptrP1,
+    const person* ptrP2) const { return *ptrP1 < *ptrP2; }
+};
+int main()
+{
+    multiset<person*, comparePersons> setPtrsPers;
+    multiset<person*, comparePersons>::iterator iter;
+
+    person* ptrP1 = new person("DEF", "ghi", 4157300);
+    person* ptrP2 = new person("ABC", "def", 3327563);
+    person* ptrP3 = new person("GHI", "jkl", 8435150);
+    person* ptrP4 = new person("JKL", "mno", 9207404);
+    person* ptrP5 = new person("MNO", "pqr", 6946473);
+    person* ptrP6 = new person("ABC", "abc", 8435150);
+    setPtrsPers.insert(ptrP1);
+    setPtrsPers.insert(ptrP2);
+    setPtrsPers.insert(ptrP3);
+    setPtrsPers.insert(ptrP4);
+    setPtrsPers.insert(ptrP5);
+    setPtrsPers.insert(ptrP6);
+    cout << "Set sorted when created:";
+    for(iter=setPtrsPers.begin(); iter != setPtrsPers.end(); iter++ )
+        (**iter).display();
+    iter = setPtrsPers.begin();
+    while( iter != setPtrsPers.end() )
+    {
+        delete *iter;
+        setPtrsPers.erase(iter++);
+    }
+    cout << endl;
+
+    return 0;
+}

ques16.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <list>
+#include <algorithm>
+using namespace std; 
+
+int main(){
+    int n;
+    cout << "Enter no. of elements: ";
+    cin >> n;
+    list<int> l;
+    cout << "Enter the integer elements: ";
+    int a;
+    for (int i = 0; i < n; ++i) {
+        cin >> a;
+        l.push_back(a);
+    }
+    
+    list<int>::iterator i1 = l.begin();
+    list<int>::iterator i2 = l.end();
+    i2--;
+
+    a = 0;
+    while (a <= n / 2)
+    {
+        swap(*i1, *i2);
+        i1++;
+        i2--;
+        a++;
+    }
+
+    for (list<int>::iterator itr = l.begin(); itr != l.end(); itr++) 
+        cout << *itr << " ";
+
+    return 0;
+}

ques17.cpp

@@ -0,0 +1,80 @@
+#include<iostream>
+#include<vector>
+#include<string>
+#include<list>
+using namespace std;
+
+// class data
+// {
+// public:
+//     string name, address, carN, carM, date;
+//     void get()
+//     {
+//         cin.ignore();
+//         getline(cin,name);
+//         getline(cin,address);
+//         getline(cin,carN);
+//         getline(cin,carM);
+//         getline(cin,date);
+//     }
+//     void put()
+//     {
+//         cout << "Name: " << name << endl;
+//         cout << "Address: " << address << endl;
+//         cout << "Car Name: " << carN << endl;
+//         cout << "Car Model: " << carM << endl;
+//         cout << "Date: " << date << endl;
+//     }
+// };
+
+// void sameCar(vector<data*> objs,int n)
+// {
+//     cout << "Same car in same year employees: " << endl;
+//     for(int i=0;i<n;i++)
+//         for(int j=0;j<n;j++)
+//             if(objs[j]->carN==objs[i]->carN && objs[i]->date==objs[j]->date && i!=j)
+//                 cout << "Name: " << objs[j]->name << endl;
+// }
+
+// int main()
+// {
+//     vector<data*> arr;
+//     int n;
+//     cin >> n;
+//     for(int i=0;i<n;i++)
+//         arr.push_back(new data);
+//     for(int i=0;i<n;i++)
+//         arr.at(i)->get();
+//     for(int i=0;i<n;i++)
+//         arr.at(i)->put();
+
+//     sameCar(arr,n);
+
+//     return 0;
+// }
+
+class Student
+{
+public:
+    int roll;
+    string name;
+};
+
+
+int main(){
+
+    vector <Student> l2;
+
+    Student obj1,obj2;
+    l2.push_back(obj1);
+    l2.push_back(obj2);
+    l2[0].roll = 1243;
+    l2[1].roll = 243;
+    l2[0].name = "sdhjf";
+    l2[1].name = "sdjfkh";
+
+    for(int i=0;i<2;i++){
+        cout << l2[i].roll << l2[i].name << endl;
+    }
+    return 0;
+}

ques18a.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <stdlib.h>
+
+using namespace std;
+
+int main(){
+    vector<int> vec;
+    int n;
+    cout << "Enter number of elements: ";
+    cin >> n;
+    for (int i = 0; i < n; ++i) {
+        int x;
+        cin >> x;
+        vec.push_back(x);
+    }
+    
+    int first1, last1, first2;
+    cout << "Enter first1, last1 and first2: ";
+    cin >> first1 >> last1 >> first2;
+    
+    if (first2 > first1 || first2 > last1){
+        cout << "Error! Can\'t shift to the right!" << endl;
+        exit(0);
+    }
+    vector<int>::iterator f1 = vec.begin() + first1;
+    vector<int>::iterator l1 = vec.begin() + last1;
+    vector<int>::iterator f2 = vec.begin() + first2;
+
+    copy(f1, l1, f2);
+    
+    cout << "After copy()" << endl;
+    
+    for (vector<int>::iterator itr = vec.begin(); itr != vec.end(); itr++) {
+        cout << *itr << " ";
+    }
+    cout << endl;
+}