A Trie is a data structure that maps strings to values of type T. All operations on a Trie should not modify the trie itself. It should reuse the exis

Provides utility functions for filenames. FileInfo provides easy access to the components of a file's path relative to the project root.

This class is a thread-safe wrapper around the Trie class. It provides a simple interface for accessing the trie. It should allow concurrent reads and

* Function object return is > 0 if lhs > rhs, < 0 if lhs < rhs, * = 0 if lhs = rhs . */

* @brief tracks all the read timestamps. * */

Check paths against the built-in config

Holds 4 copies of all lines with different preprocessing applied to them. 1) elided member contains lines without strings and comments. 2) lines

A special type that will block the move constructor and move assignment operator. Used in TrieStore tests.

Holds states related to parsing braces.

* The context for the planner. Used for planning aggregation calls. */

* Tuple format: * --------------------------------------------------------------------- * | FIXED-SIZE or VARIED-SIZED OFFSET | PAYLOAD OF VARIED-SI

Stores information about a generic block of code.

Stores information about a class.

Maintains module-wide state..

Stores information about an 'extern "C"' block.

Tracks current function name and the number of lines in its body.

Tracks line numbers for includes, and the order in which includes appear. include_list contains list of lists of (header, line number) pairs. It'

Stores information about a namespace.

Stores checkpoints of nesting stacks when #if/#else is seen.

* The AbstractExecutor implements the Volcano tuple-at-a-time iterator model. * This is the base class from which all executors in the BustTub execut

===--------------------------------------------------------------------===// Expressions ===----------------------------------------------------------

Interface of a memory pool that can quickly allocate chunks of memory

AggregateKey represents a key in an aggregation operation */

AggregateValue represents a value for each of the running aggregates */

* AggregationExecutor executes an aggregation operation (e.g. COUNT, SUM, MIN, MAX) * over the tuples produced by a child executor. */

* AggregationPlanNode represents the various SQL aggregation functions. * For example, COUNT(), SUM(), MIN() and MAX(). * * NOTE: To simplify this

AggregationType enumerates all the possible aggregation functions in our system */

* ArcReplacer implements the ARC replacement policy. */

* ArithmeticExpression represents two expressions being computed, ONLY SUPPORT INTEGER FOR NOW. */

ArithmeticType represents the type of computation that we want to perform. */

* ArrayExpression represents arrays. */

* The header page is just used to retrieve the root page, * preventing potential race condition under concurrent environment. */

* Both internal and leaf page are inherited from this page. * * It actually serves as a header part for each B+ tree page and * contains informatio

An integer value of the common sizes.

* The binder is responsible for transforming the Postgres parse tree to a binder tree * which can be recognized unambiguously by the BusTub planner.

A boolean value isn't a real SQL type, but we treat it as one to keep consistent in the expression subsystem.

* A bound aggregate call, e.g., `sum(x)`. */

* The alias in SELECT list, e.g. `SELECT count(x) AS y`, the `y` is an alias. */

* A bound table ref type for single table. e.g., `SELECT x FROM y`, where `y` is `BoundBaseTableRef`. */

* A bound binary operator, e.g., `a+b`. */

* A CTE. e.g., `WITH (select 1) x SELECT * FROM x`, where `x` is `BoundCTERef`. */