MaxwellBo

# |<--- ^    <emoji>? <type>: <subject>    ^ --->|

# |<--- v          Explain why this change is being made         v --->|


# |<--- v   Provide links to tickets, issues or other resources  v --->|


# --- COMMIT END ---

dannguyen

### sqlmd
# Bash function  for outputting SQLite results in Markdown-friendly table

### Dependency:
# csvlook can be found here: http://csvkit.readthedocs.io/en/540/scripts/csvlook.html

### USAGE
# $ sqlmd "SELECT name, age FROM people;" optional_db_name_argument.sqlite

### OUTPUT

matthieubulte

(* Good morning everyone, I'm currently learning ocaml for one of my CS class and needed to implement
   an avl tree using ocaml. I thought that it would be interesting to go a step further and try
   to verify the balance property of the avl tree using the type system. Here's the resulting code
   annotated for people new to the ideas of type level programming :)
*)

(* the property we are going to try to verify is that at each node of our tree, the height difference between
   the left and the right sub-trees is at most of 1. *)

lewisjb

/*
 * min.js
 *
 * By lewisjb - 19/1/17
 *
 * github/lewisjb
 * lewisjb.com
 *
 * ----------------------------------------------------------------------------
 * This is meant to be a minimal MVVM written in JS.

hediet

type StringBool = "true"|"false";


interface AnyNumber { prev?: any, isZero: StringBool };
interface PositiveNumber { prev: any, isZero: "false" };

type IsZero<TNumber extends AnyNumber> = TNumber["isZero"];
type Next<TNumber extends AnyNumber> = { prev: TNumber, isZero: "false" };
type Prev<TNumber extends PositiveNumber> = TNumber["prev"];

joyrexus

collapsible markdown?

CLICK ME

yes, even hidden code blocks!

print("hello world!")

sir-wabbit

sealed trait Decidable[+Proof]
final case class Yes[Proof](proof: Proof) extends Decidable[Proof]
final case object No extends Decidable[Nothing]

sealed trait List[+A] {
  def nonEmpty: Decidable[this.type <:< ::[A]]
  def ::[AA >: A](value: AA): ::[AA] = new ::[AA](value, this)
}
final case object Nil extends List[Nothing] {
  def nonEmpty: Decidable[this.type <:< ::[Nothing]] = No

Tandrial

/*
 * Copyright (c) 2019 Michael Krane
 * 
 * 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:

rosskevin

/* variation on https://medium.com/@DanHomola/react-higher-order-components-in-typescript-made-simple-6f9b55691af1 */
import * as React from 'react'
import { wrapDisplayName } from 'recompose'

// Props you want the resulting component to take (besides the props of the wrapped component)
interface ExternalProps {}

// Props the HOC adds to the wrapped component
export interface InjectedProps {}

gatlin

{-|
 - Example of using free constructions to build a flexible little compiler.
 -
 - The goal here is not necessarily efficiency but readability and flexibility.
 -
 - The language grammar is represented by an ADT; however, instead of
 - recursively referring to itself it instead references a type variable.
 -
 - We derive instances of 'Functor' and 'Traversable' for this type.
 -