1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
|
#include "jdtalk.h"
/**
* Produce an output string containing various user-defined types of words
*
* a = adjective
* d = adverb
* n = noun
* v = verb
* x = any
*
* char *parts[1024]; // probably more than enough, right?
* talkf(dict, "adnvx", &parts);
*
* @param dict pointer to dictionary array
* @param fmt
* @param parts
* @return
*/
char *talkf(struct Dictionary *dict[], char *fmt, char **parts, size_t parts_max) {
static char buf[OUTPUT_SIZE_MAX];
buf[0] = '\0';
if (!fmt || !strlen(fmt)) {
return NULL;
}
size_t len;
len = strlen(fmt);
for (size_t i = 0; i < len; i++) {
char *word = NULL;
switch (fmt[i]) {
case 'x':
word = dictionary_word(dict[WT_ANY], WT_ANY);
break;
case 'a':
word = dictionary_word(dict[WT_ADJECTIVE], WT_ADJECTIVE);
break;
case 'd':
word = dictionary_word(dict[WT_ADVERB], WT_ADVERB);
break;
case 'n':
word = dictionary_word(dict[WT_NOUN], WT_NOUN);
break;
case 'v':
word = dictionary_word(dict[WT_VERB], WT_VERB);
break;
default:
break;
}
if (parts) {
if (i < parts_max) {
parts[i] = word;
} else {
// We reached the maximum number of parts. Stop processing.
break;
}
}
if (word) {
strncat(buf, word, OUTPUT_SIZE_MAX);
if (i < len - 1)
strcat(buf, " ");
}
}
return buf;
}
char *talk_salad(struct Dictionary *dict[], size_t limit, char **parts, size_t parts_max) {
static char buf[OUTPUT_SIZE_MAX];
buf[0] = '\0';
for (size_t i = 0; i < limit; i++) {
strncat(buf, talkf(dict, "x", parts, parts_max), OUTPUT_SIZE_MAX);
if (i < limit - 1) {
strcat(buf, " ");
}
}
return buf;
}
char *talk_acronym(struct Dictionary *dict[], char *fmt, char *s, char **parts, size_t parts_max) {
size_t s_len;
size_t format_len;
char format[INPUT_SIZE_MAX];
static char buf[OUTPUT_SIZE_MAX];
static char *local_parts[OUTPUT_PART_MAX];
buf[0] = '\0';
format[0] = '\0';
if (fmt) {
strcpy(format, fmt);
} else {
strcpy(format, "x");
}
s_len = strlen(s);
format_len = strlen(fmt);
if (format_len > s_len) {
*(format + s_len) = '\0';
}
size_t x;
x = 0;
for (size_t i = 0; i < s_len; i++) {
char word[OUTPUT_SIZE_MAX];
word[0] = '\0';
while(1) {
char elem[2] = {0, 0};
elem[0] = format[x];
strcpy(word, talkf(dict, elem, &local_parts[i], parts_max));
if (*word == s[i]) {
strncat(buf, word, OUTPUT_SIZE_MAX);
if (i < s_len - 1) {
strcat(buf, " ");
}
break;
}
}
if (parts) {
if (i < parts_max) {
//printf("parts[%zu]=%s\n", i, word);
parts[i] = local_parts[i];
} else {
// We reached the maximum number of parts. Stop processing.
break;
}
}
if (x < format_len - 1) {
x++;
}
}
return buf;
}
int acronym_safe(struct Dictionary *dict, const char *acronym, const char *pattern, const char *fmt) {
size_t acronym_len;
size_t fmt_len;
size_t types_len;
int pattern_valid;
int format_valid;
pattern_valid = 0;
acronym_len = strlen(acronym);
for (size_t i = 0; i < acronym_len; i++) {
if (*pattern == acronym[i]) {
pattern_valid = 1;
break;
}
}
format_valid = 1;
if (fmt) {
format_valid = 0;
char *types;
fmt_len = strlen(fmt);
types = dictionary_word_formats(dict, pattern);
types_len = strlen(types);
for (size_t x = 0; x < types_len; x++) {
if (format_valid) break;
for (size_t i = 0; i < fmt_len; i++) {
if (types[x] == fmt[i]) {
format_valid = 1;
break;
}
}
}
}
return pattern_valid - format_valid == 0;
}
int format_safe(char *s) {
size_t valid;
const char *formatter = "nadvx";
valid = 0;
for (size_t i = 0; i < strlen(formatter); i++) {
for (size_t x = 0; x < strlen(s); x++) {
if (s[x] == formatter[i]) {
valid++;
}
}
}
return valid == strlen(s);
}
|
