6 writes to LeftSize
PresentationFramework (6)
src\Framework\MS\Internal\Data\RBNode.cs (5)
547
parent.
LeftSize
+= delta;
555
sub.
LeftSize
= node.LeftSize;
619
node.
LeftSize
-= leftmost.Size;
631
node.
LeftSize
+= this.LeftSize + this.Size;
645
this.
LeftSize
-= node.LeftSize + node.Size;
src\Framework\MS\Internal\Data\RBTree.cs (1)
569
LeftSize
= 0;
37 references to LeftSize
PresentationFramework (37)
src\Framework\MS\Internal\Data\RBNode.cs (33)
95
if (index + delta <=
LeftSize
)
104
else if (index <
LeftSize
+ Size)
106
result = new RBFinger<T>() { Node = this, Offset = index -
LeftSize
, Index = index, Found = true };
111
result = new RBFinger<T>() { Node = this, Offset = Size, Index =
LeftSize
+ Size, Found = false };
114
result = RightChild.FindIndex(index -
LeftSize
- Size, exists);
115
result.Index +=
LeftSize
+ Size;
134
result = new RBFinger<T>() { Node = this, Offset = 0, Index =
LeftSize
, Found = true };
141
result = new RBFinger<T>() { Node = this, Offset = offset, Index =
LeftSize
+ offset, Found = found };
146
result = new RBFinger<T>() { Node = this, Offset = Size, Index =
LeftSize
+ Size };
150
result.Index +=
LeftSize
+ Size;
166
if (high <=
LeftSize
)
172
if (low >=
LeftSize
)
175
left = low -
LeftSize
;
188
result = new RBFinger<T>() { Node = this, Offset = 0, Index =
LeftSize
, Found = true };
194
if (
LeftSize
+ Size <= low)
200
if (
LeftSize
+ Size >= high)
203
right = high -
LeftSize
;
214
result = new RBFinger<T>() { Node = this, Offset = right, Index =
LeftSize
+ right, Found = false };
217
int delta =
LeftSize
+ Size;
227
result = new RBFinger<T>() { Node = this, Offset = offset, Index =
LeftSize
+ offset, Found = found };
284
nodeIndex = nodeIndex - startingNode.
LeftSize
- parent.Size;
406
index = node.
LeftSize
;
410
index += parent.
LeftSize
+ parent.Size;
519
if (index <= node.
LeftSize
)
525
Debug.Assert(index >= node.
LeftSize
+ node.Size, "InsertNode: index should fall between nodes");
526
node.RightChild = InsertNode(root, node, node.RightChild, index - node.
LeftSize
- node.Size, out newNode);
555
sub.LeftSize = node.
LeftSize
;
569
if (index < node.
LeftSize
|| (index == node.
LeftSize
&& node.Size > 0))
577
bool deleteHere = (index == node.
LeftSize
);
601
node.RightChild = DeleteNode(node, node.RightChild, index - node.
LeftSize
- node.Size);
631
node.LeftSize += this.
LeftSize
+ this.Size;
645
this.LeftSize -= node.
LeftSize
+ node.Size;
src\Framework\MS\Internal\Data\RBTree.cs (4)
510
int size =
LeftSize
;
539
int size =
LeftSize
;
557
node = InsertNode(this.
LeftSize
);
596
get { return
LeftSize
; }