Annoyance, money loss, on AWS, missing out on customers, data loss, damages, lawsuites
Horizontal axis: Amount of tests.
git ls-files | sed 's/.*\.//' | sort | uniq -c | sort -u |
import string,cgi,time, datetime | |
from BaseHTTPServer import BaseHTTPRequestHandler, HTTPServer | |
class MyHandler(BaseHTTPRequestHandler): | |
def do_GET(self): | |
try: | |
self.send_response(503) # let bots know whats up | |
self.send_header('Content-type','text/html') | |
self.end_headers() | |
self.wfile.write('<!DOCTYPE html>\n<meta charset=utf-8 />\n<title>Notification page</title>\n') |
use std::iter::Peekable; | |
fn take_when_3(peeky: &mut Peekable<impl Iterator<Item = u8>>) -> Option<u8> { | |
if let Some(3) = peeky.peek() { | |
peeky.next() | |
} else { | |
None | |
} | |
} |
<?php | |
/* | |
I wanted to know if it pays off to refactor some recursive code, and | |
if or not PHP does tail call optimization and i found this post: | |
http://commonphp.blogspot.com/2010/12/tail-call-optimization-in-php-53.html | |
A good place to check how much faster an itarative solution would be. | |
I started with executing the functions. | |
Result: PHP does not do TCO. | |
*/ |
#!/bin/bash | |
MAIN=${1:-development} | |
BRANCHES=$(git branch --merged $MAIN | grep -v -e 'master\|staging\|development\|\*') | |
echo Branches merged into $MAIN: | |
echo $BRANCHES | |
read -p "Delete these branches (y/n)? " answer |
sport | |
prost | |
Bier-Tanke Antik-Rebe Eiter-Bank KI-beraten Bi-Raketen Bakterien Benkert-AI |