gh api notifications | jq '.[] | {id, title: .subject.title, repo: .repository.full_name }'gh api --method DELETE notifications/threads/ID| type term = Var of string | Abs of string * term | App of term * term | |
| let rec to_string t = | |
| match t with | |
| | Var x -> x | |
| | Abs (x, body) -> "λ" ^ x ^ "." ^ to_string body | |
| | App (t1, t2) -> "(" ^ to_string t1 ^ " " ^ to_string t2 ^ ")" | |
| let fresh_var = | |
| let counter = ref 0 in |
gh api notifications | jq '.[] | {id, title: .subject.title, repo: .repository.full_name }'gh api --method DELETE notifications/threads/ID| import { createClient } from 'v0-sdk'; | |
| const V0_API_KEY = ''; | |
| const v0 = createClient({ apiKey: V0_API_KEY }); | |
| const deleteAllV0Chats = async () => { | |
| console.log('Fetching all your V0 chats...'); | |
| try { | |
| const chatsResponse = await v0.chats.find(); |
| const a = document.querySelectorAll( | |
| ".style-scope.ytd-video-renderer > .top-level-buttons.style-scope.ytd-menu-renderer > .style-scope.ytd-menu-renderer > yt-button-shape > .yt-spec-button-shape-next.yt-spec-button-shape-next--text.yt-spec-button-shape-next--mono.yt-spec-button-shape-next--size-m.yt-spec-button-shape-next--icon-only-default") | |
| a.forEach((e) => e.click()) |
| type id = string | |
| type binop = Plus | Minus | Times | |
| type stm = CompoundStm of stm * stm | |
| | AssignStm of id * exp | |
| | PrintStm of exp list | |
| and exp = IdExp of id | |
| | NumExp of int | |
| | OpExp of exp * binop * exp | |
| | EseqExp of stm * exp |
| // ~/.config/borders/bordersrc | |
| options=( | |
| style=round | |
| width=3.0 | |
| hidpi=on | |
| active_color=0xffe2e2e3 | |
| inactive_color=0xff414550 | |
| ) |
Code is clean if it can be understood easily – by everyone on the team. Clean code can be read and enhanced by a developer other than its original author. With understandability comes readability, changeability, extensibility and maintainability.
| Theorem plus_1_n : forall n : nat, n + 1 = S n /\ S n > n. | |
| Proof. | |
| intros n. | |
| split. | |
| - induction n as [| n' IHn']. | |
| + simpl. reflexivity. | |
| + simpl. rewrite <- IHn'. reflexivity. | |
| - induction n as [| n' IHn']. | |
| + simpl. apply le_n. | |
| + simpl. apply le_n_S. apply IHn'. |
Ler e entender um pouco desse artigo. https://wiki.c2.com/?FeynmanAlgorithm