Repository navigation
Expand file tree
/
Copy pathlista.cpp
More file actions
99 lines (87 loc) · 2.17 KB
/
Copy pathlista.cpp
File metadata and controls
99 lines (87 loc) · 2.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
//
// Created by Ors on 2020. 05. 18..
//
#include <iostream>
#include <string>
#include "ember.h"
#include "lista.h"
//#include "memtrace.h"
Lista::Lista()
{
meret=0;
emberek = new Ember*[meret];
}
Lista::~Lista()
{
for(int i = 0; i < meret; ++i)
delete emberek[i];
delete[] emberek;
}
void Lista::ujEmber(Ember* uj)
{
for(int i = 0; i < meret; i++){
if(uj->NevReturn() == emberek[i]->NevReturn()){
std::cout << "Mar szerepel a kontaktok kozott\n";
return;
}
}
Ember** ujlista = new Ember*[meret + 1];
if(meret != 0){
for(int i=0; i<meret; i++)
ujlista[i]=emberek[i];
}
ujlista[meret]=uj;
meret++;
delete[] emberek;
emberek = ujlista;
std::cout << "Muvelet sikeres\n";
}
void Lista::torol(std::string torolS)
{
for(int i = 0 ; i < meret; i++){
if(torolS == emberek[i]->NevReturn()) {
delete emberek[i];
meret -= 1;
if (meret != 0) {
Ember **uj = new Ember *[meret];
if (i == 0) {
uj[0] = emberek[1];
} else
for (int j = 0; j < i; j++)
uj[j] = emberek[j];
for (int k = i; k < meret; k++)
uj[k] = emberek[k + 1];
delete[] emberek;
emberek=uj;
std::cout << "Muvelet sikeres" << std::endl;
return;
} else {
std::cout << "Muvelet sikeres" << std::endl;
return;
}
}
}
std::cout << "Muvelet sikertelen" << std::endl;
}
void Lista::keres(std::string nev)
{
for (int i=0; i<meret; i++)
{
if(nev == emberek[i]->NevReturn()){
std::cout << i+1 << ". ";
emberek[i]->kiir();
return;
}
}
std::cout << "Muvelet sikertelen. Nincs ilyen kontakt.\n";
}
void Lista::kiir(){
if(meret == 0)
std::cout<<"Muvelet sikertelen. Nincs bejegyzett kontakt."<< std::endl;
else{
for(int i=0;i<meret;i++){
std::cout<<i+1<<".: ";
emberek[i]->kiir();
}
}
}