Lines Matching full:table
47 HashTableInternals<> Table; in TEST() local
48 EXPECT_EQ(0u, Table.size()); in TEST()
49 EXPECT_GT(Table.capacity(), 0u); in TEST()
52 Table.set_as(3u, 7, Traits); in TEST()
53 EXPECT_EQ(1u, Table.size()); in TEST()
54 ASSERT_NE(Table.end(), Table.find_as(3u, Traits)); in TEST()
55 EXPECT_EQ(7u, Table.get(3u, Traits)); in TEST()
59 HashTableInternals<> Table; in TEST() local
60 EXPECT_EQ(0u, Table.size()); in TEST()
61 EXPECT_GT(Table.capacity(), 0u); in TEST()
63 // We use knowledge of the hash table's implementation details to make sure in TEST()
65 // hash table's capacity. in TEST()
66 uint32_t N1 = Table.capacity() + 1; in TEST()
70 Table.set_as(N1, 7, Traits); in TEST()
71 Table.set_as(N2, 12, Traits); in TEST()
72 EXPECT_EQ(2u, Table.size()); in TEST()
73 ASSERT_NE(Table.end(), Table.find_as(N1, Traits)); in TEST()
74 ASSERT_NE(Table.end(), Table.find_as(N2, Traits)); in TEST()
76 EXPECT_EQ(7u, Table.get(N1, Traits)); in TEST()
77 EXPECT_EQ(12u, Table.get(N2, Traits)); in TEST()
81 HashTableInternals<> Table; in TEST() local
82 EXPECT_EQ(0u, Table.size()); in TEST()
83 EXPECT_GT(Table.capacity(), 0u); in TEST()
86 Table.set_as(1u, 2, Traits); in TEST()
87 Table.set_as(3u, 4, Traits); in TEST()
88 EXPECT_EQ(2u, Table.size()); in TEST()
89 ASSERT_NE(Table.end(), Table.find_as(1u, Traits)); in TEST()
90 ASSERT_NE(Table.end(), Table.find_as(3u, Traits)); in TEST()
92 EXPECT_EQ(2u, Table.get(1u, Traits)); in TEST()
93 EXPECT_EQ(4u, Table.get(3u, Traits)); in TEST()
97 HashTableInternals<> Table; in TEST() local
98 EXPECT_EQ(0u, Table.size()); in TEST()
99 EXPECT_GT(Table.capacity(), 0u); in TEST()
104 uint32_t N1 = Table.capacity() + 1; in TEST()
109 Table.set_as(N1, 7, Traits); in TEST()
110 Table.set_as(N2, 11, Traits); in TEST()
111 Table.set_as(N3, 13, Traits); in TEST()
112 EXPECT_EQ(3u, Table.size()); in TEST()
113 ASSERT_NE(Table.end(), Table.find_as(N1, Traits)); in TEST()
114 ASSERT_NE(Table.end(), Table.find_as(N2, Traits)); in TEST()
115 ASSERT_NE(Table.end(), Table.find_as(N3, Traits)); in TEST()
117 EXPECT_EQ(7u, Table.get(N1, Traits)); in TEST()
118 EXPECT_EQ(11u, Table.get(N2, Traits)); in TEST()
119 EXPECT_EQ(13u, Table.get(N3, Traits)); in TEST()
125 // capacity is larger, and all the original items are still in the table. in TEST()
127 HashTableInternals<> Table; in TEST() local
129 uint32_t OldCapacity = Table.capacity(); in TEST()
131 Table.set_as(OldCapacity + I * 2 + 1, I * 2 + 3, Traits); in TEST()
133 EXPECT_EQ(OldCapacity, Table.size()); in TEST()
134 EXPECT_GT(Table.capacity(), OldCapacity); in TEST()
136 ASSERT_NE(Table.end(), Table.find_as(OldCapacity + I * 2 + 1, Traits)); in TEST()
137 EXPECT_EQ(I * 2 + 3, Table.get(OldCapacity + I * 2 + 1, Traits)); in TEST()
142 HashTableInternals<> Table; in TEST() local
144 uint32_t Cap = Table.capacity(); in TEST()
146 Table.set_as(Cap + I * 2 + 1, I * 2 + 3, Traits); in TEST()
149 std::vector<uint8_t> Buffer(Table.calculateSerializedLength()); in TEST()
152 EXPECT_THAT_ERROR(Table.commit(Writer), Succeeded()); in TEST()
162 EXPECT_EQ(Table.size(), Table2.size()); in TEST()
163 EXPECT_EQ(Table.capacity(), Table2.capacity()); in TEST()
164 EXPECT_EQ(Table.Buckets, Table2.Buckets); in TEST()
165 EXPECT_EQ(Table.Present, Table2.Present); in TEST()
166 EXPECT_EQ(Table.Deleted, Table2.Deleted); in TEST()
176 // To verify the hash table actually works, we want to verify that insertion in TEST()
243 HashTableInternals<FooBar> Table; in TEST() local
245 uint32_t Cap = Table.capacity(); in TEST()
250 Table.set_as(utostr(I), F, Traits); in TEST()
253 std::vector<uint8_t> Buffer(Table.calculateSerializedLength()); in TEST()
256 EXPECT_THAT_ERROR(Table.commit(Writer), Succeeded()); in TEST()
266 EXPECT_EQ(Table.size(), Table2.size()); in TEST()
267 EXPECT_EQ(Table.capacity(), Table2.capacity()); in TEST()
268 EXPECT_EQ(Table.Buckets, Table2.Buckets); in TEST()
269 EXPECT_EQ(Table.Present, Table2.Present); in TEST()
270 EXPECT_EQ(Table.Deleted, Table2.Deleted); in TEST()