honno

#!/usr/bin/env python2

from collections import deque
from itertools import permutations

def gen_permutations(numbers, slice_by):
    subsequence_len = len(numbers) - slice_by
    for permutation in permutations(numbers, subsequence_len):
        yield permutation

honno

#!/usr/bin/env python2

from collections import defaultdict, deque
from itertools import product
from operator import add

def vectorsum(*vectors):
    if len(vectors) > 1:
        return map(add, vectors[0], vectorsum(*vectors[1:]))
    else:

honno

#!/usr/bin/env python2

from collections import defaultdict

ID_LEN = 5

def gen_primes():
    """Using the Sieve of Erastothenes solution"""
    composites = defaultdict(list)
    checker = 2

honno

total_freq,pos_freq,neg_freq,KF9.1_miss,KF9.1_present,KF9.1_value,BLOSUM2.1_miss,BLOSUM2.1_present,BLOSUM2.1_value
QVSGSENTDNKPHSE,1,0,1,1,0,?,1,0,?
LQRFDQRSRQFQNLQ,3,0,3,3,0,?,3,0,?
IHFGNDWEDRYYREN,2,2,0,2,0,?,2,0,?
FADLMGYIPLVGAPL,1,1,0,1,0,?,1,0,?
EQEWGTPGSHVREET,1,0,1,0,1,-0.5,1,0,?
NLVGLLGVTGTDLQG,2,2,0,2,0,?,1,1,-0.41
PTDSPSATIDVPSNC,3,0,3,1,2,0.156667,2,1,-0.6
AVGQGWVDHFADGYD,2,1,1,1,1,-0.182667,1,1,0.208
LKLDIQPYDINQRLQ,1,0,1,1,0,?,1,0,?

honno

#!/usr/bin/env python3

import argparse
import sys
import re

id_pattern= re.compile("[A-Z]+")

if __name__ == "__main__":
    parser = argparse.ArgumentParser()

honno

#!/usr/bin/python3

import argparse
import sys
import csv

from bs4 import BeautifulSoup
import requests

if __name__ == "__main__":

honno

#!/usr/bin/python3

import argparse
import sys

import requests
from bs4 import BeautifulSoup

def music_grid_parse(music_item):
    return music_item.find('a')['href']

honno

;; Forward & Backward Chaining
;;
;; Use (run *rules *goals) in CLISP to try it out.
;;
;; Written by Matthew Barber <quitesimplymatt@gmail.com> under MIT
;;
;; The MIT License (MIT)
;;
;; Copyright (c) 2019 Matthew Barber
;;

honno

#!/usr/bin/python3

import logging
import argparse
import sys
import binascii
import multiprocessing as mp
from time import sleep

SLEEP_TIME = 0.1

honno

Health Lottery Quick Win Draws Scraper

The Health Lottery in the UK runs an online lottery that runs every 3 minutes called Quick Win, where they employ the services of an online casino games supplier called Gamevy.

And so, scraper.py collates the numbers resulting from each draw to generate a .csv file.

Gamevy has seemingly exposed every past draw of the lottery in one API endpoint that only requires a (publicly available) session token from another endpoint. As of May 2019, that's over 300 000 draws!

I made this as part of a learning exercising to test the "randomness" of this lottery game by way of statistical analysis.