mLegalTimesTree = new Node(); if (mIs24HourMode) { Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5); Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9); Node firstDigit = new Node(k0, k1); mLegalTimesTree.addChild(firstDigit); Node secondDigit = new Node(k0, k1, k2, k3, k4, k5); firstDigit.addChild(secondDigit); Node thirdDigit = new Node(k6, k7, k8, k9); secondDigit = new Node(k6, k7, k8, k9); firstDigit.addChild(secondDigit); firstDigit = new Node(k2); mLegalTimesTree.addChild(firstDigit); secondDigit = new Node(k0, k1, k2, k3); firstDigit.addChild(secondDigit); secondDigit = new Node(k4, k5); firstDigit.addChild(secondDigit); firstDigit = new Node(k3, k4, k5, k6, k7, k8, k9); mLegalTimesTree.addChild(firstDigit);
mLegalTimesTree = new Node(); if (mIs24HourMode) { Node minuteFirstDigit = new Node(k0, k1, k2, k3, k4, k5); Node minuteSecondDigit = new Node(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9); Node firstDigit = new Node(k0, k1); mLegalTimesTree.addChild(firstDigit); Node secondDigit = new Node(k0, k1, k2, k3, k4, k5); firstDigit.addChild(secondDigit); Node thirdDigit = new Node(k6, k7, k8, k9); secondDigit = new Node(k6, k7, k8, k9); firstDigit.addChild(secondDigit); firstDigit = new Node(k2); mLegalTimesTree.addChild(firstDigit); secondDigit = new Node(k0, k1, k2, k3); firstDigit.addChild(secondDigit); secondDigit = new Node(k4, k5); firstDigit.addChild(secondDigit); firstDigit = new Node(k3, k4, k5, k6, k7, k8, k9); mLegalTimesTree.addChild(firstDigit);