-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtreatment.cpp
65 lines (56 loc) · 1.61 KB
/
treatment.cpp
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
#include "base.h"
#include "treatment.h"
void createNewListTreatment(ListTreatment &L) {
first(L) = nil;
}
treatmentAddress allocateTreatment(treatmentInfo Elm) {
treatmentAddress newElm = new ElmTreatment;
info(newElm) = Elm;
next(newElm) = nil;
return newElm;
}
void insertTreatmentLast(ListTreatment &L, treatmentAddress P) {
treatmentAddress x;
if (isTreatmentEmpty(L)) {
first(L) = P;
} else {
x = first(L);
while (next(x) != nil){
x = next(x);
}
next(x) = P;
}
}
void deleteTreatmentLast(ListTreatment &L, treatmentAddress &P) {
if (isTreatmentEmpty(L)) {
cout << "List perawatan kosong, tidak ada yang bisa dihapus." << endl;
return;
}
if (next(first(L)) == nil){
P = first(L);
first(L) = nil;
} else {
treatmentAddress q;
P = first(L);
while (next(P) != nil){
q = P;
P = next(P);
}
next(q) = nil;
}
}
bool isTreatmentEmpty(ListTreatment L) {
return first(L) == nil;
}
bool isRelation(ListTreatment L, string doctorName, string patientName) {
treatmentAddress current = first(L);
while (current != nil) {
// Periksa apakah nama dokter dan pasien sesuai pada treatment
if (info(current->doctor).name == doctorName &&
info(current->patient).name == patientName) {
return true; // Dokter dan pasien memiliki relasi
}
current = next(current);
}
return false; // Tidak ada relasi ditemukan
}