Lines Matching full:strings
40 void setTo(StringPiece s, int32_t val, CharString &strings, UErrorCode &errorCode);
42 StringPiece getString(const CharString &strings) const { in getString()
46 length=(uint8_t)strings[offset++]; in getString()
49 length=((int32_t)(uint8_t)strings[offset]<<8)|(uint8_t)strings[offset+1]; in getString()
52 return StringPiece(strings.data()+offset, length); in getString()
54 int32_t getStringLength(const CharString &strings) const { in getStringLength()
57 return (uint8_t)strings[offset]; in getStringLength()
60 return ((int32_t)(uint8_t)strings[offset]<<8)|(uint8_t)strings[offset+1]; in getStringLength()
64 char charAt(int32_t index, const CharString &strings) const { return data(strings)[index]; } in charAt()
68 int32_t compareStringTo(const BytesTrieElement &o, const CharString &strings) const;
71 const char *data(const CharString &strings) const { in data()
78 return strings.data()+offset; in data()
81 // If the stringOffset is non-negative, then the first strings byte contains
83 // If the stringOffset is negative, then the first two strings bytes contain
85 // (Compared with a stringLength field here, this saves 3 bytes per string for most strings.)
92 CharString &strings, UErrorCode &errorCode) { in setTo() argument
102 int32_t offset=strings.length(); in setTo()
105 strings.append((char)(length>>8), errorCode); in setTo()
107 strings.append((char)length, errorCode); in setTo()
110 strings.append(s, errorCode); in setTo()
114 BytesTrieElement::compareStringTo(const BytesTrieElement &other, const CharString &strings) const { in compareStringTo()
116 StringPiece thisString=getString(strings); in compareStringTo()
117 StringPiece otherString=other.getString(strings); in compareStringTo()
130 : strings(NULL), elements(NULL), elementsCapacity(0), elementsLength(0), in BytesTrieBuilder()
135 strings=new CharString(); in BytesTrieBuilder()
136 if(strings==NULL) { in BytesTrieBuilder()
142 delete strings; in ~BytesTrieBuilder()
176 elements[elementsLength++].setTo(s, value, *strings, errorCode); in add()
184 const CharString *strings=static_cast<const CharString *>(context); in compareElementStrings() local
187 return leftElement->compareStringTo(*rightElement, *strings); in compareElementStrings()
233 compareElementStrings, strings, in buildBytes()
239 // Duplicate strings are not allowed. in buildBytes()
240 StringPiece prev=elements[0].getString(*strings); in buildBytes()
242 StringPiece current=elements[i].getString(*strings); in buildBytes()
252 int32_t capacity=strings->length(); in buildBytes()
274 strings->clear(); in clear()
282 return elements[i].getStringLength(*strings); in getElementStringLength()
287 return (uint8_t)elements[i].charAt(byteIndex, *strings); in getElementUnit()
299 int32_t minStringLength=firstElement.getStringLength(*strings); in getLimitOfLinearMatch()
301 firstElement.charAt(byteIndex, *strings)== in getLimitOfLinearMatch()
302 lastElement.charAt(byteIndex, *strings)) {} in getLimitOfLinearMatch()
311 char byte=elements[i++].charAt(byteIndex, *strings); in countElementUnits()
312 while(i<limit && byte==elements[i].charAt(byteIndex, *strings)) { in countElementUnits()
323 char byte=elements[i++].charAt(byteIndex, *strings); in skipElementsBySomeUnits()
324 while(byte==elements[i].charAt(byteIndex, *strings)) { in skipElementsBySomeUnits()
334 while(b==elements[i].charAt(byteIndex, *strings)) { in indexOfElementWithNextUnit()
370 elements[i].getString(*strings).data()+byteIndex, in createLinearMatchNode()
424 return write(elements[i].getString(*strings).data()+byteIndex, length); in writeElementUnits()