Nils Knappmeier nknapp

First Header	Second Header
Content from cell 1	Content from cell 2
Content in the first column	Content in the `find *

I hereby claim:

To claim this, I am signing this object:

	// Let a,b and c be 3-digit numbers such that every digit 1 to 9
	// occurs exactly once if all number are written in concatenation.
	// For which number is a+b=c true.
	// This is a riddle from a mathematics-book for fourth-graders. It is marked
	// as "difficult, for students that are faster than others".


	var buffer = [0,0,0,0,0,0,0,0,0];

	function add(pos, callback) {

	<!DOCTYPE html>
	<html>
	<head>
	<link rel="stylesheet" href="main.css">
	<meta charset="UTF-8">
	<title>Swagger Petstore</title>
	</head>
	<body>
	<div class="container">
	<h1>Swagger Petstore</h1>

	#!/bin/bash

	echo Killing all containers
	for i in $( docker ps -q ) ; do
	docker kill $i
	done

	echo Removing all containers
	for i in $( docker ps -aq ) ; do
	docker rm $i

	var Handlebars = require('handlebars');
	var LineCounter = require("line-counter");
	var env = Handlebars.create();

	function SourceMapCompiler() {
	}

	SourceMapCompiler.prototype = new Handlebars.JavaScriptCompiler();

	SourceMapCompiler.prototype.appendToBuffer = function (source, location, explicit) {

	var _ = require('lodash')

	function regex (strings, ...args) {
	return new RegExp(String.raw(strings, ...args.map(_.escapeRegExp)))
	}

	var needle = '1*'

	console.log('21111112'.match(regex`2${needle}2`)) // falsy
	console.log('22211222'.match(regex`2(${needle})+2`)) // truthy


	// Precompute the number of matching bits by the xor-result of two bytes
	const matchingBitsFromXor = []
	for (let i = 0; i < 256; i++) {
	matchingBitsFromXor[i] = countMatchingBits(i)
	}

	class PhashBuffer {
	constructor (bytesPerHash, maxSize) {
	this.buffer = Buffer.alloc(bytesPerHash * maxSize)