Unit test for Tuple.getField() and Tuple.setField()

Unit test for Tuple.getRecordId() and Tuple.setRecordId()

Unit test for TupleDesc.nameToId()

Test with a minimum and a maximum that are both negative numbers.

Gets the next tuple from the operator (typically implementing by reading from a child operator or an access method). @return The next tuple in the it

Test a join ordering with an inequality, to make sure the inequality gets put as the outermost join

Unit test for BTreeFile.numPages()

Unit test for HeapFile.numPages()

Unit test for BTreeHeaderPage.numSlots()

Make sure that equality binning does something reasonable.

Make sure that GREATER_THAN_OR_EQ binning does something reasonable.

Make sure that GREATER_THAN binning does something reasonable.

Make sure that LESS_THAN_OR_EQ binning does something reasonable.

Make sure that LESS_THAN binning does something reasonable.

Make sure that equality binning does something reasonable.

Open the access method such that when getNext is called, it iterates through the tuples that satisfy ipred. @param ipred The predicate

Determine whether the orderJoins implementation is doing a reasonable job of ordering joins, and not taking an unreasonable amount of time to do so

Test to confirm that the IntHistogram implementation is constant-space (or, at least, reasonably small space; O(log(n)) might still work if your const

Unit test for BTreePageId.pageno()

Unit test for HeapPageId.pageno()

Helper function to display a Swing window with a tree representation of the specified list of joins. See {@link #orderJoins}, which may want to call t

Read the next tuple either from the current page if it has more tuples or from the next page by following the right sibling pointer. @return the next

Read the next tuple either from the current page if it has more tuples matching the predicate or from the next page by following the right sibling poi

Unit test for BTreeFile.readPage()

Unit test for HeapFile.readPage()

Read a page from the file on disk. This should not be called directly but should be called from the BufferPool via getPage() @param pid - the id of t

Reset the tableid, and tableAlias of this operator. @param tableid the table to scan. @param tableAlias the alias of this table

reset the TupleDesc of this tuple (only affecting the TupleDesc)

Unit test for Aggregate.rewind()

Unit test for Filter.rewind()

Unit test for Join.rewind()

rewind this iterator back to the beginning of the tuples

rewind this iterator back to the beginning of the tuples

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

Begin a new index scan with the specified predicate. @param ipred The predicate that is used to scan the index.

Return a representation of this object as an array of integers, for writing to disk. Size of returned array must contain number of integers that co

Write this string to dos. Always writes maxSize + 4 bytes to the passed in dos. First four bytes are string length, next bytes are string, with remain

Return a representation of this object as an array of integers, for writing to disk. Size of returned array must contain number of integers that co

Set the children(child) of this operator. If the operator has only one child, children[0] should be used. If the operator is a join, children[0] and c

Unit test for BTreeRootPtrPage.setHeaderId()

Set the left child id for this entry. Note that updating a BTreeEntry does not actually change the data stored on the page identified by its recordId

Unit test for BTreeLeafPage.setLeftSiblingId()

Unit test for BTreeHeaderPage.setNextPageId()

Unit test for BTreeInternalPage.getParentId()

Unit test for BTreeHeaderPage.setPrevPageId()

Set the right child id for this entry. Note that updating a BTreeEntry does not actually change the data stored on the page identified by its recordI

Unit test for BTreeLeafPage.setRightSiblingId()

Unit test for BTreeRootPtrPage.setRootId()

Set up initial resources for each unit test.