The schema for a given column. Holds the data type as well as information about nullability & column name. In the future, it may hold information abo

The ID of a column. Each column in a table has a unique ID.

Returns false if the given StringPiece is empty, indicating that the strings::Split() API should omit the empty string. vector<string> v = Split(" a

A snapshot of the current MVCC state, which can determine whether an op timestamp should be considered visible.

ThreadPool takes a lot of arguments. We provide sane defaults with a builder. name: Used for debugging output and default names of the worker threads

Builder for actions involving RPC communications with a Kudu cluster.

Builds a new action (leaf) node.

IWYU pragma: keep

Helper used for schema creation/editing. Example: SchemaBuilder builder(base_schema); RETURN_NOT_OK(builder.RemoveColumn("value")); RETURN_NOT_OK(bui

An unsigned 128-bit integer type. Thread-compatible.

Builds a new mode (non-leaf) node.

Class for storing column attributes such as compression and encoding. Column attributes describe the physical storage and representation of bytes, as

Utility class for integration tests to verify that the cluster is in a good state.

Utility to join on a thread, printing warning messages if it takes too long. For example: ThreadJoiner(&my_thread) .warn_after_ms(1000) .warn_every_m

A RowChangeList is a wrapper around a Slice which contains a "changelist". A changelist is a single mutation to a row -- it may be one of three types

An utility class for issuing and signing certificates. This is used in "fluent" style. For example: CHECK_OK(CertSigner(&my_ca_cert, &my_ca_key) .se

Class for storing column attributes such as precision and scale for decimal types. Column attributes describe logical features of the column; these fe

Builder for actions involving RPC communications with a Kudu tablet server.

Used to construct a Messenger.

An exception representing a SASL or Kerberos failure.

An op timestamp generated by a Clock.

Represents a delimiter that will match any of the given byte-sized characters. AnyOf is similar to Literal, except that AnyOf uses StringPiece::find_f

Class of Operation for whole row removals. Only columns which are part of the key can be set. Instances of this class should not be reused.

A container for a host:port pair.

This is the same as ContiguousRow except it refers to a const area of memory that should not be mutated.

Builds a sequence of scan tokens.

Options for the State Machine/Write Ahead Log

Options that control the behavior of FsManager.

Represents a literal string delimiter. Examples: using ::strings::delimiter::Literal; vector<string> v = strings::Split("a=>b=>c", Literal("=>")); as

This class is a representation of a table's row (or a row limit) according to the table's partition schema. A table's partition can be defined by a pa

Returns false if the given StringPiece is empty or contains only whitespace, indicating that the strings::Split() API should omit the string. vector<

Convenience builder for more readable test composition.

A wrapper around rapidjson Value objects, to simplify usage. Intended solely for building json objects, not writing/parsing. Simplifies code like thi

Options struct for the MergeIterator.

Heap with custom key comparator. See https://stackoverflow.com/a/8875823.

Probe calculated from a given key. This caches the calculated hash values which are necessary for probing into a Bloom Filter, so that when many bloom

Builder for actions involving RPC communications with a Kudu master.

A very simple random number generator. Not especially good at generating truly random bits, but good enough for our needs in this package. This imple

Utility class for generating a workload against a test cluster. The actual data inserted is random, and thus can't be verified for integrity. However

A DataDirGroup is a group of directories used by an entity for block placement. A group is represented in memory by a list of indices which index into

A Builder class to build {@link KuduPartitioner}.

A two-dimensional greedy rebalancing algorithm. From among moves that decrease the skew of a most skewed table, it prefers ones that reduce the skew o