code: func (ss *SortedSlice) Insert(e Sortable) {
  	switch {
  	// Particular cases
  	case len(ss.s) == 0, !ss.s[len(ss.s)-1].Less(&e):
  		ss.s = append(ss.s, e)
  	case len(ss.s) == 1 && ss.s[0].Less(&e):
  		ss.s = append(ss.s, e)
  		ss.s[1] = ss.s[0]
  		ss.s[0] = e
  	default:
  		//log.Printf("want to insert v=%v into %v", e, ss.s)
  		i := ss.searchLessThan(&e, 0, len(ss.s)-1)
  		//log.Printf("insert v=%v @ i=%d in ss=%v", e, i, ss.s)
  		// Avoid creating intermediary slices
  		ss.s = append(ss.s, e)
  		copy(ss.s[i+1:], ss.s[i:])
  		ss.s[i] = e
  	}
  }
docs: // Insertion method in the slice for a structure implementing Sortable