resutl

kbtree

Linea : 6,1333504800,17,10,8,,
Data  : 6,1333504800,17,10,8.
DEBUG: kbtree_leaf_insert(): inserted at position 0.
Linea : 3,1331793000,19,13,4,,
Data  : 3,1331793000,19,13,4.
DEBUG: kbtree_leaf_insert(): inserted at position 1.
Linea : 5,1335126600,11,4,3,,
Data  : 5,1335126600,11,4,3.
DEBUG: kbtree_leaf_insert(): inserted at position 2.
Linea : 4,1328477400,10,7,3,,
Data  : 4,1328477400,10,7,3.
Linea : 5,1330470000,2,11,8,,
Data  : 5,1330470000,2,11,8.
DEBUG: kbtree_leaf_insert(): inserted at position 1.
Linea : 4,1336404600,6,10,9,,
Data  : 4,1336404600,6,10,9.
DEBUG: kbtree_leaf_insert(): inserted at position 2.
Linea : 1,1336276800,2,10,4,,
Data  : 1,1336276800,2,10,4.
Linea : 3,1333701000,9,10,2,,
Data  : 3,1333701000,9,10,2.
DEBUG: kbtree_leaf_insert(): inserted at position 1.
Linea : 1,1328848200,5,3,1,,
Data  : 1,1328848200,5,3,1.
DEBUG: kbtree_leaf_insert(): inserted at position 2.
Linea : 2,1330578000,17,3,4,,
Data  : 2,1330578000,17,3,4.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
DEBUG: kbtree_leaf_insert(): inserted at position 1.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
DEBUG: kbtree_leaf_insert(): inserted at position 2.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
DEBUG: kbtree_leaf_insert(): inserted at position 1.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
DEBUG: kbtree_leaf_insert(): inserted at position 2.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
DEBUG: kbtree_leaf_insert(): inserted at position 1.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
DEBUG: kbtree_leaf_insert(): inserted at position 2.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
Linea : ,,,,,,
Data  : 0,0,0,0,0.
DEBUG: kbtree_leaf_insert(): inserted at position 1.

Query: 	Tipo : 1	Valor: 2	Desde: -1	Hasta: -1

RESULTADO DE LA BuSQUEDA:

./TP -f ../tests/short-input.csv --falla 2:

Linea : 4,1336404600,6,10,9,,
Data : 4,1336404600,6,10,9.
Violación de segmento