HomeSort by relevance Sort by last modified time
    Searched full:countstates (Results 1 - 25 of 28) sorted by null

1 2

  /external/chromium_org/third_party/icu/source/tools/toolutil/
ucmstate.c 189 if(states->countStates==MBCS_MAX_STATE_COUNT) {
194 error=parseState(s, states->stateTable[states->countStates],
195 &states->stateFlags[states->countStates]);
201 ++states->countStates;
342 * This is achieved in at most countStates iterations.
345 for(count=states->countStates; !allStatesReady && count>=0; --count) {
347 for(state=states->countStates-1; state>=0; --state) {
406 for(state=1; state<states->countStates; ++state) {
432 if(states->countStates==0) {
492 for(state=0; state<states->countStates; ++state)
    [all...]
ucm.h 98 int32_t countStates, minCharLength, maxCharLength, countToUCodeUnits;
  /external/icu/icu4c/source/tools/toolutil/
ucmstate.c 189 if(states->countStates==MBCS_MAX_STATE_COUNT) {
194 error=parseState(s, states->stateTable[states->countStates],
195 &states->stateFlags[states->countStates]);
201 ++states->countStates;
342 * This is achieved in at most countStates iterations.
345 for(count=states->countStates; !allStatesReady && count>=0; --count) {
347 for(state=states->countStates-1; state>=0; --state) {
406 for(state=1; state<states->countStates; ++state) {
432 if(states->countStates==0) {
492 for(state=0; state<states->countStates; ++state)
    [all...]
ucm.h 98 int32_t countStates, minCharLength, maxCharLength, countToUCodeUnits;
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
expanded-fst.h 82 typename Arc::StateId CountStates(const Fst<Arc> &fst) {
dfs-visit.h 91 StateId nstates = CountStates(fst);
  /external/openfst/src/include/fst/
reverse.h 52 ofst->ReserveStates(CountStates(ifst) + 1);
concat.h 73 fst1->ReserveStates(numstates1 + CountStates(fst2));
138 fst2->ReserveStates(numstates2 + CountStates(fst1));
dfs-visit.h 109 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
expanded-fst.h 175 typename Arc::StateId CountStates(const Fst<Arc> &fst) {
union.h 72 numstates1 + CountStates(fst2) + (initial_acyclic1 ? 0 : 1));
state-table.h 360 : StateTable(new ComposeFingerprint<StateId, F>(CountStates(fst1),
361 CountStates(fst2)),
visit.h 96 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
vector-fst.h 300 BaseImpl::ReserveStates(CountStates(fst));
530 // Writes Fst to file, will call CountStates so may involve two passes if
543 hdr.SetNumStates(CountStates(fst));
replace.h 169 // Warning: calls CountStates to compute the number of states of each
190 root_size_ = CountStates(*(fst_tuples[i].second));
194 CountStates(*(fst_tuples[i].second)));
    [all...]
accumulator.h 255 weight_positions.reserve(CountStates(fst));
  /external/chromium_org/third_party/icu/source/common/
ucnvmbcs.h 139 * 1 uint32_t countStates
180 * int32_t stateTable[countStates][256];
370 uint8_t countStates, dbcsOnlyState, stateTableOwned;
373 const int32_t (*stateTable)/*[countStates]*/[256];
374 int32_t (*swapLFNLStateTable)/*[countStates]*/[256]; /* for swaplfnl */
463 uint32_t countStates,
ucnv_bld.cpp     [all...]
ucnvmbcs.c 697 for(state=0; state<mbcsTable->countStates; ++state) {
    [all...]
  /external/icu/icu4c/source/common/
ucnvmbcs.h 139 * 1 uint32_t countStates
180 * int32_t stateTable[countStates][256];
370 uint8_t countStates, dbcsOnlyState, stateTableOwned;
373 const int32_t (*stateTable)/*[countStates]*/[256];
374 int32_t (*swapLFNLStateTable)/*[countStates]*/[256]; /* for swaplfnl */
463 uint32_t countStates,
ucnv_bld.cpp     [all...]
ucnvmbcs.c 697 for(state=0; state<mbcsTable->countStates; ++state) {
    [all...]
  /external/chromium_org/third_party/icu/source/tools/makeconv/
genmbcs.cpp 375 if(mbcsData->ucm->states.countStates==0) {
    [all...]
  /external/icu/icu4c/source/tools/makeconv/
genmbcs.cpp 375 if(mbcsData->ucm->states.countStates==0) {
    [all...]
  /external/openfst/src/include/fst/extensions/pdt/
shortest-path.h 418 VLOG(1) << "# of input states: " << CountStates(*ifst_);

Completed in 1073 milliseconds

1 2