Lines Matching full:bytes
28 * Note: This builder implementation stores (bytes, value) pairs with full copies
80 // If the stringOffset is negative, then the first two strings bytes contain
82 // (Compared with a stringLength field here, this saves 3 bytes per string for most strings.)
95 // Too long: We store the length in 1 or 2 bytes.
128 bytes(NULL), bytesCapacity(0), bytesLength(0) {
141 uprv_free(bytes);
193 newTrie=new BytesTrie(bytes, bytes+(bytesCapacity-bytesLength));
197 bytes=NULL; // The new trie now owns the array.
209 result.set(bytes+(bytesCapacity-bytesLength), bytesLength);
219 if(bytes!=NULL && bytesLength>0) {
253 uprv_free(bytes);
254 bytes=reinterpret_cast<char *>(uprv_malloc(capacity));
255 if(bytes==NULL) {
263 if(bytes==NULL) {
304 int32_t length=0; // Number of different bytes at byteIndex.
336 BytesTrieBuilder::BTLinearMatchNode::BTLinearMatchNode(const char *bytes, int32_t len, Node *nextNode)
337 : LinearMatchNode(len, nextNode), s(bytes) {
338 hash=hash*37+uhash_hashCharsN(bytes, len);
372 if(bytes==NULL) {
383 uprv_free(bytes);
384 bytes=NULL;
389 bytes+(bytesCapacity-bytesLength), bytesLength);
390 uprv_free(bytes);
391 bytes=newBytes;
402 bytes[bytesCapacity-bytesLength]=(char)byte;
412 uprv_memcpy(bytes+(bytesCapacity-bytesLength), b, length);
