mtso
/ VIMREPS.txt
Last active
March 28, 2025 04:20
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| GOAL: Make each pair of (n) lines match | |
| (0) this is a pair of lines | |
| (0) this is a pair of lines | |
| (1) this is a pair of lines |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| dig aaaa example.com | |
| curl -6 "http://[2606:2800:21f:cb07:6820:80da:af6b:8b2c]" -H "Host: example.com" |
mtso
/ URL charset regex
Last active
September 17, 2024 00:57
https://www.rfc-editor.org/rfc/rfc3986#section-2.2 ; encodeURI(identity)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ^[A-Za-z0-9-_:.,;!?~*'()/=+&%@#]+$ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| b64:e3I9MTAwMCxyMj0xMDAwLHUxPTEwMCx1Mj0yMDB9 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const std = @import("std"); | |
| const Duck = struct { | |
| name: []const u8, | |
| grade: u8 = undefined, | |
| }; | |
| const DuckGrader = struct { | |
| pub fn grade(_: *DuckGrader, duck: *Duck) void { | |
| duck.grade = if (duck.name.len > 1) duck.name[0] else 'Z'; |
mtso
/ alignment.zig
Created
June 22, 2022 13:37
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| pub const Account = packed struct { | |
| id: u128, | |
| /// Opaque third-party identifier to link this account (many-to-one) to an external entity. | |
| user_data: u128, | |
| /// Reserved for accounting policy primitives. | |
| reserved: [48]u8, | |
| ledger: u32, | |
| /// A chart of accounts code describing the type of account (e.g. clearing, settlement). | |
| code: u16, | |
| flags: AccountFlags, |
mtso
/ double_left_shift_to_caps_lock.json
Created
May 30, 2022 19:55
Karabiner Elements - Double Left Shift to Caps Lock modification. https://karabiner-elements.pqrs.org/ , https://github.com/pqrs-org/KE-complex_modifications
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "title": "Double left_shift to become caps_lock", | |
| "rules": [ | |
| { | |
| "description": "Double left_shift to become caps_lock.", | |
| "manipulators": [ | |
| { | |
| "conditions": [ | |
| { | |
| "name": "left_shift pressed", |
mtso
/ double_command_to_caps_lock.json
Last active
May 27, 2022 13:38
https://github.com/pqrs-org/KE-complex_modifications
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "title": "Double left_command to become caps_lock", | |
| "rules": [ | |
| { | |
| "description": "Double left_command to become caps_lock.", | |
| "manipulators": [ | |
| { | |
| "conditions": [ | |
| { | |
| "name": "left_command pressed", |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function ser(n1,n2,n3,n4) | |
| return (n1&0xff)<<8 | n2&0xff | | |
| (n3&0xff)>>8 | (n4&0xff)>>16 | |
| end | |
| function deser(n) | |
| return { | |
| (n>>8) & 0xff, | |
| n&0xff, | |
| (n<<8) & 0xff, |
mtso
/ lisp-parser.js
Created
March 8, 2022 18:53
Lisp Parser - Write code that takes some Lisp code and returns an abstract syntax tree. The AST should represent the structure of the code and the meaning of each token. For example, if your code is given "(first (list 1 (+ 2 3) 9))", it could return a nested array like ["first", ["list", 1, ["+", 2, 3], 9]].
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // input "" -> null | |
| // input "()" -> [] | |
| // input "(1)" -> [1] | |
| // 0123456 | |
| // const input = "(first (list 1 (+ 2 3) 9))" | |
| // example out: ["first", ["list", 1, ["+", 2, 3], 9]] | |
| // (+ 2 3) -> ["+", 2, 3] | |
| // (list 1 (+ 2 3) 9) -> ["list", 1, ["+", 2, 3], 9] | |
| function parse(input) { |
NewerOlder