Count

Implemented interface members:

System.Collections.Generic.ICollection<T>.Count

System.Collections.Generic.IReadOnlyCollection<T>.Count

System.Collections.ICollection.Count

44 references to Count

System (43)

compmod\system\collections\generic\sorteddictionary.cs (1)

114return _set.Count;

compmod\system\collections\generic\sortedset.cs (42)

122if (baseSortedSet.Count == 0) { 131Stack<Node> theirStack = new Stack<SortedSet<T>.Node>(2 * log2(baseSortedSet.Count) + 2); 132Stack<Node> myStack = new Stack<SortedSet<T>.Node>(2 * log2(baseSortedSet.Count) + 2); 235Stack<Node> stack = new Stack<Node>(2 * (int)(SortedSet<T>.log2(Count + 1))); 582public void CopyTo(T[] array) { CopyTo(array, 0, Count); } 584public void CopyTo(T[] array, int index) { CopyTo(array, index, Count); } 635if (array.Length - index < Count) { 927if (set1.Count != set2.Count) 967T[] newArray = new T[Count]; 1005if (s != null && t == null && AreComparersEqual(this, s) && (s.Count > this.Count / 2)) { //this actually hurts if N is much greater than M the /2 is arbitrary 1007T[] merged = new T[s.Count + this.Count]; 1126if (Count == 0) 1141T[] merged = new T[this.Count]; 1177List<T> toSave = new List<T>(this.Count); 1244if (this.Count == 0) { 1322if (Count == 0) 1328if (this.Count > asSorted.Count) 1336return (result.uniqueCount == Count && result.unfoundCount >= 0); 1363if (Count == 0) 1378if (this.Count >= asSorted.Count) 1387return (result.uniqueCount == Count && result.unfoundCount > 0); 1414if (this.Count < asSorted.Count) 1438if (Count == 0) 1455if (asSorted.Count >= this.Count) 1471return (result.uniqueCount < Count && result.unfoundCount == 0); 1512return (result.uniqueCount == Count && result.unfoundCount == 0); 1527if (this.Count == 0) 1589if (Count == 0) { 1602int originalLastIndex = Count; 1643List<T> matches = new List<T>(this.Count); 1983List<T> toSave = new List<T>(this.Count); 2086T[] items = new T[Count]; 2178stack = new Stack<SortedSet<T>.Node>(2 * (int)SortedSet<T>.log2(set.Count + 1)); 2195stack = new Stack<SortedSet<T>.Node>(2 * (int)SortedSet<T>.log2(set.Count + 1)); 2244stack = new Stack<SortedSet<T>.Node>(2 * (int)SortedSet<T>.log2(tree.Count + 1));

System.Data.Entity (1)

System\Data\Mapping\Update\Internal\Graph.cs (1)

163while (0 < rootsPriorityQueue.Count)