|
|
|
// Copyright 2017 The Abseil Authors.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// https://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
|
|
#include "absl/strings/substitute.h"
|
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
#include "absl/base/internal/raw_logging.h"
|
|
|
|
#include "absl/strings/ascii.h"
|
|
|
|
#include "absl/strings/escaping.h"
|
|
|
|
#include "absl/strings/internal/resize_uninitialized.h"
|
|
|
|
#include "absl/strings/string_view.h"
|
|
|
|
|
|
|
|
namespace absl {
|
|
|
|
ABSL_NAMESPACE_BEGIN
|
|
|
|
namespace substitute_internal {
|
|
|
|
|
|
|
|
void SubstituteAndAppendArray(std::string* output, absl::string_view format,
|
|
|
|
const absl::string_view* args_array,
|
|
|
|
size_t num_args) {
|
|
|
|
// Determine total size needed.
|
|
|
|
size_t size = 0;
|
|
|
|
for (size_t i = 0; i < format.size(); i++) {
|
|
|
|
if (format[i] == '$') {
|
|
|
|
if (i + 1 >= format.size()) {
|
|
|
|
#ifndef NDEBUG
|
|
|
|
ABSL_RAW_LOG(FATAL,
|
|
|
|
"Invalid absl::Substitute() format string: \"%s\".",
|
|
|
|
absl::CEscape(format).c_str());
|
|
|
|
#endif
|
|
|
|
return;
|
|
|
|
} else if (absl::ascii_isdigit(format[i + 1])) {
|
|
|
|
int index = format[i + 1] - '0';
|
|
|
|
if (static_cast<size_t>(index) >= num_args) {
|
|
|
|
#ifndef NDEBUG
|
|
|
|
ABSL_RAW_LOG(
|
|
|
|
FATAL,
|
|
|
|
"Invalid absl::Substitute() format string: asked for \"$"
|
|
|
|
"%d\", but only %d args were given. Full format string was: "
|
|
|
|
"\"%s\".",
|
|
|
|
index, static_cast<int>(num_args), absl::CEscape(format).c_str());
|
|
|
|
#endif
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
size += args_array[index].size();
|
|
|
|
++i; // Skip next char.
|
|
|
|
} else if (format[i + 1] == '$') {
|
|
|
|
++size;
|
|
|
|
++i; // Skip next char.
|
|
|
|
} else {
|
|
|
|
#ifndef NDEBUG
|
|
|
|
ABSL_RAW_LOG(FATAL,
|
|
|
|
"Invalid absl::Substitute() format string: \"%s\".",
|
|
|
|
absl::CEscape(format).c_str());
|
|
|
|
#endif
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
++size;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (size == 0) return;
|
|
|
|
|
|
|
|
// Build the string.
|
|
|
|
size_t original_size = output->size();
|
Export of internal Abseil changes
--
f49e405201d2ffd5955503fa8ad0f08ec0cdfb2b by Martijn Vels <mvels@google.com>:
Add common [container.requirements] type definitions to `CharRange` and `ChunkRange`
The presence of these allow these range classes to be used in various utility functions which require some minimum type of container. For example, this change allows tests to use `EXPECT_THAT(cord.Chunks(), ElementsAre(...))`
PiperOrigin-RevId: 406941278
--
0c195f073632e21d9a4bce158047b2ba8551c2d1 by Evan Brown <ezb@google.com>:
Use explicit exponential growth in SubstituteAndAppendArray.
PiperOrigin-RevId: 406931952
--
afb043bccd809a55cab78abadb7548a057d9eda0 by Jorg Brown <jorg@google.com>:
Use longer var names in macro to avoid clang-tidy warning
PiperOrigin-RevId: 406930978
--
80397e2604e6b3d929a34742c3a32581b34d3ac4 by Martijn Vels <mvels@google.com>:
Add future kAppendBuffer and kPrependBuffer API trackers for Cordz sampling
PiperOrigin-RevId: 406912759
--
e910ce919ef83933f08a690e8b7325c7cc5b6d5d by Martijn Vels <mvels@google.com>:
Implement Prepend(string_view) in terms of PrependArray(string_view, MethodIdentifier).
PiperOrigin-RevId: 406891665
--
c9cff43d4c0568ed01f2fca0f6ef038ae03112b5 by Martijn Vels <mvels@google.com>:
Add 'Rebuild' logic to CordRepBtree
There are btree hostile scenarios where an application could perform repeated split/insert/merge operations on a cord leading to a tree exceeding the maximum height. While this should be rare in practice, this change adds a Rebuild() method that will rebuild a tree with a 100% fill factor, and we will invoke this rebuild when a tree exceeds the maximum height. This basically follows the similar 'balance' logic in Concat trees (although the latter is common in Concat uses)
PiperOrigin-RevId: 406875739
--
5b2b8fb88f1ebfdc1c670088152da2cb2ea4c376 by Martijn Vels <mvels@google.com>:
Add 'in place' enabled RemoveSuffix
An in-place RemoveSuffix is more efficient than SubTree() as it can directly modify privately owned nodes and flats allowing easy re-use of free capacity in right-most flats that may turn into Substring edges when using SubTree.
PiperOrigin-RevId: 406431230
--
f09903c0a3d7344f59aaf1380a16ea10829217d4 by Derek Mauro <dmauro@google.com>:
Internal change
PiperOrigin-RevId: 406430373
--
9957af575c33bb18dc170572a4ee8cc5901df6b2 by Greg Falcon <gfalcon@google.com>:
Initial groundwork to allow storing checksum data inside CordRep instances.
This uses a RefcountAndFlags bit that was reserved for this purpose, and will be leveraged in a follow-up change to allow attaching checksums to a Cord's value.
This change splits RefcountAndFlags::IsOne() into two distinct operations:
* IsOne(): This returns true when the associated CordRep is not shared with other threads. This is useful for functions that consume CordRep instances; for example, code that consumes an unshared CordRep can assume ownership of its children without modifying those refcounts.
* IsMutable(): This returns true when the associated CordRep reference is not shared with other threads, *and* does not store an associated checksum value. This is useful for functions that modify a CordRep's contents: code may modify the bytes of a mutable-unshared CordRep without fear of races with other threads, or of invalidating a stored checksum.
The tricky part of this CL is ensuring that the correct choice between IsMutable() and IsOne() was made at each point. An incorrect application of IsOne() could lead to correctness bugs in the future. Code conditioned on IsOne() may delete the CordRep in question, or assume ownership of its children, but must not modify the CordRep's data without explicitly adjusting the CRC.
PiperOrigin-RevId: 406191103
--
686544814079e5ab6d4593cca0c068b510be400a by Martijn Vels <mvels@google.com>:
Reduce the size in the LargeString test when running with Sanitizers
PiperOrigin-RevId: 406186945
--
735b4490bdb695c35731f06ce4b8de14ce2be6ed by Alex Strelnikov <strel@google.com>:
Release absl::SimpleHexAtoi.
PiperOrigin-RevId: 406143188
GitOrigin-RevId: f49e405201d2ffd5955503fa8ad0f08ec0cdfb2b
Change-Id: Ic6527ac40fa03ea02ca813e8bb7868a219544de4
3 years ago
|
|
|
strings_internal::STLStringResizeUninitializedAmortized(output,
|
|
|
|
original_size + size);
|
|
|
|
char* target = &(*output)[original_size];
|
|
|
|
for (size_t i = 0; i < format.size(); i++) {
|
|
|
|
if (format[i] == '$') {
|
|
|
|
if (absl::ascii_isdigit(format[i + 1])) {
|
|
|
|
const absl::string_view src = args_array[format[i + 1] - '0'];
|
|
|
|
target = std::copy(src.begin(), src.end(), target);
|
|
|
|
++i; // Skip next char.
|
|
|
|
} else if (format[i + 1] == '$') {
|
|
|
|
*target++ = '$';
|
|
|
|
++i; // Skip next char.
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
*target++ = format[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(target == output->data() + output->size());
|
|
|
|
}
|
|
|
|
|
|
|
|
Arg::Arg(const void* value) {
|
|
|
|
static_assert(sizeof(scratch_) >= sizeof(value) * 2 + 2,
|
|
|
|
"fix sizeof(scratch_)");
|
|
|
|
if (value == nullptr) {
|
|
|
|
piece_ = "NULL";
|
|
|
|
} else {
|
|
|
|
char* ptr = scratch_ + sizeof(scratch_);
|
|
|
|
uintptr_t num = reinterpret_cast<uintptr_t>(value);
|
|
|
|
do {
|
|
|
|
*--ptr = absl::numbers_internal::kHexChar[num & 0xf];
|
|
|
|
num >>= 4;
|
|
|
|
} while (num != 0);
|
|
|
|
*--ptr = 'x';
|
|
|
|
*--ptr = '0';
|
|
|
|
piece_ = absl::string_view(ptr, scratch_ + sizeof(scratch_) - ptr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO(jorg): Don't duplicate so much code between here and str_cat.cc
|
|
|
|
Arg::Arg(Hex hex) {
|
|
|
|
char* const end = &scratch_[numbers_internal::kFastToBufferSize];
|
|
|
|
char* writer = end;
|
|
|
|
uint64_t value = hex.value;
|
|
|
|
do {
|
|
|
|
*--writer = absl::numbers_internal::kHexChar[value & 0xF];
|
|
|
|
value >>= 4;
|
|
|
|
} while (value != 0);
|
|
|
|
|
|
|
|
char* beg;
|
|
|
|
if (end - writer < hex.width) {
|
|
|
|
beg = end - hex.width;
|
|
|
|
std::fill_n(beg, writer - beg, hex.fill);
|
|
|
|
} else {
|
|
|
|
beg = writer;
|
|
|
|
}
|
|
|
|
|
|
|
|
piece_ = absl::string_view(beg, end - beg);
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO(jorg): Don't duplicate so much code between here and str_cat.cc
|
|
|
|
Arg::Arg(Dec dec) {
|
|
|
|
assert(dec.width <= numbers_internal::kFastToBufferSize);
|
|
|
|
char* const end = &scratch_[numbers_internal::kFastToBufferSize];
|
|
|
|
char* const minfill = end - dec.width;
|
|
|
|
char* writer = end;
|
|
|
|
uint64_t value = dec.value;
|
|
|
|
bool neg = dec.neg;
|
|
|
|
while (value > 9) {
|
|
|
|
*--writer = '0' + (value % 10);
|
|
|
|
value /= 10;
|
|
|
|
}
|
|
|
|
*--writer = '0' + value;
|
|
|
|
if (neg) *--writer = '-';
|
|
|
|
|
|
|
|
ptrdiff_t fillers = writer - minfill;
|
|
|
|
if (fillers > 0) {
|
|
|
|
// Tricky: if the fill character is ' ', then it's <fill><+/-><digits>
|
|
|
|
// But...: if the fill character is '0', then it's <+/-><fill><digits>
|
|
|
|
bool add_sign_again = false;
|
|
|
|
if (neg && dec.fill == '0') { // If filling with '0',
|
|
|
|
++writer; // ignore the sign we just added
|
|
|
|
add_sign_again = true; // and re-add the sign later.
|
|
|
|
}
|
|
|
|
writer -= fillers;
|
|
|
|
std::fill_n(writer, fillers, dec.fill);
|
|
|
|
if (add_sign_again) *--writer = '-';
|
|
|
|
}
|
|
|
|
|
|
|
|
piece_ = absl::string_view(writer, end - writer);
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace substitute_internal
|
|
|
|
ABSL_NAMESPACE_END
|
|
|
|
} // namespace absl
|