25 /*
26 *******************************************************************************
27 * (C) Copyright IBM Corp. and others, 1996-2009 - All Rights Reserved *
28 * *
29 * The original version of this source code and documentation is copyrighted *
30 * and owned by IBM, These materials are provided under terms of a License *
31 * Agreement between IBM and Sun. This technology is protected by multiple *
32 * US and International patents. This notice and attribution to IBM may not *
33 * to removed. *
34 *******************************************************************************
35 */
36 /* Written by Simon Montagu, Matitiahu Allouche
37 * (ported from C code written by Markus W. Scherer)
38 */
39
40 package sun.text.bidi;
41
42 /**
43 * A BidiRun represents a sequence of characters at the same embedding level.
44 * The Bidi algorithm decomposes a piece of text into sequences of characters
45 * at the same embedding level, each such sequence is called a <quote>run</quote>.
46 *
47 * <p>A BidiRun represents such a run by storing its essential properties,
48 * but does not duplicate the characters which form the run.
49 *
50 * <p>The "limit" of the run is the position just after the
51 * last character, i.e., one more than that position.
52 *
53 * <p>This class has no public constructor, and its members cannot be
54 * modified by users.
55 *
56 * @see com.ibm.icu.text.Bidi
57 */
58 public class BidiRun {
59
60 int start; /* first logical position of the run */
61 int limit; /* last visual position of the run +1 */
62 int insertRemove; /* if >0, flags for inserting LRM/RLM before/after run,
63 if <0, count of bidi controls within run */
64 byte level;
65
|
25 /*
26 *******************************************************************************
27 * (C) Copyright IBM Corp. and others, 1996-2009 - All Rights Reserved *
28 * *
29 * The original version of this source code and documentation is copyrighted *
30 * and owned by IBM, These materials are provided under terms of a License *
31 * Agreement between IBM and Sun. This technology is protected by multiple *
32 * US and International patents. This notice and attribution to IBM may not *
33 * to removed. *
34 *******************************************************************************
35 */
36 /* Written by Simon Montagu, Matitiahu Allouche
37 * (ported from C code written by Markus W. Scherer)
38 */
39
40 package sun.text.bidi;
41
42 /**
43 * A BidiRun represents a sequence of characters at the same embedding level.
44 * The Bidi algorithm decomposes a piece of text into sequences of characters
45 * at the same embedding level, each such sequence is called a "run".
46 *
47 * <p>A BidiRun represents such a run by storing its essential properties,
48 * but does not duplicate the characters which form the run.
49 *
50 * <p>The "limit" of the run is the position just after the
51 * last character, i.e., one more than that position.
52 *
53 * <p>This class has no public constructor, and its members cannot be
54 * modified by users.
55 *
56 * @see com.ibm.icu.text.Bidi
57 */
58 public class BidiRun {
59
60 int start; /* first logical position of the run */
61 int limit; /* last visual position of the run +1 */
62 int insertRemove; /* if >0, flags for inserting LRM/RLM before/after run,
63 if <0, count of bidi controls within run */
64 byte level;
65
|