Extern/Beef
1
0
Fork 0
mirror of https://github.com/beefytech/Beef.git synced 2025-06-20 17:08:00 +02:00
Code Activity

Removed 'internal' protection - it's all about [Friend] now

Browse source
This commit is contained in:
Brian Fiete 2020-03-09 06:34:16 -07:00
parent 81af04a1ce
commit 14ac27c977
119 changed files with 1339 additions and 1388 deletions
Download patch file Download diff file Expand all files Collapse all files

20
BeefLibs/corlib/src/Collections/Generic/Dictionary.bf
View file

@ -218,7 +218,7 @@ namespace System.Collections.Generic
public Enumerator GetEnumerator()
{
return Enumerator(this, Enumerator.KeyValuePair);
return Enumerator(this, Enumerator.[Friend]KeyValuePair);
}
[DisableObjectAccessChecks]
@ -572,10 +572,10 @@ namespace System.Collections.Generic
//private KeyValuePair<TKey, TValue> current;
private int_cosize mGetEnumeratorRetType; // What should Enumerator.Current return?
internal const int_cosize DictEntry = 1;
internal const int_cosize KeyValuePair = 2;
const int_cosize DictEntry = 1;
const int_cosize KeyValuePair = 2;
internal this(Dictionary<TKey, TValue> dictionary, int_cosize getEnumeratorRetType)
public this(Dictionary<TKey, TValue> dictionary, int_cosize getEnumeratorRetType)
{
mDictionary = dictionary;
#if VERSION_DICTIONARY
@ -718,10 +718,10 @@ namespace System.Collections.Generic
private int_cosize mIndex;
private TValue mCurrent;
internal const int_cosize cDictEntry = 1;
internal const int_cosize cKeyValuePair = 2;
const int_cosize cDictEntry = 1;
const int_cosize cKeyValuePair = 2;
internal this(Dictionary<TKey, TValue> dictionary)
public this(Dictionary<TKey, TValue> dictionary)
{
mDictionary = dictionary;
#if VERSION_DICTIONARY
@ -819,10 +819,10 @@ namespace System.Collections.Generic
private int_cosize mIndex;
private TKey* mCurrent;
internal const int_cosize DictEntry = 1;
internal const int_cosize KeyValuePair = 2;
const int_cosize DictEntry = 1;
const int_cosize KeyValuePair = 2;
internal this(Dictionary<TKey, TValue> dictionary)
public this(Dictionary<TKey, TValue> dictionary)
{
mDictionary = dictionary;
#if VERSION_DICTIONARY

18
BeefLibs/corlib/src/Collections/Generic/HashSet.bf
View file

@ -988,7 +988,7 @@ namespace System.Collections.Generic
}*/
/// Copies this to an array. Used for DebugView
internal T[] ToArray()
T[] ToArray()
{
T[] newArray = new T[Count];
CopyTo(newArray);
@ -1074,17 +1074,17 @@ namespace System.Collections.Generic
#endregion
// used for set checking operations (using enumerables) that rely on counting
internal struct ElementCount
struct ElementCount
{
internal int32 mUniqueCount;
internal int32 mUnfoundCount;
public int32 mUniqueCount;
public int32 mUnfoundCount;
}
internal struct Slot
struct Slot
{
internal int32 mHashCode; // Lower 31 bits of hash code, -1 if unused
internal T mValue;
internal int32 mNext; // Index of next entry, -1 if last
public int32 mHashCode; // Lower 31 bits of hash code, -1 if unused
public T mValue;
public int32 mNext; // Index of next entry, -1 if last
}
public struct Enumerator : IEnumerator<T>
@ -1096,7 +1096,7 @@ namespace System.Collections.Generic
#endif
private T mCurrent;
internal this(HashSet<T> set)
public this(HashSet<T> set)
{
this.mSet = set;
mIndex = 0;

6
BeefLibs/corlib/src/Collections/Generic/List.bf
View file

@ -530,7 +530,7 @@ namespace System.Collections.Generic
public void Sort(Comparison<T> comp)
{
var sorter = Sorter<T, void>(mItems, null, mSize, comp);
sorter.Sort(0, mSize);
sorter.[Friend]Sort(0, mSize);
}
public int RemoveAll(Predicate<T> match)
@ -622,7 +622,7 @@ namespace System.Collections.Generic
if (mItems == null)
return;
let type = typeof(T);
if ((type.mTypeFlags & .WantsMark) == 0)
if ((type.[Friend]mTypeFlags & .WantsMark) == 0)
return;
for (int i < mSize)
{
@ -639,7 +639,7 @@ namespace System.Collections.Generic
#endif
private T* mCurrent;
internal this(List<T> list)
public this(List<T> list)
{
mList = list;
mIndex = 0;

4
BeefLibs/corlib/src/Collections/Generic/Queue.bf
View file

@ -196,7 +196,7 @@ namespace System.Collections.Generic
return false;
}
internal T GetElement(int i)
T GetElement(int i)
{
return mArray[(mHead + i) % mArray.Count];
}
@ -270,7 +270,7 @@ namespace System.Collections.Generic
#endif
private T mCurrentElement;
internal this(Queue<T> q)
public this(Queue<T> q)
{
mQueue = q;
#if VERSION_QUEUE

8
BeefLibs/corlib/src/Collections/Generic/Sorter.bf
View file

@ -16,7 +16,7 @@ namespace System.Collections.Generic
private int mCount;
private Comparison<T> comparer;
internal this(T* keys, T2* items, int count, Comparison<T> comparer)
public this(T* keys, T2* items, int count, Comparison<T> comparer)
{
this.keys = keys;
this.items = items;
@ -24,7 +24,7 @@ namespace System.Collections.Generic
this.comparer = comparer;
}
internal static int FloorLog2(int n)
static int FloorLog2(int n)
{
int result = 0;
int val = n;
@ -44,7 +44,7 @@ namespace System.Collections.Generic
return low + ((hi - low) >> 1);
}
internal void SwapIfGreaterWithItems(int a, int b)
void SwapIfGreaterWithItems(int a, int b)
{
if (a != b)
{
@ -77,7 +77,7 @@ namespace System.Collections.Generic
}
}
internal void Sort(int left, int length)
void Sort(int left, int length)
{
IntrospectiveSort(left, length);
}