Mark-Marks

type Array<T> = { T }
type Map<K, V> = { [K]: V }
type Graph<T> = Map<T, Array<T>>
-- Based on Kahn's algorithm
local function toposort<T>(graph: Graph<T>): Array<T>
    local in_degree: Map<T, number> = {}
    for node, neighbors in graph do
        in_degree[node] = 0

        for _, neighbor in neighbors do

Mark-Marks

local palette = {
	base = "#1a1a22",
	surface = "#1F1F28",
	overlay = "#2A2A37",
	muted = "#707b77",
	subtle = "#707b77",
	text = "#d7d6c6",
	red = "#a9471a",
	yellow = "#d3b04f",
	cyan = "#a2d0d2",

Mark-Marks

{
  "$schema": "http://json-schema.org/draft-04/schema#",
  "required": ["name", "version", "target"],
  "type": "object",
  "additionalProperties": false,
  "properties": {
    "name": {
      "type": "string",
      "pattern": "[a-zA-Z0-9_]+\\/[a-zA-Z0-9_]+",
      "title": "The name of the package.",

Mark-Marks

export type Singleton = {
	start: (() -> ())?,

	[string]: any,
}

local Framework = {}
Framework.modules = {} :: { ModuleScript }
Framework.started = false