Lines Matching +defs:table +defs:string
44 /* How do we store string values? */
110 * Find duplicates and count the total number of string code units
112 * for minimal string and container storage.
163 return; /* This is a duplicate of an earlier-visited string. */
165 /* Put this string into the set for finding duplicates. */
173 * This string will be stored without an explicit length.
224 * This might be an integer, or an empty string/binary/etc.
239 /* Neither a string nor a container. */
275 return 0; /* empty string */
378 /* Find the smallest table type that fits the data. */
446 * This might be an integer, or an empty or UTF-16 v2 string,
476 /* Write the UTF-16 v1 string. */
546 * This might be an integer, or an empty or UTF-16 v2 string,
593 /* Write the UTF-16 v1 string. */
887 * more compact string value storage, optional pool bundle
908 /* write the table key strings */
1151 static void table_close(struct SResource *table) {
1155 current = table->u.fTable.fFirst;
1164 table->u.fTable.fFirst = NULL;
1185 static void string_close(struct SResource *string) {
1186 if (string->u.fString.fChars != NULL &&
1187 string->u.fString.fChars != &gEmptyString) {
1188 uprv_free(string->u.fString.fChars);
1189 string->u.fString.fChars =NULL;
1266 void table_add(struct SResource *table, struct SResource *res, int linenumber, UErrorCode *status) {
1283 list = &(table->u.fTable);
1326 error(linenumber, "duplicate key '%s' in table, first appeared at line %d", currentKeyString, current->line);
1450 /* no error: the root table and array items have no keys */
1563 /* Key string from the pool bundle, do not delete. */
1650 /* sort equal suffixes by descending string length */
1659 /* Make "is suffix of another string" compare greater than a non-suffix. */
1664 /* sort by ascending string length */
1751 * This string is not a suffix of the previous one;
1771 /* yes, point to the earlier string */
1796 /* Write the suffix strings. Make each point to the real string. */