Paste code

// Auteur : Raphael De Oliveira
#include <iostream>
#include <map>
#include <iostream>
#include <array>
#include <algorithm>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <utility>
#include "test.h"

using namespace std;

int main() {

    // Création d&#039;objets test
    test t1;
    test t2(50);
    test t3(60);
    test t4(70);
    test t5(80);

    // Utilisation de std::array
    array<test, 6> liste = {t1, t3, t2, t4, t5, test(90)};
    sort(liste.begin(), liste.end());
    cout <<endl<< "------------std::array--------------------------" << endl;
    for(test t : liste) {
        t.toString();
    }
    // std::queue
    queue<int> ma_queue;
    ma_queue.push(10);
    ma_queue.push(20);
    ma_queue.push(30);

    cout <<endl<< "------------std::queue--------------------------" << endl;
    cout<<"Exemple affichage queue : ";
    while(ma_queue.empty()==false){
        cout<<ma_queue.front()<< &#039; &#039;;
        ma_queue.pop();
    }
    cout<<endl;

    // std::stack
    stack<string> pile;
    pile.push("Raphael");
    pile.push("De Oliveira");
    pile.push("Manuel");
    cout <<endl<< "------------std::stack--------------------------" << endl;
    cout<<"Exemple d&#039;affichage de stack : ";
    while(pile.empty()==false){
        cout<<pile.top()<< " ";
        pile.pop();
    }
    cout<<endl;

    // std::unordered_set
    unordered_set<int> ensemble = {10, 2, 3, 4, 5};
    cout <<endl<< "------------std::unordered_set:--------------------------" << endl;
    cout << "std::unordered_set: ";
    for (int x : ensemble) {
        cout << x << &#039; &#039;;
    }
    cout << endl;
    return 0;
}