Export of internal Abseil changes.
-- 4e043a11b4c10a24e84046827ee16f47e11e35cc by Abseil Team <absl-team@google.com>: Merge of https://github.com/abseil/abseil-cpp/pull/136 PiperOrigin-RevId: 218197648 -- e61f06e1e601061a443feaa8c5207c52437bd641 by Abseil Team <absl-team@google.com>: Don't include <iostream> into int128, it's wasteful Including iostream emits a global constructor for initializing std::cout and friends, which isn't actually used by this file. PiperOrigin-RevId: 218156386 -- 8a6c82396e4c956be7f285328aec131cb4965f16 by Xiaoyi Zhang <zhangxy@google.com>: Fix MSVC compiler warnings on discarding return values of functions with 'nodiscard' attribute. PiperOrigin-RevId: 217883401 -- abf3e3a0f22bc4070df9dbc9a4ef4d883ed686bf by Tom Manshreck <shreck@google.com>: Update public README to add new libraries PiperOrigin-RevId: 217879399 -- 43b3b420a4e861711abbfbd497b8f2b3de17ec8c by Abseil Team <absl-team@google.com>: Import of CCTZ from GitHub. PiperOrigin-RevId: 217780963 -- 1c8831947ca6a65a63842e6bd5f37a7c102a4e1b by Abseil Team <absl-team@google.com>: Fix typo in a comment (missing comma in usage example). PiperOrigin-RevId: 217776645 GitOrigin-RevId: 4e043a11b4c10a24e84046827ee16f47e11e35cc Change-Id: I8999ae928da7a0030b4ecfd8d13da8522fdd013a
This commit is contained in:
commit
c476da141c
606 changed files with 41 additions and 49 deletions
10
README.md
10
README.md
|
@ -63,10 +63,14 @@ Abseil contains the following C++ library components:
|
||||||
<br /> The `algorithm` library contains additions to the C++ `<algorithm>`
|
<br /> The `algorithm` library contains additions to the C++ `<algorithm>`
|
||||||
library and container-based versions of such algorithms.
|
library and container-based versions of such algorithms.
|
||||||
* [`container`](absl/container/)
|
* [`container`](absl/container/)
|
||||||
<br /> The `container` library contains additional STL-style containers.
|
<br /> The `container` library contains additional STL-style containers,
|
||||||
|
including Abseil's unordered "Swiss table" containers.
|
||||||
* [`debugging`](absl/debugging/)
|
* [`debugging`](absl/debugging/)
|
||||||
<br /> The `debugging` library contains code useful for enabling leak
|
<br /> The `debugging` library contains code useful for enabling leak
|
||||||
checks. Future updates will add stacktrace and symbolization utilities.
|
checks, and stacktrace and symbolization utilities.
|
||||||
|
* [`hash`](absl/hash/)
|
||||||
|
<br /> The `hash` library contains the hashing framework and default hash
|
||||||
|
functor implementations for hashable types in Abseil.
|
||||||
* [`memory`](absl/memory/)
|
* [`memory`](absl/memory/)
|
||||||
<br /> The `memory` library contains C++11-compatible versions of
|
<br /> The `memory` library contains C++11-compatible versions of
|
||||||
`std::make_unique()` and related memory management facilities.
|
`std::make_unique()` and related memory management facilities.
|
||||||
|
@ -90,6 +94,8 @@ Abseil contains the following C++ library components:
|
||||||
* [`types`](absl/types/)
|
* [`types`](absl/types/)
|
||||||
<br /> The `types` library contains non-container utility types, like a
|
<br /> The `types` library contains non-container utility types, like a
|
||||||
C++11-compatible version of the C++17 `std::optional` type.
|
C++11-compatible version of the C++17 `std::optional` type.
|
||||||
|
* [`utility`](absl/utility/)
|
||||||
|
<br /> The `utility` library contains utility and helper code.
|
||||||
|
|
||||||
## License
|
## License
|
||||||
|
|
||||||
|
|
|
@ -48,11 +48,9 @@ list(APPEND CONTAINER_INTERNAL_HEADERS
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
||||||
absl_library(
|
absl_header_library(
|
||||||
TARGET
|
TARGET
|
||||||
absl_container
|
absl_container
|
||||||
SOURCES
|
|
||||||
"internal/raw_hash_set.cc"
|
|
||||||
EXPORT_NAME
|
EXPORT_NAME
|
||||||
container
|
container
|
||||||
)
|
)
|
||||||
|
@ -164,13 +162,3 @@ absl_test(
|
||||||
PUBLIC_LIBRARIES
|
PUBLIC_LIBRARIES
|
||||||
${TEST_INSTANCE_TRACKER_TEST_PUBLIC_LIBRARIES}
|
${TEST_INSTANCE_TRACKER_TEST_PUBLIC_LIBRARIES}
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
||||||
absl_test(
|
|
||||||
TARGET
|
|
||||||
raw_hash_set_test
|
|
||||||
SOURCES
|
|
||||||
"internal/raw_hash_set_test.cc"
|
|
||||||
PUBLIC_LIBRARIES
|
|
||||||
absl::base absl::hash absl_throw_delegate test_instance_tracker_lib
|
|
||||||
)
|
|
||||||
|
|
|
@ -66,6 +66,3 @@ absl_test(
|
||||||
PRIVATE_COMPILE_FLAGS
|
PRIVATE_COMPILE_FLAGS
|
||||||
${ABSL_EXCEPTIONS_FLAG}
|
${ABSL_EXCEPTIONS_FLAG}
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
|
@ -145,7 +145,7 @@ TEST(Make_UniqueTest, NotAmbiguousWithStdMakeUnique) {
|
||||||
explicit TakesStdType(const std::vector<int> &vec) {}
|
explicit TakesStdType(const std::vector<int> &vec) {}
|
||||||
};
|
};
|
||||||
using absl::make_unique;
|
using absl::make_unique;
|
||||||
make_unique<TakesStdType>(std::vector<int>());
|
(void)make_unique<TakesStdType>(std::vector<int>());
|
||||||
}
|
}
|
||||||
|
|
||||||
#if 0
|
#if 0
|
||||||
|
|
|
@ -17,7 +17,7 @@
|
||||||
#include <stddef.h>
|
#include <stddef.h>
|
||||||
#include <cassert>
|
#include <cassert>
|
||||||
#include <iomanip>
|
#include <iomanip>
|
||||||
#include <iostream> // NOLINT(readability/streams)
|
#include <ostream> // NOLINT(readability/streams)
|
||||||
#include <sstream>
|
#include <sstream>
|
||||||
#include <string>
|
#include <string>
|
||||||
#include <type_traits>
|
#include <type_traits>
|
||||||
|
|
|
@ -460,4 +460,3 @@ absl_test(
|
||||||
absl::base
|
absl::base
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
||||||
|
|
|
@ -151,7 +151,7 @@ void BM_find_string_view_len_one(benchmark::State& state) {
|
||||||
std::string haystack(state.range(0), '0');
|
std::string haystack(state.range(0), '0');
|
||||||
absl::string_view s(haystack);
|
absl::string_view s(haystack);
|
||||||
for (auto _ : state) {
|
for (auto _ : state) {
|
||||||
s.find("x"); // not present; length 1
|
benchmark::DoNotOptimize(s.find("x")); // not present; length 1
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
BENCHMARK(BM_find_string_view_len_one)->Range(1, 1 << 20);
|
BENCHMARK(BM_find_string_view_len_one)->Range(1, 1 << 20);
|
||||||
|
@ -160,7 +160,7 @@ void BM_find_string_view_len_two(benchmark::State& state) {
|
||||||
std::string haystack(state.range(0), '0');
|
std::string haystack(state.range(0), '0');
|
||||||
absl::string_view s(haystack);
|
absl::string_view s(haystack);
|
||||||
for (auto _ : state) {
|
for (auto _ : state) {
|
||||||
s.find("xx"); // not present; length 2
|
benchmark::DoNotOptimize(s.find("xx")); // not present; length 2
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
BENCHMARK(BM_find_string_view_len_two)->Range(1, 1 << 20);
|
BENCHMARK(BM_find_string_view_len_two)->Range(1, 1 << 20);
|
||||||
|
@ -169,7 +169,7 @@ void BM_find_one_char(benchmark::State& state) {
|
||||||
std::string haystack(state.range(0), '0');
|
std::string haystack(state.range(0), '0');
|
||||||
absl::string_view s(haystack);
|
absl::string_view s(haystack);
|
||||||
for (auto _ : state) {
|
for (auto _ : state) {
|
||||||
s.find('x'); // not present
|
benchmark::DoNotOptimize(s.find('x')); // not present
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
BENCHMARK(BM_find_one_char)->Range(1, 1 << 20);
|
BENCHMARK(BM_find_one_char)->Range(1, 1 << 20);
|
||||||
|
@ -178,7 +178,7 @@ void BM_rfind_one_char(benchmark::State& state) {
|
||||||
std::string haystack(state.range(0), '0');
|
std::string haystack(state.range(0), '0');
|
||||||
absl::string_view s(haystack);
|
absl::string_view s(haystack);
|
||||||
for (auto _ : state) {
|
for (auto _ : state) {
|
||||||
s.rfind('x'); // not present
|
benchmark::DoNotOptimize(s.rfind('x')); // not present
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
BENCHMARK(BM_rfind_one_char)->Range(1, 1 << 20);
|
BENCHMARK(BM_rfind_one_char)->Range(1, 1 << 20);
|
||||||
|
@ -193,7 +193,7 @@ void BM_worst_case_find_first_of(benchmark::State& state, int haystack_len) {
|
||||||
|
|
||||||
absl::string_view s(haystack);
|
absl::string_view s(haystack);
|
||||||
for (auto _ : state) {
|
for (auto _ : state) {
|
||||||
s.find_first_of(needle);
|
benchmark::DoNotOptimize(s.find_first_of(needle));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -678,9 +678,9 @@ TEST(StringViewTest, STL2Substr) {
|
||||||
EXPECT_EQ(a.substr(23, absl::string_view::npos), c);
|
EXPECT_EQ(a.substr(23, absl::string_view::npos), c);
|
||||||
// throw exception
|
// throw exception
|
||||||
#ifdef ABSL_HAVE_EXCEPTIONS
|
#ifdef ABSL_HAVE_EXCEPTIONS
|
||||||
EXPECT_THROW(a.substr(99, 2), std::out_of_range);
|
EXPECT_THROW((void)a.substr(99, 2), std::out_of_range);
|
||||||
#else
|
#else
|
||||||
EXPECT_DEATH(a.substr(99, 2), "absl::string_view::substr");
|
EXPECT_DEATH((void)a.substr(99, 2), "absl::string_view::substr");
|
||||||
#endif
|
#endif
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -342,7 +342,7 @@ using CivilYear =
|
||||||
//
|
//
|
||||||
// absl::CivilSecond cs = ...;
|
// absl::CivilSecond cs = ...;
|
||||||
// absl::civil_year_t y = cs.year();
|
// absl::civil_year_t y = cs.year();
|
||||||
// cs = absl::CivilSecond(y, 1, 1, 0, 0 0); // CivilSecond(CivilYear(cs))
|
// cs = absl::CivilSecond(y, 1, 1, 0, 0, 0); // CivilSecond(CivilYear(cs))
|
||||||
//
|
//
|
||||||
using civil_year_t = time_internal::cctz::year_t;
|
using civil_year_t = time_internal::cctz::year_t;
|
||||||
|
|
||||||
|
|
|
@ -1,3 +1,5 @@
|
||||||
|
/* Layout and location of TZif files. */
|
||||||
|
|
||||||
#ifndef TZFILE_H
|
#ifndef TZFILE_H
|
||||||
|
|
||||||
#define TZFILE_H
|
#define TZFILE_H
|
||||||
|
|
2
absl/time/internal/cctz/testdata/version
vendored
2
absl/time/internal/cctz/testdata/version
vendored
|
@ -1 +1 @@
|
||||||
2018e-2-g99dd695
|
2018f-1-g401c42d
|
||||||
|
|
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Some files were not shown because too many files have changed in this diff Show more
Loading…
Reference in a new issue