RESULT 1.0

#Fill in your runtime results in this file
#You should replace each X with the corresponding value

#These values correspond to the time it takes (in ms) to insert data1 to all data structures
OpenHashSet_AddData1 = 28751.0
ClosedHashSet_AddData1 = 187606.0
TreeSet_AddData1 = 40.0
LinkedList_AddData1 = 28863.0
HashSet_AddData1 = 37.0

#These values correspond to the time it takes (in ms) to insert data2 to all data structures
OpenHashSet_AddData2 = 11.0
ClosedHashSet_AddData2 = 28.0
TreeSet_AddData2 = 37.0
LinkedList_AddData2 = 20939.0
HashSet_AddData2 = 4.0

#These values correspond to the time it takes (in ns) to check if "hi" is contained in
#the data structures initialized with data1
OpenHashSet_Contains_hi1 = 24
ClosedHashSet_Contains_hi1 = 45
TreeSet_Contains_hi1 = 80
LinkedList_Contains_hi1 = 329156
HashSet_Contains_hi1 = 28

#These values correspond to the time it takes (in ns) to check if "-13170890158" is contained in
#the data structures initialized with data1
OpenHashSet_Contains_negative = 413427
ClosedHashSet_Contains_negative = 1807365
TreeSet_Contains_negative = 120
LinkedList_Contains_negative = 410190
HashSet_Contains_negative = 23

#These values correspond to the time it takes (in ns) to check if "23" is contained in
#the data structures initialized with data2
OpenHashSet_Contains_23 = 16
ClosedHashSet_Contains_23 = 15
TreeSet_Contains_23 = 33
LinkedList_Contains_23 = 115
HashSet_Contains_23 = 26

#These values correspond to the time it takes (in ns) to check if "hi" is contained in
#the data structures initialized with data2
OpenHashSet_Contains_hi2 = 7
ClosedHashSet_Contains_hi2 = 26
TreeSet_Contains_hi2 = 67
LinkedList_Contains_hi2 = 478399
HashSet_Contains_hi2 = 8