util/src/main/java/com/epam/deltix/util/text/VocabularyEnumeration16.java [31:65]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        mCode = code;
        mStringBuilder = new StringBuilder (maxLength);
        mPath = new int [maxLength + 1];
        mPositions = new int [maxLength + 1];
        
        mPath [0] = 0;
        mPositions [0] = -2;
        mDepth = 0;

        findNext ();
    }

    public boolean          hasMoreElements () {
        return mDepth >= 0;
    }

    public CharSequence     nextElement () {
        mStringBuilder.setLength (0);
        
        for (int ii = 0; ii < mDepth; ii++)
            mStringBuilder.append ((char) (mCode [mPath [ii] + 1] + mPositions [ii]));
        
        findNext ();
        
        return (mStringBuilder);
    }

    private void            findNext () {
        for (;;) {
            int         node = mPath [mDepth];
            int         pos = ++mPositions [mDepth];

            if (pos == -1) {
                if (mCode [node] == 1)
                    return;     // Got one
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



util/src/main/java/com/epam/deltix/util/text/VocabularyEnumeration32.java [31:65]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        mCode = code;
        mStringBuilder = new StringBuilder (maxLength);
        mPath = new int [maxLength + 1];
        mPositions = new int [maxLength + 1];
        
        mPath [0] = 0;
        mPositions [0] = -2;
        mDepth = 0;

        findNext ();
    }

    public boolean          hasMoreElements () {
        return mDepth >= 0;
    }

    public CharSequence     nextElement () {
        mStringBuilder.setLength (0);
        
        for (int ii = 0; ii < mDepth; ii++)
            mStringBuilder.append ((char) (mCode [mPath [ii] + 1] + mPositions [ii]));
        
        findNext ();
        
        return (mStringBuilder);
    }

    private void            findNext () {
        for (;;) {
            int         node = mPath [mDepth];
            int         pos = ++mPositions [mDepth];

            if (pos == -1) {
                if (mCode [node] == 1)
                    return;     // Got one
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -