32 references to Id
System.Data.Entity (32)
System\Data\Query\PlanCompiler\JoinGraph.cs (32)
242
get { return m_newLocationId != this.
Id
; }
527
BuildJoinEdges(m_root, m_root.
Id
);
774
if (leftTableNode.LastVisibleId < joinNode.
Id
||
775
rightTableNode.LastVisibleId < joinNode.
Id
)
868
leftMaxVisibility = joinNode.
Id
;
869
rightMaxVisibility = joinNode.
Id
;
874
rightMaxVisibility = joinNode.
Id
;
1346
if (replacingTable.
Id
< table.NewLocationId)
1445
if (node1.
Id
== node2.
Id
)
1453
if (node1.
Id
< node2.
Id
)
1464
while (currentParent.
Id
< rigthNode.
Id
)
1492
if (tableNode.
Id
< replacementNode.NewLocationId)
1495
replacementNode.NewLocationId = tableNode.
Id
;
1648
if (smallestEdge.Right.
Id
> joinEdge.Right.
Id
)
1936
PlanCompiler.Assert(joinEdge.Left.
Id
< joinEdge.Right.
Id
,
1937
"(left-id, right-id) = (" + joinEdge.Left.
Id
+ "," + joinEdge.Right.
Id
+ ")");
2400
minLocationId = joinNode.
Id
;
2524
localPredicateMinLocationId = joinNode.
Id
;
2532
localPredicateNode = CombinePredicateNodes(joinNode.
Id
, localPredicateNode, localPredicateMinLocationId, leftPredicates, rightPredicates, out predicates);
2611
if (replacementNode.NewLocationId < tableNode.
Id
)
2763
return node.
Id
;
2788
if (currentNode.
Id
== nodeId1 || currentNode.
Id
== nodeId2)
2790
return currentNode.
Id
;
2795
return currentNode.
Id
;
2812
while ((subree.
Id
< nodeId) && (i < root.Children.Count))