Nils Knappmeier nknapp

## a+b=c
// 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) {

## index.html
<!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>

## package.json
{
"name":"test",
"version":"3.14.15"
}

## Dockerfile
FROM traefik:camembert
ADD traefik.toml .
EXPOSE 80
EXPOSE 8080
EXPOSE 443

## wipe-docker.sh
#!/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

## example.js
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) {

## regex-template-literal.js
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('2221*1*222'.match(regex`2(${needle})+2`)) // truthy

## pipe-in-table.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                nknapp
                / pipe-in-table.md
            
            
              Created
              March 22, 2017 21:49
            
          
First Header
Second Header


Content from cell 1
Content from cell 2


Content in the first column
Content in the `find *


## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                nknapp
                / keybase.md
            
            
              Created
              May 24, 2017 21:19
            
              
                keybase.md
              
          
    Keybase proof

I hereby claim:

I am nknapp on github.
I am nknapp (https://keybase.io/nknapp) on keybase.
I have a public key ASBc1DN469TlP5kG_R1r8OKyyQxfxvztA9b1dkpyd8zywQo

To claim this, I am signing this object:

  
## phashBuffer.js

// 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)
	// 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>
	FROM traefik:camembert
	ADD traefik.toml .
	EXPOSE 80
	EXPOSE 8080
	EXPOSE 443
	#!/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
First Header	Second Header
Content from cell 1	Content from cell 2
Content in the first column	Content in the `find *

	// 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)