mlemanczyk/Recyclable.Collections.Compatibility.List
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Unsupported methods marked as internal.

Browse Source
This commit is contained in:
mlemanczyk committed 2024-01-17 22:41:56 +01:00
1 parent 4ddd57eaf4
commit 6076e330a6
5 files changed
+30 -28
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

Recyclable.Collections.Compatibility.List/Recyclable.Collections.Compatibility.List.csproj
+2 -2
View File
@@ -6,7 +6,7 @@
<Nullable>enable</Nullable>
<GeneratePackageOnBuild>true</GeneratePackageOnBuild>
<PackageId>Recyclable.Collections.Compatibility.List</PackageId>
<PackageVersion>0.0.2</PackageVersion>
<PackageVersion>0.0.3</PackageVersion>
<Authors>Marek Lemańczyk</Authors>
<Company>N/A</Company>
<Product>Recyclable.Collections.Compatibility.List</Product>
@@ -18,7 +18,7 @@
<PackageLicenseFile>LICENSE.md</PackageLicenseFile>
<PackageReadmeFile>README.md</PackageReadmeFile>
<RepositoryType>git</RepositoryType>
<PackageReleaseNotes>Collections.Benchmarks.Core package updated. Bug fixes.</PackageReleaseNotes>
<PackageReleaseNotes>RecyclableLongList.Compatibility.List.Find(), .FindLast(), .ForEach() &amp; .GetRange() implemented. Bug fixes.</PackageReleaseNotes>
<Platforms>AnyCPU;x64</Platforms>
<PackageIcon>logo.png</PackageIcon>
</PropertyGroup>
Recyclable.Collections.Compatibility.List/RecyclableList.Compatibility.List.cs
+2
View File
@@ -6,6 +6,8 @@ using System.Runtime.CompilerServices;
using Recyclable.Collections.Compatibility.List.Properties;
using Recyclable.Collections.Pools;
[assembly: InternalsVisibleTo("Recyclable.Collections.Compatibility.List.Tests")]
namespace Recyclable.Collections
{
Recyclable.Collections.Compatibility.List/RecyclableLongList.Compatibility.List.IndexOf.cs
+3 -3
View File
@@ -6,19 +6,19 @@ namespace Recyclable.Collections
public static class zzzRecyclableLongListCompatibilityListIndexOf
#pragma warning restore IDE1006 // Naming Styles
{
public static int LastIndexOf<T>(this RecyclableLongList<T> list, T item)
internal static int LastIndexOf<T>(this RecyclableLongList<T> list, T item)
//=> list._count != 0
// ? Array.LastIndexOf(list._memoryBlock, item, list._count - 1)
// : RecyclableDefaults.ItemNotFoundIndex;
=> throw new NotImplementedException();
public static int LastIndexOf<T>(this RecyclableLongList<T> list, T item, int index)
internal static int LastIndexOf<T>(this RecyclableLongList<T> list, T item, int index)
//=> list._count != 0
// ? Array.LastIndexOf(list._memoryBlock, item, index)
// : RecyclableDefaults.ItemNotFoundIndex;
=> throw new NotImplementedException();
public static int LastIndexOf<T>(this RecyclableLongList<T> list, T item, int index, int count)
internal static int LastIndexOf<T>(this RecyclableLongList<T> list, T item, int index, int count)
//=> list._count != 0
// ? Array.LastIndexOf(list._memoryBlock, item, index, count)
// : RecyclableDefaults.ItemNotFoundIndex;
Recyclable.Collections.Compatibility.List/RecyclableLongList.Compatibility.List.InsertRange.cs
+12 -12
View File
@@ -90,7 +90,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, in Array items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, in Array items)
{
//if (list._capacity < list._count + items.Length)
//{
@@ -108,7 +108,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, in T[] items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, in T[] items)
{
//if (list._capacity < list._count + items.Length)
//{
@@ -126,7 +126,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, ReadOnlySpan<T> items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, ReadOnlySpan<T> items)
{
//if (list._capacity < list._count + items.Length)
//{
@@ -144,7 +144,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, Span<T> items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, Span<T> items)
{
//if (list._capacity < list._count + items.Length)
//{
@@ -162,7 +162,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, List<T> items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, List<T> items)
{
//if (list._capacity < list._count + items.Count)
//{
@@ -180,7 +180,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, ICollection items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, ICollection items)
{
//if (list._capacity < list._count + items.Count)
//{
@@ -198,7 +198,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, ICollection<T> items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, ICollection<T> items)
{
//if (list._capacity < list._count + items.Count)
//{
@@ -216,7 +216,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, RecyclableList<T> items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, RecyclableList<T> items)
{
//if (list._capacity < list._count + items._count)
//{
@@ -234,7 +234,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, RecyclableLongList<T> items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, RecyclableLongList<T> items)
{
//if (items._longCount == 0)
//{
@@ -287,7 +287,7 @@ namespace Recyclable.Collections
throw new NotImplementedException();
}
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, IEnumerable items, int growByCount = RecyclableDefaults.MinPooledArrayLength)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, IEnumerable items, int growByCount = RecyclableDefaults.MinPooledArrayLength)
{
//var enumerator = items.GetEnumerator();
//if (!enumerator.MoveNext())
@@ -349,7 +349,7 @@ namespace Recyclable.Collections
throw new NotImplementedException();
}
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, IReadOnlyList<T> items)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, IReadOnlyList<T> items)
{
//int sourceItemsCount = items.Count;
//if (list._capacity < list._count + sourceItemsCount)
@@ -370,7 +370,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.NoInlining | MethodImplOptions.AggressiveOptimization)]
public static void InsertRange<T>(this RecyclableLongList<T> list, int index, IEnumerable<T> items, int growByCount = RecyclableDefaults.MinPooledArrayLength)
internal static void InsertRange<T>(this RecyclableLongList<T> list, int index, IEnumerable<T> items, int growByCount = RecyclableDefaults.MinPooledArrayLength)
{
//if (items is RecyclableList<T> sourceRecyclableList)
//{
Recyclable.Collections.Compatibility.List/RecyclableLongList.Compatibility.List.cs
+11 -11
View File
@@ -463,7 +463,7 @@ namespace Recyclable.Collections
return result;
}
public static int RemoveAll<T>(this RecyclableLongList<T> list, Predicate<T> match)
internal static int RemoveAll<T>(this RecyclableLongList<T> list, Predicate<T> match)
{
//using var allIndexes = zzzRecyclableListCompatibilityListFind.FindAllIndexes(list, match);
//int foundItemsCount = allIndexes._count;
@@ -490,7 +490,7 @@ namespace Recyclable.Collections
throw new NotImplementedException();
}
public static void RemoveRange<T>(this RecyclableLongList<T> list, int index, int count)
internal static void RemoveRange<T>(this RecyclableLongList<T> list, int index, int count)
{
//int oldCount = list._count;
//count = count - index + 1 <= oldCount ? count : oldCount - index + 1;
@@ -516,7 +516,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Reverse<T>(this RecyclableLongList<T> list)
internal static void Reverse<T>(this RecyclableLongList<T> list)
{
//Array.Reverse(list._memoryBlock, 0, list._count);
//list._version++;
@@ -525,7 +525,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Reverse<T>(this RecyclableLongList<T> list, int index, int count)
internal static void Reverse<T>(this RecyclableLongList<T> list, int index, int count)
{
//Array.Reverse(list._memoryBlock, index, count);
//list._version++;
@@ -534,7 +534,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Sort<T>(this RecyclableLongList<T> list)
internal static void Sort<T>(this RecyclableLongList<T> list)
{
//Array.Sort(list._memoryBlock, 0, list._count);
//list._version++;
@@ -543,7 +543,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Sort<T>(this RecyclableLongList<T> list, Comparison<T> comparison)
internal static void Sort<T>(this RecyclableLongList<T> list, Comparison<T> comparison)
{
//Array.Sort(list._memoryBlock, 0, list._count, new ComparisonToComparerAdapter<T>(comparison));
//list._version++;
@@ -552,7 +552,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Sort<T>(this RecyclableLongList<T> list, IComparer<T>? comparer)
internal static void Sort<T>(this RecyclableLongList<T> list, IComparer<T>? comparer)
{
//Array.Sort(list._memoryBlock, 0, list._count, comparer);
//list._version++;
@@ -561,7 +561,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Sort<T>(this RecyclableLongList<T> list, int index, int count, IComparer<T>? comparer)
internal static void Sort<T>(this RecyclableLongList<T> list, int index, int count, IComparer<T>? comparer)
{
//Array.Sort(list._memoryBlock, index, count, comparer);
//list._version++;
@@ -570,7 +570,7 @@ namespace Recyclable.Collections
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static T[] ToArray<T>(this RecyclableLongList<T> list)
internal static T[] ToArray<T>(this RecyclableLongList<T> list)
{
//T[] result = new T[list._count];
//new ReadOnlySpan<T>(list._memoryBlock, 0, list._count).CopyTo(result);
@@ -579,7 +579,7 @@ namespace Recyclable.Collections
throw new NotImplementedException();
}
public static void TrimExcess<T>(this RecyclableLongList<T> list)
internal static void TrimExcess<T>(this RecyclableLongList<T> list)
{
//var requiredCapacity = list._count >= RecyclableDefaults.InitialCapacity ? list._count : RecyclableDefaults.InitialCapacity;
@@ -601,7 +601,7 @@ namespace Recyclable.Collections
throw new NotImplementedException();
}
public static bool TrueForAll<T>(this RecyclableLongList<T> list, Predicate<T> match)
internal static bool TrueForAll<T>(this RecyclableLongList<T> list, Predicate<T> match)
{
//int sourceItemsCount = list._count;
//if (sourceItemsCount == 0)