test06-m3.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: 3
# Number of events (excluding PRINT events) 500
J 1
P
# -----
# Online Nodes: [1]
# Online Files: []
# -----
L 1
J 5
I 5 1
F 5
F 5
L 5
J 5
J 2
L 5
L 2
J 0
L 0
J 4
I 6 3
I 4 1
I 5 1
I 7 3
F 5
D 5
D 7
I 2 1
J 7
D 2
D 6
I 2 3
I 6 3
I 7 1
D 6
D 4
I 3 1
I 6 1
D 2
I 5 1
I 1 3
L 4
I 2 2
D 5
I 0 3
D 0
L 7
J 0
I 0 2
L 0
J 4
I 1 2
D 1
J 5
J 1
I 4 1
L 1
P
# -----
# Online Nodes: [4, 5]
# Online Files: [4]
# -----
L 5
J 3
J 2
D 4
I 3 2
I 2 1
D 3
J 6
L 6
L 3
J 6
I 1 1
D 1
I 1 3
J 7
J 1
L 7
J 3
D 1
D 2
L 3
J 0
J 5
L 6
L 2
L 1
J 3
L 3
J 2
I 4 2
I 1 2
I 0 2
I 6 3
L 4
I 3 1
D 6
L 5
I 7 1
D 4
D 1
D 3
L 2
J 7
L 0
D 7
F 0
J 0
L 0
I 3 2
I 6 2
P
# -----
# Online Nodes: [7]
# Online Files: [0, 3, 6]
# -----
J 1
L 7
I 5 1
L 1
J 4
J 2
I 2 3
D 2
I 6 2
F 6
L 2
J 6
L 6
J 6
D 6
J 1
L 4
L 1
I 3 3
D 3
J 5
L 6
J 0
I 1 3
F 1
J 3
D 1
J 1
J 2
L 0
L 5
I 1 2
J 7
I 7 2
D 1
D 7
L 3
L 1
J 6
J 1
I 1 3
L 6
D 1
L 1
J 5
L 5
L 2
I 0 3
J 6
F 0
P
# -----
# Online Nodes: [6, 7]
# Online Files: [0]
# -----
D 0
J 2
L 6
J 5
L 7
J 6
J 7
I 1 1
J 1
L 5
J 3
L 1
J 5
I 5 2
I 2 1
D 1
J 0
I 0 1
D 0
F 5
J 1
D 5
I 6 1
L 2
L 0
L 3
L 6
I 7 3
L 7
J 2
D 7
L 5
J 5
I 1 2
J 6
L 1
F 2
J 3
D 2
J 4
J 1
L 5
J 7
L 7
J 5
I 3 3
I 0 3
L 3
D 0
L 6
P
# -----
# Online Nodes: [1, 2, 4, 5]
# Online Files: [1, 3, 6]
# -----
L 4
L 1
F 1
D 6
L 2
F 3
F 1
L 5
J 2
I 3 2
L 2
J 7
J 2
I 5 3
I 7 3
I 0 3
J 6
D 0
D 7
L 2
I 6 1
D 5
I 2 3
L 7
I 4 1
L 6
J 6
I 2 2
I 4 2
J 4
L 4
I 0 2
I 3 3
J 2
I 6 1
I 5 1
L 6
J 4
D 4
L 4
I 7 3
F 3
I 4 2
D 7
F 5
J 0
D 4
J 3
J 7
F 3
P
# -----
# Online Nodes: [0, 2, 3, 7]
# Online Files: [0, 2, 3, 5, 6]
# -----
J 5
I 7 1
I 4 3
L 5
J 1
D 4
F 5
D 3
D 6
D 2
I 4 3
J 4
D 4
L 4
D 0
I 6 3
I 4 2
L 1
I 1 2
I 2 1
J 1
J 4
L 2
I 0 2
I 3 3
L 0
D 0
J 5
F 1
I 0 2
D 7
J 0
I 7 1
D 4
L 0
J 6
D 2
F 6
D 0
D 3
L 5
J 5
D 5
D 6
F 1
D 7
F 1
J 0
D 1
L 1
P
# -----
# Online Nodes: [0, 3, 4, 5, 6, 7]
# Online Files: []
# -----
L 3
I 1 2
L 7
D 1
L 4
L 6
L 0
J 6
J 3
L 6
I 5 1
J 2
D 5
J 0
J 6
L 0
J 0
I 7 1
I 5 3
I 3 3
D 5
I 6 1
I 5 3
J 1
I 1 3
I 0 1
J 7
J 4
D 3
D 6
F 7
L 4
D 0
D 7
L 2
L 1
J 1
I 3 3
I 0 1
D 3
F 0
L 1
J 4
J 2
J 1
D 5
D 1
I 2 2
D 0
D 2
P
# -----
# Online Nodes: [0, 1, 2, 3, 4, 5, 6, 7]
# Online Files: []
# -----
I 2 2
F 2
L 1
L 2
F 2
F 2
L 4
D 2
J 1
J 4
L 7
J 7
I 2 3
J 2
D 2
L 7
I 4 1
L 5
J 7
F 4
F 4
J 5
D 4
L 3
L 7
L 2
I 7 2
D 7
J 2
I 6 3
I 1 2
F 1
D 1
F 6
J 7
D 6
J 3
I 1 1
F 1
D 1
L 0
L 6
L 5
J 6
J 0
I 4 3
I 0 3
I 1 3
D 0
L 0
P
# -----
# Online Nodes: [1, 2, 3, 4, 6, 7]
# Online Files: [1, 4]
# -----
I 6 1
L 3
D 4
I 4 2
F 4
D 4
L 6
L 1
I 0 2
J 5
F 6
L 5
D 1
F 6
D 0
J 1
L 7
D 6
J 6
L 4
J 7
L 1
L 7
L 6
I 1 3
F 1
I 6 2
I 0 3
J 1
D 1
J 6
J 5
L 1
J 3
L 3
J 3
L 5
I 1 2
L 2
J 4
L 4
J 7
J 5
F 0
D 6
D 0
D 1
L 7
J 0
J 7
P
# -----
# Online Nodes: [0, 3, 5, 6, 7]
# Online Files: []
# -----
J 1
L 0
J 4
I 6 1
D 6
I 4 3
D 4
I 0 1
D 0
J 2
L 5
L 2
I 4 2
J 2
D 4
I 0 3
J 5
J 0
I 2 1
D 0
L 5
D 2
I 3 2
D 3
L 0
L 1
L 7
L 4
I 5 2
L 2
J 1
J 0
J 2
L 0
L 2
I 1 3
L 6
F 1
L 3
D 5
J 0
J 3
F 1
D 1
J 6
L 0
J 7
J 4
I 4 1
P
# -----
# Online Nodes: [1, 3, 4, 6, 7]
# Online Files: [4]
# -----