cagedmantis

package main

import (
	"bufio"
	"bytes"
	"io"
	"strings"

	"golang.org/x/term"
)

cagedmantis

d = {"foo":[]}

for num in range(10):
    for key, value in d.iteritems():
        value.append(num)

        
d["foo"].append(23)        
        

cagedmantis

Keybase proof

I hereby claim:

• I am cagedmantis on github.
• I am exobit (https://keybase.io/exobit) on keybase.
• I have a public key ASCvnbYMHagFsMnkfQzBszdtii5LJDnjzBh6ZE-nCmsY9Ao

To claim this, I am signing this object:

cagedmantis

package main

import (
	"fmt"
	"log"
	"net/http"
)

// web provides an interface for the setting and getting of
// keys via http endpoints.

cagedmantis

resource "null_resource" "init_serf" {
  count = "${var.num_nodes}"

  depends_on = [ "digitalocean_droplet.serf" ]

  provisioner "remote-exec" {
	connection {
	  user = "root"
	}

cagedmantis

struct foo
{
    int moo;
    char c[];
};

struct bar
{
    int moo;

cagedmantis

/**
 * @author Carlos Amedee <carlos.amedee@gmail.com>
 * 
 * @brief  
 * 
 * 
 */

#include <iostream>
#include <algorithm>

cagedmantis

#!/usr/bin/env python
# -*- mode: python; tab-width: 4 -*-
# -*- coding: utf-8 -*-
#

import random

for x in range(100):
    giants = []
    while len(giants) < 10:

cagedmantis

public interface Calculator {
	int calculate(int valueA, int valueB);
}

public class Subtract implements Calculator {
	public int calculate(int valueA, int valueB) {
		return valueA - valueB;
	}

cagedmantis

# Description: Tic Tac Toe game implementation written in Ruby.
# The minmax algorithm is used to provide the AI.

class State
  def initialize
    @board = [[0,0,0],[0,0,0],[0,0,0]]
  end
    
  def is_empty(row, column)
    if (@board[row][column] == 0)