Skip to content

Instantly share code, notes, and snippets.

@lplume
lplume / sample.js
Created January 24, 2018 10:44
Have a nice time
const str = "Something back";
say(str);
say(back(str));
@lplume
lplume / starred_update.py
Last active April 30, 2018 07:07
Get updates from you starred repos
from sys import argv
from agithub.GitHub import GitHub
# pip install agithub
# argv[1] = github login name
## sample out
# repo: miyakogi/pyppeteer
@lplume
lplume / README
Created May 21, 2018 11:00 — forked from bert/README
Bresenham Algorithms in C
Some possible implementations of the Bresenham Algorithms in C.
The Bresenham line algorithm is an algorithm which determines which points in an
n-dimensional raster should be plotted in order to form a close approximation
to a straight line between two given points.
It is commonly used to draw lines on a computer screen, as it uses only integer
addition, subtraction and bit shifting, all of which are very cheap operations
in standard computer architectures.
It is one of the earliest algorithms developed in the field of computer graphics.
A minor extension to the original algorithm also deals with drawing circles.