Koitaro

package Slots;

sub import {
    shift;
    my $pkg = caller;
    my $index = -1;
    eval join "\n",
        "package $pkg;",
        "\@${pkg}::ISA = 'Slots';",
        map { $index++; "sub $_ { \$_[0][$index] }" } @_;

Koitaro

class MinHeap
    def initialize (arr = [])
        @arr = arr.dup.sort!
    end
    
    def push(v)
        i = @arr.size
        @arr.push(v)
        upheap(i)
    end

Koitaro

class Primes < Array
    def initialize(n)
        @max = n
        super n+1, false
        self[2] = true
        i = 3
        while i <= n
            self[i] = true
            i += 2
        end

Koitaro

package main

import (
	"fmt"
	"stack"
)

func main() {
	s := stack.New()
	for i := 1; i <= 5; i++ {

Koitaro

package main

import (
	"fmt"
	"io/ioutil"
	"runtime"
	"strings"
	"time"
)

Koitaro

package main

import (
	"fmt"
	"math"
	"runtime"
	"sort"
	"time"
)

Koitaro

package main

import (
	"fmt"
	"runtime"
	"time"
)

func init() {
	runtime.GOMAXPROCS(8)

Koitaro

package main

import (
	"fmt"
	"time"
)

type primeFactors map[int]int

func newPrimeFactors(n int) (answer primeFactors) {

Koitaro

package main

import (
	"fmt"
	"time"
)

func sum(n int) (out chan int) {
	out = make(chan int)
	go func() {

Koitaro

package graph

type Graph map[string]*vertex

func New() Graph {
	return make(Graph)
}

func (g Graph) Vertices() (answer []string) {
	for v := range g {