11 lines
2.3 KiB
HTML
11 lines
2.3 KiB
HTML
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><base href="../"><link rel="stylesheet" href="dmdoc.css"><title>/datum/sortInstance - /tg/ Station 13</title></head><body><header><a href="index.html">/tg/ Station 13</a> - <a href="index.html#modules">Modules</a> - <a href="index.html#types">Types</a> — <a href="datum/sortInstance.html#proc">Proc Details</a></header><main><h1>sortInstance <aside>/<a href="datum.html">datum</a>/<a href="datum/sortInstance.html">sortInstance</a></aside> <a href="https://github.com/evilew/GS13-Citadel/blob/e8e0068531dd988f9e65b33ae7866d4fbf1fdd9e/code/__HELPERS/sorts/__main.dm#L13"><img src="git.png" width="16" height="16" title="code/__HELPERS/sorts/__main.dm 13"></a></h1><table class="summary" cellspacing="0"><tr><td colspan="2"><h2>Procs</h2></td></tr><tr><th><a href="datum/sortInstance.html#proc/gallopRight">gallopRight</a></th><td>Like gallopLeft, except that if the range contains an element equal to
|
|
key, gallopRight returns the index after the rightmost equal element.</td></tr></table><h2 id="proc">Proc Details</h2><h3 id="proc/gallopRight"><aside class="declaration">proc </aside>gallopRight<aside>(key, base, len, hint) <a href="https://github.com/evilew/GS13-Citadel/blob/e8e0068531dd988f9e65b33ae7866d4fbf1fdd9e/code/__HELPERS/sorts/__main.dm#L318"><img src="git.png" width="16" height="16" title="code/__HELPERS/sorts/__main.dm 318"></a></aside></h3><p>Like gallopLeft, except that if the range contains an element equal to
|
|
key, gallopRight returns the index after the rightmost equal element.</p>
|
|
<p>@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]</p></main><footer>tgstation.dme <a href="https://github.com/evilew/GS13-Citadel/tree/e8e0068531dd988f9e65b33ae7866d4fbf1fdd9e">e8e0068</a> (master) — <a href="https://github.com/SpaceManiac/SpacemanDMM/blob/master/crates/dmdoc/README.md">dmdoc 1.9.0</a></footer></body></html> |