| import DataLoader from 'dataloader' | |
| import { Exchange, Operation } from 'urql' | |
| import { pipe, map } from 'wonka' | |
| interface BatchRequest { | |
| url: string | |
| options?: RequestInit | |
| } | |
| const batchFetch = ( |
This should make True Color (24-bit) and italics work in your tmux session and vim/neovim when using Alacritty (and should be compatible with any other terminal emulator, including Kitty).
Running this script should look the same in tmux as without.
curl -s https://gist.githubusercontent.com/lifepillar/09a44b8cf0f9397465614e622979107f/raw/24-bit-color.sh >24-bit-color.sh
| ROS (10 systems) | |
| In addition to that documented in the HPI above, the additional ROS was obtained: | |
| Constitutional: Denies fevers or chills | |
| Eyes: Denies vision changes | |
| ENMT: Denies sore throat | |
| CV: Denies chest pain | |
| Resp: Denies SOB | |
| GI: Denies vomiting or diarrhea | |
| GU: Denies painful urination | |
| MSK: Denies recent trauma |
Cryptopals is a set of cryptographic challenges, originally published here: https://cryptopals.com
Set 8 of the challenges was never published publicly, until late March 2018. However the cryptopals website was not updated to include the challenges. This gist compiles the 8th set of the Cryptopals challenges.
| title | link |
|---|---|
| 57. Diffie-Hellman Revisited: Small Subgroup Confinement | https://toadstyle.org/cryptopals/513b590b41d19eff3a0aa028023349fd.txt |
| 58. Pollard's Method for Catching Kangaroos | https://toadstyle.org/cryptopals/3e17c7b35fcf491d08c989081ed18c9a.txt |
| 59. Elliptic Curve Diffie-Hellman and Invalid-Curve Attacks | https://toadstyle.org/cryptopals/a0833e607878a80fdc0808f889c721b1.txt |
The project is split into several parts:
The following are examples of the four types rate limiters discussed in the accompanying blog post. In the examples below I've used pseudocode-like Ruby, so if you're unfamiliar with Ruby you should be able to easily translate this approach to other languages. Complete examples in Ruby are also provided later in this gist.
In most cases you'll want all these examples to be classes, but I've used simple functions here to keep the code samples brief.
This uses a basic token bucket algorithm and relies on the fact that Redis scripts execute atomically. No other operations can run between fetching the count and writing the new count.
| #include <igl/guess_extension.h> | |
| #include <igl/read_triangle_mesh.h> | |
| #include <igl/viewer/Viewer.h> | |
| #include <Eigen/Core> | |
| #include <iostream> | |
| #include <string> | |
| #include <cstdio> | |
| #include <unistd.h> | |
| int main(int argc, char * argv[]) |
FWIW: I (@rondy) am not the creator of the content shared here, which is an excerpt from Edmond Lau's book. I simply copied and pasted it from another location and saved it as a personal note, before it gained popularity on news.ycombinator.com. Unfortunately, I cannot recall the exact origin of the original source, nor was I able to find the author's name, so I am can't provide the appropriate credits.
