-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathOverzicht.txt
50 lines (39 loc) · 1.19 KB
/
Overzicht.txt
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
Current list of elements to implement (+ summary):
movietheatre -- Main class
Containers (Set & Get only)
Screen
Vars: screenNumber & seats
Slot
Vars: ID, time
Ticket
Vars: userID
User
Vars: ID, firstName, lastName, email
Reservation
Vars: ID, userID, timestamp, showingID, amount
Film
Vars: ID, title, rating
Handlers (Contains + Handles Data)
showing
Vars: ID, screenID, timeSlot, date, filmID, freeseats. tickets
Handles reservations w/ stack (tickets)
ADT's:
ADT Queue
Transforms Reservations into Tickets
Protection against many stack push operation at a time
ADT Stack
Per showing 1 stack
Push: Comes from ADT Queue
Pop: Person enters screen
ADT Table
showing:
Implementation: Double linked chain (SearchKey: ID)
Outside ADT: Sort of choice w/ SearchKey : date, timeSlot, screenID
film:
Implementatation: Binary searchTree
+ Only inorder traversal (SearchKey: Rating)
Must also allow advanced implementations:
2-3 tree
2-3-4 tree
Red=black tree
Hashmap