Skip to content

Instantly share code, notes, and snippets.

View agrif's full-sized avatar

agrif agrif

View GitHub Profile
[
{
"index": 1,
"fade-flags": 0,
"looping": 1,
"global-volume": 155,
"u0": 0,
"u1": 0,
"sounds": [
{
{
"left": 124,
"top": 69,
"right": 608,
"bottom": 392,
"effect-speed": 15,
"u0": 163,
"u1": 0,
"u2": 4,
"u3": 0,
This file has been truncated, but you can view the full file.
{
"left": 124,
"top": 69,
"right": 608,
"bottom": 392,
"effect-speed": 15,
"u0": 163,
"u1": 0,
"u2": 4,
"u3": 0,
[
815,
4378,
30042,
4850,
29790,
29235,
5078,
5667,
5202,
[
{
"index": 1,
"movie-id": 123,
"code": 1,
"left": 60,
"top": 0,
"u0": [
0,
0,
[
{
"index": 1,
"sfxe-id": 77,
"u0": 0
},
{
"index": 2,
"sfxe-id": 78,
"u0": 0
[
{
"blst-id": 52,
"name-rec": 15,
"left": 0,
"top": 0,
"right": 608,
"bottom": 392,
"u0": 0,
"mouse-cursor": 3007,
import numpy
import itertools
class BinFunc:
"""Binary functions, represented as a truth table. This lets us
compare binary functions, and build sets of binary functions. Normal
Python functions don't let us do that.
"""
def __init__(self, table):
zero_ref_mut!(FOO, u32);
fn main() {
let mut val: u32 = 2;
// initialize static FOO
// fzero acts like a MutexHandle
// while it's in scope, FOO is used to store &mut val
let mut fzero = FOO.claim(&mut val).unwrap();
#![no_std]
#![no_main]
#![feature(never_type)]
#![feature(unwrap_infallible)]
#![feature(arbitrary_self_types)]
#![feature(alloc_error_handler)]
// unfortunately new asm doesn't let you set stack pointer...
#![feature(llvm_asm)]
#[macro_use]