Count

Implemented interface members:

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

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

System.Collections.ICollection.Count

62 references to Count

Microsoft.AspNetCore.Mvc.Core (1)

Infrastructure\ActionSelectionTable.cs (1)

132var routeValues = new string[routeKeys.Count];

Microsoft.CodeAnalysis.CodeStyle (2)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\FlowAnalysis\CustomDataFlowAnalysis.cs (2)

93if (toVisit.Count > 0) 198while (toVisit.Count != 0 || unreachableBlocksToVisit.Count != 0);

Microsoft.CodeAnalysis.Test.Utilities (4)

Metadata\MetadataSignatureUnitTestHelper.cs (2)

92if (signatures.Count > 1) 117else if (signatures.Count == 1)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\FlowAnalysis\CustomDataFlowAnalysis.cs (2)

93if (toVisit.Count > 0) 198while (toVisit.Count != 0 || unreachableBlocksToVisit.Count != 0);

Microsoft.CodeAnalysis.UnitTests (2)

Collections\List\TestBase.Generic.cs (2)

289while (set.Count < count) 298Debug.Assert(set.Count == count);

Microsoft.CodeAnalysis.Workspaces (2)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\FlowAnalysis\CustomDataFlowAnalysis.cs (2)

93if (toVisit.Count > 0) 198while (toVisit.Count != 0 || unreachableBlocksToVisit.Count != 0);

Microsoft.ML.AutoML (2)

Sweepers\SmacSweeper.cs (2)

397if (bestK.Count < k || r.CompareTo(worst) > 0) 400if (bestK.Count > k)

Microsoft.ML.Core (1)

Utilities\Utils.cs (1)

105return x == null ? 0 : x.Count;

Microsoft.ML.Sweeper (4)

Algorithms\KdoSweeper.cs (2)

434if (bestK.Count < _args.HistoryLength || r.CompareTo(worst) > 0) 437if (bestK.Count > _args.HistoryLength)

Algorithms\SmacSweeper.cs (2)

388if (bestK.Count < k || r.CompareTo(worst) > 0) 391if (bestK.Count > k)

System.CodeDom (1)

Microsoft\CSharp\CSharpCodeGenerator.cs (1)

2476if (importList.Count > 0)

System.Collections (40)

System\Collections\Generic\SortedDictionary.cs (1)

141return _set.Count;

System\Collections\Generic\SortedSet.cs (37)

94if (sortedSet.Count > 0) 194var stack = new Stack<Node>(2 * (int)Log2(Count + 1)); 290internal virtual int TotalCount() { return Count; } 509public void CopyTo(T[] array) => CopyTo(array, 0, Count); 511public void CopyTo(T[] array, int index) => CopyTo(array, index, Count); 556if (array.Length - index < Count) 807return set1.Count == set2.Count && set1.SetEquals(set2); 856if (asSorted != null && treeSubset == null && Count == 0) 866if (asSorted != null && treeSubset == null && HasEqualComparer(asSorted) && (asSorted.Count > this.Count / 2)) 869T[] merged = new T[asSorted.Count + this.Count]; 990if (Count == 0) 1008T[] merged = new T[this.Count]; 1052List<T> toSave = new List<T>(Count); 1110if (Count == 0) 1177if (Count == 0) 1185if (Count > asSorted.Count) 1193return result.UniqueCount == Count && result.UnfoundCount >= 0; 1214if (Count == 0) 1222if (Count >= asSorted.Count) 1229return result.UniqueCount == Count && result.UnfoundCount > 0; 1244if (Count < asSorted.Count) 1263if (Count == 0) 1273if (asSorted.Count >= Count) 1288return result.UniqueCount < Count && result.UnfoundCount == 0; 1316return result.UniqueCount == Count && result.UnfoundCount == 0; 1323if (Count == 0) 1374if (Count == 0) 1388int originalLastIndex = Count; 1432List<T> matches = new List<T>(this.Count); 1543T[] items = new T[Count];

System\Collections\Generic\SortedSet.TreeSubSet.cs (2)

94if (Count == 0) 336return _underlying.Count;

System.Collections.Immutable (2)

System\Collections\Immutable\ImmutableSortedSet_1.cs (2)

379if (this.Count != otherSet.Count) 421if (this.Count >= otherSet.Count)

System.IO.Packaging (1)

System\IO\Packaging\ZipPackage.cs (1)

572if (pieceSet.Count == 0)