Below is a list of Folly components in alphabetical order, along with a brief description of each.
Simple arena for memory allocation: multiple allocations get freed all at once. With threaded version.
High-performance atomic hash map with almost lock-free operation.
A small framework for benchmarking code. Client code registers benchmarks, optionally with an argument that dictates the scale of the benchmark (iterations, working set size etc). The framework runs benchmarks (subject to a command-line flag) and produces formatted output with timing information.
Various bit manipulation utilities optimized for speed.
Bit-twiddling functions that wrap the ffsl(l) primitives in a uniform interface.
An implementation of the structure described in A Provably Correct Scalable Concurrent Skip List by Herlihy et al.
A variety of data conversion routines (notably to and from string), optimized for speed and safety.
Similar to boost::variant, but restricted to pointers only. Uses the highest-order unused 16 bits in a pointer as discriminator. So sizeof(DiscriminatedPtr<int, string, Widget>) == sizeof(void*).
Dynamically-typed object, created with JSON objects in mind.
Endian conversion primitives.
Escapes a string in C style.
Wrapper around the eventfd system call.
A drop-in implementation of std::string with a variety of optimizations.
A mostly drop-in implementation of std::vector with a variety of optimizations.
Pseudo-statements (implemented as macros) for iteration.
Python-style formatting utilities.
Group Varint encoding for 32-bit values.
Various popular hash function implementations.
A simple class for collecting histogram data.
Convenience type definitions for using boost::intrusive_list.
JSON serializer and deserializer. Uses dynamic.h.
Wrappers around __builtin_expect.
Memory allocation helpers, particularly when using jemalloc.
Helpers for finding items in associative containers (such as std::map and std::unordered_map).
A highly specialized data structure consisting of a pointer, a 1-bit spin lock, and a 15-bit integral, all inside one 64-bit word.
Necessarily evil stuff.
Pretty-printer for numbers that appends suffixes of unit used: bytes (kb, MB, ...), metric suffixes (k, M, G, ...), and time (s, ms, us, ns, ...).
Lock free single-reader, single-writer queue.
Defines only one function---randomNumberSeed().
Boost-style range facility and the StringPiece specialization.
Fast and compact reader-writer spin lock.
C++11 incarnation of the old ScopeGuard idiom.
Very small spin locks (1 byte and 1 bit).
Vector with the small buffer optimization and an ptional embedded PicoSpinLock.
Collections similar to std::map but implemented as sorted vectors.
STL allocator wrapping a simple allocate/deallocate interface.
String utilities that connect folly::fbstring with std::string.
High-level synchronization library.
Demangling and errno utilities.
High-performance atomic increment using thread caching.
Improved thread local storage for non-trivial types.
Queue with per-item timeout.
Type traits that complement those defined in the standard C++11 header <traits>.
Defines the codePointToUtf8 function.