[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 1 | // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 | // Use of this source code is governed by a BSD-style license that can be |
| 3 | // found in the LICENSE file. |
| 4 | |
avi | b734894 | 2015-12-25 20:57:10 | [diff] [blame] | 5 | #include <stdint.h> |
| 6 | |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 7 | #include <string> |
| 8 | #include <vector> |
| 9 | |
| 10 | #include "content/browser/speech/chunked_byte_buffer.h" |
| 11 | #include "testing/gtest/include/gtest/gtest.h" |
| 12 | |
[email protected] | fcb8e021 | 2012-10-29 11:57:18 | [diff] [blame] | 13 | namespace content { |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 14 | |
avi | b734894 | 2015-12-25 20:57:10 | [diff] [blame] | 15 | typedef std::vector<uint8_t> ByteVector; |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 16 | |
| 17 | TEST(ChunkedByteBufferTest, BasicTest) { |
| 18 | ChunkedByteBuffer buffer; |
| 19 | |
avi | b734894 | 2015-12-25 20:57:10 | [diff] [blame] | 20 | const uint8_t kChunks[] = { |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 21 | 0x00, 0x00, 0x00, 0x04, 0x01, 0x02, 0x03, 0x04, // Chunk 1: 4 bytes |
avi | b734894 | 2015-12-25 20:57:10 | [diff] [blame] | 22 | 0x00, 0x00, 0x00, 0x02, 0x05, 0x06, // Chunk 2: 2 bytes |
| 23 | 0x00, 0x00, 0x00, 0x01, 0x07 // Chunk 3: 1 bytes |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 24 | }; |
| 25 | |
| 26 | EXPECT_EQ(0U, buffer.GetTotalLength()); |
| 27 | EXPECT_FALSE(buffer.HasChunks()); |
| 28 | |
| 29 | // Append partially chunk 1. |
| 30 | buffer.Append(kChunks, 2); |
| 31 | EXPECT_EQ(2U, buffer.GetTotalLength()); |
| 32 | EXPECT_FALSE(buffer.HasChunks()); |
| 33 | |
| 34 | // Complete chunk 1. |
| 35 | buffer.Append(kChunks + 2, 6); |
| 36 | EXPECT_EQ(8U, buffer.GetTotalLength()); |
| 37 | EXPECT_TRUE(buffer.HasChunks()); |
| 38 | |
| 39 | // Append fully chunk 2. |
| 40 | buffer.Append(kChunks + 8, 6); |
| 41 | EXPECT_EQ(14U, buffer.GetTotalLength()); |
| 42 | EXPECT_TRUE(buffer.HasChunks()); |
| 43 | |
| 44 | // Remove and check chunk 1. |
dcheng | 5971627 | 2016-04-09 05:19:08 | [diff] [blame] | 45 | std::unique_ptr<ByteVector> chunk; |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 46 | chunk = buffer.PopChunk(); |
| 47 | EXPECT_TRUE(chunk != NULL); |
| 48 | EXPECT_EQ(4U, chunk->size()); |
avi | b734894 | 2015-12-25 20:57:10 | [diff] [blame] | 49 | EXPECT_EQ(0, std::char_traits<uint8_t>::compare(kChunks + 4, &(*chunk)[0], |
| 50 | chunk->size())); |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 51 | EXPECT_EQ(6U, buffer.GetTotalLength()); |
| 52 | EXPECT_TRUE(buffer.HasChunks()); |
| 53 | |
| 54 | // Read and check chunk 2. |
| 55 | chunk = buffer.PopChunk(); |
| 56 | EXPECT_TRUE(chunk != NULL); |
| 57 | EXPECT_EQ(2U, chunk->size()); |
avi | b734894 | 2015-12-25 20:57:10 | [diff] [blame] | 58 | EXPECT_EQ(0, std::char_traits<uint8_t>::compare(kChunks + 12, &(*chunk)[0], |
| 59 | chunk->size())); |
[email protected] | 31b7610e | 2012-04-25 09:47:12 | [diff] [blame] | 60 | EXPECT_EQ(0U, buffer.GetTotalLength()); |
| 61 | EXPECT_FALSE(buffer.HasChunks()); |
| 62 | |
| 63 | // Append fully chunk 3. |
| 64 | buffer.Append(kChunks + 14, 5); |
| 65 | EXPECT_EQ(5U, buffer.GetTotalLength()); |
| 66 | |
| 67 | // Remove and check chunk 3. |
| 68 | chunk = buffer.PopChunk(); |
| 69 | EXPECT_TRUE(chunk != NULL); |
| 70 | EXPECT_EQ(1U, chunk->size()); |
| 71 | EXPECT_EQ((*chunk)[0], kChunks[18]); |
| 72 | EXPECT_EQ(0U, buffer.GetTotalLength()); |
| 73 | EXPECT_FALSE(buffer.HasChunks()); |
| 74 | } |
| 75 | |
[email protected] | fcb8e021 | 2012-10-29 11:57:18 | [diff] [blame] | 76 | } // namespace content |