コード例 #1
0
        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);
        }
コード例 #2
0
    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;
    }
コード例 #3
0
    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;
    }
コード例 #4
0
        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);
        }