code: func (ss *SortedSlice) ReversedIter(idx ...int) (c chan Sortable) {
  	c = make(chan Sortable)
  	i, j := 0, len(ss.s)-1
  	if len(idx) >= 1 {
  		i = idx[0]
  	}
  	if len(idx) >= 2 {
  		j = idx[1]
  	}
  	if i < len(ss.s) && j < len(ss.s) && i <= j && i >= 0 {
  		go func() {
  			defer close(c)
  			for k := len(ss.s) - 1 - i; k >= len(ss.s)-1-j; k-- {
  				v := ss.s[k]
  				c <- v
  			}
  		}()
  	} else {
  		close(c)
  	}
  	return c
  }
docs: // Iter returns a chan of Sortable in the slice but in reverse order. Start and
  // Stop indexes can be specified via optional parameters