| # -------------------------------------------------------------------- | |
| # Recursively find pdfs from the directory given as the first argument, | |
| # otherwise search the current directory. | |
| # Use exiftool and qpdf (both must be installed and locatable on $PATH) | |
| # to strip all top-level metadata from PDFs. | |
| # | |
| # Note - This only removes file-level metadata, not any metadata | |
| # in embedded images, etc. | |
| # | |
| # Code is provided as-is, I take no responsibility for its use, |
Do you really need Elastic Search?
- https://www.postgresql.org/docs/current/pgtrgm.html
- https://scoutapm.com/blog/how-to-make-text-searches-in-postgresql-faster-with-trigram-similarity
- https://about.gitlab.com/blog/2016/03/18/fast-search-using-postgresql-trigram-indexes/
- https://mazeez.dev/posts/pg-trgm-similarity-search-and-fast-like
- https://alexklibisz.com/2022/02/18/optimizing-postgres-trigram-search.html
- https://www.freecodecamp.org/news/fuzzy-string-matching-with-postgresql/
| // by dave | |
| float[][] result; | |
| float t, c; | |
| float ease(float p) { | |
| p = c01(p); | |
| return 3*p*p - 2*p*p*p; | |
| } | |
| float ease(float p, float g) { |
If you're used to solving cryptic puzzles, or deciphering texts using crypt-analytical cribs, it can be useful to know the relative frequency of letters in the distribution of words. Wordle has a built-in list of 5-letter words. That list isn't the same as all of the five letter words in the dictionary, or even only the common ones. Perfectly common words like 'tudor' are omitted. This gist contains a few useful tables that are worth familiarizing yourself with if you want to solve wordle puzzles logically.
| # Copyright 2021 Scratchwork Development LLC. All rights reserved. | |
| PI = 3.1415926 | |
| class Game | |
| attr_gtk | |
| def tick | |
| defaults | |
| render |
This document now exists on the official ASP.NET core docs page.
- Application
- Request Handling
This project is a tiny compiler for a very simple language consisting of boolean expression.
The language has two constants: 1 for true and 0 for false, and 4 logic gates:
! (not), & (and), | (or), and ^ (xor).
It can also use parentheses to manage priorities.
Here is its grammar in BNF format:
expr ::= "0" | "1"
| #!/bin/bash | |
| # | |
| # Backs up my entire website, in case Tumblr or CloudApp goes down someday. | |
| # Last time I ran this, it took 18 minutes. | |
| # | |
| wget \ | |
| --mirror `# turns on recursion and timestamping, basically says we want to "mirror" the whole site` \ | |
| --convert-links `# after download, convert all links to point to localhost` \ |
| "time" | |
| "down" | |
| "life" | |
| "left" | |
| "back" | |
| "code" | |
| "data" | |
| "show" | |
| "only" | |
| "site" |