code: func (c *Container) runRemove(v uint16) bool {
  	runs := c.runs()
  	i, contains := binSearchRuns(v, runs)
  	if !contains {
  		return false
  	}
  	c.unmapRun()
  	runs = c.runs()
  	if v == runs[i].last && v == runs[i].start {
  		runs = append(runs[:i], runs[i+1:]...)
  	} else if v == runs[i].last {
  		runs[i].last--
  	} else if v == runs[i].start {
  		runs[i].start++
  	} else if v > runs[i].start {
  		last := runs[i].last
  		runs[i].last = v - 1
  		runs = append(runs, interval16{})
  		copy(runs[i+2:], runs[i+1:])
  		runs[i+1] = interval16{start: v + 1, last: last}
  		// runs = append(runs[:i+1], append([]interval16{{start: v + 1, last: last}}, runs[i+1:]...)...)
  	}
  	c.n--
  	c.setRuns(runs)
  	return true
  }
docs: // runRemove removes v from a run container, and returns true if v was removed.