| /external/srec/srec/crec/ |
| priority_q.c | 75 void remove_non_end_word_from_q(srec *rec, priority_q *pq, word_token *word_token_array, nodeID end_node)
88 if (token->end_node != end_node)
117 due to context-dependency. When "history_for_token" ignores the end_node,
127 if (token1->end_node != token2->end_node)
132 history_for_token1 += token1->end_node * 1000000;
139 history_for_token2 += token2->end_node * 1000000;
|
| 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_context.c | 110 int fst_add_arcs(srec_context* fst, nodeID start_node, nodeID end_node,
1198 nodeID start_node = MAXnodeID, end_node = MAXnodeID; local
[all...] |
| word_lattice.c | 50 WT.end_node = MAXnodeID; \
141 PLogMessage (" (%d W%d %s cost=%d/%d/%d time=%d%s node=%d)", wtoken_index, wtoken->word, p, wtoken->cost, cost, cost_for_word, wtoken->end_time, iwttime, wtoken->end_node);
329 wtoken->word, p, wtoken->cost, cost, cost_for_word, wtoken->end_time, WORD_TOKEN_GET_WD_ETIME(wtoken), wtoken->end_node);
|
| srec.c | 717 nodeID end_node,
755 wtoken->end_node = end_node;
1826 nodeID end_node; 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/chromium_org/cc/trees/ |
| layer_sorter.cc | 322 GraphNode* end_node = NULL; local
325 end_node = &node_b;
328 end_node = &node_a;
332 DVLOG(2) << start_node->layer->id() << " -> " << end_node->layer->id();
333 edges_.push_back(GraphEdge(start_node, end_node, weight));
|
| /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
| HtmlTree.java | 365 public int end_node; field in class:HtmlTree.Block
429 b.end_node = n;
440 b.end_node = endNode;
448 b.start_node + "-" + b.end_node + " " +
449 getPlainText(b.start_node, b.end_node));
[all...] |
| /external/srec/tools/test_g2g/ |
| test_g2g.c | 271 for( ; fr_node!=fst->end_node; fr_node=arc->to_node) {
|
| /external/srec/srec/Grammar/src/ |
| SR_GrammarImpl.c | 737 if (node == fst->end_node) continue;
|
| /external/chromium_org/third_party/cython/src/Cython/Compiler/ |
| Optimize.py | 317 end_node = length_temp.ref(node.pos)
320 start_node, end_node = end_node, start_node
351 relation2=relation2, bound2=end_node,
[all...] |
