baweaver

def destructure(method_name)
  # Intercept the original class
  meta_klass = class << self; self end

  # Save the original method as a proc
  method_proc = method(method_name)

  # We only want to do this for keyword argument type
  # methods
  unless method_proc.parameters.all? { |t, _| t == :key }

xsot

Usage

sed -E -f solver.sed input where input is a file containing the maze.

For best results, resize your terminal to match the height of the maze. To disable animations, delete the lines containing p.

Maze format

The solver assumes the following:

• The maze only contains the characters # \nSE
• Every line has the same number of characters
• There is only one start (S) and end (E)

solnic

Calculating -------------------------------------
     type-safe users   273.000  i/100ms
      ar user models   257.000  i/100ms
-------------------------------------------------
     type-safe users      2.813k (± 1.7%) i/s -     14.196k
      ar user models      2.574k (±10.7%) i/s -     12.850k

Comparison:
     type-safe users:     2812.7 i/s
      ar user models:     2574.2 i/s - 1.09x slower

Wunkolo

#include <math.h>
#include <algorithm>
#include <string>
#include <immintrin.h>
using namespace std;typedef float R;
#define _W 79
#define _H 39
#define EP 0.01f
#define OP operator
#define C const

barneycarroll

var animating = false;

// Define an animator consisting of optional incoming and outgoing animations. 
// alwaysAnimate is false unless specified as true: false means an incoming animation will only trigger if an outgoing animation is also in progress.
// forcing dontClone to true means the outward animation will use the original element rather than a clone. This could improve performance by recycling elements, but can lead to trouble: clones have the advantage of being stripped of all event listeners.
function animator( incoming, outgoing, alwaysAnimate, dontClone ){
	// The resulting animator can be applied to any number of components
	return function animate( x, y, z ){
		var config;
		var parent;

kachayev

Channels Are Not Enough

... or Why Pipelining Is Not That Easy

Golang Concurrency Patterns for brave and smart.

By @kachayev

Intro

Integralist

hash = { 'foo' => 'bar' }

# Version 1
hash = Hash[hash.map { |k, v| [k.to_sym, v] }]

# Version 2
hash = hash.reduce({}) do |memo, (k, v)| 
  memo.tap { |m| m[k.to_sym] = v }
end

lelandbatey

Description

This simple script will take a picture of a whiteboard and use parts of the ImageMagick library with sane defaults to clean it up tremendously.

The script is here:

#!/bin/bash
convert "$1" -morphology Convolve DoG:15,100,0 -negate -normalize -blur 0x1 -channel RBG -level 60%,91%,0.1 "$2"

Results

lilianchisca

<div itemprop="image" data-picture="lazy" data-alt="Don't forget to change the alt text!">
    <div data-src="assets/images/example-s"></div>
    <div data-src="assets/images/example-m" data-media="(min-width: 700px)"></div>
    <div data-src="assets/images/example-l" data-media="(min-width: 1200px)"></div>

    <noscript>
        <img src="assets/images/example-s.jpg" alt="Don't forget to change the alt text!">
    </noscript>
</div>

datagrok

Ideas for improvements to git log --graph

I will maybe someday get around to dusting off my C and making these changes myself unless someone else does it first.

Make the graph for --topo-order less wiggly

Imagine a long-running development branch periodically merges from master. The git log --graph --all --topo-order is not as simple as it could be, as of git version 1.7.10.4.

It doesn't seem like a big deal in this example, but when you're trying to follow the history trails in ASCII and you've got several different branches displayed at once, it gets difficult quickly.