stavros vagionitis svagionitis

Hey everyone - this is not just a one off thing, there are likely to be many other modules in your dependency trees that are now a burden to their authors. I didn't create this code for altruistic motivations, I created it for fun. I was learning, and learning is fun. I gave it away because it was easy to do so, and because sharing helps learning too. I think most of the small modules on npm were created for reasons like this. However, that was a long time ago. I've since moved on from this module and moved on from that thing too and in the process of moving on from that as well. I've written way better modules than this, the internet just hasn't fully caught up.

@broros

otherwise why would he hand over a popular package to a stranger?

If it's not fun anymore, you get literally nothing from maintaining a popular package.

One time, I was working as a dishwasher in a restu

High-Performance Matrix Multiplication

This is a short post that explains how to write a high-performance matrix multiplication program on modern processors. In this tutorial I will use a single core of the Skylake-client CPU with AVX2, but the principles in this post also apply to other processors with different instruction sets (such as AVX512).

Intro

Matrix multiplication is a mathematical operation that defines the product of

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)

	# -- coding: utf-8 --

	'''The Pelco-D Protocol

	Standard Number TF-0002
	Version 2 Revision 1 Release Date August 15, 2003

	Transmitters will format a single character and receivers will be able to
	decipher a single character as: 1 start bit, 8 data bits, 1 stop bit,
	and no parity.

	#include <stdio.h>

	#define SQ(x) (x)*(x)

	#define M0(x,y) SQ(x)+SQ(y)<4?0:0xe0
	#define M1(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M0(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0)):0xc0
	#define M2(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M1(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0xa0
	#define M3(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M2(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x80
	#define M4(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M3(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x60
	#define M5(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M4(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x40

	#!/bin/bash

	if [ -z "$1" ]; then
	echo "waiting for the following arguments: username + max-page-number"
	exit 1
	else
	name=$1
	fi

	if [ -z "$2" ]; then

	//
	// Author: Jonathan Blow
	// Version: 1
	// Date: 31 August, 2018
	//
	// This code is released under the MIT license, which you can find at
	//
	// https://opensource.org/licenses/MIT
	//
	//

	# source:http://geocities.com/SiliconValley/heights/7052/opcode.txt
	From: mark@omnifest.uwm.edu (Mark Hopkins)
	Newsgroups: alt.lang.asm
	Subject: A Summary of the 80486 Opcodes and Instructions

	(1) The 80x86 is an Octal Machine
	This is a follow-up and revision of an article posted in alt.lang.asm on
	7-5-92 concerning the 80x86 instruction encoding.

	The only proper way to understand 80x86 coding is to realize that ALL 80x86

	'''
	Example of web scraping using Python and BeautifulSoup.

	Sraping ESPN College Football data
	http://www.espn.com/college-sports/football/recruiting/databaseresults/_/sportid/24/class/2006/sort/school/starsfilter/GT/ratingfilter/GT/statuscommit/Commitments/statusuncommit/Uncommited

	The script will loop through a defined number of pages to extract footballer data.
	'''

	from bs4 import BeautifulSoup


	#include <math_constants>

	image Input = file("maze.png");

	glsl vec4 initialState(vec2 pos) {
	vec4 input = texture(Input, pos);
	vec4 color = vec4(0.0, 0.0, 0.0, 1.0);
	// Detect starting point
	if (input.g > 0.5 && input.r + input.b < 1.0)