tim-peters

#!/bin/bash

HOSTNAME=[url]
DYNDNSUSER=[email]
DYNDNSPW=[SpDyn token]
DYNDNSURL=https://update.spdyn.de/nic/update

CURRENT_IP6=$(ip address show dev wlan0 | grep ff:fe | grep -v fe80: | awk '{print $2}' | sed 's/^\([0-9a-f:]*\).*/\1/g')
DNS_IP6=$(host -t AAAA ${HOSTNAME} | tr " " "\n" | grep ff:fe)

tim-peters

# Depends on
# * Python
# * Pillow (https://pypi.python.org/pypi/Pillow/3.4.2#downloads)
#
# Execute with
# http://superuser.com/questions/276154/automating-the-scanning-of-graphics-files-for-corruption
#
# Source
# http://superuser.com/questions/276154/automating-the-scanning-of-graphics-files-for-corruption
# --------------------

tim-peters

Keybase proof

I hereby claim:

• I am tim-peters on github.
• I am tipe (https://keybase.io/tipe) on keybase.
• I have a public key whose fingerprint is 5BE9 C46D EE41 3015 DE57 8233 98AB F7A5 161C FAEF

To claim this, I am signing this object:

tim-peters

/*
 * Processing 2.0 File
 * Author: Tim J. Peters <tim-peters>
 * Released under CC BY 3.0
 */
 
int dotSize = 100; // scale
int gridSize = 10; // size of the map (grid)

int[] waysToKnot;

tim-peters

/*
 * Processing 2.0 File
 * Author: Tim J. Peters <tim-peters>
 * Released under CC BY 3.0
 */
 
int dotSize = 100; // scale
int gridSize = 10; // size of the map (grid)

int[] waysToKnot;

tim-peters

int width = 12; // Set amount of rectangles in a row
int height = 12; // Set amount of rectangles column
int outer_size = 70; // Set size of the (outer) rectangles
int inner_size = 100; // Set size of the rectangles/circles inside (must be smaller than outer_size!!!)
int marginX = 30; // Set margin between (outer) rectangles in a row (if you like)
int marginY = 30; // Set margin between (outer) rectangles in a column (if you like)
float animation_offset = -.48; // Set offset between rectangles anmiation

////////////////////////////////////

tim-peters

// List prime numbers with processing 2
// Simplified
// By: TiPE

int[] zahlen = new int[101]; // create an array width 101 "parts" called zahlen
int anzahl = 0; // create an int for counting the primes


for(int x=1;x<=100;x++) // count from 1 to 100...
{