<PackageReference Include="System.Collections" Version="4.0.11-beta-23409" />

---

API Differences between 4.0.11-beta-23409 and 4.0.10-beta-22231

168 Additions 0 Removals

System.Collections

• public static class StructuralComparisons
  • public static IComparer StructuralComparer { get; }
  • public static IEqualityComparer StructuralEqualityComparer { get; }

System.Collections.Generic

• public class HashSet<T> : ICollection<T>, IEnumerable<T>, IEnumerable, ISet<T>, IReadOnlyCollection<T>
  • public struct Enumerator<T> : IEnumerator<T>, IDisposable, IEnumerator
  • public IEqualityComparer<T> Comparer { get; }
  • public int Count { get; }
  • public HashSet()
  • public HashSet(IEqualityComparer<T> comparer)
  • public HashSet(IEnumerable<T> collection)
  • public HashSet(IEnumerable<T> collection, IEqualityComparer<T> comparer)
  • public bool Add(T item)
  • public void Clear()
  • public bool Contains(T item)
  • public void CopyTo(T[] array, int arrayIndex)
  • public void CopyTo(T[] array)
  • public void CopyTo(T[] array, int arrayIndex, int count)
  • public void ExceptWith(IEnumerable<T> other)
  • public Enumerator<T> GetEnumerator()
  • public void IntersectWith(IEnumerable<T> other)
  • public bool IsProperSubsetOf(IEnumerable<T> other)
  • public bool IsProperSupersetOf(IEnumerable<T> other)
  • public bool IsSubsetOf(IEnumerable<T> other)
  • public bool IsSupersetOf(IEnumerable<T> other)
  • public bool Overlaps(IEnumerable<T> other)
  • public bool Remove(T item)
  • public int RemoveWhere(Predicate<T> match)
  • public bool SetEquals(IEnumerable<T> other)
  • public void SymmetricExceptWith(IEnumerable<T> other)
  • public void TrimExcess()
  • public void UnionWith(IEnumerable<T> other)
• public class LinkedList<T> : ICollection<T>, IEnumerable<T>, IEnumerable, ICollection, IReadOnlyCollection<T>
  • public struct Enumerator<T> : IEnumerator<T>, IDisposable, IEnumerator
  • public int Count { get; }
  • public LinkedListNode<T> First { get; }
  • public LinkedListNode<T> Last { get; }
  • public LinkedList()
  • public LinkedList(IEnumerable<T> collection)
  • public LinkedListNode<T> AddAfter(LinkedListNode<T> node, T value)
  • public void AddAfter(LinkedListNode<T> node, LinkedListNode<T> newNode)
  • public LinkedListNode<T> AddBefore(LinkedListNode<T> node, T value)
  • public void AddBefore(LinkedListNode<T> node, LinkedListNode<T> newNode)
  • public LinkedListNode<T> AddFirst(T value)
  • public void AddFirst(LinkedListNode<T> node)
  • public LinkedListNode<T> AddLast(T value)
  • public void AddLast(LinkedListNode<T> node)
  • public void Clear()
  • public bool Contains(T value)
  • public void CopyTo(T[] array, int index)
  • public LinkedListNode<T> Find(T value)
  • public LinkedListNode<T> FindLast(T value)
  • public Enumerator<T> GetEnumerator()
  • public bool Remove(T value)
  • public void Remove(LinkedListNode<T> node)
  • public void RemoveFirst()
  • public void RemoveLast()
• public sealed class LinkedListNode<T>
  • public LinkedList<T> List { get; }
  • public LinkedListNode<T> Next { get; }
  • public LinkedListNode<T> Previous { get; }
  • public T Value { get; set; }
  • public LinkedListNode(T value)
• public class Queue<T> : IEnumerable<T>, IEnumerable, ICollection, IReadOnlyCollection<T>
  • public struct Enumerator<T> : IEnumerator<T>, IDisposable, IEnumerator
  • public int Count { get; }
  • public Queue()
  • public Queue(int capacity)
  • public Queue(IEnumerable<T> collection)
  • public void Clear()
  • public bool Contains(T item)
  • public void CopyTo(T[] array, int arrayIndex)
  • public T Dequeue()
  • public void Enqueue(T item)
  • public Enumerator<T> GetEnumerator()
  • public T Peek()
  • public T[] ToArray()
  • public void TrimExcess()
