}
// Current position in the buffer.
- int pos = 24 * 4; // offset of end of header, which has 24 fields, all int32_t (4 bytes)
+ int pos = DH_SIZE * 4; // offset of end of header, which has DH_SIZE fields, all int32_t (4 bytes)
//
// Read in the Forward state transition table as an array of shorts.
RBBINode[] fTreeRoots = new RBBINode[4];
static final int fForwardTree = 0; // Indexes into the above fTreeRoots array
static final int fReverseTree = 1; // for each of the trees.
- static final int fSafeFwdTree = 3; // (in C, these are pointer variables and
- static final int fSafeRevTree = 4; // there is no array.)
+ static final int fSafeFwdTree = 2; // (in C, these are pointer variables and
+ static final int fSafeRevTree = 3; // there is no array.)
int fDefaultTree = fForwardTree; // For rules not qualified with a !
// the tree to which they belong to.
// longest match.
RBBISetBuilder fSetBuilder; // Set and Character Category builder.
- List<RBBINode> fUSetNodes; // Vector of all uset nodes.
+ List<RBBINode> fUSetNodes; // Vector of all used nodes.
RBBITableBuilder fForwardTable; // State transition tables
//
/**< Syntax error in RBBI rule. */
static final int U_BRK_UNCLOSED_SET = 0x10205;
- /**< UnicodeSet witing an RBBI rule missing a closing ']'. */
+ /**< UnicodeSet writing an RBBI rule missing a closing ']'. */
static final int U_BRK_ASSIGN_ERROR = 0x10206;
/**< Syntax error in RBBI rule assignment statement. */
// All rule expressions are ORed together.
// The ';' that terminates an expression really just functions as a
// '|' with
- // a low operator prededence.
+ // a low operator precedence.
//
// Each of the four sets of rules are collected separately.
// (forward, reverse, safe_forward, safe_reverse)
*/
void removeSafeState(int keepState, int duplState) {
assert(keepState < duplState);
- assert(duplState < fDStates.size());
+ assert(duplState < fSafeTable.size());
fSafeTable.remove(duplState);
int numStates = fSafeTable.size();