kimgea

#include "stdafx.h"

#include <list>
#include <bitset>
#include <array>
#include <vector>
using namespace std;

// LOL what where I thinking
// Going to fancy trying to avoid inner loop O(N^2) and even hash function

kimgea

#include "stdafx.h"
#include <string>

class collection {};


template<typename query_set_base_t>
struct query_set_base
{
	query_set_base_t & select(const std::string & q) { return *static_cast<query_set_base_t*>(this); }

kimgea

#include <string>

/*
	Attempt to create dependency injections for easier testing without using dynamic polimorphism

	Implementation is seperated into helper classes from the real usage classes.
	This is to avoid using complex template types or auto to hold the instances

	Updise:
		- No vtables

kimgea

#include <vector>
#include <list>
#include <set>


enum class insert_method_enum{general, push_back, push_front};


// Main template insert helper with its temlate specialications
template<insert_method_enum i>

kimgea

#include <memory>
#include <string>


// Dependency injection for c++


////////////////////////////////////////////////////////
//
//