146 lines
4.3 KiB
C++
146 lines
4.3 KiB
C++
/*
|
|
**********************************************************************
|
|
* Copyright (C) 1999 IBM Corp. All rights reserved.
|
|
**********************************************************************
|
|
* Date Name Description
|
|
* 11/11/99 rgillam Complete port from Java.
|
|
**********************************************************************
|
|
*/
|
|
|
|
#include "ucmp8.h"
|
|
#include "cmemory.h"
|
|
#include "rbbi_tbl.h"
|
|
|
|
//=======================================================================
|
|
// constructor
|
|
//=======================================================================
|
|
|
|
RuleBasedBreakIteratorTables::RuleBasedBreakIteratorTables(UDataMemory* memory)
|
|
: refCount(0),
|
|
ownTables(FALSE)
|
|
{
|
|
if(memory != 0) {
|
|
fMemory = memory;
|
|
const void* image = udata_getMemory(memory);
|
|
|
|
if(image != 0) {
|
|
|
|
const int32_t* im = (const int32_t*)(image);
|
|
const int8_t* base = (const int8_t*)(image);
|
|
|
|
// the memory image begins with an index that gives the offsets into the
|
|
// image for each of the fields in the BreakIteratorTables object--
|
|
// use those to initialize the tables object (it will end up pointing
|
|
// into the memory image for everything)
|
|
numCategories = (int32_t)im[0];
|
|
description = UnicodeString(TRUE, (UChar*)((int32_t)im[1] + base), -1);
|
|
charCategoryTable = ucmp8_openAlias((uint16_t*)((int32_t)im[2] + base),
|
|
(int8_t*)((int32_t)im[3] + base), 0);
|
|
stateTable = (int16_t*)((int32_t)im[4] + base);
|
|
backwardsStateTable = (int16_t*)((int32_t)im[5] + base);
|
|
endStates = (int8_t*)((int32_t)im[6] + base);
|
|
lookaheadStates = (int8_t*)((int32_t)im[7] + base);
|
|
} else {
|
|
udata_close(fMemory);
|
|
}
|
|
} else {
|
|
fMemory = 0;
|
|
}
|
|
}
|
|
|
|
RuleBasedBreakIteratorTables::RuleBasedBreakIteratorTables()
|
|
: refCount(0),
|
|
ownTables(TRUE),
|
|
fMemory(0)
|
|
{
|
|
// everything else is null-initialized. This constructor depends on
|
|
// a RuleBasedBreakIteratorBuilder filling in all the members
|
|
}
|
|
|
|
//=======================================================================
|
|
// boilerplate
|
|
//=======================================================================
|
|
|
|
/**
|
|
* Destructor
|
|
*/
|
|
RuleBasedBreakIteratorTables::~RuleBasedBreakIteratorTables() {
|
|
if (ownTables) {
|
|
delete [] stateTable;
|
|
delete [] backwardsStateTable;
|
|
delete [] endStates;
|
|
delete [] lookaheadStates;
|
|
ucmp8_close(charCategoryTable);
|
|
}
|
|
else {
|
|
uprv_free(charCategoryTable);
|
|
if(fMemory != 0) {
|
|
udata_close(fMemory);
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Equality operator. Returns TRUE if both tables objects are of the
|
|
* same class, have the same behavior, and iterate over the same text.
|
|
*/
|
|
UBool
|
|
RuleBasedBreakIteratorTables::operator==(const RuleBasedBreakIteratorTables& that) const {
|
|
return this->description == that.description;
|
|
}
|
|
|
|
/**
|
|
* Compute a hash code for these tables
|
|
* @return A hash code
|
|
*/
|
|
int32_t
|
|
RuleBasedBreakIteratorTables::hashCode() const {
|
|
return description.hashCode();
|
|
}
|
|
|
|
//=======================================================================
|
|
// implementation
|
|
//=======================================================================
|
|
/**
|
|
* Looks up a character's category (i.e., its category for breaking purposes,
|
|
* not its Unicode category)
|
|
*/
|
|
int32_t
|
|
RuleBasedBreakIteratorTables::lookupCategory(UChar c, BreakIterator* ignored) const {
|
|
return ucmp8_get(charCategoryTable, c);
|
|
}
|
|
|
|
/**
|
|
* Given a current state and a character category, looks up the
|
|
* next state to transition to in the state table.
|
|
*/
|
|
int32_t
|
|
RuleBasedBreakIteratorTables::lookupState(int32_t state, int32_t category) const {
|
|
return stateTable[state * numCategories + category];
|
|
}
|
|
|
|
/**
|
|
* Given a current state and a character category, looks up the
|
|
* next state to transition to in the backwards state table.
|
|
*/
|
|
int32_t
|
|
RuleBasedBreakIteratorTables::lookupBackwardState(int32_t state, int32_t category) const {
|
|
return backwardsStateTable[state * numCategories + category];
|
|
}
|
|
|
|
/**
|
|
* Returns true if the specified state is an accepting state.
|
|
*/
|
|
UBool
|
|
RuleBasedBreakIteratorTables::isEndState(int32_t state) const {
|
|
return endStates[state];
|
|
}
|
|
|
|
/**
|
|
* Returns true if the specified state is a lookahead state.
|
|
*/
|
|
UBool
|
|
RuleBasedBreakIteratorTables::isLookaheadState(int32_t state) const {
|
|
return lookaheadStates[state];
|
|
}
|