/// <summary>
/// Simple ascending zero-based rank
/// </summary>
/// <param name="values"></param>
/// <param name="comparer"></param>
/// <returns></returns>
public static ArraySegment <KV <T, int> > SortRank(ArraySegment <T> values, IComparer <T> comparer = null)
{
KVKeyComparer <T, int> kvComparer;
if (_comparer == null)
{
_comparer = comparer ?? Comparer <T> .Default;
_kvComparer = new KVKeyComparer <T, int>(_comparer);
kvComparer = _kvComparer;
}
else if (comparer != null && comparer != _comparer)
{
kvComparer = new KVKeyComparer <T, int>(comparer);
}
else
{
kvComparer = _kvComparer;
}
if (_sorted == null || values.Count > _sorted.Length)
{
_sorted = new KV <T, int> [values.Count];
_ranked = new KV <T, int> [values.Count];
}
for (int i = 0; i < values.Count; i++)
{
_sorted[i] = new KV <T, int>(values.Array[values.Offset + i], i);
}
Array.Sort(_sorted, kvComparer);
for (int i = 0; i < _sorted.Length; i++)
{
_ranked[_sorted[i].Value] = new KV <T, int>(_sorted[i].Key, i);
}
return(new ArraySegment <KV <T, int> >(_ranked));
}
public static ArraySegment <int> SortRank(ArraySegment <T> values, IComparer <T> comparer = null)
{
KVKeyComparer <T, int> kvComparer;
if (_comparer == null)
{
_comparer = comparer ?? Comparer <T> .Default;
_kvComparer = new KVKeyComparer <T, int>(_comparer);
kvComparer = _kvComparer;
}
else if (comparer != null && comparer != _comparer)
{
kvComparer = new KVKeyComparer <T, int>(comparer);
}
else
{
kvComparer = _kvComparer;
}
if (_sorted == null || values.Count > _sorted.Length)
{
_sorted = new KV <T, int> [values.Count];
_ranked = new int[values.Count];
}
for (int i = 0; i < values.Count; i++)
{
_sorted[i] = new KV <T, int>(values.Array[values.Offset + i], i);
}
// TODO use two arrays instead of the _sorted one and use the pool
Array.Sort(_sorted, kvComparer);
for (int i = 0; i < _sorted.Length; i++)
{
_ranked[_sorted[i].Value] = i;
}
Array.Clear(_sorted, 0, values.Count);
return(new ArraySegment <int>(_ranked));
}
