Implemented interface member:
property
Count
System.Collections.Immutable.IBinaryTree.Count
42 references to Count
System.Collections.Immutable (42)
System\Collections\Immutable\ImmutableDictionary_2.HashBucket.cs (1)
234int indexOfRootNode = _additionalElements.Left!.Count;
System\Collections\Immutable\ImmutableHashSet_1.HashBucket.cs (1)
221int indexOfRootNode = _additionalElements.Left!.Count;
System\Collections\Immutable\ImmutableList_1.Builder.cs (1)
72get { return this.Root.Count; }
System\Collections\Immutable\ImmutableList_1.cs (1)
140public int Count => _root.Count;
System\Collections\Immutable\ImmutableList_1.Enumerator.cs (8)
92Requires.Argument(reversed || count == -1 || (startIndex == -1 ? 0 : startIndex) + count <= root.Count); 93Requires.Argument(!reversed || count == -1 || (startIndex == -1 ? root.Count - 1 : startIndex) - count + 1 >= 0); 98_startIndex = startIndex >= 0 ? startIndex : (reversed ? root.Count - 1 : 0); 99_count = count == -1 ? root.Count : count; 206int skipNodes = _reversed ? _root.Count - _startIndex - 1 : _startIndex; 207while (!node.IsEmpty && skipNodes != this.PreviousBranch(node)!.Count) 209if (skipNodes < this.PreviousBranch(node)!.Count) 216skipNodes -= this.PreviousBranch(node)!.Count + 1;
System\Collections\Immutable\ImmutableList_1.Node.cs (30)
172Requires.Range(index >= 0 && index < this.Count, nameof(index)); 196Requires.Range(index >= 0 && index < this.Count, nameof(index)); 325Requires.Range(index >= 0 && index <= this.Count, nameof(index)); 390Requires.Range(index >= 0 && index <= this.Count, nameof(index)); 420Requires.Range(index >= 0 && index < this.Count, nameof(index)); 520Requires.Range(index >= 0 && index < this.Count, nameof(index)); 547internal Node Reverse() => this.Reverse(0, this.Count); 559Requires.Range(index + count <= this.Count, nameof(index)); 597var array = new T[this.Count]; 600return NodeTreeFromList(array.AsOrderedCollection(), 0, this.Count); 612internal Node Sort(IComparer<T>? comparer) => this.Sort(0, this.Count, comparer); 633Requires.Argument(index + count <= this.Count); 636var array = new T[this.Count]; 639return NodeTreeFromList(array.AsOrderedCollection(), 0, this.Count); 683int thisNodeIndex = _left!.Count; // this is only the index within the AVL tree, treating this node as root rather than a member of a larger tree. 738internal int IndexOf(T item, IEqualityComparer<T>? equalityComparer) => this.IndexOf(item, 0, this.Count, equalityComparer); 784Requires.Range(count <= this.Count, nameof(count)); 785Requires.Range(index + count <= this.Count, nameof(count)); 825Requires.Range(count >= 0 && count <= this.Count, nameof(count)); 857Requires.Range(array.Length >= this.Count, nameof(array)); 882Requires.Range(array.Length >= arrayIndex + this.Count, nameof(arrayIndex)); 911Requires.Range(index + count <= this.Count, nameof(count)); 933Requires.Range(array.Length >= arrayIndex + this.Count, nameof(arrayIndex)); 1123Requires.Range(startIndex >= 0 && startIndex <= this.Count, nameof(startIndex)); 1125return this.FindIndex(startIndex, this.Count - startIndex, match); 1146Requires.Range(startIndex + count <= this.Count, nameof(count)); 1212return this.IsEmpty ? -1 : this.FindLastIndex(this.Count - 1, this.Count, match); 1232Requires.Range(startIndex == 0 || startIndex < this.Count, nameof(startIndex)); 1257Requires.Range(count <= this.Count, nameof(count));