konn

var app = Application("Adobe Acrobat Pro")
	doc = app.documents[0];
app.includeStandardAdditions = true;

app.pdfWindows[0].pages().reverse().forEach(function(page){
	var n = page.pageNumber();
	doc.insertPages({after: n,
					 from: doc,
					 startingWith: n,
					 numberOfPages: 1});

konn

autoload -Uz add-zsh-hook;

unset __WINDOWLOC;
unset __PREVSETID;

function set_bg () {
  osascript -e "tell app \"Terminal\" to set the current settings of the tab ${__WINDOWLOC[1]} of window id ${__WINDOWLOC[2]} to settings set \"$1\""
}

function ssh-mosh-observe() {

konn

autoload -Uz add-zsh-hook;

unset __WINDOWLOC;
unset __PREVSETID;

function set_bg () {
  osascript -e "tell app \"Terminal\" to set the current settings of the tab ${__WINDOWLOC[1]} of window id ${__WINDOWLOC[2]} to settings set \"$1\""
}

function ssh-mosh-observe() {

konn

{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE DataKinds, GADTs, PolyKinds, TypeFamilies, TypeOperators #-}
module Main where
import GHC.TypeLits

type family Div2 (n :: Nat) where
  Div2 0 = 0
  Div2 1 = 0
  Div2 n = Div2 (n - 2) + 1

konn

var app = Application("Adobe InDesign CS5"),
    doc = app.activeDocument,
    style = doc.styles;

doc.hyperlinks()
   .forEach(function(ref){
   		try {
   			if (dest = ref.destination.destinationURL()) {
				var comp   = dest.match(/\/RubyText:(.+?)$/i)
					horz   = dest.match(/\/horzInVert:$/i)

konn

$(document).ready (function(){
    var redacted = $(".redacted");
    var text = JSON.parse(redacted.attr("data-model"))['text'];
    $(".redacted .btn").remove();
    $(".redacted .fs-tweet-text").text(text);
    redacted.removeClass("redacted");
});

konn

{-# LANGUAGE OverloadedStrings, QuasiQuotes #-}
module Main where
import PrintfRevised
  -- ^ Printf core
import PrintfQQ
  -- ^ QuasiQuotes

main :: IO ()
main = do
  let x = 42

konn

Require Import ssreflect ssrbool eqtype ssrnat div prime.

Set Implicit Arguments.
Unset Strict Implicit.
Unset Printing Implicit Defensive.

Theorem wf_ltn : well_founded (fun (x y : nat) => x < y).
Proof.
  move => x.
  move : {2}x (leqnn x) => n.

konn

import algebra.order
import standard
import logic
open algebra bool eq.ops

structure poset [class] (A: Type) extends has_le A :=
  (le_refl : ∀a, le a a)
  (le_trans : ∀a b c, le a b → le b c → le a c)

definition weak_order.to_poset [instance] [coercion] [reducible]

konn

String.prototype.tr = function (from, to) {
    var str = this;
    for (i in [...Array(Math.min(from.length, to.length))]) {
	str = str.replace(new RegExp(from[i], "g"), to[i]);
    }
    return str;
}
 
function kanjify(str) {
    return str.tr("0123456789", "〇一二三四五六七八九");