HomeSort by relevance Sort by last modified time
    Searched defs:end_node (Results 1 - 7 of 7) sorted by null

  /external/srec/srec/crec/
srec_eosd.c 78 nodeID end_node; local
93 end_node = rec->context->end_node;
94 eftoken_index = rec->best_token_for_node[ end_node];
srec.c 717 nodeID end_node,
755 wtoken->end_node = end_node;
1826 nodeID end_node; local
    [all...]
srec_context.c 109 int fst_add_arcs(srec_context* fst, nodeID start_node, nodeID end_node,
1197 nodeID start_node = MAXnodeID, end_node = MAXnodeID; local
    [all...]
  /external/srec/srec/include/
srec.h 106 nodeID end_node; /* for backtrace with word graph */ member in struct:word_token_t
328 void remove_non_end_word_from_q(srec *rec, priority_q *pq, word_token *word_token_array, nodeID end_node);
srec_context.h 120 nodeID end_node; member in struct:srec_context
  /external/bluetooth/glib/tests/
sequence-test.c 10 GSequenceNode * end_node; member in struct:_GSequence
61 GSequenceNode *node = seq->end_node;
71 g_assert (seq->end_node == node);
  /packages/inputmethods/PinyinIME/jni/share/
matrixsearch.cpp 894 MatrixNode *end_node = matrix_[step_end].mtrx_nd_fixed; local
895 assert(NULL != end_node);
897 step_start = end_node->from->step;
900 DictMatchInfo *dmi = dmi_pool_ + end_node->dmi_fr;
    [all...]

Completed in 206 milliseconds