test07-m4.data

This is a binary search tree with void* pointer in data segment in order you to search store and del

# Contains JOIN, LEAVE, INSERT, DELETE, FIND and PRINT events
# M parameter: 4
# Number of events (excluding PRINT events) 500
J 10
P
# -----
# Online Nodes: [10]
# Online Files: []
# -----
I 2 2
D 2
J 13
J 14
L 10
J 9
I 2 1
J 7
F 2
L 13
L 7
L 14
L 9
J 13
L 13
J 15
L 15
J 2
I 14 2
I 9 2
J 15
L 15
L 2
J 7
J 0
I 1 1
D 1
L 0
I 11 1
D 11
I 7 2
F 7
J 8
D 7
J 10
L 7
J 9
J 15
L 10
I 3 3
J 1
L 1
J 1
J 14
I 10 2
L 14
J 0
D 3
D 10
I 5 2
P
# -----
# Online Nodes: [0, 1, 8, 9, 15]
# Online Files: [5]
# -----
L 15
J 10
L 1
I 6 2
I 11 1
L 10
J 14
D 11
D 5
D 6
J 5
L 0
I 12 1
J 15
F 12
D 12
J 2
I 14 1
I 15 1
L 14
L 15
J 12
J 15
L 8
J 10
D 14
I 9 3
D 15
L 12
J 12
L 12
J 4
I 4 3
L 10
J 0
I 3 2
D 3
J 11
I 2 3
D 4
I 11 3
L 15
D 11
I 13 1
D 9
I 0 1
I 9 2
L 5
D 0
D 9
P
# -----
# Online Nodes: [0, 2, 4, 9, 11]
# Online Files: [2, 13]
# -----
F 2
I 7 1
L 9
L 0
L 2
F 13
L 11
L 4
J 7
J 9
J 3
L 3
L 7
L 9
J 13
J 14
I 3 1
L 13
D 3
L 14
J 9
I 15 2
I 12 3
I 14 2
I 13 1
J 1
J 3
J 14
J 13
D 14
L 13
D 15
J 0
I 14 1
D 12
I 5 2
D 14
L 0
J 8
J 6
I 3 1
J 12
D 3
L 14
L 12
I 8 3
D 5
L 9
D 13
D 8
P
# -----
# Online Nodes: [1, 3, 6, 8]
# Online Files: []
# -----
L 6
J 6
L 8
J 2
L 3
J 14
J 12
J 4
L 6
I 8 2
D 8
I 12 3
L 14
D 12
L 4
I 5 2
J 15
L 12
I 7 1
L 15
D 7
L 2
F 5
J 0
L 0
I 12 2
D 5
D 12
I 13 1
J 0
I 5 2
D 5
D 13
L 1
I 9 1
J 4
I 0 3
J 14
L 14
J 9
J 13
D 0
F 9
D 9
J 10
J 12
I 9 1
D 9
I 4 2
F 4
P
# -----
# Online Nodes: [0, 4, 9, 10, 12, 13]
# Online Files: [4]
# -----
F 4
L 13
L 12
D 4
L 4
L 0
I 10 2
I 15 1
F 10
L 10
I 11 1
D 10
D 11
J 8
I 14 1
L 9
L 8
J 11
I 2 1
L 11
J 13
I 14 2
L 13
J 11
I 12 3
L 11
J 12
I 15 3
J 15
I 9 2
J 13
L 13
J 7
J 2
L 12
L 15
J 5
D 15
J 8
I 1 1
I 10 3
L 2
D 10
J 13
L 7
L 13
J 9
L 9
L 8
I 11 1
P
# -----
# Online Nodes: [5]
# Online Files: [1, 9, 11]
# -----
J 11
I 0 1
D 11
L 11
J 7
D 1
L 5
L 7
J 6
L 6
J 0
J 12
J 3
J 6
J 7
L 7
J 2
I 5 3
I 1 2
D 1
L 12
D 5
J 9
L 6
L 2
I 4 2
J 12
J 8
L 8
J 4
J 8
L 8
L 4
D 4
L 12
L 3
I 7 1
D 7
J 14
J 11
J 10
J 5
I 1 3
J 3
J 13
J 12
I 0 2
J 6
D 1
I 2 3
P
# -----
# Online Nodes: [0, 3, 5, 6, 9, 10, 11, 12, 13, 14]
# Online Files: [0, 2]
# -----
J 8
L 14
L 12
D 2
L 0
J 0
J 7
J 12
I 2 3
L 10
F 2
I 5 1
L 7
D 5
J 2
J 7
I 1 1
I 15 3
D 15
I 5 2
L 11
J 11
L 13
I 3 3
I 4 1
L 6
D 0
J 14
D 5
J 10
F 2
I 9 2
D 9
L 11
D 1
L 14
J 1
J 13
J 11
J 15
L 5
D 4
I 12 2
J 4
D 3
L 13
I 3 3
I 11 3
F 3
L 11
P
# -----
# Online Nodes: [0, 1, 2, 3, 4, 7, 8, 9, 10, 12, 15]
# Online Files: [2, 3, 11, 12]
# -----
L 12
D 11
L 4
L 7
J 12
J 4
J 11
J 5
D 3
D 2
D 12
L 12
L 2
L 15
I 0 1
J 14
J 7
F 0
J 13
I 14 1
J 2
J 15
D 0
D 14
L 8
J 8
I 2 3
I 13 2
L 11
D 13
F 2
D 2
I 3 1
I 7 3
I 11 2
L 1
I 9 1
D 11
J 12
F 9
D 3
D 7
L 13
I 13 3
J 13
D 9
D 13
L 2
I 4 2
J 2
P
# -----
# Online Nodes: [0, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 14, 15]
# Online Files: [4]
# -----
I 11 1
I 9 3
F 11
I 13 1
J 1
D 4
L 7
I 3 3
D 3
I 2 3
J 11
I 12 2
I 14 2
L 0
F 13
L 14
L 11
D 14
D 12
I 15 2
J 14
I 0 2
I 6 3
L 4
I 14 1
L 3
L 8
J 11
I 1 3
D 9
L 10
D 1
J 6
I 12 3
L 15
J 8
J 15
D 13
D 6
D 11
L 5
I 3 3
L 9
I 9 3
D 3
J 4
J 10
L 12
D 12
I 3 3
P
# -----
# Online Nodes: [1, 2, 4, 6, 8, 10, 11, 13, 14, 15]
# Online Files: [0, 2, 3, 9, 14, 15]
# -----
J 0
D 15
D 9
I 4 3
L 0
D 14
I 12 2
L 4
D 12
L 8
D 2
D 3
I 11 1
I 3 1
D 0
D 11
L 13
D 3
J 5
L 11
D 4
I 5 3
J 4
F 5
J 3
I 9 3
J 9
I 0 3
D 5
J 13
I 1 2
D 9
J 8
J 11
L 2
D 1
I 3 1
L 5
I 4 3
F 3
J 2
D 4
J 7
J 12
J 5
J 0
D 0
F 3
I 14 1
P
# -----
# Online Nodes: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]
# Online Files: [3, 14]
# -----