Lines Matching refs:Node
101 private Node mLegalTimesTree;
885 Node node = mLegalTimesTree;
1103 mLegalTimesTree = new Node();
1106 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
1107 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
1112 Node firstDigit = new Node(k0, k1);
1116 Node secondDigit = new Node(k0, k1, k2, k3, k4, k5);
1122 Node thirdDigit = new Node(k6, k7, k8, k9);
1127 secondDigit = new Node(k6, k7, k8, k9);
1133 firstDigit = new Node(k2);
1137 secondDigit = new Node(k0, k1, k2, k3);
1143 secondDigit = new Node(k4, k5);
1149 firstDigit = new Node(k3, k4, k5, k6, k7, k8, k9);
1156 Node ampm = new Node(getAmOrPmKeyCode(AM), getAmOrPmKeyCode(PM));
1159 Node firstDigit = new Node(k1);
1165 Node secondDigit = new Node(k0, k1, k2);
1171 Node thirdDigit = new Node(k0, k1, k2, k3, k4, k5);
1178 Node fourthDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
1184 thirdDigit = new Node(k6, k7, k8, k9);
1190 secondDigit = new Node(k3, k4, k5);
1194 thirdDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
1200 firstDigit = new Node(k2, k3, k4, k5, k6, k7, k8, k9);
1206 secondDigit = new Node(k0, k1, k2, k3, k4, k5);
1210 thirdDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
1222 private class Node {
1224 private ArrayList<Node> mChildren;
1226 public Node(int... legalKeys) {
1228 mChildren = new ArrayList<Node>();
1231 public void addChild(Node child) {
1244 public Node canReach(int key) {
1248 for (Node child : mChildren) {