I hereby claim:
- I am bruceoutdoors on github.
- I am bzlee (https://keybase.io/bzlee) on keybase.
- I have a public key ASACgT3CJdqwlZjLsQ9mVk3lrUFa4SpNZSvD9FCKsxkj5go
To claim this, I am signing this object:
| #!/bin/bash | |
| # Check if VM name is provided | |
| VM_NAME=$1 | |
| if [ -z "$VM_NAME" ]; then | |
| echo "Makes IP static for given virtual machine name in virt-manager" | |
| echo "Usage: $0 <vm_name>" | |
| exit 1 | |
| fi |
I hereby claim:
To claim this, I am signing this object:
| // simple matrix calculator | |
| #include <iostream> | |
| #include <cstdlib> | |
| #include <limits> | |
| // A 3x3 matrix | |
| const int M_SIZE = 3; | |
| typedef double matrix[M_SIZE][M_SIZE]; | |
| // function prototypes |
| <?php | |
| /* * ** | |
| * | |
| * This script converts an existing MySQL database to migrations in Laravel 4. | |
| * | |
| * 1. Place this file inside app/controllers/ | |
| * | |
| * 2. In this file, edit the index() method to customize this script to your needs. | |
| * - inside $migrate->ignore(), you pass in an array of table |
| #!/bin/bash | |
| set -o errexit -o nounset -o pipefail | |
| # Generate kaf (https://github.com/birdayz/kaf) configuration with AWS MSK clusters | |
| # Usage: | |
| # # Setup new config: | |
| # AWS_PROFILE=dev ./gen-kaf-conf.sh > ~/.kaf/config && kaf config select-cluster | |
| # | |
| # # Append to existing config (tail command removes first line): | |
| # AWS_PROFILE=dev ./gen-kaf-conf.sh | tail -n+2 >> ~/.kaf/config |
| #!/bin/bash | |
| # Note: Must run as root! | |
| cd /etc/wireguard/ | |
| # Get next available internal IP address | |
| IP=$((`tac wg0.conf | grep -m1 -oP "[0-9]+(?=/32)" || echo 1` + 1)) | |
| # Generate client key | |
| CLIENT_PRIVATE=`wg genkey` |
| #!/bin/bash | |
| . matrix.sh | |
| . mods.sh | |
| . translator.sh | |
| function hill_decrypt { | |
| key=${1// /} # clear spaces from key | |
| if [ ${#key} -lt 4 ]; | |
| then |
| # python3 | |
| from collections import deque | |
| # Store combinations as a tree. The size of the tree directly | |
| # corresponds to the running time of the algorithm - O(2^n) | |
| # Worst runtime is when the sum of items is larger than the target | |
| # and no combination exist. An intuitive optimization here is to | |
| # prune combinations away when the sum has already exceeded the target | |
| class Node: |
| # Python3 port of http://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/UF.java.html | |
| class DisjointSet: | |
| """ | |
| Execution: python disjoint_set.py < input.txt | |
| Data files: http://algs4.cs.princeton.edu/15uf/tinyUF.txt | |
| http://algs4.cs.princeton.edu/15uf/mediumUF.txt | |
| http://algs4.cs.princeton.edu/15uf/largeUF.txt | |
| Weighted quick-union by rank with path compression. | |