Lines Matching refs:names
18 * This builder reads Unicode character names and aliases,
31 * -- data-based names
52 * tokenString=tokenStrings+token; (tokenStrings=start of names data + tokenStringOffset;)
60 * uint16_t groupMSB; -- for a group of 32 character names stored, this is code point>>5
61 * uint16_t offsetHigh; -- group strings are at start of names data + groupStringsOffset + this 32 bit-offset
79 * -- algorithmic names
88 * algorithmic names (Unicode 3.0.0: 3, hardcoded in gennames)
197 /* the structure for algorithmic names needs to be 4-aligned */
273 addLine(UChar32 code, const char *names[], int16_t lengths[], int16_t count);
305 const char *names[4]={ NULL, NULL, NULL, NULL };
310 names[0]=props.name;
312 parseName(names[0], lengths[0]);
327 names[3]=buffer.data();
330 names[3]=corr;
333 parseName(names[3], lengths[3]);
337 addLine(props.start, names, lengths, LENGTHOF(names));
513 printf("number of letters used in the names: %d\n", (int)letterCount);
754 printf("size of all names in the database: %lu\n",
758 printf("number of words in the dictionary from these names: %lu\n",
833 * - the offset to the algorithmic names, uint32_t (4)
845 * - the size of the data for the algorithmic names
856 "total data length %lu, token strings %lu, compressed strings %lu, algorithmic names %lu\n",
895 /* 4-align the algorithmic names data */
981 addLine(UChar32 code, const char *names[], int16_t lengths[], int16_t count) {
1018 uprv_memcpy(stringStart+length, names[i], lengths[i]);