Lines Matching refs:properties
87 #define qmatches(myQ, myU) (in_list( myU->properties[ myQ->type], myQ))
1054 dp->properties[ Left1+j] = find_letter_index(LTS_MARKER_PIPESEP_CHAR, lm);
1057 if (i < 0) dp->properties[ Left1+j] = find_letter_index(LTS_MARKER_PIPESEP_CHAR, lm);
1059 dp->properties[ Left1+j] = find_letter_index(input_word[i], lm);
1060 if (dp->properties[ Left1+j] == LTS_MAXCHAR) { /*assume an unknown character is a word boundary*/
1061 dp->properties[ Left1+j] = find_letter_index(LTS_MARKER_PIPESEP_CHAR, lm);
1073 dp->properties[ Right1+j] = find_letter_index(LTS_MARKER_PIPESEP_CHAR, lm);
1076 if (i >= word_len) dp->properties[Right1+j] = find_letter_index(LTS_MARKER_PIPESEP_CHAR, lm);
1078 dp->properties[ Right1+j] = find_letter_index(input_word[i], lm);
1079 if (dp->properties[ Right1+j] == LTS_MAXCHAR) { /*assume an unknown character is a word boundary*/
1080 dp->properties[ Right1+j] = find_letter_index(LTS_MARKER_PIPESEP_CHAR, lm);
1087 dp->letter = letter; // properties[ Letter] = letter;
1089 dp->properties[ LeftPhone1] = left_phone;
1095 dp->properties[ WordLen] = word_len;
1097 if (index == 0) dp->properties[ LetInWord] = 0;
1098 else if (index == word_len-1) dp->properties[ LetInWord] = 2;
1099 else dp->properties[ LetInWord] = 1;
1133 if (index > last_syl_start) dp->properties[ SylInWord] = 2;
1134 else if (index < first_syl_end) dp->properties[ SylInWord] = 0;
1135 else dp->properties[ SylInWord] = 1;
1168 if (index > last_syl_start) dp->properties[ Syl2InWord] = 2;
1169 else if (index < first_syl_end) dp->properties[ Syl2InWord] = 0;
1170 else dp->properties[Syl2InWord] = 1;
1198 if (index > last_syl_start) dp->properties[SylInRoot] = 2;
1199 properties[ SylInRoot] = 0;
1200 else dp->properties[ SylInRoot] = 1;
1233 if (index > last_syl_start) dp->properties[Syl2InRoot] = 2;
1234 else if (index < first_syl_end) dp->properties[Syl2InRoot] = 0;
1235 else dp->properties[Syl2InRoot] = 1;
1238 dp->properties[Left_DFRE] = index - root_start;
1239 dp->properties[Right_DFRE] = (root_end - index) - 1;
1247 dp->properties[RightString] = find_best_string(input_word+index+1, lts);
1251 dp->properties[LeftString] = find_best_prefix_string(tempstr, lts);
1320 tree = lts->trees[dp->letter]; // properties[Letter]];
