Closes this iterator. If overridden by a subclass, they should call super.close() in order for Operator's internal state to be consistent.

Unit test for TupleDesc.combine()

Unit test for BufferPool.transactionComplete() assuing commit. Verify that a tuple inserted during a committed transaction is durable

Compare the specified field to the value of this Field. Return semantics are as specified by Field.compare @throws IllegalCastException i

Compare two tuples based on their key field @return -1 if t1 < t2, 1 if t1 > t2, 0 if t1 == t2

Compare two entries based on their key field @return -1 if e1 < e2, 1 if e1 > e2, 0 if e1 == e2

Compare two entries based on their key field @return -1 if e1 > e2, 1 if e1 < e2, 0 if e1 == e2

This is a helper method that computes the cost and cardinality of joining joinToRemove to joinSet (joinSet should contain joinToRemove), given that al

Unit test for Aggregate.getNext() using a count aggregate with string types

Given a matrix of tuples from SystemTestUtil.createRandomHeapFile, create an identical HeapFile table @param tuples Tuples to create a HeapFile from @

Initialize each unit test

Initialize each unit test

Initialize each unit test

Initialize each unit test

Unit test for BTreeInternalPage.deleteEntry()

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

Unit test for BTreeInternalPage.deleteEntry() with false entries

Unit test for HeapPage.deleteTuple() with false tuples

Unit test for BTreeLeafPage.deleteTuple() with false tuples

Method to encapsulate the process of deleting an entry (specifically the key and right child) from a parent node. If the parent becomes empty (no key

Unit test for HeapPage.deleteTuple()

Unit test for BufferPool.deleteTuple()

Unit test for BTreeLeafPage.deleteTuple()

Unit test for BTreeFile.deleteTuple()

Remove the specified tuple from the buffer pool. Will acquire a write lock on the page the tuple is removed from and any other pages that are updated.

Helper method to enumerate all of the subsets of a given size of a specified vector. @param v The vector whose subsets are desired @param

Unit test for Join.getNext() using an = predicate

Unit test for BTreePageId.equals()

Unit test for HeapPageId.equals()

Unit test for RecordId.equals()

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

Return true if the fieldvalue in the supplied predicate is satisfied by this predicate's fieldvalue and operator. @param ipd T

Two RecordId objects are considered equal if they represent the same tuple. @return True if this and o represent the same tuple

Verify that the join cardinalities produced by estimateJoinCardinality() are reasonable

Verify that the estimated join costs from estimateJoinCost() are reasonable we check various order requirements for the output of estimateJoinCost.

Verify the cost estimates of scanning various numbers of pages from a HeapFile This test checks that the estimateScanCost is: +linear in numPages wh

Estimate the selectivity (as a double between 0 and 1) of the specified predicate over the specified string @param op The operation being

Verify that selectivity estimates do something reasonable. Don't bother splitting this into N different functions for each possible Op because we will

Verify the table-cardinality estimates based on a selectivity estimate

Discards a page from the buffer pool. Flushes the page to disk to ensure dirty pages are updated on disk.

Operator.fetchNext implementation. Iterates over tuples from the child operator, projecting out the fields from the tuple @return The next tuple, or

Inserts tuples read from child into the tableId specified by the constructor. It returns a one field tuple containing the number of inserted records.

Returns the next tuple. If there is a group by field, then the first field is the field by which we are grouping, and the second field is the result o

AbstractDbIterator.readNext implementation. Iterates over tuples from the child operator, applying the predicate to them and returning those that pass

Returns the next tuple generated by the join, or null if there are no more tuples. Logically, this is the next tuple in r1 cross r2 that satisfies the

Operator.fetchNext implementation. Returns tuples from the child operator in order @return The next tuple in the ordering, or null if there are no mo

Deletes tuples as they are read from the child operator. Deletes are processed via the buffer pool (which can be accessed via the Database.getBufferPo

@return An iterator which iterates over all the fields of this tuple

Unit test for Predicate.filter()

Unit test for Filter.getNext() using a &lt; predicate that filters everything

Unit test for Filter.getNext() using an = predicate

Unit test for Filter.getNext() using an = predicate passing no tuples

Unit test for Filter.getNext() using a &lt; predicate that filters some tuples

Unit test for JoinPredicate.filter()

Flushes a certain page to disk @param pid an ID indicating the page to flush

@return true if we successfully found the tuple(s)

@return Return the alias of the table this operator scans.

Return a view of this page before it was modified -- used by recovery

Return a view of this page before it was modified -- used by recovery

Return a view of this page before it was modified -- used by recovery

Return a view of this page before it was modified -- used by recovery

Return a view of this page before it was modified -- used by recovery

Unit test for BTreeHeaderPage.getEmptySlot()

@return an Exception instance if one occurred while searching for the tuple(s); null otherwise

@return an Exception instance if one occurred while inserting the tuple; null otherwise

@return an Exception instance if one occurred while inserting the tuple; null otherwise

Unit test for BTreeRootPtrPage.getHeaderId()

Unit test for BTreeFile.getId()

Unit test for BTreeRootPtrPage.getId()

Unit test for BTreeHeaderPage.getId()

Unit test for BTreeInternalPage.getId()

Unit test for HeapFile.getId()

Unit test for HeapPage.getId()

Unit test for BTreeLeafPage.getId()

Unit test for BTreeLeafPage.getLeftSiblingId()