Searched refs:fragment_lengths (Results 1 – 7 of 7) sorted by relevance
106 const char *fragment_lengths) { in clone_choice() argument109 if (choice->fragment_lengths) strfree(choice->fragment_lengths); in clone_choice()117 choice->fragment_lengths = in clone_choice()118 fragment_lengths ? strsave(fragment_lengths) : NULL; in clone_choice()132 choice->fragment_lengths = NULL; in clear_choice()151 if (this_choice->fragment_lengths) in free_choice()152 strfree (this_choice->fragment_lengths); in free_choice()190 const char *fragment_lengths) { in new_choice() argument202 this_choice->fragment_lengths = in new_choice()203 fragment_lengths ? strsave(fragment_lengths) : NULL; in new_choice()
61 char *fragment_lengths; // length of fragments for each unichar in string member192 return choice->fragment_lengths; in class_fragment_lengths()209 const char *fragment_lengths);233 const char *fragment_lengths);
56 const char *fragment_lengths = a_choice->fragment_lengths; in convert_to_word_choice() local61 word_choice->append_unichar_id(unichar_id, fragment_lengths[x], 0.0, 0.0); in convert_to_word_choice()
383 const char *fragment_lengths = NULL; in rebuild_current_state() local386 fragment_lengths = best_choice.fragment_lengths(); in rebuild_current_state()388 if (fragment_lengths) { in rebuild_current_state()391 if (fragment_lengths[i] > 1) { in rebuild_current_state()394 for (int j = 0; j < fragment_lengths[i]; ++j) { in rebuild_current_state()395 expanded_fragment_lengths_str += fragment_lengths[i]; in rebuild_current_state()
178 const char *fragment_lengths = word->best_choice->fragment_lengths(); in word_adaptable() local179 if (fragment_lengths != NULL && *fragment_lengths != '\0') { in word_adaptable()181 if (fragment_lengths[i] > 1) { in word_adaptable()
233 const char *other_fragment_lengths = second.fragment_lengths(); in operator +=()291 const char *other_fragment_lengths = source.fragment_lengths(); in operator =()
145 inline const char *fragment_lengths() const { in fragment_lengths() function