< Summary

Information
Class: Gravitas.SleepIslands
Assembly: Gravitas
File(s): /home/runner/work/Gravitas/Gravitas/src/Gravitas/Core/Islands/SleepIslands.cs
Line coverage
100%
Covered lines: 20
Uncovered lines: 0
Coverable lines: 20
Total lines: 56
Line coverage: 100%
Branch coverage
100%
Covered branches: 12
Total branches: 12
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
.ctor()100%11100%
Reserve(...)100%22100%
Begin(...)100%11100%
Join(...)100%66100%
Block(...)100%11100%
CanSleep(...)100%11100%
FindRoot(...)100%44100%

File(s)

/home/runner/work/Gravitas/Gravitas/src/Gravitas/Core/Islands/SleepIslands.cs

#LineLine coverage
 1//=======================================================================
 2// SleepIslands.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;
 9
 10namespace Gravitas;
 11
 12/// <summary>
 13/// Tracks automatic sleep eligibility for connected body slots after response.
 14/// </summary>
 15internal sealed class SleepIslands
 16{
 17    private const int Ready = -1;
 18    private const int Blocked = -2;
 1019119    private int[] _parents = Array.Empty<int>();
 20
 21    internal void Reserve(int slotCount)
 22    {
 1228123        if (slotCount > _parents.Length)
 1142224            Array.Resize(ref _parents, Math.Max(slotCount, _parents.Length * 2));
 1228125    }
 26
 51227    internal void Begin(int slotCount) => _parents.AsSpan(0, slotCount).Fill(Ready);
 28
 29    internal void Join(int first, int second)
 30    {
 53631        if (first < 0 || second < 0)
 432            return;
 33
 53234        first = FindRoot(first);
 53235        second = FindRoot(second);
 53236        if (first != second)
 53037            _parents[Math.Max(first, second)] = Math.Min(first, second);
 53238    }
 39
 52240    internal void Block(int slot) => _parents[FindRoot(slot)] = Blocked;
 41
 103642    internal bool CanSleep(int slot) => _parents[FindRoot(slot)] == Ready;
 43
 44    private int FindRoot(int slot)
 45    {
 366446        while (_parents[slot] >= 0)
 47        {
 104248            int parent = _parents[slot];
 104249            if (_parents[parent] >= 0)
 1150                _parents[slot] = _parents[parent];
 104251            slot = parent;
 52        }
 53
 262254        return slot;
 55    }
 56}