Skip to content

Instantly share code, notes, and snippets.

View alfiedotwtf's full-sized avatar

Alfie John alfiedotwtf

View GitHub Profile

Preamble

There is a longstanding issue/missing feature/bug with sockets on Docker on macOS; it may never work; you'll need to use a network connection between Docker containers and X11 on macOS for the foreseeable future.

I started from this gist and made some adjustments:

  • the volume mappings aren't relevant/used, due to the socket issue above.
  • this method only allows X11 connections from your Mac, not the entire local network, which would include everyone on the café/airport WiFi.
  • updated to include using the host.docker.internal name for the the container host, instead.
  • you have to restart XQuartz after the config change.
@alfiedotwtf
alfiedotwtf / keybase.md
Last active December 15, 2024 06:22
keybase.md

Keybase proof

I hereby claim:

  • I am alfiedotwtf on github.
  • I am alfiedotwtf (https://keybase.io/alfiedotwtf) on keybase.
  • I have a public key ASDHwscsKFiVtZQOkQVPmdWPHhvCFVNMYmsBLjM0lPDWwQo

To claim this, I am signing this object:

@alfiedotwtf
alfiedotwtf / cache-oblivious.md
Created December 1, 2024 12:17 — forked from debasishg/cache-oblivious.md
Papers related to cache oblivious data structures

Cache Oblivious and Cache Aware Data Structure and Algorithms

  1. Cache-Oblivious Algorithms and Data Structures - Erik Demaine (One of the earliest papers in cache oblivious data structures and algorithms that introduces the cache oblivious model in detail and examines static and dynamic cache oblivious data structures built between 2000-2003)

  2. Cache Oblivious B-Trees - Bender, Demaine, Farch-Colton (This paper presents two dynamic search trees attaining near-optimal performance on any hierarchical memory. One of the fundamental papers in the field where both search trees discussed match the optimal search bound of Θ(1+log (B+1)N) memory transfers)

  3. Cache Oblivious Search Trees via Binary Trees of Small Height - Brodal, Fagerberg, Jacob (The data structure discussed in this paper works on the version of [2] but avoids the use o