Count

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

ArrayBuilder.cs (3)

114_builder.Count = value; 670_builder.Count = limit; 676_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

EditAndContinue\AbstractEditAndContinueAnalyzer.cs (2)

633newActiveStatements.Count = oldActiveStatements.Length; 636newExceptionRegions.Count = oldActiveStatements.Length;

EditAndContinue\EditAndContinueDiagnosticDescriptors.cs (1)

55builder.Count = index + 1;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

System\Collections\Immutable\ImmutableArray_1.Builder.cs (8)

245this.Count = 0; 369this.Count += items.Length; 384this.Count += items.Length; 400this.Count += length; 436this.Count += items.Length; 449this.Count += items.Length; 574this.Count--; 1065this.Count += length;

System\Reflection\Metadata\Ecma335\MetadataBuilder.Heaps.cs (1)

544stringVirtualIndexToHeapOffsetMap.Count = totalCount;

System\Reflection\Metadata\Ecma335\MetadataBuilder.Tables.cs (1)

297rowCounts.Count = MetadataTokens.TableCount;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (3)

114_builder.Count = value; 692_builder.Count = limit; 698_builder.Count = count;

Health\ResourceHealthCheckService.cs (1)

299for (var i = 0; i < builder.Count; i++)

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\libraries\System.Reflection.Metadata\src\System\Reflection\Metadata\TypeName.cs (1)

68: genericTypeArguments.Count == genericTypeArguments.Capacity ? genericTypeArguments.MoveToImmutable() : genericTypeArguments.ToImmutableArray();

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

ArrayBuilder.cs (10)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 282for (var j = 0; j < _builder.Count; j++) 301for (var j = 0; j < _builder.Count; j++) 342_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 356=> _builder[_builder.Count - 1]; 368return _builder.Count > 0;

CodeGen\LocalScopeManager.cs (13)

261Debug.Assert(scopes.Count > 0); 285Debug.Assert(scopes.Count > 0); 419for (int i = 0, cnt = _nestedScopes.Count; i < cnt; i++) 435for (int i = 0; i < Blocks.Count; i++) 480for (int i = 0; i < Blocks.Count; i++) 524for (int i = 0, cnt = Blocks.Count; i < cnt; i++) 532for (int i = 0, cnt = _nestedScopes.Count; i < cnt; i++) 699Debug.Assert(((_handlers.Count == 0) && (scopeType == ScopeType.Try)) || 700((_handlers.Count > 0) && ((scopeType == ScopeType.Catch) || (scopeType == ScopeType.Filter) || (scopeType == ScopeType.Finally) || (scopeType == ScopeType.Fault)))); 711Debug.Assert(_handlers.Count > 1); 717for (int i = 1; i < _handlers.Count; i++) 749Debug.Assert(_handlers.Count > 1); 847if (handlers.Count != 2 || handlers[1].Type != ScopeType.Finally)

MetadataReference\AssemblyMetadata.cs (1)

352for (int i = _initialModules.Length; i < moduleBuilder.Count; i++)

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\RoslynAnalyzers\Utilities\FlowAnalysis\Extensions\ListExtensions.cs (4)

37list[i - builder.Count] = value; 46list.RemoveRange(list.Count - builder.Count, builder.Count); 47return builder.Capacity == builder.Count ? builder.MoveToImmutable() : builder.ToImmutable();

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Analyzers\CSharp\Analyzers\RemoveUnnecessaryNullableDirective\NullableImpactingSpanWalker.cs (1)

30public bool HasSpans => _spans?.Count > 0;

Diagnostics\Analyzers\TypeSyntaxSimplifierWalker.cs (1)

58public bool HasDiagnostics => _diagnostics?.Count > 0;

src\Analyzers\CSharp\Analyzers\RemoveUnnecessaryNullableDirective\NullableImpactingSpanWalker.cs (1)

30public bool HasSpans => _spans?.Count > 0;

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

DocumentationComments\AbstractDocumentationCommentFormattingService.cs (1)

88public bool AtBeginning => Builder.Count == 0;

EditAndContinue\AbstractEditAndContinueAnalyzer.cs (6)

956Debug.Assert(oldActiveStatements.Length == newActiveStatements.Count); 957Debug.Assert(oldActiveStatements.Length == newExceptionRegions.Count); 962for (var i = 0; i < newActiveStatements.Count; i++) 1123Debug.Assert(oldActiveStatements.IsEmpty || oldActiveStatements.Length == newActiveStatements.Count); 1124Debug.Assert(newActiveStatements.Count == newExceptionRegions.Count);

EditAndContinue\EditAndContinueDiagnosticDescriptors.cs (2)

53if (index >= builder.Count) 192s_generalDiagnosticBaseIndex = builder.Count;

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\LanguageServer\Microsoft.CommonLanguageServerProtocol.Framework\MethodHandlerDetails.cs (1)

92if (builder.Count == 0)

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

Hosting\AssemblyLoader\MetadataShadowCopyProvider.cs (1)

491for (int i = 1; i < moduleBuilder.Count; i++)

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

Workspace\ProjectSystem\ProjectSystemProject.BatchingDocumentCollection.cs (2)

311for (var i = 0; i < _documentsAddedInBatch.Count; i++) 372for (var i = 0; i < _documentsAddedInBatch.Count; i++)

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

MethodHandlerDetails.cs (1)

92if (builder.Count == 0)

