- host_tuple empty_tuple;
- empty_tuple.tuple_size = 0; empty_tuple.data = NULL;
- host_tuple& left_tuple = empty_tuple;
- host_tuple& right_tuple = empty_tuple;
-
- if (minq == 0) {
- if(max_input_ts[minq]) {
- if (input_queue[minq].empty())
- left_tuple = max_input_tuple[minq];
- else
- left_tuple = input_queue[minq].front();
- }
- } else {
- if(max_input_ts[minq]) {
- if (input_queue[minq].empty())
- right_tuple = max_input_tuple[minq];
- else
- right_tuple = input_queue[minq].front();
- }
+ timestamp left_ts, right_ts;
+ timestamp *left_ts_ptr = &left_ts;
+ timestamp *right_ts_ptr = &right_ts;
+
+
+/*
+ if (input_queue[0].empty()){
+ printf("L=max_ts, ");
+ left_ts_ptr = max_input_ts[0];
+ }else{
+ printf("L=q, ");
+ func.load_ts_from_tup(left_ts_ptr, input_queue[0].front());
+ }
+
+ if (input_queue[1].empty()){
+ printf("R=max_ts, ");
+ right_ts_ptr = max_input_ts[1];
+ }else{
+ printf("L=q, ");
+ func.load_ts_from_tup(right_ts_ptr, input_queue[1].front());
+ }
+*/
+ if(curr_ts_valid){
+ left_ts_ptr = curr_ts;
+ right_ts_ptr = curr_ts;
+ }else{
+//printf("curr_ts invalid\n");
+ left_ts_ptr = NULL;
+ right_ts_ptr = NULL;