maxtruxa

Antonym List

Note: The table headings (positive/negative) are not necessarily meaningful.

Positive	Negative
acquire	release
add	remove (e.g. an item), subtract (arithmetic)
advance	retreat
allocate	deallocate (correct), free (common)
allow	deny

gallais

(*
   We don't really care about the data constructors here
   but they are needed, cf:
   https://sympa.inria.fr/sympa/arc/caml-list/2013-10/msg00190.html
 *)
type zero    = Zero
type 'a succ = Succ

(*
   []   has length 0

chrisdone

module Printf

%default total

-- Formatting AST.
data Format
  = FInt Format
  | FString Format
  | FOther Char Format
  | FEnd

MattIPv4

According to all known laws of aviation, there is no way a bee should be able to fly.
Its wings are too small to get its fat little body off the ground.
The bee, of course, flies anyway because bees don't care what humans think is impossible.
Yellow, black. Yellow, black. Yellow, black. Yellow, black.
Ooh, black and yellow!
Let's shake it up a little.
Barry! Breakfast is ready!
Coming!
Hang on a second.
Hello?

pedrominicz

The originality of these Gists varies drastically. Most are inspired by the work of others, in that case, all merit goes to the original authors. I have linked everything used as reference material on the Gists themselves.

Haskell

• Crégut's strongly reducing Krivine abstract machine
• Type-check STLC into a GADT
• Alex: indentation-sensitive lexer
• A-normalization (administrative normal form, ANF)
• Number of SK-combinator calculus terms of a given size
• Number of untyped lambda calculus terms of a given size

pedrominicz

{-# LANGUAGE UndecidableInstances #-}

module Hylo where

-- An attempt to derive a hylomorphism from the type signature (at the time of
-- writing I don't recall ever seeing the implementation of one).

type Algebra f a = f a -> a

type Coalgebra f a = a -> f a

jemmanuel

This is based on a neat little post that I saw on Simon Frankau‘s blog that I thought I’d provide a few more details on, as well as bringing it to a wider audience. Some higher-level data structures in object-oriented programming languages have dynamic memory allocation. This is used to create objects (usually things that behave like lists) that can grow and shrink as the program executes. When initializing a regular array in C or Java, you have to specify the size of the array on creation, for example with

int myArray[] = new int[10];

quackbarc

\b(?:(?<fizzbuzz>(?:(?:[369]|[258][0369]*[147]|(?:[147]|[258][0369]*[258])(?:[0369]|[147][0369]*[258])*(?:[28]|[147][0369]*[147]))*(?:0|(?:[147]|[258][0369]*[258])(?:[0369]|[147][0369]*[258])*5))+)|(?<buzz>\d*[05])|(?<fizz>(?:[0369]|[258][0369]*[147]|(?:[147]|[258][0369]*[258])(?:[0369]|[147][0369]*[258])*(?:[258]|[147][0369]*[147]))+))\b

insanity, as i'd like to call it. although it isn't fizzbuzz per se, it's the best you can get with regex. here's a regexr link to it with sample text.

this matches a number (within word boundaries) if it falls under any of the three groups:

• fizzbuzz, which picks up numbers divisible by both 3 and 5, i.e. 15;
• buzz, which picks up numbers divisible by 5; and
• fizz, which picks up numbers divisible by 3.

darvil82

class BritishNaming(type):
	def __new__(mcs, *args):
		cls = super().__new__(mcs, *args)
		cls.__init__ = cls.__innit__
		return cls
				
				
class MyBritishClass(metaclass=BritishNaming):
	def __innit__(self):
		print("I am british now ig")

FreyaHolmer

///////////////////////////////////////////////////////////////////////////////
// ABOUT:        A unity Shader .cginc to draw numbers in the fragment shader
// AUTHOR:       Freya Holmér
// LICENSE:      Use for whatever, commercial or otherwise!
//               Don't hold me liable for issues though
//               But pls credit me if it works super well <3
// LIMITATIONS:  There's some precision loss beyond 3 decimal places
// CONTRIBUTORS: yes please! if you know a more precise way to get
//               decimal digits then pls lemme know!
//               GetDecimalSymbolAt() could use some more love/precision