< Summary

Information
Class: Gravitas.Queries.Physics2DHitSorter
Assembly: Gravitas
File(s): /home/runner/work/Gravitas/Gravitas/src/Gravitas/Queries/2D/Hits/Physics2DHitSorter.cs
Line coverage
100%
Covered lines: 33
Uncovered lines: 0
Coverable lines: 33
Total lines: 81
Line coverage: 100%
Branch coverage
100%
Covered branches: 18
Total branches: 18
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
SortByDistance(...)100%11100%
SortByDistance(...)100%66100%
ComesBefore(...)100%11100%
SiftDown(...)100%1010100%
Compare(...)100%22100%
Swap(...)100%11100%

File(s)

/home/runner/work/Gravitas/Gravitas/src/Gravitas/Queries/2D/Hits/Physics2DHitSorter.cs

#LineLine coverage
 1//=======================================================================
 2// Physics2DHitSorter.cs
 3//=======================================================================
 4// MIT License, Copyright (c) 2026-present David Oravsky (mrdav30)
 5// See LICENSE file in the project root for full license information.
 6//=======================================================================
 7
 8using System.Runtime.CompilerServices;
 9using SwiftCollections;
 10
 11namespace Gravitas.Queries;
 12
 13/// <summary>
 14/// Orders planar hits by distance and deterministic tie breaks.
 15/// </summary>
 16internal static class Physics2DHitSorter
 17{
 18    public static void SortByDistance(SwiftList<Physics2DHit> hits)
 19    {
 398120        SortByDistance(hits, 0, hits.Count);
 398121    }
 22
 23    public static void SortByDistance(SwiftList<Physics2DHit> hits, int start, int count)
 24    {
 398125        if (count < 2)
 258126            return;
 27
 2778428        for (int root = (count / 2) - 1; root >= 0; root--)
 1249229            SiftDown(hits, start, root, count);
 30
 5166831        for (int end = count - 1; end > 0; end--)
 32        {
 2443433            Swap(hits, start, start + end);
 2443434            SiftDown(hits, start, 0, end);
 35        }
 140036    }
 37
 17547638    public static bool ComesBefore(Physics2DHit left, Physics2DHit right) => Compare(left, right) < 0;
 39
 40    private static void SiftDown(SwiftList<Physics2DHit> hits, int start, int root, int count)
 41    {
 7727242        while (true)
 43        {
 11419844            int child = (root * 2) + 1;
 11419845            if (child >= count)
 3213246                return;
 47
 8206648            int swapIndex = root;
 8206649            if (ComesBefore(hits[start + swapIndex], hits[start + child]))
 7454850                swapIndex = child;
 51
 8206652            int right = child + 1;
 8206653            if (right < count && ComesBefore(hits[start + swapIndex], hits[start + right]))
 3587854                swapIndex = right;
 55
 8206656            if (swapIndex == root)
 479457                return;
 58
 7727259            Swap(hits, start + root, start + swapIndex);
 7727260            root = swapIndex;
 61        }
 62    }
 63
 64    [MethodImpl(MethodImplOptions.AggressiveInlining)]
 65    private static int Compare(Physics2DHit left, Physics2DHit right)
 66    {
 17547667        int distance = left.Distance.CompareTo(right.Distance);
 17547668        if (distance != 0)
 16747969            return distance;
 70
 799771        return left.Collider.Id.CompareTo(right.Collider.Id);
 72    }
 73
 74    [MethodImpl(MethodImplOptions.AggressiveInlining)]
 75    private static void Swap(SwiftList<Physics2DHit> hits, int left, int right)
 76    {
 10170677        Physics2DHit temp = hits[left];
 10170678        hits[left] = hits[right];
 10170679        hits[right] = temp;
 10170680    }
 81}