Jach

Similar to my Book Reading List Queue or my Anime Notes, this will track some thoughts on some past games I've played or beaten. I've been tracking my beaten games with play time for some time at How Long To Beat, but I haven't given them ratings or post-play thoughts, and I thought it might be a good idea to start doing that and go back and do it for some old plays (and maybe discover for some that I have very little memory of what actually happened). List is for my own benefit so I'm not going to be careful around spoiler topics, but I'm also lazy and don't want to write that much to justify a review score... I wouldn't mind chatting in the comments if there's a game where my rating is quite different and some discussion around it would be interesting.

There are some games that are more 'ongoing' or never-ending in some sense like being meant to be played and replayed over and over, maybe they're arcade style or MMOs or games-as-service things, in any case they

Jach

A bit similar to my Book Reading List Queue, but not as complete or detailed. I've been tracking the anime I've been watching on MAL for a while and in case anyone is interested that is the definitive spot for dates / scores. Over time I'd like to maybe comment on everything here to some extent, even just a few words' remark on my thoughts or feelings, and maybe justify my score slightly. Mostly just one-two sentence things though I'm sure some will expand. The reason to do this is sometimes I forget why I judged something a particular way and only remember the judgement or feeling, keeping even a minor note should help recall fuller details even if I don't write the fuller ones here. Rating wise, I'd happily rewatch anything 8 or above.

Order here will also be most recent at the top. List started with Haruhi Suzumiya, so unfortunately everything prior that is backwards memory-filling, not fresh thoughts after just finishing.

Note that I di

Jach

My ideal goal is to read at least one book a month, on average, or 12 per year. (Yay success in 2018, 2020-2022.) I've been very bad at this goal before but still have it. This is a mostly most-recent-first sorted non-exhaustive list of books (sometimes papers or short articles too) I've read with short 'reviews' or thoughts. There are spoilers since this list is mainly meant for myself. At the end there is a non-exhaustive non-sorted list of books I'd like to read before I die.

I may eventually sort these by subject as the list or my desire to procrastinate grows, and maybe go through change logs and memory to try and annotate when a book was actually read -- maybe even add all the books I read before I started this log, even if I don't recall the plot very well. Finally, here's a link to my Amazon Wish List in case you're looking for gifts. ;) http://www.amazon.com/gp/registry/wishlist/225QQLO3JIGTL

---

2024

Raft - Stephen Baxter - https://www.amazon.com/Raft-Stephen-Baxter-author/dp/1473224055/

Jach

import json
import glob

files = glob.glob('*.js')
data = {}

for f in files:
  file = open(f)
  _ = file.readline()
  data[f] = json.loads(file.read())

Jach

; before running, run java -jar selenium-server-4.1.2.jar standalone

(defpackage #:coyo-yt-posts
  (:use #:cl))
(in-package :coyo-yt-posts)

(ql:quickload :cl-webdriver-client)
(ql:quickload :dexador)

(use-package :webdriver-client)

Jach

;; A generic solution for connected components. "I have some number of graphs. Is this element connected to
;; this other element? Or are the graphs/sets each element belongs to disjoint?"
;;
;; a 'backwards' tree with pointers from a node to its parent, which lets you union two separate trees together by
;; just taking the shorter one's root and pointing it at the taller one's (or vice versa, but this way preserves log
;; behavior). The path compression optimization seems to just be an extra pass in find(), after you have the result,
;; to re-parent each item along the path to the found root parent so that any future finds() of any of those items
;; will only have one lookup to reach the component root.

(defclass union-find ()

Jach

<?php

/* USAGE:
 * $send = array();
 * $send['to'] = 'to@d.com';
 * $send['from'] = 'from@d.com'; // defaults to 'admin@thisdomain.com'
 * $send['subject'] = 'Sub';
 * $send['html'] = '<a href="site">click me</a>'; // newlines == <br /> automagically
 *
 * $mail = new EasyMail($send);

Jach

;;;; For years I had a script that used the twitter free API to get my account's (@jachy) likes, and if they were
;;;; images or videos, download a local copy of them because I was sick of accounts being suspended and losing some memes/art
;;;; forever.
;;;; Anyway, because the free tier is no more, here is a very dirty Common Lisp script to replace it.
;;;; It requires Selenium (expected to be running before this script, e.g. with `java -jar selenium-server-4.1.2.jar standalone`
;;;; and I'm assuming Firefox rather than Chrome is being used) to load up the likes page and continue to scroll down the page
;;;; for a fixed duration of time, frequently polling the page source and extracting media URLs from it. It handles pictures,
;;;; mp4 videos, and gifs. It uses `yt-dlp` (fork of youtube-dl) to get the mp4 URLs, uses `ls` to check for already-downloaded
;;;; existence (needed for lazy glob patterns), and `wget` to do the actual download.
;;;; By default it runs for 5 minutes, my cronjob is setup to run the sc

Jach

'''
Repeatedly run a command if the system records a sound loud enough.
Requires PyAudio and Numpy.

Windows users:
win32 Python 2.7: http://www.python.org/ftp/python/2.7.3/python-2.7.3.msi
Numpy: http://sourceforge.net/projects/numpy/files/NumPy/1.7.1/numpy-1.7.1-win32-superpack-python2.7.exe/download
PyAudio: http://people.csail.mit.edu/hubert/pyaudio/packages/pyaudio-0.2.7.py27.exe
'''
import os

Jach

(defstruct cell
  color
  value
  i
  j)

(defun create-cells (matrix)
  (let ((cells (list))
        (color :white))
    (loop for i below (array-dimension matrix 0) do