1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
//
// Copyright (c) 2023 Alan de Freitas (alandefreitas@gmail.com)
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://github.com/boostorg/url
//
#include "../matches.hpp"
namespace boost {
namespace urls {
auto
matches_base::
at( size_type pos ) const
-> const_reference
{
if (pos < size())
{
return matches()[pos];
}
boost::throw_exception(
std::out_of_range(""));
}
auto
matches_base::
operator[]( size_type pos ) const
-> const_reference
{
BOOST_ASSERT(pos < size());
return matches()[pos];
}
auto
matches_base::
at( core::string_view id ) const
-> const_reference
{
for (std::size_t i = 0; i < size(); ++i)
{
if (ids()[i] == id)
return matches()[i];
}
boost::throw_exception(
std::out_of_range(""));
}
auto
matches_base::
operator[]( core::string_view id ) const
-> const_reference
{
return at(id);
}
auto
matches_base::
find( core::string_view id ) const
-> const_iterator
{
for (std::size_t i = 0; i < size(); ++i)
{
if (ids()[i] == id)
return matches() + i;
}
return matches() + size();
}
auto
matches_base::
begin() const
-> const_iterator
{
return &matches()[0];
}
auto
matches_base::
end() const
-> const_iterator
{
return &matches()[size()];
}
auto
matches_base::
empty() const noexcept
-> bool
{
return size() == 0;
}
} // urls
} // boost
|
