code: def indel_at( self, position, check_insertions=True, check_deletions=True, one_based=True ):
          
          (insertions, deletions) = self.get_indels( one_based=one_based )
          if check_insertions:
              for insertion in insertions:
                  if insertion[0] == position:
                      return True
          if check_deletions:
              for deletion in deletions:
                  if deletion[0] < position < deletion[0] + deletion[1] + 1:
                      return True
          return False
docs: Does the read contain an indel at the given position?
          Return True if the read contains an insertion at the given position
          (position must be the base before the insertion event) or if the read
          contains a deletion where the base at position is deleted. Return False
          otherwise.