Lines Matching refs:head
2008 Node head = null;
2022 if (head == null)
2023 head = node;
2103 if (head == null) {
2104 head = tail = node;
2110 if (head == null) {
2115 return head;
2753 * Parses a group and returns the head node of a set of nodes that process
2759 Node head = null;
2768 head = createGroup(true);
2770 head.next = expr(tail);
2774 head = createGroup(true);
2776 head.next = expr(tail);
2778 head = tail = new Pos(head);
2780 head = tail = new Neg(head);
2784 head = createGroup(true);
2786 head.next = expr(tail);
2787 head = tail = new Ques(head, INDEPENDENT);
2798 head = createGroup(false);
2801 head.next = expr(tail);
2805 head = createGroup(true);
2807 head.next = expr(tail);
2810 head.study(info);
2817 head = tail = (hasSupplementary ?
2818 new BehindS(head, info.maxLength,
2820 new Behind(head, info.maxLength,
2823 head = tail = (hasSupplementary ?
2824 new NotBehindS(head, info.maxLength,
2826 new NotBehind(head, info.maxLength,
2845 head = createGroup(true);
2847 head.next = expr(tail);
2852 head = createGroup(false);
2854 head.next = expr(tail);
2861 Node node = closure(head);
2862 if (node == head) { // No closure
2866 if (head == tail) { // Zero length assertion
2880 head = new Branch(head, null, tail);
2882 head = new Branch(null, head, tail);
2885 return head;
2894 if (head.study(info)) { // Deterministic
2896 head = root = new GroupCurly(head.next, curly.cmin,
2901 return head;
2903 int temp = ((GroupHead) head).localIndex;
2913 loop.body = head;
2923 * Create group head and tail nodes using double return. If the group is
2932 GroupHead head = new GroupHead(localIndex);
2935 groupNodes[groupIndex] = head;
2936 return head;
4575 GroupHead head;
4576 GroupRef(GroupHead head) {
4577 this.head = head;
4580 return head.matchRef(matcher, i, seq)