Extensions\ITypeSymbolExtensions.cs (1)

91return derivedTypes.Count == 0 ? null : derivedTypes.ToImmutable();

ComInterfaceGenerator.cs (1)

437for (int i = methodList.Count - 1; i > -1; i--)

ComInterfaceInfo.cs (1)

135if (nonFatalDiagnostics.Count != 0)

GeneratedStatements.cs (1)

80if (statementsToUpdate.Count > 0)

SignatureContext.cs (1)

117NativeIndex = typeInfos.Count

TaskList\VisualStudioDiagnosticIdCache.cs (1)

171if (builder.Count == 0)

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

System\Collections\Immutable\ImmutableArray_1.Builder.cs (56)

113for (int i = value; i < this.Count; i++) 142if (index >= this.Count) 152if (index >= this.Count) 170if (index >= this.Count) 201/// <exception cref="InvalidOperationException">When <see cref="ImmutableArray{T}.Builder.Count"/> doesn't 205if (Capacity != Count) 220/// If <see cref="Capacity"/> equals <see cref="Count"/>, the internal array will be extracted 255Requires.Range(index >= 0 && index <= this.Count, nameof(index)); 256this.EnsureCapacity(this.Count + 1); 258if (index < this.Count) 260Array.Copy(_elements, index, _elements, index + 1, this.Count - index); 274Requires.Range(index >= 0 && index <= this.Count, nameof(index)); 278this.EnsureCapacity(this.Count + count); 280if (index != this.Count) 303Requires.Range(index >= 0 && index <= this.Count, nameof(index)); 310this.EnsureCapacity(this.Count + items.Length); 312if (index != this.Count) 345this.EnsureCapacity(this.Count + count); 368int offset = this.Count; 383int offset = this.Count; 399int offset = this.Count; 435int offset = this.Count; 448int offset = this.Count; 478this.AddRange(items._elements, items.Count); 489this.AddRange(items._elements, items.Count); 567Requires.Range(index >= 0 && index < this.Count, nameof(index)); 569if (index < this.Count - 1) 571Array.Copy(_elements, index + 1, _elements, index, this.Count - index - 1); 601Array.Copy(_elements, index + length, _elements, index, this.Count - index - length); 687if (this.Count == 0) 692T[] result = new T[this.Count]; 693Array.Copy(_elements, result, this.Count); 705Requires.Range(index >= 0 && index + this.Count <= array.Length, nameof(index)); 706Array.Copy(_elements, 0, array, index, this.Count); 716Array.Copy(_elements, 0, destination, 0, this.Count); 730Requires.Range(sourceIndex >= 0 && sourceIndex + length <= this.Count, nameof(sourceIndex)); 768return this.IndexOf(item, startIndex, this.Count - startIndex, EqualityComparer<T>.Default); 801Requires.Range(startIndex >= 0 && startIndex < this.Count, nameof(startIndex)); 802Requires.Range(count >= 0 && startIndex + count <= this.Count, nameof(count)); 835return this.IndexOf(item, startIndex, this.Count - startIndex, equalityComparer); 845if (this.Count == 0) 850return this.LastIndexOf(item, this.Count - 1, this.Count, EqualityComparer<T>.Default); 861if (this.Count == 0 && startIndex == 0) 866Requires.Range(startIndex >= 0 && startIndex < this.Count, nameof(startIndex)); 898Requires.Range(startIndex >= 0 && startIndex < this.Count, nameof(startIndex)); 949if (Count > 1) 951Array.Sort(_elements, 0, this.Count, Comparer<T>.Default); 967if (Count > 1) 989if (Count > 1) 1006Requires.Range(count >= 0 && index + count <= this.Count, nameof(count)); 1020Requires.Range(this.Count <= destination.Length, nameof(destination)); 1021new ReadOnlySpan<T>(_elements, 0, this.Count).CopyTo(destination); 1030for (int i = 0; i < this.Count; i++) 1062this.EnsureCapacity(this.Count + length); 1064int offset = this.Count;

System\Linq\ImmutableArrayExtensions.cs (3)

683return builder[builder.Count - 1]; 693return builder.Any() ? builder[builder.Count - 1] : default; 703return builder.Count > 0;

System\Reflection\Metadata\Internal\NamespaceCache.cs (1)

178Debug.Assert(data.Namespaces!.Count == 0);

System\Reflection\Metadata\TypeName.cs (1)

68: genericTypeArguments.Count == genericTypeArguments.Capacity ? genericTypeArguments.MoveToImmutable() : genericTypeArguments.ToImmutableArray();

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);

src\Dependencies\PooledObjects\ArrayBuilder.cs (11)

110return _builder.Count; 156while (index > _builder.Count) 161if (index == _builder.Count) 206return _builder.IndexOf(item, 0, _builder.Count, equalityComparer); 271_builder.RemoveAt(_builder.Count - 1); 277for (var j = 0; j < _builder.Count; j++) 296for (var j = 0; j < _builder.Count; j++) 315for (var j = 0; j < _builder.Count; j++) 356_builder.Sort(startIndex, _builder.Count - startIndex, comparer); 370=> _builder[_builder.Count - 1]; 382return _builder.Count > 0;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\ImmutableArrayExtensions.cs (2)

36if (builder.Count == 0) 39if (builder.Count == builder.Capacity)

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Utilities\BKTree.Builder.cs (1)

174Debug.Assert(currentEdgeIndex == edges.Count);