|author||Abseil Team <firstname.lastname@example.org>||Wed May 11 13:49:06 2022 -0700|
|committer||Copybara-Service <email@example.com>||Wed May 11 13:49:59 2022 -0700|
Document that Consume(Prefix|Suffix)() don't modify the input on failure PiperOrigin-RevId: 448075898 Change-Id: Ia4047f833bf27c62752b41f4ba65ab3be88a0181
The repository contains the Abseil C++ library code. Abseil is an open-source collection of C++ code (compliant to C++11) designed to augment the C++ standard library.
Abseil is an open-source collection of C++ library code designed to augment the C++ standard library. The Abseil library code is collected from Google's own C++ code base, has been extensively tested and used in production, and is the same code we depend on in our daily coding lives.
In some cases, Abseil provides pieces missing from the C++ standard; in others, Abseil provides alternatives to the standard for special needs we've found through usage in the Google code base. We denote those cases clearly within the library code we provide you.
Abseil is not meant to be a competitor to the standard library; we've just found that many of these utilities serve a purpose within our code base, and we now want to provide those resources to the C++ community as a whole.
If you want to just get started, make sure you at least run through the Abseil Quickstart. The Quickstart contains information about setting up your development environment, downloading the Abseil code, running tests, and getting a simple binary working.
See the quickstart for more information on building Abseil using the Bazel build system.
Abseil is officially supported on many platforms. See the Abseil platform support guide for details on supported operating systems, compilers, CPUs, etc.
Abseil contains the following C++ library components:
baselibrary contains initialization code and other code which all other Abseil code depends on. Code within
basemay not depend on any other code (other than the C++ standard library).
algorithmlibrary contains additions to the C++
<algorithm>library and container-based versions of such algorithms.
cleanuplibrary contains the control-flow-construct-like type
absl::Cleanupwhich is used for executing a callback on scope exit.
containerlibrary contains additional STL-style containers, including Abseil's unordered “Swiss table” containers.
debugginglibrary contains code useful for enabling leak checks, and stacktrace and symbolization utilities.
hashlibrary contains the hashing framework and default hash functor implementations for hashable types in Abseil.
memorylibrary contains C++11-compatible versions of
std::make_unique()and related memory management facilities.
metalibrary contains C++11-compatible versions of type checks available within C++14 and C++17 versions of the C++
numericlibrary contains C++11-compatible 128-bit integers.
profilinglibrary contains utility code for profiling C++ entities. It is currently a private dependency of other Abseil libraries.
statuscontains abstractions for error handling, specifically
stringslibrary contains a variety of strings routines and utilities, including a C++11-compatible version of the C++17
synchronizationlibrary contains concurrency primitives (Abseil's
absl::Mutexclass, an alternative to
std::mutex) and a variety of synchronization abstractions.
timelibrary contains abstractions for computing with absolute points in time, durations of time, and formatting and parsing time within time zones.
typeslibrary contains non-container utility types, like a C++11-compatible version of the C++17
utilitylibrary contains utility and helper code.
Abseil recommends users “live-at-head” (update to the latest commit from the master branch as often as possible). However, we realize this philosophy doesn't work for every project, so we also provide Long Term Support Releases to which we backport fixes for severe bugs. See our release management document for more details.
The Abseil C++ library is licensed under the terms of the Apache license. See LICENSE for more information.
For more information about Abseil: