Skip to content

Instantly share code, notes, and snippets.

View matthewjberger's full-sized avatar

Matthew J. Berger matthewjberger

View GitHub Profile
@matthewjberger
matthewjberger / tinypubsub.rs
Last active January 1, 2024 06:16
Tiny pubsub broker in rust
// [dependencies]
// uuid = { version = "1.6.1", features = ["v4"] }
use std::collections::{HashMap, VecDeque};
#[derive(Clone, Debug)]
pub enum Message {
String(String),
}
@matthewjberger
matthewjberger / upgrade.md
Last active December 30, 2023 08:56
force upgrade your rust app cargo.toml dependencies

Force upgrade your rust app cargo.toml dependencies

cargo install cargo-edit
cargo upgrade --ignore-rust-version --incompatible
@matthewjberger
matthewjberger / Cargo.toml
Created December 28, 2023 22:43
Put a pixel on the screen using SDL2's software renderer in Rust
[package]
name = "chitauri"
version = "0.1.0"
edition = "2021"
[dependencies]
sdl2 = { version = "0.36.0", features = ["bundled"] }
@matthewjberger
matthewjberger / scenegraph.rs
Created December 17, 2023 13:15
Scenegraph
use petgraph::graph::{DiGraph, NodeIndex};
use petgraph::Direction;
use nalgebra::{Vector3, Isometry3};
use std::collections::HashMap;
#[derive(Debug, Clone)]
enum SceneNode {
Spatial(SpatialNode),
Mesh { base: SpatialNode, vertices: Vec<Vector3<f32>> },
}
@matthewjberger
matthewjberger / bytecode.rs
Created December 17, 2023 08:52
Bytecode emulation pattern in rust
struct Emulator {
register: [u8; 2], // Two general-purpose registers
program_counter: usize,
memory: [u8; 256], // Simplified memory
}
enum Instruction {
Load(u8, u8), // Load a value into a register
Add, // Add two registers
Subtract, // Subtract two registers
@matthewjberger
matthewjberger / semantic.rs
Created November 13, 2023 07:39
semantic version
use std::convert::TryFrom;
use std::num::ParseIntError;
#[derive(Debug, PartialEq, Eq, PartialOrd, Ord)]
struct SemanticVersion {
major: u32,
minor: u32,
patch: u32,
}
@matthewjberger
matthewjberger / nodegraph.rs
Last active November 3, 2023 13:38
Nodegraph V2
use petgraph::graphmap::DiGraphMap;
use serde::{Deserialize, Serialize};
use std::{collections::HashMap, error::Error, fmt, hash::Hash};
#[derive(Debug)]
pub struct NodeGraphError {
details: String,
}
impl NodeGraphError {
fn contains_single_num_in_range(s: &str, section_index: usize, min: u8, max: u8) -> Option<u8> {
s.split('/')
.nth(section_index)?
.split('-')
.filter_map(|part| part.parse::<u8>().ok())
.find(|&num| (min..=max).contains(&num))
}
#[cfg(test)]
mod tests {
use petgraph::{graph::NodeIndex, prelude::*};
use std::ops::{Index, IndexMut};
pub trait Aggregatable: Clone + PartialEq + std::fmt::Debug {
fn aggregate(&self, parent: &Self) -> Self;
}
// The SceneGraph is now generic over the type of the transform
#[derive(Default)]
pub struct SceneGraph<T: Aggregatable>(pub Graph<T, ()>);
// ===========================
// Approach 1: Direct Function
// ===========================
struct DirectProcessor {
process: fn() -> &'static str,
}
impl DirectProcessor {
fn process_data() -> &'static str {