|
13 | 13 | // limitations under the License. |
14 | 14 |
|
15 | 15 | #include <cstddef> |
| 16 | +#include <cstring> |
16 | 17 | #include <string> |
17 | | -#include <utility> |
18 | 18 |
|
19 | 19 | #include "google/protobuf/wrappers.pb.h" |
20 | 20 | #include "absl/base/nullability.h" |
21 | 21 | #include "absl/functional/overload.h" |
22 | 22 | #include "absl/log/absl_check.h" |
23 | 23 | #include "absl/status/status.h" |
24 | 24 | #include "absl/strings/cord.h" |
| 25 | +#include "absl/strings/match.h" |
25 | 26 | #include "absl/strings/str_cat.h" |
26 | 27 | #include "absl/strings/string_view.h" |
| 28 | +#include "common/internal/byte_string.h" |
27 | 29 | #include "common/value.h" |
28 | 30 | #include "internal/status_macros.h" |
29 | 31 | #include "internal/strings.h" |
@@ -57,19 +59,8 @@ std::string StringDebugString(const Bytes& value) { |
57 | 59 |
|
58 | 60 | StringValue StringValue::Concat(const StringValue& lhs, const StringValue& rhs, |
59 | 61 | absl::Nonnull<google::protobuf::Arena*> arena) { |
60 | | - ABSL_DCHECK(arena != nullptr); |
61 | | - |
62 | | - if (lhs.IsEmpty()) { |
63 | | - return rhs; |
64 | | - } |
65 | | - if (rhs.IsEmpty()) { |
66 | | - return lhs; |
67 | | - } |
68 | | - |
69 | | - absl::Cord result; |
70 | | - result.Append(lhs.ToCord()); |
71 | | - result.Append(rhs.ToCord()); |
72 | | - return StringValue(std::move(result)); |
| 62 | + return StringValue( |
| 63 | + common_internal::ByteString::Concat(lhs.value_, rhs.value_, arena)); |
73 | 64 | } |
74 | 65 |
|
75 | 66 | std::string StringValue::DebugString() const { |
@@ -204,4 +195,79 @@ int StringValue::Compare(const StringValue& string) const { |
204 | 195 | [this](const auto& alternative) -> int { return Compare(alternative); }); |
205 | 196 | } |
206 | 197 |
|
| 198 | +bool StringValue::StartsWith(absl::string_view string) const { |
| 199 | + return value_.Visit(absl::Overload( |
| 200 | + [&](absl::string_view lhs) -> bool { |
| 201 | + return absl::StartsWith(lhs, string); |
| 202 | + }, |
| 203 | + [&](const absl::Cord& lhs) -> bool { return lhs.StartsWith(string); })); |
| 204 | +} |
| 205 | + |
| 206 | +bool StringValue::StartsWith(const absl::Cord& string) const { |
| 207 | + return value_.Visit(absl::Overload( |
| 208 | + [&](absl::string_view lhs) -> bool { |
| 209 | + return lhs.size() >= string.size() && |
| 210 | + lhs == string.Subcord(0, lhs.size()); |
| 211 | + }, |
| 212 | + [&](const absl::Cord& lhs) -> bool { return lhs.StartsWith(string); })); |
| 213 | +} |
| 214 | + |
| 215 | +bool StringValue::StartsWith(const StringValue& string) const { |
| 216 | + return string.value_.Visit(absl::Overload( |
| 217 | + [&](absl::string_view rhs) -> bool { return StartsWith(rhs); }, |
| 218 | + [&](const absl::Cord& rhs) -> bool { return StartsWith(rhs); })); |
| 219 | +} |
| 220 | + |
| 221 | +bool StringValue::EndsWith(absl::string_view string) const { |
| 222 | + return value_.Visit(absl::Overload( |
| 223 | + [&](absl::string_view lhs) -> bool { |
| 224 | + return absl::EndsWith(lhs, string); |
| 225 | + }, |
| 226 | + [&](const absl::Cord& lhs) -> bool { return lhs.EndsWith(string); })); |
| 227 | +} |
| 228 | + |
| 229 | +bool StringValue::EndsWith(const absl::Cord& string) const { |
| 230 | + return value_.Visit(absl::Overload( |
| 231 | + [&](absl::string_view lhs) -> bool { |
| 232 | + return lhs.size() >= string.size() && |
| 233 | + lhs == string.Subcord(string.size() - lhs.size(), lhs.size()); |
| 234 | + }, |
| 235 | + [&](const absl::Cord& lhs) -> bool { return lhs.EndsWith(string); })); |
| 236 | +} |
| 237 | + |
| 238 | +bool StringValue::EndsWith(const StringValue& string) const { |
| 239 | + return string.value_.Visit(absl::Overload( |
| 240 | + [&](absl::string_view rhs) -> bool { return EndsWith(rhs); }, |
| 241 | + [&](const absl::Cord& rhs) -> bool { return EndsWith(rhs); })); |
| 242 | +} |
| 243 | + |
| 244 | +bool StringValue::Contains(absl::string_view string) const { |
| 245 | + return value_.Visit(absl::Overload( |
| 246 | + [&](absl::string_view lhs) -> bool { |
| 247 | + return absl::StrContains(lhs, string); |
| 248 | + }, |
| 249 | + [&](const absl::Cord& lhs) -> bool { return lhs.Contains(string); })); |
| 250 | +} |
| 251 | + |
| 252 | +bool StringValue::Contains(const absl::Cord& string) const { |
| 253 | + return value_.Visit(absl::Overload( |
| 254 | + [&](absl::string_view lhs) -> bool { |
| 255 | + if (auto flat = string.TryFlat(); flat) { |
| 256 | + return absl::StrContains(lhs, *flat); |
| 257 | + } |
| 258 | + // There is no nice way to do this. We cannot use std::search due to |
| 259 | + // absl::Cord::CharIterator being an input iterator instead of a forward |
| 260 | + // iterator. So just make an external cord with a noop releaser. We know |
| 261 | + // the external cord will not outlive this function. |
| 262 | + return absl::MakeCordFromExternal(lhs, []() {}).Contains(string); |
| 263 | + }, |
| 264 | + [&](const absl::Cord& lhs) -> bool { return lhs.Contains(string); })); |
| 265 | +} |
| 266 | + |
| 267 | +bool StringValue::Contains(const StringValue& string) const { |
| 268 | + return string.value_.Visit(absl::Overload( |
| 269 | + [&](absl::string_view rhs) -> bool { return Contains(rhs); }, |
| 270 | + [&](const absl::Cord& rhs) -> bool { return Contains(rhs); })); |
| 271 | +} |
| 272 | + |
207 | 273 | } // namespace cel |
0 commit comments