This uses a contined in b, and b contained in c to force a contained in c.
           Just in case a contained in c wasn't already found by nucmer
15778
def _expand_containing_using_transitivity(self, containing_contigs):
        ''''''
        for name in containing_contigs:
            containing_contigs[name] = self._get_all_containing(containing_contigs, name)
        return containing_contigs
516339
private void bumpClause(final CLClause c) {
        switch (this.config.cbump) {
            case INC:
                c.setActivity(c.activity() + 1);
                break;
            case LRU:
                c.setActivity(this.stats.conflicts);
                break;
            case AVG:
                c.setActivity((this.stats.conflicts + c.activity()) / 2);
                break;
            case NONE:
            default:
                assert this.config.cbump == CleaneLingConfig.ClauseBumping.NONE;
                break;
        }
    }
1209780
def amod(a, b):
    ''''''
    modded = int(a % b)
    return b if modded is 0 else modded
918938
def add(a, b):
    
    if a is None:
        if b is None:
            return None
        else:
            return b
    elif b is None:
        return a
    return a + b
92052
public void addEdge(N a, N b)
    {
        if( !containsBoth(a, b) )
            return;//Cant add nodes to things that doing exist
        nodes.get(a).getOutgoing().add(b);
        nodes.get(b).getIncoming().add(a);
    }
1062850
public function coprime($a, $b)
    {
        $small = 0;
        $diff  = 0;
        while (bccomp($a, '0') > 0 && bccomp($b, '0') > 0) {
            if (bccomp($a, $b) == -1) {
                $small = $a;
                $diff  = bcmod($b, $a);
            }
            if (bccomp($a, $b) == 1) {
                $small = $b;
                $diff = bcmod($a, $b);
            }
            if (bccomp($a, $b) == 0) {
                $small = $a;
                $diff  = bcmod($b, $a);
            }
            $a = $small;
            $b = $diff;
        }
        if (bccomp($a, '1') == 0) {
            return true;
        }

        return false;
    }
632298
def insert(self, i, tag1, tag2, cmd="prevtag", x=None, y=None):
        
        if " < " in tag1 and not x and not y:
            tag1, x = tag1.split(" < "); cmd="prevtag"
        if " > " in tag1 and not x and not y:
            x, tag1 = tag1.split(" > "); cmd="nexttag"
        lazylist.insert(self, i, [tag1, tag2, cmd, x or "", y or ""])
1283469
function transformInsertDelete (a, b) {
  if (a.type === DELETE) {
    return transformInsertDelete(b, a)
  }
  // we can assume, that a is an insertion and b is a deletion
  // a is before b
  if (a.pos <= b.pos) {
    b.pos += a.str.length
  // a is after b
  } else if (a.pos >= b.pos + b.str.length) {
    a.pos -= b.str.length
  // Note: this is a conflict case the user should be noticed about
  // If applied still, the deletion takes precedence
  // a.pos > b.pos && <= b.pos + b.length
  } else {
    var s = a.pos - b.pos
    b.str = b.str.slice(0, s) + a.str + b.str.slice(s)
    a.str = ''
  }
}
531017
function forceWithin(container, sel) {
	var range = doc.createRange();
	range.selectNodeContents(container);
	range.collapse(false);
	setRange(range, sel);
}
133439
def swap(self, a, b):
        
        self.mem[a], self.mem[b] = self.mem[b], self.mem[a]
        self.asm[a], self.asm[b] = self.asm[b], self.asm[a]
422445
def safe_mult(a, b):
    """"""
    if isinstance(a, str) and isinstance(b, int) and len(a) * b > MAX_STR_LEN:
        raise RuntimeError("String length exceeded, max string length is {}".format(MAX_STR_LEN))
    return a * b
126998
private Formula constructCNF(final LinkedHashSet<? extends Formula> clauses) {
    if (clauses.isEmpty())
      return this.verum();
    if (clauses.size() == 1)
      return clauses.iterator().next();
    Map<LinkedHashSet<? extends Formula>, And> opAndMap = this.andsN;
    switch (clauses.size()) {
      case 2:
        opAndMap = this.ands2;
        break;
      case 3:
        opAndMap = this.ands3;
        break;
      case 4:
        opAndMap = this.ands4;
        break;
      default:
        break;
    }
    And tempAnd = opAndMap.get(clauses);
    if (tempAnd != null)
      return tempAnd;
    tempAnd = new And(clauses, this, true);
    opAndMap.put(clauses, tempAnd);
    return tempAnd;
  }
670153
function(a, b)
{
    return (a.l <= b.r && b.l <= a.r && a.b <= b.t && b.b <= a.t);
}
301946
def in_constraint(self, node1, node2):
        """"""
        constraint = constraint_table[node2]
        if constraint == 0b0:
            return False

        try:
            value = self.el2bv[node1]
        except KeyError:
            return False

        return constraint & value != 0
1186111
def coerce(other)
      if other.is_a? InternalComplex
        return other, self
      elsif other.is_a? Complex
        return InternalComplex.new( other.real, other.imag ), self
      else
        return InternalComplex.new( other, 0 ), self
      end
    end
1251891
private boolean containsBoth(N a, N b)
    {
        return nodes.containsKey(a) && nodes.containsKey(b);
    }
205459
private int selectBest( double a , double b , double c ) {
		if( a < b ) {
			if( a < c )
				return 0;
			else
				return 2;
		} else if( b <= c ) {
			return 1;
		} else {
			return 2;
		}
	}