msmoiz

#pragma once

#include "CoreMinimal.h"
#include "UObject/Interface.h"
#include "InterfaceDemo.generated.h"

UINTERFACE()
class UBaseInterface : public UInterface
{
	GENERATED_BODY()

msmoiz

#include <iostream>

#define GOODBYE std::cout << "Goodbye World!" << std::endl;

int main()
{
    std::cout << "Hello World!" << std::endl;
    GOODBYE;
#ifdef KIDDING
    std::cout << "Just kidding!" << std::endl;

msmoiz

#include "static.h"
#include "shared.h"
#include <iostream>

void local_hello()
{
    std::cout << "Hello local world!" << std::endl;
}

int main()

msmoiz

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

int main()
{
	Stack<std::string> notes;
	notes.push("Hey");
	notes.push("what's");
	notes.push("up.");

msmoiz

#include <iostream>
#include <string>

#include "queue.h"

int main()
{
	Queue<std::string> orders;
	orders.enqueue("burger");
	orders.enqueue("fries");

msmoiz

#include <iostream>
#include "unionfind.h"

int main(int argc, const char* argv[])
{
	int node_count;
	std::cin >> node_count;

	std::cout << "Size: " << node_count << std::endl;

msmoiz

template<typename T>
void exchange(Vector<T>& list, int i, int j)
{
	T temp = list[i];
	list[i] = list[j];
	list[j] = temp;
}

/**
 * In a typical selection sort (a simple, but inefficient

msmoiz

#include <vector>

template<typename T>
void exchange(vector<T>& list, int i, int j)
{
	T temp = list[i];
	list[i] = list[j];
	list[j] = temp;
}

msmoiz

template<typename T>
void exchange(vector<T>& list, int i, int j)
{
	T temp = list[i];
	list[i] = list[j];
	list[j] = temp;
}

/**
 * Part of the drawback of the insertion sort

msmoiz

#include <vector>

template<typename T>
void exchange(vector<T>& list, int i, int j)
{
	T temp = list[i];
	list[i] = list[j];
	list[j] = temp;
}