# sort_instance

## Procs | |

gallopRight | Like gallopLeft, except that if the range contains an element equal to key, gallopRight returns the index after the rightmost equal element. |
---|

## Proc Details

### gallopRight

Like gallopLeft, except that if the range contains an element equal to key, gallopRight returns the index after the rightmost equal element.

@param key the key whose insertion point to search for
@param a the array in which to search
@param base the index of the first element in the range
@param len the length of the range; must be > 0
@param hint the index at which to begin the search, 0 <= hint < n.
The closer hint is to the result, the faster this method will run.
@param c the comparator used to order the range, and to search
@return the int k, 0 <= k <= n such that `a[b + k - 1] <= key < a[b + k]`