Lines Matching refs:buffer
67 // Do not write ignored bytes right at the end of the buffer.
87 * uint8_t byte buffer, similar to CharString but simpler.
98 const uint8_t *data() const { return buffer.getAlias(); }
99 uint8_t operator[](int32_t index) const { return buffer[index]; }
101 uint8_t *data() { return buffer.getAlias(); }
110 U_ASSERT(len > 0 && buffer[len - 1] == 1);
111 sink.Append(reinterpret_cast<const char *>(buffer.getAlias()), len - 1);
115 MaybeStackArray<uint8_t, 40> buffer;
126 if(len < buffer.getCapacity() || ensureCapacity(1)) {
127 buffer[len++] = (uint8_t)b;
137 if((len + appendLength) <= buffer.getCapacity() || ensureCapacity(appendLength)) {
138 buffer[len++] = b0;
140 buffer[len++] = b1;
150 if((len + appendLength) <= buffer.getCapacity() || ensureCapacity(appendLength)) {
151 buffer[len++] = bytes[0];
153 buffer[len++] = bytes[1];
155 buffer[len++] = bytes[2];
157 buffer[len++] = bytes[3];
170 if((len + appendLength) <= buffer.getCapacity() || ensureCapacity(appendLength)) {
172 buffer[len++] = b0;
174 buffer[len] = b1;
175 buffer[len + 1] = b0;
185 int32_t newCapacity = 2 * buffer.getCapacity();
193 if(buffer.resize(newCapacity, len)==NULL) {
268 // No need to keep all CEs in the buffer when we write a sort key.
332 char buffer[3] = { p2, (char)(p >> 8), (char)p };
333 sink.Append(buffer, (buffer[1] == 0) ? 1 : (buffer[2] == 0) ? 2 : 3);
