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

Jach

;; Public domain example of using cl-autowrap and cffi to follow using the core api documented at
;; https://fmod.com/resources/documentation-api?version=2.0&page=white-papers-getting-started.html
;; to load and play a sound file with fmod.
;; This file assumes it's in the downloaded fmodstudioapi20009linux/ folder,
;; which contains the C includes and pre-built dynamic libraries.
;; Try it out, evaluating step by step!

(ql:quickload :cl-autowrap)

(defpackage :fmod-test

Jach

#|Public domain. Does not unwind-protect errors like it should.|#
(in-package #:cl-user)
(defpackage #:sdl-intro
  (:use #:common-lisp))
(in-package #:sdl-intro)

(ql:quickload "sdl2")

(defun null-ptr? (alien-val)
  (cffi:null-pointer-p (autowrap:ptr alien-val)))

Jach

; quick and dirty adaptation from https://gist.github.com/stucchio/1403042
(ql:quickload :numcl)
(ql:quickload :vgplot)

(defparameter *exercise-level* 1.5)
(defparameter *height-inches* (* 6 12))
(defparameter *a* (/ (* *exercise-level* (+ 66 (* 12.7 *height-inches*)))
                     3500.0))
(defparameter *b* (/ (* *exercise-level* 6.23)
                     3500))

Jach

// ==UserScript==
// @name     Twitter Selected Users
// @version  1
// @grant    none
// @namespace local
// @include     https://twitter.com/*
// ==/UserScript==

// Brittle bare-minimum works-for-me code ahead!
// License: Public Domain (see bottom)

Jach

'''
Python implementation of Haskell's

sieve xs = sieve' xs Map.empty
  where
    sieve' []     table = []
    sieve' (x:xs) table =
        case Map.lookup x table of
            Nothing     -> x : sieve' xs (Map.insert (x*x) [x] table)
            Just facts  -> sieve' xs (foldl reinsert (Map.delete x table) facts)

Jach

import sys
import ctypes
pyint_p = ctypes.POINTER(ctypes.c_byte*sys.getsizeof(5))
five = ctypes.cast(id(5), pyint_p)
print(2 + 2 == 5) # False
five.contents[five.contents[:].index(5)] = 4
print(2 + 2 == 5) # True (must be sufficiently large values of 2 there...)

Jach

;(ql:quickload :cl-ppcre)
;(ql:quickload :cl-interpol)
;(named-readtables:in-readtable :interpol-syntax)
(defun full-match (pattern string)
  "Something like Python's re.fullmatch.
   Example (with cl-interpol):
   (full-match #?/\s/ #?' ') -> T
   (full-match #?/\s/ #?'') -> nil"
  (equal string (cl-ppcre:scan-to-strings pattern string)))

Jach

; union-find.lisp

;; 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 (not done here) 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

Jach

#|
This file is in the public domain.
I grabbed the data from ucd.all.flat.zip at ftp://ftp.unicode.org/Public/11.0.0/ucdxml/
and use this script to create a UnicodeLetters.txt file
containing a series of unicode chars suitable for using in JavaScript regular expressions
where you want \p{L}.
Note that IE does not support the 'u' flag, you'll need to restrict yourself to the subset of
letters in the BMP (below 0x10000) and use this script to print out a simple "\uABCD" instead of "\\u{ABCDE}".
Also note that reading in the file seems to stress SBCL's default settings, run with
--dynamic-space-size 10000