• public class SortedDictionary<TKey, TValue> : IDictionary<TKey, TValue>, ICollection<KeyValuePair<TKey, TValue>>, IEnumerable<KeyValuePair<TKey, TValue>>, IEnumerable, IDictionary, ICollection, IReadOnlyDictionary<TKey, TValue>, IReadOnlyCollection<KeyValuePair<TKey, TValue>>
  • public struct Enumerator<TKey, TValue> : IEnumerator<KeyValuePair<TKey, TValue>>, IDisposable, IEnumerator, IDictionaryEnumerator
  • public sealed class KeyCollection<TKey, TValue> : ICollection<TKey>, IEnumerable<TKey>, IEnumerable, ICollection, IReadOnlyCollection<TKey>
  • public sealed class ValueCollection<TKey, TValue> : ICollection<TValue>, IEnumerable<TValue>, IEnumerable, ICollection, IReadOnlyCollection<TValue>
  • public IComparer<TKey> Comparer { get; }
  • public int Count { get; }
  • public TValue this[TKey key] { get; set; }
  • public KeyCollection<TKey, TValue> Keys { get; }
  • public ValueCollection<TKey, TValue> Values { get; }
  • public SortedDictionary()
  • public SortedDictionary(IDictionary<TKey, TValue> dictionary)
  • public SortedDictionary(IDictionary<TKey, TValue> dictionary, IComparer<TKey> comparer)
  • public SortedDictionary(IComparer<TKey> comparer)
  • public void Add(TKey key, TValue value)
  • public void Clear()
  • public bool ContainsKey(TKey key)
  • public bool ContainsValue(TValue value)
  • public void CopyTo(KeyValuePair<TKey, TValue>[] array, int index)
  • public Enumerator<TKey, TValue> GetEnumerator()
  • public bool Remove(TKey key)
  • public bool TryGetValue(TKey key, out TValue value)
• public class SortedList<TKey, TValue> : IDictionary<TKey, TValue>, ICollection<KeyValuePair<TKey, TValue>>, IEnumerable<KeyValuePair<TKey, TValue>>, IEnumerable, IDictionary, ICollection, IReadOnlyDictionary<TKey, TValue>, IReadOnlyCollection<KeyValuePair<TKey, TValue>>
  • public int Capacity { get; set; }
  • public IComparer<TKey> Comparer { get; }
  • public int Count { get; }
  • public TValue this[TKey key] { get; set; }
  • public IList<TKey> Keys { get; }
  • public IList<TValue> Values { get; }
  • public SortedList()
  • public SortedList(int capacity)
  • public SortedList(IComparer<TKey> comparer)
  • public SortedList(int capacity, IComparer<TKey> comparer)
  • public SortedList(IDictionary<TKey, TValue> dictionary)
  • public SortedList(IDictionary<TKey, TValue> dictionary, IComparer<TKey> comparer)
  • public void Add(TKey key, TValue value)
  • public void Clear()
  • public bool ContainsKey(TKey key)
  • public bool ContainsValue(TValue value)
  • public IEnumerator<KeyValuePair<TKey, TValue>> GetEnumerator()
  • public int IndexOfKey(TKey key)
  • public int IndexOfValue(TValue value)
  • public bool Remove(TKey key)
  • public void RemoveAt(int index)
  • public void TrimExcess()
  • public bool TryGetValue(TKey key, out TValue value)
• public class SortedSet<T> : ISet<T>, ICollection<T>, IEnumerable<T>, IEnumerable, ICollection, IReadOnlyCollection<T>
  • public struct Enumerator<T> : IEnumerator<T>, IDisposable, IEnumerator
  • public IComparer<T> Comparer { get; }
  • public int Count { get; }
  • public T Max { get; }
  • public T Min { get; }
  • public SortedSet()
  • public SortedSet(IComparer<T> comparer)
  • public SortedSet(IEnumerable<T> collection)
  • public SortedSet(IEnumerable<T> collection, IComparer<T> comparer)
  • public bool Add(T item)
  • public virtual void Clear()
  • public virtual bool Contains(T item)
  • public void CopyTo(T[] array)
  • public void CopyTo(T[] array, int index)
  • public void CopyTo(T[] array, int index, int count)
  • public void ExceptWith(IEnumerable<T> other)
  • public Enumerator<T> GetEnumerator()
  • public virtual SortedSet<T> GetViewBetween(T lowerValue, T upperValue)
  • public virtual void IntersectWith(IEnumerable<T> other)
  • public bool IsProperSubsetOf(IEnumerable<T> other)
  • public bool IsProperSupersetOf(IEnumerable<T> other)
  • public bool IsSubsetOf(IEnumerable<T> other)
  • public bool IsSupersetOf(IEnumerable<T> other)
  • public bool Overlaps(IEnumerable<T> other)
  • public bool Remove(T item)
  • public int RemoveWhere(Predicate<T> match)
  • public IEnumerable<T> Reverse()
  • public bool SetEquals(IEnumerable<T> other)
  • public void SymmetricExceptWith(IEnumerable<T> other)
  • public void UnionWith(IEnumerable<T> other)
• public class Stack<T> : IEnumerable<T>, IEnumerable, ICollection, IReadOnlyCollection<T>
  • public struct Enumerator<T> : IEnumerator<T>, IDisposable, IEnumerator
  • public int Count { get; }
  • public Stack()
  • public Stack(int capacity)
  • public Stack(IEnumerable<T> collection)
  • public void Clear()
  • public bool Contains(T item)
  • public void CopyTo(T[] array, int arrayIndex)
  • public Enumerator<T> GetEnumerator()
  • public T Peek()
  • public T Pop()
  • public void Push(T item)
  • public T[] ToArray()
  • public void TrimExcess()