RichardB01

#include <gtk/gtk.h>

/*
 * Iterates a directory and all of its subdirectories to produce a list of the 
 * paths of the files inside of them.
 */
GQueue* list_directory(GString* dir_path) {
    GQueue* unchecked_queue;
    GQueue* checked_queue;
    

RichardB01

#include <string>
using namespace std;

/**
 *      Replaces every occurance of repchar with newchar in the str
 * and returns a copied value.
 * @param[in] str The string who's characters are being replaced.
 * @param[in] repchar The character to replace.
 * @param[in] newchar The character to replace with.
 * @param[out] The copied string with replaced characters.

RichardB01

#include <deque>
#include <string>
using namespace std;

/**
 *      Split a string into a sequence of substrings according to
 * a deliminator.
 * @param[in] str The string to split.
 * @param[in] delim The deliminator of substrings.
 * @param[out] The sequence of split strings.

RichardB01

#include <iostream>


class Mammal
{
public:
    Mammal();
    ~Mammal();
};

RichardB01

Ring = {}
Ring._registeredFunctions = {}
Ring._currentTestFunctionPtr = nil
Ring._tests = {}

function Ring.RegisterTest(func)
	table.insert(Ring._registeredFunctions, func)
end

function Ring.Assert(op, msg)

RichardB01

struct Cluster
{
	Vector2 m_meanPosition;
	std::vector<Vector2> m_points;
	Color m_colour;
};

void InitializeClusters(std::vector<Vector2>& dataPoints, std::vector<Cluster>& clusters)

RichardB01

static int64_t Pack(int32_t inX, int32_t inY)
{
    int64_t x = static_cast<int64_t>(inX) << 32;
    int64_t y = static_cast<int64_t>(inY);

    // twos complement, therefore 32 msbs must be cleared.
    if (inY < 0)
    {
        y = y ^ 0xFFFFFFFF00000000;
    }

RichardB01

/*
 Macros
 */
#define DEBUG(x) printf("%s\r\n", x)
#define THREADING_ENABLED false

/*
 Constant
 */

RichardB01

/*
The MIT License (MIT)

Copyright (c) 2020 Richard Bamford

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WIT

RichardB01

/*
 The MIT License (MIT)

 Copyright (c) 2020 Richard Bamford

 Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

 The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTIO