Lines Matching refs:bytes
29 * Note: This builder implementation stores (bytes, value) pairs with full copies
81 // If the stringOffset is negative, then the first two strings bytes contain
83 // (Compared with a stringLength field here, this saves 3 bytes per string for most strings.)
96 // Too long: We store the length in 1 or 2 bytes.
129 bytes(NULL), bytesCapacity(0), bytesLength(0) {
142 uprv_free(bytes);
195 newTrie=new BytesTrie(bytes, bytes+(bytesCapacity-bytesLength));
199 bytes=NULL; // The new trie now owns the array.
211 result.set(bytes+(bytesCapacity-bytesLength), bytesLength);
221 if(bytes!=NULL && bytesLength>0) {
255 uprv_free(bytes);
256 bytes=static_cast<char *>(uprv_malloc(capacity));
257 if(bytes==NULL) {
265 if(bytes==NULL) {
306 int32_t length=0; // Number of different bytes at byteIndex.
338 BytesTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode)
339 : LinearMatchNode(len, nextNode), s(bytes) {
340 hash=hash*37+ustr_hashCharsN(bytes, len);
374 if(bytes==NULL) {
385 uprv_free(bytes);
386 bytes=NULL;
391 bytes+(bytesCapacity-bytesLength), bytesLength);
392 uprv_free(bytes);
393 bytes=newBytes;
404 bytes[bytesCapacity-bytesLength]=(char)byte;
414 uprv_memcpy(bytes+(bytesCapacity-bytesLength), b, length);
