@Test public void testGetBinaryForestRecurWord() { fail("Not yet implemented"); }
@SuppressWarnings({StableData.RAW_TYPES, StableData.UNCHECKED}) public StringBuilder getBinaryForestRecurWord(StringBuilder outputWordNode, String inputString, int charPosition , int inputStringLength, Map<Integer, Map> forestRoots, int forestDepth, int charPositionNext ) { if (StableData.INT_THREE== forestDepth) { return outputWordNode; } char charAtPosition= inputString.charAt(charPosition); int rangeHigh= charAtPosition>> StableData.INT_TEN; Map<Integer, Map> trees= forestRoots.get(rangeHigh); if (null== trees) { return outputWordNode; } int range= charAtPosition>> StableData.INT_SIX; if (!trees.containsKey(range)) { return outputWordNode; } Map<Long, FMHMMNode> maps= trees.get(range); FMHMMNode fFHMMNode= maps.get(Long.valueOf(charAtPosition)); if (null== fFHMMNode) { return outputWordNode; } Map<String, Integer> outputList= fFHMMNode.getNext(); if (null== outputList||charPositionNext>= inputStringLength) { return outputWordNode; } char positionOfi= inputString.charAt(charPositionNext); if (outputList.containsKey(String.valueOf(positionOfi))) { outputWordNode= getBinaryForestRecurWord(outputWordNode.append(positionOfi), inputString , charPositionNext, inputStringLength, forestRoots , forestDepth+ StableData.INT_ONE, ++charPositionNext); } return outputWordNode; }
NEROControllerImp implements NEROController { @SuppressWarnings({StableData.RAW_TYPES, StableData.UNCHECKED}) public StringBuilder getBinaryForestRecurWord(StringBuilder outputWordNode, String inputString, int charPosition , int inputStringLength, Map<Integer, Map> forestRoots, int forestDepth, int charPositionNext ) { if (StableData.INT_THREE== forestDepth) { return outputWordNode; } char charAtPosition= inputString.charAt(charPosition); int rangeHigh= charAtPosition>> StableData.INT_TEN; Map<Integer, Map> trees= forestRoots.get(rangeHigh); if (null== trees) { return outputWordNode; } int range= charAtPosition>> StableData.INT_SIX; if (!trees.containsKey(range)) { return outputWordNode; } Map<Long, FMHMMNode> maps= trees.get(range); FMHMMNode fFHMMNode= maps.get(Long.valueOf(charAtPosition)); if (null== fFHMMNode) { return outputWordNode; } Map<String, Integer> outputList= fFHMMNode.getNext(); if (null== outputList||charPositionNext>= inputStringLength) { return outputWordNode; } char positionOfi= inputString.charAt(charPositionNext); if (outputList.containsKey(String.valueOf(positionOfi))) { outputWordNode= getBinaryForestRecurWord(outputWordNode.append(positionOfi), inputString , charPositionNext, inputStringLength, forestRoots , forestDepth+ StableData.INT_ONE, ++charPositionNext); } return outputWordNode; } }
NEROControllerImp implements NEROController { @SuppressWarnings({StableData.RAW_TYPES, StableData.UNCHECKED}) public StringBuilder getBinaryForestRecurWord(StringBuilder outputWordNode, String inputString, int charPosition , int inputStringLength, Map<Integer, Map> forestRoots, int forestDepth, int charPositionNext ) { if (StableData.INT_THREE== forestDepth) { return outputWordNode; } char charAtPosition= inputString.charAt(charPosition); int rangeHigh= charAtPosition>> StableData.INT_TEN; Map<Integer, Map> trees= forestRoots.get(rangeHigh); if (null== trees) { return outputWordNode; } int range= charAtPosition>> StableData.INT_SIX; if (!trees.containsKey(range)) { return outputWordNode; } Map<Long, FMHMMNode> maps= trees.get(range); FMHMMNode fFHMMNode= maps.get(Long.valueOf(charAtPosition)); if (null== fFHMMNode) { return outputWordNode; } Map<String, Integer> outputList= fFHMMNode.getNext(); if (null== outputList||charPositionNext>= inputStringLength) { return outputWordNode; } char positionOfi= inputString.charAt(charPositionNext); if (outputList.containsKey(String.valueOf(positionOfi))) { outputWordNode= getBinaryForestRecurWord(outputWordNode.append(positionOfi), inputString , charPositionNext, inputStringLength, forestRoots , forestDepth+ StableData.INT_ONE, ++charPositionNext); } return outputWordNode; }  }
NEROControllerImp implements NEROController { @SuppressWarnings({StableData.RAW_TYPES, StableData.UNCHECKED}) public StringBuilder getBinaryForestRecurWord(StringBuilder outputWordNode, String inputString, int charPosition , int inputStringLength, Map<Integer, Map> forestRoots, int forestDepth, int charPositionNext ) { if (StableData.INT_THREE== forestDepth) { return outputWordNode; } char charAtPosition= inputString.charAt(charPosition); int rangeHigh= charAtPosition>> StableData.INT_TEN; Map<Integer, Map> trees= forestRoots.get(rangeHigh); if (null== trees) { return outputWordNode; } int range= charAtPosition>> StableData.INT_SIX; if (!trees.containsKey(range)) { return outputWordNode; } Map<Long, FMHMMNode> maps= trees.get(range); FMHMMNode fFHMMNode= maps.get(Long.valueOf(charAtPosition)); if (null== fFHMMNode) { return outputWordNode; } Map<String, Integer> outputList= fFHMMNode.getNext(); if (null== outputList||charPositionNext>= inputStringLength) { return outputWordNode; } char positionOfi= inputString.charAt(charPositionNext); if (outputList.containsKey(String.valueOf(positionOfi))) { outputWordNode= getBinaryForestRecurWord(outputWordNode.append(positionOfi), inputString , charPositionNext, inputStringLength, forestRoots , forestDepth+ StableData.INT_ONE, ++charPositionNext); } return outputWordNode; }  @SuppressWarnings({StableData.RAW_TYPES, StableData.UNCHECKED}) StringBuilder getBinaryForestRecurWord(StringBuilder outputWordNode, String inputString, int charPosition
			, int inputStringLength, Map<Integer, Map> forestRoots, int forestDepth, int charPositionNext ); }
