#include "DBEngine.h"

using namespace std;

DBEngine::DBEngine(){
	//
}

//create a new table in memory
void DBEngine::createCmd(){
	//
}
	
//open a txt file, parse SQL script, load data in table
//void DBEngine::openCmd(){
	//
//}

//should write cmdList to a .txt file
void DBEngine::saveCmd(){
	//
}

//display the database
void DBEngine::showCmd(){
	//
}

//add a tuple to a table in the memory
void DBEngine::insertQuery(){
	//
}

//remove a tuple from a table in the memory
void DBEngine::deleteQuery(){
	//
}

//search and return one more tuples from a table in the memory
void DBEngine::selectQuery(){
	//
}

//return a subset of attributes (columns)
/*
vector<string> DBEngine::projectQuery(Relation table, string query){
	
	/*
		So basically this is what's going on:
		- Take the table to iterate through, this is the relation (input 1)
		- Take a string that will be used for the program to search for in the attributes (input 2)
		- Iterate through each attribute until the attribute (string) matches the input query
		- For every iterator, have a counter that counts how many attributes are skipped over in the vector until the attribute is found
		- This counter will be used to iterate through each vector (row) in the list, skip over that many attributes, and push that into a result vector
		- Once all vector's elements at the specified attribute are pushed back, return the result vector
	
	
	for(int i = 0; i < table.getSize(); i++) {
		
		
	}
	
}
*/
//each row in the first table is paired with all the rows in the second table
void DBEngine::productQuery(){
	//
}

//true if relations have the same # of attributes and each attribute must be from the same domain
bool DBEngine::unionComp(){
	return false;
}