Skip to content

Instantly share code, notes, and snippets.

View JustinBeaudry's full-sized avatar

Justin Beaudry JustinBeaudry

View GitHub Profile
@JustinBeaudry
JustinBeaudry / logseq-theme-base16-eighties.css
Last active May 31, 2025 03:21
A dark, minimalist LogSeq theme inspired by Base64 encoding aesthetics, 80s cyberpunk vibes, and terminal hacker culture. Powered by NerdFonts for full icon support and monospaced elegance. Neon teals, glitchy pinks, and soft shadows give your second brain a retro-futuristic glow—perfect for distraction-free thinking with style.
:root {
--ls-primary-background-color: #2d2d2d; /* base00 */
--ls-secondary-background-color: #393939; /* base01 */
--ls-tertiary-background-color: #515151; /* base02 */
--ls-quaternary-background-color: #747369; /* base03 */
--ls-primary-text-color: #d3d0c8; /* base05 */
--ls-secondary-text-color: #a09f93; /* base04 */
--ls-link-text-color: #6699cc; /* base0D */
@JustinBeaudry
JustinBeaudry / fedora42_macbook14_2.md
Created May 30, 2025 17:26
Fedora 42 on Macbook 14,2

Fedora 42 on Macbook 14,2

Doumenting my journey here for myself and others. Inspired by Rob Hills

My Macbook Pro

urzo@fedora:~$ sudo dmidecode | grep -i mac
	Product Name: MacBookPro14,2
	Family: MacBook Pro
@JustinBeaudry
JustinBeaudry / LABELS.md
Created March 2, 2019 06:06
Github labelling

Github labelling

A guideline for labelling in GitHub. This is not a manifesto or an attempt to indocrinate anyone. It is meant as a reference for my personal use of labels in GitHub. Use it if you want, I don't care.

Table of Contents

  1. [Type][type]
  2. [Priority][priority]
  3. [Status][status]
@JustinBeaudry
JustinBeaudry / benchmarking-hashes.js
Last active February 27, 2019 01:43
Benchmarking Node Crypto vs XXHash
// Benchmarking Node Crypto vs XXHash
//
// Setup/Installation:
// mkdir hashbenchmarks && cd hashbenchmarks && npm i xxhash benchmark beautify-benchmark && curl https://gist.githubusercontent.com/JustinBeaudry/45b8ad0c1a36eaf0974f8dc1188e2af3/raw/202dd48b8a2606ad0be99a8261770ddd4dba74b9/benchmarking-hashes.js -o benchmarking-hashes.js
//
// Running:
// node benchmarking-hashes.js
const http = require('http');
const crypto = require('crypto');
@JustinBeaudry
JustinBeaudry / unix_path_validation.js
Last active January 25, 2019 16:26
Javascript Path Regex
const isPath = str => /^(\/?[^\/ ]*)+\/?\.\w+$/i.test(str);
isPath('adsasdasd'); // false
isPath('path/to/file'); // false
isPath('path/to/file.txt'); // true
isPath('/path/to/file.txt'); // true
isPath('C:\path\to\file.txt'); // true
@JustinBeaudry
JustinBeaudry / docker-compose.yml
Last active October 23, 2018 20:24
Docker Compose Wordpress yaml file
version: '3.3'
services:
db:
image: mysql:5.7
ports:
- "3306:3306"
volumes:
- db_data:/var/lib/mysql
restart: always
@JustinBeaudry
JustinBeaudry / deform.cs
Created October 10, 2018 16:25
Mesh Deformer C#
using UnityEngine;
using Unity.Jobs;
using Unity.Burst;
using Unity.Collections;
using Unity.Mathematics;
using static Unity.Mathematics.math;
namespace Deform
{
public class TwistDeformer : Deformer

Effective Engineer - Notes

What's an Effective Engineer?

  • They are the people who get things done. Effective Engineers produce results.

Adopt the Right Mindsets

@JustinBeaudry
JustinBeaudry / 01_Queueing_Theory.md
Created December 29, 2017 00:01 — forked from rondy/01_Queueing_Theory.md
Queueing Theory references

Queueing Theory references

General content

http://www.shmula.com/queueing-theory/
http://ferd.ca/queues-don-t-fix-overload.html
https://news.ycombinator.com/item?id=8632043
https://thetechsolo.wordpress.com/2015/01/25/queueing-theory-explained/
http://people.revoledu.com/kardi/tutorial/Queuing/index.html
http://setosa.io/blog/2014/09/02/gridlock/index.html
@JustinBeaudry
JustinBeaudry / quickSort.js
Created August 7, 2017 17:20
Quick Sort with Hoare Partitioning
function _quickSort(array, left, right) {
left = left || 0;
right = right || array.length - 1;
let pivot = _partitionHoare(array, left, right);
if (left < pivot - 1) {
_quickSort(array, left, right);
}
if (right > pivot) {
_quickSort(array, pivot, right);