@return true iff the tuples have the same number of fields and corresponding fields in the two Tuples are all equal.

Compares one PageId to another. @param o The object to compare against (must be a PageId) @return true if the objects are equal (e.g., page numbers a

Compares the specified object with this TupleDesc for equality. Two TupleDescs are considered equal if they have the same number of items and if the i

Get the id of the left sibling of this page @return the id of the left sibling

Retrieve the maximum number of entries this page can hold. (The number of keys)

Get the number of tuples that can fit on a page with the specified number of integer fields @param columns - the number of columns @return the number

Get the page size of root pointer pages @return the page size

Unit test for TupleDesc.numFields()

Read the specified page from disk. @throws IllegalArgumentException if the page does not exist in this file.

@return true if we successfully inserted the tuple

Create a random internal page for testing @param pid - the page id of the internal page @param keyField - the index of the key field in each tuple @pa

@return an Exception instance if one occured during lock acquisition; null otherwise

Unit test for RecordId.getPageId()

Returns the TupleDesc associated with this OpIterator. @return the TupleDesc associated with this OpIterator.

Generic unit test structure for BufferPool.getPage() assuming locking. @param tid1 the first transaction Id @param pid1 the first page to lock over @

Resets the iterator to the start. @throws DbException When rewind is unsupported.

@param card The estimated cardinality of this operator Will only be used in lab7

Set the left sibling id of this page @param id - the new left sibling id @throws DbException if the id is not valid

Checks if the sequence represents an arithmetic sequence (approximately) ret[0] is true if the sequence is linear ret[1] is the common difference of t

Create a random leaf page for testing @param pid - the page id of the leaf page @param columns - the number of fields per tuple @param keyField - the

Given a name of a field, try to figure out what table it belongs to by looking through all of the tables added via {@link #addScan}. @return A full

Return the log file of the static Database instance

Retrieve the maximum number of tuples this page can hold.

@return the page id this RecordId references.

Returns the index of the field that this B+ tree is keyed on

@return a reverse iterator over all entries on this page (calling remove on this iterator throws an UnsupportedOperationException) (note that this ite

Convert the specified tuple list (with only integer fields) into a binary page file. <br> The format of the output file will be as specified in HeapP

Delete a tuple from this BTreeFile. May cause pages to merge or redistribute entries/tuples if the pages become less than half full. @param tid - the

Estimates the cost of sequentially scanning the file, given that the cost to read a page is costPerPageIO. You can assume that there are no seeks and

get the index of the first empty slot @return the index of the first empty slot or -1 if none exists

Get the parent id of this page @return the parent id

Adds the specified entry to the page; the entry's recordId should be updated to reflect that it is now stored on this page. @throws DbException if the

Insert a tuple into this BTreeFile, keeping the tuples in sorted order. May cause pages to split if the page where tuple t belongs is full. @param ti

Returns true if the page of the BTreeFile associated with slot i is used

Abstraction to fill or clear a slot on this page.

Abstraction to mark a page of the BTreeFile used or unused

Resets the iterator to the start. @throws DbException when rewind is unsupported. @throws IllegalStateException If the iterator has not been opened

Push the specified page to disk. @param p The page to write. page.getId().pageno() specifies the offset into the file where the page should be writt

Add a new table to the catalog. This table's contents are stored in the specified DbFile. @param file the contents of the table to add; file.getId()

Convert a set of entries to a byte array in the format of a BTreeInternalPage @param entries - the set of entries @param npagebytes - number of bytes

Convert a set of tuples to a byte array in the format of a BTreeLeafPage @param tuples - the set of tuples @param npagebytes - number of bytes per pa

Returns the DbFile that can be used to read the contents of the specified table. @param tableid The id of the table, as specified by the DbFile.getId(

Computes the number of slots in the header

@return the page number in the table getTableId() associated with this PageId

@return The TupleDesc representing the schema of this tuple.

Returns the type of this field (see {@link Type#INT_TYPE} or {@link Type#STRING_TYPE} @return type of this field

Return true if field is a primary key of the specified table, false otherwise @param tableAlias The alias of the table in the query @param

Returns true if associated slot on this page is filled.

Set the right sibling id of this page @param id - the new right sibling id @throws DbException if the id is not valid

Set the id of the root page in this B+ tree @param id - the id of the root page @throws DbException if the id is invalid

@param tableAliasToId table alias to table id mapping @param tableStats table statistics

Write a page to disk. This should not be called directly but should be called from the BufferPool when pages are flushed to disk @param page - the p

Verifies that the OpIterator has been exhausted of all elements.

Delete the specified entry (key + right child pointer) from the page. The recordId is used to find the specified entry, so it must not be null. After

Delete the specified tuple from the page; the tuple should be updated to reflect that it is no longer stored on any page. @throws DbException if th

The number of entries that can fit on a page with integer key fields @return the number of entries per page

@return the operand

Initially mark all slots in the header used.

Adds the specified tuple to the page such that all records remain in sorted order; the tuple should be updated to reflect that it is now stored on th

Create a OpIterator over group aggregate results. @return a OpIterator whose tuples are the pair (groupVal, aggregateVal) if using group, or

Merge a new tuple into the aggregate, grouping as indicated in the constructor @param tup the Tuple containing an aggregate field and a gr

Returns the number of pages in this HeapFile.

Convert this LogicalPlan into a physicalPlan represented by a {@link OpIterator}. Attempts to find the optimal plan by using {@link JoinOptimizer#o

Write the bytes representing this field to the specified DataOutputStream. @see DataOutputStream @param dos The DataOutputStream to write to.

Set the parent id @param id - the id of the parent of this page @throws DbException if the id is not valid

Checks if the sequence represents approximately a fixed sequence (c,c,c,c,..) ret[0] is true if the sequence is linear ret[1] is the constant of the s

Close the iterator

Compare the specified field to the value of this Field. Return semantics are as specified by Field.compare @throws IllegalCastException if val is not

Delete the specified tuple from the page; the corresponding header bit should be updated to reflect that it is no longer stored on any page. @throws