def _ruleIncluded(self, r1ID, r1l, r2ID, r2l):
    'check if a conflict exists between to ruleID (i.e. same first bits equals) '
    r1 = (r1ID << (32 - r1l))
    r2 = (r2ID << (32 - r2l))
    l = min(r1l, r2l)
    for k in range((32 - l), 32):
        if ((r1 & (1 << k)) != (r2 & (1 << k))):
            return False
    return True
check if a conflict exists between to ruleID (i.e. same first bits equals)
def _ruleIncluded(self, r1ID, r1l, r2ID, r2l):
    ' '
    r1 = (r1ID << (32 - r1l))
    r2 = (r2ID << (32 - r2l))
    l = min(r1l, r2l)
    for k in range((32 - l), 32):
        if ((r1 & (1 << k)) != (r2 & (1 << k))):
            return False
    return True