def contains(self, chrom, point):
if not chrom in self.itrees:<EOL><INDENT>return False<EOL><DEDENT>blocks = self.itrees[chrom].intersectingPoint(point)<EOL>if len(blocks) == <NUM_LIT:0>:<EOL><INDENT>return False<EOL><DEDENT>if len(blocks) > <NUM_LIT:1>:<EOL><INDENT>msg = "<STR_LIT>" + str(chrom) + "<STR_LIT>" +str(point) + "<STR_LIT>"<EOL>raise IndexedWigError(msg)<EOL><DEDENT>block = blocks[<NUM_LIT:0>]<EOL>if not block.isPopulated():<EOL><INDENT>block.populate(self.handle)<EOL>if len(self.populatedBlocks) >= self.blockCapacity:<EOL><INDENT>if self.debug:<EOL><INDENT>sys.stderr.write("<STR_LIT>")<EOL><DEDENT>t, o = heappop(self.populatedBlocks)<EOL>o.depopulate()<EOL><DEDENT>heappush(self.populatedBlocks, (time.time, block))<EOL><DEDENT>return block.contains(chrom, point)<EOL>
@summary: returns true if the indexed wig contains a value for the
          given location, false otherwise