NEROControllerImp implements NEROController { @SuppressWarnings({StableData.RAW_TYPES, StableData.UNCHECKED}) public StringBuilder getBinaryForestRecurWord(StringBuilder outputWordNode, String inputString, int charPosition , int inputStringLength, Map<Integer, Map> forestRoots, int forestDepth, int charPositionNext ) { if (StableData.INT_THREE== forestDepth) { return outputWordNode; } char charAtPosition= inputString.charAt(charPosition); int rangeHigh= charAtPosition>> StableData.INT_TEN; Map<Integer, Map> trees= forestRoots.get(rangeHigh); if (null== trees) { return outputWordNode; } int range= charAtPosition>> StableData.INT_SIX; if (!trees.containsKey(range)) { return outputWordNode; } Map<Long, FMHMMNode> maps= trees.get(range); FMHMMNode fFHMMNode= maps.get(Long.valueOf(charAtPosition)); if (null== fFHMMNode) { return outputWordNode; } Map<String, Integer> outputList= fFHMMNode.getNext(); if (null== outputList||charPositionNext>= inputStringLength) { return outputWordNode; } char positionOfi= inputString.charAt(charPositionNext); if (outputList.containsKey(String.valueOf(positionOfi))) { outputWordNode= getBinaryForestRecurWord(outputWordNode.append(positionOfi), inputString , charPositionNext, inputStringLength, forestRoots , forestDepth+ StableData.INT_ONE, ++charPositionNext); } return outputWordNode; }  @SuppressWarnings({StableData.RAW_TYPES, StableData.UNCHECKED}) StringBuilder getBinaryForestRecurWord(StringBuilder outputWordNode, String inputString, int charPosition
			, int inputStringLength, Map<Integer, Map> forestRoots, int forestDepth, int charPositionNext );  }