GCC Code Coverage Report

Directory: libs/http_proto/include/boost/http_proto/
File: boost/http_proto/impl/fields_view_base.ipp
Date: 2023-01-09 16:11:13
Exec Total Coverage
Lines: 135 139 97.1%
Functions: 20 21 95.2%
Branches: 50 56 89.3%
Line Branch Exec Source
1 //
2 // Copyright (c) 2021 Vinnie Falco (vinnie dot falco at gmail dot com)
3 //
4 // Distributed under the Boost Software License, Version 1.0. (See accompanying
5 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
6 //
7 // Official repository: https://github.com/CPPAlliance/http_proto
8 //
9
10 #ifndef BOOST_HTTP_PROTO_IMPL_FIELDS_VIEW_BASE_IPP
11 #define BOOST_HTTP_PROTO_IMPL_FIELDS_VIEW_BASE_IPP
12
13 #include <boost/http_proto/fields_view.hpp>
14 #include <boost/http_proto/field.hpp>
15 #include <boost/http_proto/detail/except.hpp>
16 #include <boost/url/grammar/ci_string.hpp>
17 #include <boost/url/grammar/parse.hpp>
18 #include <boost/assert.hpp>
19 #include <boost/assert/source_location.hpp>
20 #include <utility>
21
22 namespace boost {
23 namespace http_proto {
24
25 ✗ fields_view_base::
26 value_type::
27 value_type(
28 ✗ reference const& other)
29 ✗ : id(other.id)
30 , name(other.name)
31 ✗ , value(other.value)
32 {
33 }
34
35 //------------------------------------------------
36
37 auto
38 2623 fields_view_base::
39 iterator::
40 operator*() const noexcept ->
41 reference
42 {
43
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2623 times.
 2623 BOOST_ASSERT(i_ < ph_->count);
44 auto const& e =
45 2623 ph_->tab()[i_];
46 2623 auto const* p =
47 2623 ph_->cbuf + ph_->prefix;
48 return {
49 2623 e.id,
50 string_view(
51 2623 p + e.np, e.nn),
52 string_view(
53 2623 p + e.vp, e.vn) };
54 }
55
56 //------------------------------------------------
57
58 auto
59 24 fields_view_base::
60 reverse_iterator::
61 operator*() const noexcept ->
62 reference
63 {
64
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 24 times.
 24 BOOST_ASSERT(i_ > 0);
65 auto const& e =
66 24 ph_->tab()[i_-1];
67 24 auto const* p =
68 24 ph_->cbuf + ph_->prefix;
69 return {
70 24 e.id,
71 string_view(
72 24 p + e.np, e.nn),
73 string_view(
74 24 p + e.vp, e.vn) };
75 }
76
77 //------------------------------------------------
78
79 64 fields_view_base::
80 subrange::
81 iterator::
82 iterator(
83 detail::header const* ph,
84 64 std::size_t i) noexcept
85 : ph_(ph)
86 64 , i_(i)
87 {
88
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 64 times.
 64 BOOST_ASSERT(i <= ph_->count);
89 64 }
90
91 64 fields_view_base::
92 subrange::
93 iterator::
94 iterator(
95 64 detail::header const* ph) noexcept
96 : ph_(ph)
97 64 , i_(ph->count)
98 {
99 64 }
100
101 auto
102 69 fields_view_base::
103 subrange::
104 iterator::
105 operator*() const noexcept ->
106 reference const
107 {
108 auto const& e =
109 69 ph_->tab()[i_];
110 69 auto const p =
111 69 ph_->cbuf + ph_->prefix;
112 138 return string_view(
113 69 p + e.vp, e.vn);
114 }
115
116 auto
117 77 fields_view_base::
118 subrange::
119 iterator::
120 operator++() noexcept ->
121 iterator&
122 {
123
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 77 times.
 77 BOOST_ASSERT(i_ < ph_->count);
124 77 auto const* e = &ph_->tab()[i_];
125 77 auto const id = e->id;
126
2/2
✓ Branch 0 taken 70 times.
✓ Branch 1 taken 7 times.
 77 if(id != field::unknown)
127 {
128 70 ++i_;
129 70 --e;
130
2/2
✓ Branch 0 taken 45 times.
✓ Branch 1 taken 47 times.
 92 while(i_ != ph_->count)
131 {
132
2/2
✓ Branch 0 taken 23 times.
✓ Branch 1 taken 22 times.
 45 if(e->id == id)
133 23 break;
134 22 ++i_;
135 22 --e;
136 }
137 70 return *this;
138 }
139 7 auto const p =
140 7 ph_->cbuf + ph_->prefix;
141 auto name =
142 7 string_view(p + e->np, e->nn);
143 7 ++i_;
144 7 --e;
145
2/2
✓ Branch 0 taken 20 times.
✓ Branch 1 taken 4 times.
 24 while(i_ != ph_->count)
146 {
147
2/2
✓ Branch 1 taken 3 times.
✓ Branch 2 taken 17 times.
 20 if(grammar::ci_is_equal(
148 name, string_view(
149 20 p + e->np, e->nn)))
150 3 break;
151 17 ++i_;
152 17 --e;
153 }
154 7 return *this;
155 }
156
157 //------------------------------------------------
158 //
159 // fields_view_base
160 //
161 //------------------------------------------------
162
163 bool
164 4 fields_view_base::
165 exists(
166 field id) const noexcept
167 {
168 4 return find(id) != end();
169 }
170
171 bool
172 7 fields_view_base::
173 exists(
174 string_view name) const noexcept
175 {
176 7 return find(name) != end();
177 }
178
179 std::size_t
180 12 fields_view_base::
181 count(field id) const noexcept
182 {
183 12 std::size_t n = 0;
184
2/2
✓ Branch 3 taken 43 times.
✓ Branch 4 taken 12 times.
 55 for(auto v : *this)
185
2/2
✓ Branch 0 taken 11 times.
✓ Branch 1 taken 32 times.
 43 if(v.id == id)
186 11 ++n;
187 12 return n;
188 }
189
190 std::size_t
191 5 fields_view_base::
192 count(string_view name) const noexcept
193 {
194 5 std::size_t n = 0;
195
2/2
✓ Branch 3 taken 44 times.
✓ Branch 4 taken 5 times.
 49 for(auto v : *this)
196
2/2
✓ Branch 1 taken 7 times.
✓ Branch 2 taken 37 times.
 44 if(grammar::ci_is_equal(
197 v.name, name))
198 7 ++n;
199 5 return n;
200 }
201
202 auto
203 58 fields_view_base::
204 find(field id) const noexcept ->
205 iterator
206 {
207 58 auto it = begin();
208 58 auto const last = end();
209
2/2
✓ Branch 1 taken 143 times.
✓ Branch 2 taken 8 times.
 151 while(it != last)
210 {
211
2/2
✓ Branch 2 taken 50 times.
✓ Branch 3 taken 93 times.
 143 if(it->id == id)
212 50 break;
213 93 ++it;
214 }
215 58 return it;
216 }
217
218 auto
219 66 fields_view_base::
220 find(string_view name) const noexcept ->
221 iterator
222 {
223 66 auto it = begin();
224 66 auto const last = end();
225
2/2
✓ Branch 1 taken 158 times.
✓ Branch 2 taken 8 times.
 166 while(it != last)
226 {
227 158 if(grammar::ci_is_equal(
228
2/2
✓ Branch 2 taken 58 times.
✓ Branch 3 taken 100 times.
 316 it->name, name))
229 58 break;
230 100 ++it;
231 }
232 66 return it;
233 }
234
235 auto
236 2 fields_view_base::
237 find(
238 iterator from,
239 field id) const noexcept ->
240 iterator
241 {
242 2 auto const last = end();
243
2/2
✓ Branch 1 taken 10 times.
✓ Branch 2 taken 1 times.
 11 while(from != last)
244 {
245
2/2
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 9 times.
 10 if(from->id == id)
246 1 break;
247 9 ++from;
248 }
249 2 return from;
250 }
251
252 auto
253 2 fields_view_base::
254 find(
255 iterator from,
256 string_view name) const noexcept ->
257 iterator
258 {
259 2 auto const last = end();
260
2/2
✓ Branch 1 taken 11 times.
✓ Branch 2 taken 1 times.
 12 while(from != last)
261 {
262 11 if(grammar::ci_is_equal(
263
2/2
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 10 times.
 22 name, from->name))
264 1 break;
265 10 ++from;
266 }
267 2 return from;
268 }
269
270 auto
271 27 fields_view_base::
272 find_last(
273 iterator it,
274 field id) const noexcept ->
275 iterator
276 {
277 27 auto const it0 = begin();
278 for(;;)
279 {
280
2/2
✓ Branch 1 taken 4 times.
✓ Branch 2 taken 36 times.
 40 if(it == it0)
281 4 return end();
282 36 --it;
283
2/2
✓ Branch 2 taken 23 times.
✓ Branch 3 taken 13 times.
 36 if(it->id == id)
284 23 return it;
285 }
286 }
287
288 auto
289 3 fields_view_base::
290 find_last(
291 iterator it,
292 string_view name) const noexcept ->
293 iterator
294 {
295 3 auto const it0 = begin();
296 for(;;)
297 {
298
2/2
✓ Branch 1 taken 1 times.
✓ Branch 2 taken 13 times.
 14 if(it == it0)
299 1 return end();
300 13 --it;
301 13 if(grammar::ci_is_equal(
302
2/2
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 11 times.
 26 it->name, name))
303 2 return it;
304 }
305 }
306
307 string_view
308 2 fields_view_base::
309 value_or(
310 field id,
311 string_view s) const noexcept
312 {
313 2 auto it = find(id);
314
2/2
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 1 times.
 2 if(it != end())
315 1 return it->value;
316 1 return s;
317 }
318
319 string_view
320 2 fields_view_base::
321 value_or(
322 string_view name,
323 string_view s) const noexcept
324 {
325 2 auto it = find(name);
326
2/2
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 1 times.
 2 if(it != end())
327 1 return it->value;
328 1 return s;
329 }
330
331 //------------------------------------------------
332
333 auto
334 16 fields_view_base::
335 find_all(
336 field id) const noexcept ->
337 subrange
338 {
339 32 return subrange(
340 16 ph_, find(id).i_);
341 }
342
343 auto
344 5 fields_view_base::
345 find_all(
346 string_view name) const noexcept ->
347 subrange
348 {
349 10 return subrange(
350 5 ph_, find(name).i_);
351 }
352
353 //------------------------------------------------
354
355 } // http_proto
356 } // boost
357
358 #endif
359