This is a game I was taught by some friends in Sweden, they called it Kabul, but I think it might have another name as Googling for it returned no similar results. I decided to write down the rules as it's actually a pretty great game!
| #!/bin/python3 | |
| import curses | |
| import sys | |
| import os | |
| from math import floor | |
| decks = 6 | |
| bet_unit = 10 | |
| def main(win, decks): |
| SEEDPERSON=$1 | |
| rm output.csv | |
| urls=$(curl -s "$SEEDPERSON" | grep /person/ | grep -v Sammanf | grep grannHeader | sed -r 's/.*href=(.*)>/\1/g' | sed 's/>.*$//' | sed 's/^\//https:\/\/mrkoll.se\//') | |
| #echo "Url, First Name, Last Name, Address, Appt. No., Postcode, DoB, Gender, Res. Since, Phone" >> output.csv | |
| for url in $urls | |
| do | |
| echo -n "$url," >> output.csv | |
| curl -s "$url" | grep -E '(tel:|block_col1)' -A 47 | grep span | sed '/tel:/q' | sed -E 's/<div class=history_span/\n<div class=history_span/' | grep -vE '(history_span|f_head1|förnamn|f_line1|mellannamn)' | sed 's/<[^>]*>//g' | sed -E 's/ lgh ([0-9]{4})/\nlgh \1\n/' | sed s/-XXXX// | sed -r '/^\s*$/d' | sed 's/^herre/M/'| sed 's/^tjej/F/' | sed 's/^dam/F/' | sed 's/^kvinna/F/' | sed 's/^man/M/' | sed '6,7d;' | dos2unix | paste -s -d ',' >> output.csv |
| import { deepEqual } from 'assert' | |
| type RecursiveFn<T> = (xs: T[], out?: T[]) => T[] | |
| type OperatorFn<T> = (T: T, xs: T[], out: T[]) => T | void | |
| type FactoryFn = <T>(fn: OperatorFn<T>) => RecursiveFn<T> | |
| const recursiveFactory: FactoryFn = <T>(fn: OperatorFn<T>) => { | |
| const recursive: RecursiveFn<T> = (xs, out = []) => { | |
| const x = xs.shift() |
| import { Document, Element, parseXml } from 'libxmljs'; | |
| import { VError } from 'verror'; | |
| export class XMLReader { | |
| private document: Document; | |
| private namespaces: Record<string, string>; | |
| constructor(inputXml: string) { | |
| try { | |
| this.document = parseXml(inputXml); |
| // Avoid generating expected results as they are not testing your logic independently | |
| describe('1+1=2 testing antipattern', () => { | |
| describe('add', () => { | |
| const add = (a: number, b: number): number => a + b; | |
| const expected = 1 + 1; | |
| it('should add two numbers', () => { | |
| // This is testing two sets of logic, and doesnt guarantee the correctness of the function | |
| // as the output of expected could also be wrong | |
| expect(add(1, 1)).toEqual(expected); |
| + '[' -z /bin/bash ']' | |
| ++ basename /bin/bash | |
| + shell=bash | |
| + case "$shell" in | |
| + shopt -s extglob | |
| + NODEDIST=https://nodejs.org/dist | |
| + NAVE_CACHE_DUR=86400 | |
| ++ curl --version | |
| ++ head -n1 | |
| + NAVEUA='nave/curl 7.64.1 (x86_64-pc-linux-gnu) libcurl/7.64.1 OpenSSL/1.1.1b zlib/1.2.11 libidn2/2.1.1 libpsl/0.20.2 (+libidn2/2.1.1) libssh2/1.8.1 nghttp2/1.36.0' |
I hereby claim:
To claim this, I am signing this object:
| module.exports = function findCodingRange (codingSeq, contig, reverse) { | |
| let codingLength = codingSeq.length | |
| , start = 0 | |
| , end = 0 | |
| , selector = 12 | |
| , fail = false | |
| start = contig.indexOf(codingSeq.substring(0, selector)) | |
| end = contig.indexOf(codingSeq.substring(codingLength - selector, codingLength)) + selector |
I've always had fzf and ripgrep on my radar, and I've finally gotten around to using them together. Good lord it makes a world of difference, especially when added to Vim as well as Bash.
Add the following snippet to your ~/.bashrc, this add's fzf keybindings to bash and gets fzf to use ripgrep by default for faster searching.
[ -f ~/.fzf.bash ] && source ~/.fzf.bash
export FZF_DEFAULT_COMMAND='rg --files --no-ignore --hidden --follow --glob "!.git/*"'
bind -x '"\C-p": vim $(fzf);'
Okay now what can you do?