There's a bunch of ways to do this.
On windows, I would just use AutoHotKey.
On a linux distro, setxkbmap
does the trick, but it is not as flexible.
The goal:
- remapping the capslock to control
- remap something else to toggle capslock
""" | |
URL to Binary to Decimal | |
How it Works | |
1. Does a DNS lookup on the URL given. | |
2. Converts the 255.255.255.255 into 4 binary numbers | |
3. Appends each of the binary numbers together | |
4. Converts the appended binary number into a decimal. |
package main | |
import ( | |
"fmt" | |
"github.com/emirpasic/gods/trees/binaryheap" | |
) | |
type item struct { | |
data interface{} | |
priority int |
package main | |
import ( | |
"fmt" | |
) | |
type node struct { | |
terminal bool | |
m map[rune]*node | |
} |
package main | |
import ( | |
"fmt" | |
"math/big" | |
) | |
var memo = map[int]*big.Int{ | |
0: big.NewInt(0), | |
1: big.NewInt(1), |
#include <iostream> | |
#include <map> | |
#include <set> | |
/** | |
* WeightedGraph | |
* | |
* @tparam _Key: Type of key used to reference nodes. | |
* | |
*/ |
#include <iostream> | |
#include <map> | |
#include <set> | |
/** | |
* WeightedGraph | |
* | |
* @tparam _Key: Type of key used to reference nodes. | |
* | |
*/ |
/* | |
randintNorm returns an integer in [min, max] including min and max. | |
The distribution will be closer to a normal distribution because it adds | |
2 instances of Math.random() together, like rolling 2 dice and adding them together. | |
*/ | |
const randintNorm = (min, max)=> { | |
min = Math.ceil(min); | |
max = Math.floor(max); | |
let r = (Math.random() + Math.random()) / 2; | |
return Math.floor(r * (max - min + 1)) + min; |
def title(s, L=70): | |
L = L - len(s) - 4 | |
l1 = L // 2 | |
l2 = L - l1 | |
prefix = l1*'═' + '╡' | |
postfix = '╞' + l2*'═' | |
print(prefix, s, postfix) | |
import sys | |
import math | |
def fib(n): | |
a = (1 + 5**(1/2)) / 2 | |
b = (1 - 5**(1/2)) / 2 | |
return (a**n - b**n)/ 5**(1/2) | |
if len(sys.argv) is not 2: |