addrem1

#include "head.hpp"

void add_beg(lista *&beg, lista *&end) {
    lista *temp;
    temp = new lista;

    temp->name = ((char)(rand() % 26 + 97));
    for (int i = 0; i < rand() % 8 + 8; i++) { temp->name += ((char)(rand() % 26 + 97)); };
    if (rand() % 2 == 1) {
        temp->surn = "qwertyuiop";
    }
    else {
        temp->surn = ((char)(rand() % 26 + 97));
        for (int i = 0; i < rand() % 8 + 8; i++) { temp->surn += ((char)(rand() % 26 + 97)); };
    };
    temp->pesel = ((char)(rand() % 10 + 48));
    for (int i = 0; i < 11; i++) { temp->pesel += ((char)(rand() % 10 + 48)); };
    temp->age = rand() % 50 + 18;

    temp->next = nullptr;
    temp->prev = nullptr;

    temp->next = beg;
    beg = temp;

    if (temp->next != nullptr) {
        temp->next->prev = temp;
    }
    else {
        end = temp;
    };

    std::cout << "\nDodano element na poczatku listy.";
    return;
}

void add_end(lista *&beg, lista *&end) {
    lista *temp;
    temp = new lista;

    temp->name = ((char)(rand() % 26 + 97));
    for (int i = 0; i < rand() % 8 + 8; i++) { temp->name += ((char)(rand() % 26 + 97)); };
    if (rand() % 2 == 1) {
        temp->surn = "qwertyuiop";
    }
    else {
        temp->surn = ((char)(rand() % 26 + 97));
        for (int i = 0; i < rand() % 8 + 8; i++) { temp->surn += ((char)(rand() % 26 + 97)); };
    };
    temp->pesel = ((char)(rand() % 10 + 48));
    for (int i = 0; i < 11; i++) { temp->pesel += ((char)(rand() % 10 + 48)); };
    temp->age = rand() % 50 + 18;

    temp->next = nullptr;
    temp->prev = nullptr;

    temp->prev = end;
    end = temp;

    if (temp->prev != nullptr) {
        temp->prev->next = temp;
    }
    else {
        beg = temp;
    };

    std::cout << "\nDodano element na koncu listy.";
    return;
}

void rem_beg(lista *&beg, lista *&end) {
    lista *temp;

    if (beg == nullptr || end == nullptr) {
        std::cout << "\nNic do usuniecia.";
        return;
    };

    if (beg == end) {
        delete beg;
        beg = nullptr;
        end = nullptr;
        std::cout << "\nUsunieto jedyny element.";
        return;
    };

    temp = beg->next;
    beg->next->prev = nullptr;
    delete beg;
    beg = temp;

    std::cout << "\nUsunieto pierwszy element.";
    return;
}

void rem_end(lista *&beg, lista *&end) {
    lista *temp;

    if (beg == nullptr || end == nullptr) {
        std::cout << "\nNic do usuniecia.";
        return;
    };

    if (beg == end) {
        delete beg;
        beg = nullptr;
        end = nullptr;
        std::cout << "\nUsunieto jedyny element.";
        return;
    };

    temp = end->prev;
    end->prev->next = nullptr;
    delete end;
    end = temp;

    std::cout << "\nUsunieto ostatni element.";
    return;
}