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 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
|
/* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
file LICENSE.rst or https://cmake.org/licensing for details. */
#include <cm/string_view> // IWYU pragma: associated
#ifndef CMake_HAVE_CXX_STRING_VIEW
# include <algorithm>
# include <ostream>
# include <stdexcept>
# include <cm3p/kwiml/int.h>
namespace cm {
string_view::const_reference string_view::at(size_type pos) const
{
if (pos >= size_) {
throw std::out_of_range("Index out of range in string_view::at");
}
return data_[pos];
}
string_view::size_type string_view::copy(char* dest, size_type count,
size_type pos) const
{
if (pos > size_) {
throw std::out_of_range("Index out of range in string_view::copy");
}
size_type const rcount = std::min(count, size_ - pos);
traits_type::copy(dest, data_ + pos, rcount);
return rcount;
}
string_view string_view::substr(size_type pos, size_type count) const
{
if (pos > size_) {
throw std::out_of_range("Index out of range in string_view::substr");
}
size_type const rcount = std::min(count, size_ - pos);
return string_view(data_ + pos, rcount);
}
int string_view::compare(string_view v) const noexcept
{
size_type const rlen = std::min(size_, v.size_);
int c = traits_type::compare(data_, v.data_, rlen);
if (c == 0) {
if (size_ < v.size_) {
c = -1;
} else if (size_ > v.size_) {
c = 1;
}
}
return c;
}
int string_view::compare(size_type pos1, size_type count1, string_view v) const
{
return substr(pos1, count1).compare(v);
}
int string_view::compare(size_type pos1, size_type count1, string_view v,
size_type pos2, size_type count2) const
{
return substr(pos1, count1).compare(v.substr(pos2, count2));
}
int string_view::compare(char const* s) const
{
return compare(string_view(s));
}
int string_view::compare(size_type pos1, size_type count1, char const* s) const
{
return substr(pos1, count1).compare(string_view(s));
}
int string_view::compare(size_type pos1, size_type count1, char const* s,
size_type count2) const
{
return substr(pos1, count1).compare(string_view(s, count2));
}
string_view::size_type string_view::find(string_view v,
size_type pos) const noexcept
{
if (pos < size_) {
for (; pos + v.size_ <= size_; ++pos) {
if (std::char_traits<char>::compare(data_ + pos, v.data_, v.size_) ==
0) {
return pos;
}
}
}
return npos;
}
string_view::size_type string_view::find(char c, size_type pos) const noexcept
{
return find(string_view(&c, 1), pos);
}
string_view::size_type string_view::find(char const* s, size_type pos,
size_type count) const
{
return find(string_view(s, count), pos);
}
string_view::size_type string_view::find(char const* s, size_type pos) const
{
return find(string_view(s), pos);
}
string_view::size_type string_view::rfind(string_view v,
size_type pos) const noexcept
{
if (size_ >= v.size_) {
for (pos = std::min(pos, size_ - v.size_) + 1; pos > 0;) {
--pos;
if (std::char_traits<char>::compare(data_ + pos, v.data_, v.size_) ==
0) {
return pos;
}
}
}
return npos;
}
string_view::size_type string_view::rfind(char c, size_type pos) const noexcept
{
return rfind(string_view(&c, 1), pos);
}
string_view::size_type string_view::rfind(char const* s, size_type pos,
size_type count) const
{
return rfind(string_view(s, count), pos);
}
string_view::size_type string_view::rfind(char const* s, size_type pos) const
{
return rfind(string_view(s), pos);
}
string_view::size_type string_view::find_first_of(string_view v,
size_type pos) const noexcept
{
for (; pos < size_; ++pos) {
if (traits_type::find(v.data_, v.size_, data_[pos])) {
return pos;
}
}
return npos;
}
string_view::size_type string_view::find_first_of(char c,
size_type pos) const noexcept
{
return find_first_of(string_view(&c, 1), pos);
}
string_view::size_type string_view::find_first_of(char const* s, size_type pos,
size_type count) const
{
return find_first_of(string_view(s, count), pos);
}
string_view::size_type string_view::find_first_of(char const* s,
size_type pos) const
{
return find_first_of(string_view(s), pos);
}
string_view::size_type string_view::find_last_of(string_view v,
size_type pos) const noexcept
{
if (size_ > 0) {
for (pos = std::min(pos, size_ - 1) + 1; pos > 0;) {
--pos;
if (traits_type::find(v.data_, v.size_, data_[pos])) {
return pos;
}
}
}
return npos;
}
string_view::size_type string_view::find_last_of(char c,
size_type pos) const noexcept
{
return find_last_of(string_view(&c, 1), pos);
}
string_view::size_type string_view::find_last_of(char const* s, size_type pos,
size_type count) const
{
return find_last_of(string_view(s, count), pos);
}
string_view::size_type string_view::find_last_of(char const* s,
size_type pos) const
{
return find_last_of(string_view(s), pos);
}
string_view::size_type string_view::find_first_not_of(
string_view v, size_type pos) const noexcept
{
for (; pos < size_; ++pos) {
if (!traits_type::find(v.data_, v.size_, data_[pos])) {
return pos;
}
}
return npos;
}
string_view::size_type string_view::find_first_not_of(
char c, size_type pos) const noexcept
{
return find_first_not_of(string_view(&c, 1), pos);
}
string_view::size_type string_view::find_first_not_of(char const* s,
size_type pos,
size_type count) const
{
return find_first_not_of(string_view(s, count), pos);
}
string_view::size_type string_view::find_first_not_of(char const* s,
size_type pos) const
{
return find_first_not_of(string_view(s), pos);
}
string_view::size_type string_view::find_last_not_of(
string_view v, size_type pos) const noexcept
{
if (size_ > 0) {
for (pos = std::min(pos, size_ - 1) + 1; pos > 0;) {
--pos;
if (!traits_type::find(v.data_, v.size_, data_[pos])) {
return pos;
}
}
}
return npos;
}
string_view::size_type string_view::find_last_not_of(
char c, size_type pos) const noexcept
{
return find_last_not_of(string_view(&c, 1), pos);
}
string_view::size_type string_view::find_last_not_of(char const* s,
size_type pos,
size_type count) const
{
return find_last_not_of(string_view(s, count), pos);
}
string_view::size_type string_view::find_last_not_of(char const* s,
size_type pos) const
{
return find_last_not_of(string_view(s), pos);
}
std::ostream& operator<<(std::ostream& o, string_view v)
{
return o.write(v.data(), v.size());
}
std::string& operator+=(std::string& s, string_view v)
{
s.append(v.data(), v.size());
return s;
}
}
std::hash<cm::string_view>::result_type std::hash<cm::string_view>::operator()(
argument_type const& s) const noexcept
{
// FNV-1a hash.
static KWIML_INT_uint64_t const fnv_offset_basis = 0xcbf29ce484222325;
static KWIML_INT_uint64_t const fnv_prime = 0x100000001b3;
KWIML_INT_uint64_t h = fnv_offset_basis;
for (char const& c : s) {
h = h ^ KWIML_INT_uint64_t(KWIML_INT_uint8_t(c));
h = h * fnv_prime;
}
return result_type(h);
}
#else
// Avoid empty translation unit.
void cm_string_view_cxx()
{
}
#endif
|