magicoal-nerb

using System;
using System.Collections.Generic;

public class JsonVariant {
	// Referent
	public JsonObject referent = null;

	// Floating point number
	public float number;

magicoal-nerb

using System;
using System.Collections.Generic;

// Xml element
public class XmlElement {
	// Current XML tag
	public string tag;
	
	// Current XML body
	public string body;

magicoal-nerb

--!strict

-- Animate.lua
-- magicoal_nerb/poopbarrel :3

local AnimateScriptKeymap: {[string]: string} = {
	Climbing = "climb",
	Freefall = "fall",
	Running = "run",
	Jumping = "jump",

magicoal-nerb

--!strict
local Queue = require("./Queue")

local Octree = {}
Octree.__index = Octree

export type OctreeNode = {
	-- nodes expect 8 children if childIndex != 0
	min: vector,
	max: vector,

magicoal-nerb

--!strict

-- Buffer
-- magicoal_nerb :P

local Buffer = {}
Buffer.__index = Buffer

export type Buffer = typeof(setmetatable({} :: {
	data: buffer,

magicoal-nerb

--!strict

-- BK trees are used for fast string lookup queries
-- And yea u have to use levenshtein

-- Basically, I just knocked down a few constants
-- so it is marginally faster than most implementations.
-- But, asymptotic performance is basically the same so yeah

-- https://gist.github.com/magicoal-nerb/6c91120e671d557de59e6d87e6617868

magicoal-nerb

--!strict

-- yet another queue implementation :P
-- magicoal_nerb

local Queue = {}
Queue.__index = Queue

export type Queue<T> = typeof(setmetatable({} :: {
	data: { T },

magicoal-nerb

--!strict

local Set = {}
Set.__index = Set

export type Set<T> = typeof(setmetatable({} :: {
	data: { [T]: boolean },
}, Set))

function Set.new()

magicoal-nerb

--!strict

-- yet another bvh implementation :P
-- magicoal_nerb

local Queue = require("./Queue")

local Bvh = {}
Bvh.__index = Bvh

magicoal-nerb

--!strict

-- PriorityQueue.lua
-- me when the queue is my priority
-- also made with lectures from mit ocw
-- magicoal_nerb/poopbarrel

local PriorityQueue = {}
PriorityQueue.__index = PriorityQueue