< prev index next >

src/java.desktop/share/classes/sun/font/BidiUtils.java

Print this page

        

@@ -46,12 +46,12 @@
      * This is a convenience method for clients who prefer to use an explicit levels
      * array instead of iterating over the runs.
      *
      * @param levels the array to receive the character levels
      * @param start the starting offset into the array
-     * @throws IndexOutOfBoundsException if <code>start</code> is less than 0 or
-     * <code>start + getLength()</code> is greater than <code>levels.length</code>.
+     * @throws IndexOutOfBoundsException if {@code start} is less than 0 or
+     * {@code start + getLength()} is greater than {@code levels.length}.
      */
     public static void getLevels(Bidi bidi, byte[] levels, int start) {
         int limit = start + bidi.getLength();
 
         if (start < 0 || limit > levels.length) {

@@ -85,11 +85,11 @@
 
     /**
      * Given level data, compute a a visual to logical mapping.
      * The leftmost (or topmost) character is at visual index zero.  The
      * logical index of the character is derived from the visual index
-     * by the expression <code>li = map[vi];</code>.
+     * by the expression {@code li = map[vi];}.
      * @param levels the levels array
      * @return the mapping array from visual to logical
      */
     public static int[] createVisualToLogicalMap(byte[] levels) {
         int len = levels.length;

@@ -146,11 +146,11 @@
     }
 
     /**
      * Return the inverse position map.  The source array must map one-to-one (each value
      * is distinct and the values run from zero to the length of the array minus one).
-     * For example, if <code>values[i] = j</code>, then <code>inverse[j] = i</code>.
+     * For example, if {@code values[i] = j}, then {@code inverse[j] = i}.
      * @param values the source ordering array
      * @return the inverse array
      */
     public static int[] createInverseMap(int[] values) {
         if (values == null) {
< prev index next >