Iteratorlardan foydalanish uchun ma’lum list konteyneriga most iteratorlar yaratish lozim

Sinf shablonida ikki xil toifadan foydalanish

#include

using namespace std;

template

class myclass

{

Type1 i; Type2 j; public:

myclass(Type1 a, Type2 b) {

i = a; j = b; }

void show() {

cout << i << ' ' << j << '\n'; }

};

int main()

{

myclass ob1(10, 0.23);

myclass ob2('X', "Assalomu alaykum.");

ob1.show(); // show int, double

ob2.show(); // show char, char *

return 0;

}
Examples:  

Input : stackname.push(5);

stackname.push(1);

stackname.top();

Output : 1

Input : stackname.push(5);

stackname.push(1);

stackname.push(2);

stackname.top();

Output : 2

#include

#include

using namespace std;

 

int main()

{

    stack mystack;

    mystack.push(5);

    mystack.push(1);

    mystack.push(2);

 

    // Stack top

    cout << mystack.top();

    return 0;

}

Examples:

Input : mystack

mystack.empty();

Output : True

Input : mystack = 1, 2, 3

Output : False

#include

#include

using namespace std;

  

int main()

{

    stack mystack;

    mystack.push(1);

  

    // Stack becomes 1

  

    if (mystack.empty()) {

        cout << "True";

    }

    else {

        cout << "False";

    }

    return 0;

}

Examples:

Input : mystack

mystack.push(6);

Output : 6

Input : mystack

mystack.push(0);

mystack.push(1);

Output : 0, 1

#include

#include

using namespace std;

  

int main()

{

    // Empty stack

    stack mystack;

    mystack.push(0);

    mystack.push(1);

    mystack.push(2);

  

    // Printing content of stack

    while (!mystack.empty()) {

        cout << ' ' << mystack.top();

        mystack.pop();

    }

}

Quyida Listning ba'zi funktsiyalarining ishlashini ko'rsatadigan dastur:

#include

#include

#include

using namespace std;

//ro'yxatdagi elementlarni chop etish funktsiyasi

void showlist(list g)

{

list :: iterator it;

for(it = g.begin(); it != g.end(); ++it)

cout << '\t' << *it;

cout << '\n';

}

int main()

{
list gqlist1, gqlist2;
for (int i = 0; i < 10; ++i)

{

gqlist1.push_back(i * 2);

gqlist2.push_front(i * 3);

}

cout << "\nList 1 (gqlist1) is : ";

showlist(gqlist1);

cout << "\nList 2 (gqlist2) is : ";

showlist(gqlist2);

cout << "\ngqlist1.front() : " << gqlist1.front();

cout << "\ngqlist1.back() : " << gqlist1.back();

cout << "\ngqlist1.pop_front() : ";

gqlist1.pop_front();

showlist(gqlist1);

cout << "\ngqlist2.pop_back() : ";

gqlist2.pop_back();

showlist(gqlist2);

cout << "\ngqlist1.reverse() : ";

gqlist1.reverse();

showlist(gqlist1);

cout << "\ngqlist2.sort(): ";

gqlist2.sort();

showlist(gqlist2);

return 0;}