HomeSort by relevance Sort by last modified time
    Searched full:arc_token_list (Results 1 - 8 of 8) sorted by null

  /external/srec/srec/Semproc/src/
SemanticGraphImpl.c 152 if (impl->arc_token_list != NULL)
154 FREE(impl->arc_token_list);
155 impl->arc_token_list = NULL;
196 /* convert these to an arc_token_list or whatever */
246 static arc_token_lnk get_first_arc_leaving_node1(arc_token* arc_token_list,
253 if ((nodeID)(int)arc_token_list[i].next_token_index == node)
254 return ARC_TOKEN_LNK(arc_token_list, i);
284 arc_token* arc_token_list; local
414 semgraph->arc_token_list = NEW_ARRAY(arc_token,max_num_arc_tokens, L("semgraph.wordgraph"));
415 arc_token_list = semgraph->arc_token_list
638 arc_token *atoken, *arc_token_list = impl->arc_token_list; local
    [all...]
SemanticProcessorImpl.c 264 for (atok = atoken_start; atok; atok = ARC_TOKEN_PTR(semgraph->arc_token_list, atok->next_token_index))
277 atok_use = arc_tokens_find_ilabel(semgraph->arc_token_list, semgraph->arcs_for_slot[atok->ilabel], *currentWord);
282 for (a = semgraph->arcs_for_slot[atok->ilabel]; 0 && a; a = ARC_TOKEN_PTR(semgraph->arc_token_list, a->next_token_index))
302 arc_token* atokfna = ARC_TOKEN_PTR(semgraph->arc_token_list, atok->first_next_arc);
371 for (atok = atoken_start; atok; atok = ARC_TOKEN_PTR(semgraph->arc_token_list, atok->next_token_index))
386 atok_use = arc_tokens_find_ilabel(semgraph->arc_token_list, semgraph->arcs_for_slot[atok->ilabel], wdID);
391 for (a = semgraph->arcs_for_slot[atok->ilabel]; 0 && a; a = ARC_TOKEN_PTR(semgraph->arc_token_list, a->next_token_index))
414 arc_token* atokfna = ARC_TOKEN_PTR(semgraph->arc_token_list, atok->first_next_arc);
504 rc = checkpath_forwardByWordID(semgraph, heap, &semgraph->arc_token_list[0], path_root,
825 debug_base_arc_token = &semgraph->arc_token_list[0]
    [all...]
  /external/srec/srec/crec/
text_parser.c 95 for (tmp = ARC_TOKEN_PTR(context->arc_token_list, next_atok->first_next_arc); tmp != NULL;
96 tmp = ARC_TOKEN_PTR(context->arc_token_list, tmp->next_token_index))
112 arc_token* atok = &context->arc_token_list[0];
199 if (!context->arc_token_list)
astar.c 56 The word graph is represented as an arc_token_list,
72 arc_token* arc_token_list = context->arc_token_list; local
84 root_arc.first_next_arc = ARC_TOKEN_LNK(arc_token_list, 0);
92 atoken = &arc_token_list[0];
93 for (; atoken; atoken = ARC_TOKEN_PTR(arc_token_list, atoken->next_token_index))
99 for (tmp = ARC_TOKEN_PTR(arc_token_list, atoken->first_next_arc); tmp;
100 tmp = ARC_TOKEN_PTR(arc_token_list, tmp->next_token_index))
115 tmp = ARC_TOKEN_PTR(arc_token_list, atoken->first_next_arc);
124 for (tmp = ARC_TOKEN_PTR(arc_token_list, atoken->first_next_arc); tmp
173 arc_token* arc_token_list = context->arc_token_list; local
665 arc_token* arc_token_list; \/* to skip graph constraints, just set this to NULL *\/ local
    [all...]
srec_context.c 1775 arc_token *arc_token_list, *tmp; local
    [all...]
word_lattice.c 696 keep_arc_token_list = rec->context->arc_token_list;
697 rec->context->arc_token_list = 0;
753 rec->context->arc_token_list = keep_arc_token_list;
  /external/srec/srec/Semproc/include/
SR_SemanticGraphImpl.h 86 arc_token* arc_token_list; member in struct:SR_SemanticGraphImpl_t
116 arc_token* arc_tokens_find_ilabel(arc_token* base, arc_token* arc_token_list, wordID wdid);
  /external/srec/srec/include/
srec_context.h 141 arc_token* arc_token_list; member in struct:srec_context
236 arc_token_lnk get_first_arc_leaving_node(arc_token* arc_token_list, arcID num_arcs, nodeID node);

Completed in 224 milliseconds