Java Code Examples for sun.font.BidiUtils#createContiguousOrder()

The following examples show how to use sun.font.BidiUtils#createContiguousOrder() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: TextLine.java    From jdk8u-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 2
Source File: TextLine.java    From jdk8u-dev-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 3
Source File: TextLine.java    From jdk-1.7-annotated with Apache License 2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 4
Source File: TextLine.java    From jdk8u-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 5
Source File: TextLine.java    From jdk8u_jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 6
Source File: TextLine.java    From openjdk-8 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 7
Source File: TextLine.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 8
Source File: TextLine.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 9
Source File: TextLine.java    From Java8CN with Apache License 2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 10
Source File: TextLine.java    From jdk1.8-source-analysis with Apache License 2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 11
Source File: TextLine.java    From openjdk-jdk9 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 12
Source File: TextLine.java    From Bytecoder with Apache License 2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 13
Source File: TextLine.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 14
Source File: TextLine.java    From openjdk-jdk8u with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 15
Source File: TextLine.java    From JDKSourceCode1.8 with MIT License 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 16
Source File: TextLine.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 17
Source File: TextLine.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}
Example 18
Source File: TextLine.java    From dragonwell8_jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * Compute the components order from the given components array and
 * logical-to-visual character mapping.  May return null if canonical.
 */
private static int[] computeComponentOrder(TextLineComponent[] components,
                                           int[] charsLtoV) {

    /*
     * Create a visual ordering for the glyph sets.  The important thing
     * here is that the values have the proper rank with respect to
     * each other, not the exact values.  For example, the first glyph
     * set that appears visually should have the lowest value.  The last
     * should have the highest value.  The values are then normalized
     * to map 1-1 with positions in glyphs.
     *
     */
    int[] componentOrder = null;
    if (charsLtoV != null && components.length > 1) {
        componentOrder = new int[components.length];
        int gStart = 0;
        for (int i = 0; i < components.length; i++) {
            componentOrder[i] = charsLtoV[gStart];
            gStart += components[i].getNumCharacters();
        }

        componentOrder = BidiUtils.createContiguousOrder(componentOrder);
        componentOrder = BidiUtils.createInverseMap(componentOrder);
    }
    return componentOrder;
}