Searched refs:levels (Results 1 - 24 of 24) sorted by relevance

/openjdk7/jdk/src/share/classes/sun/font/
H A DBidiUtils.java45 * Return the level of each character into the levels array starting at start.
46 * This is a convenience method for clients who prefer to use an explicit levels
49 * @param levels the array to receive the character levels
52 * <code>start + getLength()</code> is greater than <code>levels.length</code>.
54 public static void getLevels(Bidi bidi, byte[] levels, int start) { argument
57 if (start < 0 || limit > levels.length) {
58 throw new IndexOutOfBoundsException("levels.length = " + levels.length +
69 levels[
94 createVisualToLogicalMap(byte[] levels) argument
250 createNormalizedMap(int[] values, byte[] levels, int start, int limit) argument
338 reorderVisually(byte[] levels, Object[] objects) argument
[all...]
H A DGraphicComponent.java55 private byte[] levels; // possibly null field in class:GraphicComponent
71 * into charLtoV and levels. charsLtoV and levels may be adopted.
76 byte[] levels,
90 initLocalOrdering(charsLtoV, levels, start, limit);
102 byte[] levels = null;
106 levels = parent.levels;
113 levels = new byte[limit];
116 levels[
73 GraphicComponent(GraphicAttribute graphic, Decoration decorator, int[] charsLtoV, byte[] levels, int start, int limit, AffineTransform baseTx) argument
130 initLocalOrdering(int[] charsLtoV, byte[] levels, int start, int limit) argument
[all...]
/openjdk7/jdk/src/share/classes/sun/text/bidi/
H A DBidiLine.java57 * This means that there is a Bidi object with a levels
60 * Only if the length of the text is zero, then levels==dirProps==NULL.
73 * Here, the levels array is scanned as soon as necessary, and a vector of
82 * In a further attempt to save memory, the levels array is never changed
87 * which is not reflected in the levels array.
88 * This allows a line Bidi object to use the same levels array as
92 * paragraph's levels and dirProps arrays are reused by way of setting
94 * change the now shared levels for (L1).
102 * the paragraph's levels array that we just point into.
115 byte[] levels
640 prepareReorder(byte[] levels, byte[] pMinLevel, byte[] pMaxLevel) argument
677 reorderVisual(byte[] levels) argument
[all...]
H A DBidiBase.java113 * <h3>Basic concept: levels</h3>
115 * Levels in this API represent embedding levels according to the Unicode
828 byte[] levels; field in class:BidiBase
842 ImpTabPair impTabPair; /* reference to levels state table pair */
854 /* implicitly at the paraLevel (rule (L1)) - levels may not reflect that */
1328 * Resolve the explicit levels as specified by explicit embedding codes.
1333 * levels are externally specified (from "styled text", supposedly the preferred
1362 * Handling the stack of explicit levels (Xn):
1364 * With the Bidi stack of explicit levels,
1374 * Popping levels wit
3024 reorderVisual(byte[] levels) argument
3378 reorderVisually(byte[] levels, int levelStart, Object[] objects, int objectStart, int count) argument
[all...]
/openjdk7/jdk/test/java/io/Serializable/oldTests/
H A DBinaryTree.java94 public void print(int levels) { argument
100 if (level <= levels && left != null) {
101 left.print(levels);
104 if (level <= levels && right != null) {
105 right.print(levels);
/openjdk7/jdk/src/share/classes/java/awt/geom/
H A DFlatteningPathIterator.java46 int limit; // Maximum number of recursion levels
74 int levels[]; // The recursion level at which field in class:FlatteningPathIterator
79 // levels array of the curve segment
88 * 10 levels of subdivision which yields a maximum of 1024 line
127 this.levels = new int[limit + 1];
210 levels[0] = 0;
244 level = levels[levelIndex];
263 levels[levelIndex] = level;
265 levels[levelIndex] = level;
269 // in recursion levels t
[all...]
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/c14n/implementations/
H A DCanonicalizer20010315.java72 List levels=new ArrayList(); field in class:Canonicalizer20010315.XmlAttrStack
79 levels.remove(levels.size()-1);
80 if (levels.size()==0) {
84 lastlevel=((XmlsStackElement)levels.get(levels.size()-1)).level;
91 levels.add(cur);
97 int size=levels.size()-1;
102 levels.add(cur);
109 e=(XmlsStackElement)levels
[all...]
H A DCanonicalizer11.java77 List levels = new ArrayList(); field in class:Canonicalizer11.XmlAttrStack
84 levels.remove(levels.size() - 1);
85 if (levels.size() == 0) {
89 lastlevel=((XmlsStackElement)levels.get(levels.size()-1)).level;
96 levels.add(cur);
106 levels.add(cur);
108 int size = levels.size() - 2;
114 e = (XmlsStackElement) levels
[all...]
/openjdk7/hotspot/test/compiler/7047069/
H A DTest7047069.java44 int limit; // Maximum number of recursion levels
65 int levels[]; // The recursion level at which field in class:Test7047069
70 // levels array of the curve segment
129 this.levels = new int[limit + 1];
159 int level = levels[levelIndex];
178 levels[levelIndex] = level;
180 levels[levelIndex] = level;
184 // in recursion levels to try to flatten any more. The
/openjdk7/jdk/test/java/text/Bidi/
H A DBidiConformance.java754 private int getRunCount(String levels) { argument
755 int len = levels.length();
756 char c = levels.charAt(0);
760 if (levels.charAt(index) != c) {
762 c = levels.charAt(index);
769 private int[] getRunLevels_int(int runCount, String levels) { argument
771 int len = levels.length();
772 char c = levels.charAt(0);
777 if (levels.charAt(index) != c) {
778 c = levels
786 getRunLevels_byte(int runCount, String levels) argument
803 getRunLimits(int runCount, String levels) argument
820 getRunStarts(int runCount, String levels) argument
836 getObjects(int runCount, String text, String levels) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/
H A DNodeSortRecordFactory.java89 int levels = order.length;
90 int[] iOrder = new int[levels];
91 int[] iType = new int[levels];
92 for (int i = 0; i < levels; i++) {
H A DNodeSortRecord.java78 private int _scanned = 0; // Number of key levels extracted from DOM
109 int levels = settings.getSortOrders().length;
110 _values = new Object[levels];
130 _collators = new Collator[levels];
131 for (int i = 0; i < levels; i++){
212 int levels = _settings.getSortOrders().length;
215 for (level = 0; level < levels; level++) {
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/
H A DBasicDiagnosticFormatter.java247 String[] levels = indent.split("\\|");
249 switch (levels.length) {
252 Integer.parseInt(levels[4]));
255 Integer.parseInt(levels[3]));
258 Integer.parseInt(levels[2]));
261 Integer.parseInt(levels[1]));
264 Integer.parseInt(levels[0]));
/openjdk7/jdk/test/sun/util/logging/
H A DPlatformLoggerTest.java154 final Level[] levels = new Level[] {
160 if (levels.length != count) {
162 " PlatformLogger.Level members, but " + levels.length +
163 " standard java.util.logging levels - the numbers should be equal.");
166 for (Level level : levels) {
170 for (Level level : levels) {
/openjdk7/jdk/src/share/classes/javax/swing/text/
H A DAbstractDocument.java1046 // Calculate the bidi levels for the affected range of paragraphs. The
1047 // levels array will contain a bidi level for each character in the
1049 byte levels[] = calculateBidiLevels( firstPStart, lastPEnd );
1067 //System.out.println("createbidiElements: prevElem= " + prevElem + " prevLevel= " + prevLevel + "level[0] = " + levels[0]);
1068 if( prevLevel==levels[0] ) {
1080 while((firstSpanEnd<levels.length) && (levels[firstSpanEnd]==levels[0]))
1098 if( nextLevel == levels[levels
[all...]
H A DTextLayoutStrategy.java136 byte[] levels = new byte[n];
143 levels[i] = (byte)StyleConstants.getBidiLevel(bidiElem.getAttributes());
147 BidiUtils.reorderVisually( levels, reorder );
/openjdk7/jdk/src/share/classes/java/text/
H A DBidi.java54 * both the direction and the 'nesting level' of a directional run. Odd levels
55 * are right-to-left, while even levels are left-to-right. So for example level
302 * Reorder the objects in the array into visual order based on their levels.
309 * in the levels array (at <code>index - objectStart + levelStart</code>).
311 * @param levels an array representing the bidi level of each object
312 * @param levelStart the start position in the levels array
317 public static void reorderVisually(byte[] levels, int levelStart, Object[] objects, int objectStart, int count) { argument
318 BidiBase.reorderVisually(levels, levelStart, objects, objectStart, count);
/openjdk7/jdk/src/share/classes/java/util/logging/
H A DLevel.java34 * The Level class defines a set of standard logging levels that
37 * at a given level also enables logging at all higher levels.
42 * The levels in descending order are:
57 * levels by subclassing Level. In such cases subclasses should
140 * detailed tracing. The exact meaning of the three levels will
183 * add new logging levels, they may subclass Level and define new
368 * Known names are the levels defined by this class (e.g., <CODE>FINE</CODE>,
370 * appropriate package access, or new levels defined or created
440 // KnownLevel class maintains the global list of all known levels.
517 for (List<KnownLevel> levels
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/ws/processor/util/
H A DIndentingWriter.java114 public void pI(int levels) { argument
115 for (int i = 0; i < levels; ++i) {
120 public void pO(int levels) { argument
121 for (int i = 0; i < levels; ++i) {
/openjdk7/jdk/src/share/classes/java/awt/font/
H A DTextLine.java909 byte[] levels = null;
947 levels = BidiUtils.getLevels(bidi);
948 int[] charsVtoL = BidiUtils.createVisualToLogicalMap(levels);
963 charsLtoV, levels,
982 chars, 0, chars.length, charsLtoV, levels, isDirectionLTR);
1001 byte[] levels,
1012 int chunkLimit = firstVisualChunk(charsLtoV, levels, pos, runLimit); // <= displayLimit
1054 byte[] levels,
1078 int chunkLimit = firstVisualChunk(charsLtoV, levels,
1082 new GraphicComponent(graphicAttribute, decorator, charsLtoV, levels, po
997 createComponentsOnRun(int runStart, int runLimit, char[] chars, int[] charsLtoV, byte[] levels, TextLabelFactory factory, Font font, CoreMetrics cm, FontRenderContext frc, Decoration decorator, TextLineComponent[] components, int numComponents) argument
1049 getComponents(StyledParagraph styledParagraph, char[] chars, int textStart, int textLimit, int[] charsLtoV, byte[] levels, TextLabelFactory factory) argument
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/
H A DSort.java717 final int levels = sortObjects.size();
718 final int match[] = new int[levels];
719 final InstructionHandle target[] = new InstructionHandle[levels];
722 // Compile switch statement only if the key has multiple levels
723 if (levels > 1) {
731 for (int level = 0; level < levels; level++) {
739 // Compile def. target for switch statement if key has multiple levels
740 if (levels > 1) {
H A DMode.java1046 Enumeration levels = _importLevels.keys();
1047 while (levels.hasMoreElements()) {
1048 Integer max = (Integer)levels.nextElement();
/openjdk7/jdk/src/share/classes/javax/swing/tree/
H A DDefaultMutableTreeNode.java572 * Returns the number of levels above this node -- the distance from
576 * @return the number of levels above this node
580 int levels = 0;
584 levels++;
587 return levels;
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DForkJoinWorkerThread.java778 int levels = MAX_HELP; // remaining chain length
819 if (--levels > 0 && task.status >= 0 &&
825 break; // max levels, stale, dead-end, or cyclic

Completed in 88 milliseconds