amakukha

#!/usr/bin/env python3

import os, sys, hashlib

MD5 = True

def md5sum(fn):
    hasher = hashlib.md5()
    with open(fn, 'rb') as f:
        hasher.update(f.read())

amakukha

#!/usr/bin/env python3

'''
A script to recursively compare two directories (including file size and file hash changes)
Usage: python3 compare_dirs.py DIR1 DIR2
'''

import os, sys, hashlib, unicodedata

COMPARE_FILES = True            # should file sizes be compared if their names are the same?

amakukha

#!/usr/bin/python

## Percentage area overlap between circles in Python. 
## Inspired by PHP code by JP Hastings-Spital:
##     https://gist.github.com/jphastings/316058

import math

def circle_overlap(centers_distance, radius1, radius2):
    # Make sure the larger circle is left-most (for convenience)

amakukha

/* 
 * Play duo melody with Arduino
 * ============================
 *  
 * Description:
 *   This sketch simultaneously plays two separate melodies on two (passive) 
 *   speakers or buzzers. This creates effect of a "choir".
 *   For simplicity, it uses function play2Tones(), which only plays two notes
 *   of equal duration simultaneosly.
 *   The actual melody here is the Anthem of Ukraine.

amakukha

#ifndef _RING_BUFFER_
#define _RING_BUFFER_

// Source: https://embeddedartistry.com/blog/2017/4/6/circular-buffers-in-cc

#include <memory>
#include <mutex>

template <class T>
class RingBuffer {

amakukha

# Proper (fast) Python implementations of Dan Bernstein's DJB2 32-bit hashing function
# 
# DJB2 has terrible avalanching performance, though.
# For example, it returns the same hash values for these strings: "xy", "yX", "z7". 
# I recommend using Murmur3 hash. Or, at least, FNV-1a or SDBM hashes below.

import functools
djb2 = lambda x: functools.reduce(lambda x,c: 0xFFFFFFFF & (x*33 + c), x, 5381)
sdbm = lambda x: functools.reduce(lambda x,c: 0xFFFFFFFF & (x*65599 + c), x, 0)
fnv1a_32 = lambda x: functools.reduce(lambda x,c: 0xFFFFFFFF & ((x^c)*0x1000193), x, 0x811c9dc5)

amakukha

/* 
 * Solution of the Jon Bentley's k most frequent words problem using a prefix tree and
 * a heap of size k. Worst case time complexity is O(N log k), where N is the total 
 * number of words.
 *
 * The problem is formulated in the Communications of the ACM 29,5 (May 1986), 364-369:
 *     "Given a text file and an integer k, you are to print the k
 *     most common words in the file (and the number of their
 *     occurrences) in decreasing frequency."
 * 

amakukha

#!/usr/bin/env python3 
  
'''
A script to generate text files that look like a novel in TXT form.
Words are completely made up, but vaguely resemble the Finnish language.
The resulting text uses ASCII encoding with only printable characters. 
Distribution of words follows Zipf's law.

Standard parameters generate 1 GB text with 148391 distinct words.

amakukha

# .config file for compiling toybox on MacOS
# 1) make defconfig
# 2) replace the .config file
# 3) make
# Also: don't forget to install gsed (GNU sed)
# Adding CPUS=1 in scripts/make.sh might also be needed
# 
# -----------------------------------------------
#
# Automatically generated make config: don't edit

amakukha

#!/usr/bin/env python

# Copyright 2019 Google Inc.

# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at

#     http://www.apache.org/licenses/LICENSE-2.0