aaru-dps/Aaru
1
0
Fork 0
mirror of https://github.com/aaru-dps/Aaru.git synced 2025-12-16 19:24:25 +00:00
Code Issues Packages Projects Releases Wiki Activity

General refactor and cleanup.

Browse Source
This commit is contained in:
Natalia Portillo
2024-05-01 04:05:22 +01:00
parent 185a8c3fd5
commit e46d21bde6
922 changed files with 36437 additions and 29485 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
Aaru.CommonTypes/Extents/ExtentsInt.cs
View File

@@ -61,8 +61,7 @@ public sealed class ExtentsInt
_backend = new List<Tuple<int, int>>();
// This ensure no overlapping extents are added on creation
foreach(Tuple<int, int> t in list)
Add(t.Item1, t.Item2);
foreach(Tuple<int, int> t in list) Add(t.Item1, t.Item2);
}
/// <summary>Gets a count of how many extents are stored</summary>
@@ -79,8 +78,7 @@ public sealed class ExtentsInt
for(var i = 0; i < _backend.Count; i++)
{
// Already contained in an extent
if(item >= _backend[i].Item1 && item <= _backend[i].Item2)
return;
if(item >= _backend[i].Item1 && item <= _backend[i].Item2) return;
// Expands existing extent start
if(item == _backend[i].Item1 - 1)
@@ -99,8 +97,7 @@ public sealed class ExtentsInt
}
// Expands existing extent end
if(item != _backend[i].Item2 + 1)
continue;
if(item != _backend[i].Item2 + 1) continue;
removeOne = _backend[i];
@@ -145,8 +142,7 @@ public sealed class ExtentsInt
realEnd = end;
// TODO: Optimize this
for(int t = start; t <= realEnd; t++)
Add(t);
for(int t = start; t <= realEnd; t++) Add(t);
}
/// <summary>Checks if the specified item is contained by an extent on this instance</summary>
@@ -197,8 +193,7 @@ public sealed class ExtentsInt
}
// Extent is only element
if(item != extent.Item1 || item != extent.Item2)
continue;
if(item != extent.Item1 || item != extent.Item2) continue;
toRemove = extent;
@@ -206,16 +201,13 @@ public sealed class ExtentsInt
}
// Item not found
if(toRemove == null)
return false;
if(toRemove == null) return false;
_backend.Remove(toRemove);
if(toAddOne != null)
_backend.Add(toAddOne);
if(toAddOne != null) _backend.Add(toAddOne);
if(toAddTwo != null)
_backend.Add(toAddTwo);
if(toAddTwo != null) _backend.Add(toAddTwo);
// Sort
_backend = _backend.OrderBy(t => t.Item1).ToList();