Lines Matching refs:Node
103 private Node mLegalTimesTree;
604 Node node = mLegalTimesTree;
822 mLegalTimesTree = new Node();
825 Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5);
826 Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
831 Node firstDigit = new Node(k0, k1);
835 Node secondDigit = new Node(k0, k1, k2, k3, k4, k5);
841 Node thirdDigit = new Node(k6, k7, k8, k9);
846 secondDigit = new Node(k6, k7, k8, k9);
852 firstDigit = new Node(k2);
856 secondDigit = new Node(k0, k1, k2, k3);
862 secondDigit = new Node(k4, k5);
868 firstDigit = new Node(k3, k4, k5, k6, k7, k8, k9);
875 Node ampm = new Node(getAmOrPmKeyCode(AM), getAmOrPmKeyCode(PM));
878 Node firstDigit = new Node(k1);
884 Node secondDigit = new Node(k0, k1, k2);
890 Node thirdDigit = new Node(k0, k1, k2, k3, k4, k5);
897 Node fourthDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
903 thirdDigit = new Node(k6, k7, k8, k9);
909 secondDigit = new Node(k3, k4, k5);
913 thirdDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
919 firstDigit = new Node(k2, k3, k4, k5, k6, k7, k8, k9);
925 secondDigit = new Node(k0, k1, k2, k3, k4, k5);
929 thirdDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9);
941 private class Node {
943 private ArrayList<Node> mChildren;
945 public Node(int... legalKeys) {
947 mChildren = new ArrayList<Node>();
950 public void addChild(Node child) {
963 public Node canReach(int key) {
967 for (Node child : mChildren) {