'''
Created on Jul 10, 2011
 
Implements a Hash Join operator.
The intermediate results are represented as a Queue, but it doesn't
work until all the tuples are arrived.
 
@author: Maribel Acosta Deibe
'''
from time import time
from OperatorStructures import Table, Record
from ANAPSID.Operators.Join import Join
 
class HashJoin(Join):
 
    def __init__(self, vars):
        self.left_table  = Table()
        self.right_table = Table()
        self.results     = []
        self.vars        = vars
 
    def instantiate(self, d):
        newvars = self.vars - set(d.keys())
        return HashJoin(newvars)
 
    def execute(self, qleft, qright, out):
        # Executes the Hash Join.
        self.left = []
        self.right = []
        self.qresults = out
 
        # Initialize tuples.
        tuple1 = None
        tuple2 = None
 
        # Get the tuples from the queues.
        while (not(tuple1 == "EOF") or not(tuple2 == "EOF")):
            # Try to get tuple from left queue.
            if not(tuple1 == "EOF"):
                try:
                    tuple1 = qleft.get(False)
                    #print tuple1
                    self.left.append(tuple1)
                except Exception:
                    # This catch:
                    # Empty: in tuple2 = self.left.get(False), when the queue is empty.
                    pass
 
            # Try to get tuple from right queue.
            if not(tuple2 == "EOF"):
                try:
                    tuple2 = qright.get(False)
                    #print tuple2
                    self.right.append(tuple2)
                except Exception:
                    # This catch:
                    # Empty: in tuple2 = self.right.get(False), when the queue is empty.
                    pass
 
        # Get the variables to join.
        if ((len(self.left) > 1) and (len(self.right) > 1)):
            # Iterate over the lists to get the tuples.
            while ((len(self.left) > 1) or (len(self.right) > 1)):
                if len(self.left) > 1:
                    self.insertAndProbe(self.left.pop(0), self.left_table, self.right_table)
                if len(self.right) > 1:
                    self.insertAndProbe(self.right.pop(0), self.right_table, self.left_table)
 
        # Put all the results in the output queue.
        while self.results:
            self.qresults.put(self.results.pop(0))
 
        # Put EOF in queue and exit.
        self.qresults.put("EOF")
 
    def insertAndProbe(self, tuple, table1, table2):
        # Insert the tuple in its corresponding partition and probe.
        #print tuple
        # Get the attribute(s) to apply hash.
        att = ''
        for var in self.vars:
            att = att + tuple[var]
        i = hash(att) % table1.size;
 
        # Insert record in partition.
        record = Record(tuple, time(), 0)
        table1.insertRecord(i, record)
 
        # Probe the record against its partition in the other table.
        self.probe(record, table2.partitions[i], self.vars)
 
 
    def probe(self, record, partition, var):
        # Probe a tuple if the partition is not empty.
        if partition:
 
            # For every record in the partition, check if it is duplicated.
            # Then, check if the tuple matches for every join variable.
            # If there is a join, concatenate the tuples and produce result.
            for r in partition.records:
                if self.isDuplicated(record, r):
                    break
                join = True
                for v in var:
                    join = True
                    if record.tuple[v] != r.tuple[v]:
                        join = False
                        break
 
                if join:
                    res = record.tuple.copy()
                    res.update(r.tuple)
                    self.results.append(res)
 
 
    def isDuplicated(self, record1, record2):
        # Verify if the tuples has been already probed.
        return not record1.ats >= record2.ats