本文整理汇总了C#中ParseTree.FindLeafNode方法的典型用法代码示例。如果您正苦于以下问题：C# ParseTree.FindLeafNode方法的具体用法？C# ParseTree.FindLeafNode怎么用？C# ParseTree.FindLeafNode使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类ParseTree的用法示例。
在下文中一共展示了ParseTree.FindLeafNode方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: GetTargetAtTriggerPoint
public static ParseTreeNode GetTargetAtTriggerPoint(ITrackingPoint triggerPoint, ITextSnapshot snapshot, ParseTree parseTree)
{
Contract.Requires(snapshot != null);
Contract.Requires(parseTree != null);
Contract.Requires(triggerPoint != null);
//Can we get our position?
var pos = triggerPoint.Convert(snapshot);
if (pos == default(Position))
return null;
//Can we get our leaf node?
var leafNode = parseTree.FindLeafNode(pos);
if (leafNode == null)
return null;
var asPropDecl = leafNode.AsProperty();
if (asPropDecl != null)
{
return asPropDecl;
}
//Is our leaf node a name?
var asName = leafNode.AsAnyName();
if (asName == null)
return null;
//Is anyone in our ancestry a call node?
var nodeInQuestion = leafNode;
var lastNonBinaryOperatorNode = leafNode;
var lastNode = leafNode;
while (nodeInQuestion != null) {
//Is the node in question a node call?
var asCall = nodeInQuestion.AsAnyCall();
if (asCall != null) {
//Make sure we aren't on the right side of the call
if (asCall.Right == lastNode)
return null;
return asCall;
}
var asProp = nodeInQuestion.AsDot();
if (asProp != null)
{
//Make sure we aren't on the left side of the dot
if (asProp.Right == lastNode && asProp.Right.IsName())
{
return asProp;
}
}
var asCtorCall = nodeInQuestion.AsAnyCreation();
if (asCtorCall != null)
{
return asCtorCall;
}
var declNode = nodeInQuestion.AsAnyMember();
if (declNode != null)
{
if (lastNode == leafNode) { return declNode; }
return null;
}
NamedAssignmentNode na = nodeInQuestion as NamedAssignmentNode;
if (na != null)
{
if (na.Identifier == asName)
{
return na;
}
}
//Is our parent a binary operator?
var asBinaryOperator = nodeInQuestion.AsAnyBinaryOperator();
if (asBinaryOperator != null) {
//Make sure we are always on the rightmost of any binary operator
if (asBinaryOperator.Right != lastNonBinaryOperatorNode)
return null;
} else
lastNonBinaryOperatorNode = nodeInQuestion;
//Climp higher up our ancestry for the next iteration
lastNode = nodeInQuestion;
nodeInQuestion = nodeInQuestion.Parent;
}
//Did we successfully find a call node?
if (nodeInQuestion == null)
return null;
if (nodeInQuestion.Kind != NodeKind.Call)
return null;
var callNode = nodeInQuestion.AsAnyCall();
return callNode;
}示例2: GetAnyCallNodeAboveTriggerPoint
public static ParseTreeNode GetAnyCallNodeAboveTriggerPoint(ITrackingPoint triggerPoint, ITextSnapshot snapshot, ParseTree parseTree) {
Contract.Requires(snapshot != null);
Contract.Requires(parseTree != null);
Contract.Requires(triggerPoint != null);
//Can we get our position?
var pos = triggerPoint.Convert(snapshot);
if (pos == default(Position))
return null;
//Can we get our leaf node?
var leafNode = parseTree.FindLeafNode(pos);
if (leafNode == null)
return null;
//Is anyone in our ancestry a call node?
var nodeInQuestion = leafNode;
ParseTreeNode ptn = null;
while (nodeInQuestion != null) {
//Is the node in question a node call?
var asCall = nodeInQuestion.AsAnyCall();
if (asCall != null) {
ptn = asCall;
break;
}
var asCtorCall = nodeInQuestion.AsAnyCreation();
if (asCtorCall != null) {
ptn = asCtorCall;
break;
}
//Climp higher up our ancestry for the next iteration
nodeInQuestion = nodeInQuestion.Parent;
}
//Did we successfully find a call node?
return ptn;
}