Matthew J. Berger matthewjberger

🦀

Writing something in Rust, probably

Staff Software Engineer @usehyphen Programming something in rust, probably

matthewjberger / pubsub.rs

Created July 4, 2024 22:48

An in-process pub/sub message broker in rust using async_std

	// [dependencies]
	// async-std = { version = "1.12.0", features = ["attributes"] }
	// futures = "0.3.30"
	use async_std::{
	future::timeout,
	sync::{Arc, Mutex},
	};
	use futures::{
	channel::mpsc::{unbounded, UnboundedReceiver, UnboundedSender},
	futures::stream::StreamExt,

matthewjberger / gist:9ebc5c368b422f7fea5643890935dd50

Created May 23, 2024 18:55

sequential parent-local numbering of nodes in a petgraph - https://play.rust-lang.org/?version=stable&mode=debug&edition=2021&gist=1951210f28c2ef1caa9b815155472712

	// petgraph v0.6.5
	use petgraph::graph::{NodeIndex, DiGraph};

	fn number_children(graph: &DiGraph<(), ()>, parent: NodeIndex, depth: usize) -> Vec<(NodeIndex, usize, usize)> {
	let mut tree = Vec::new();
	let mut index = 0;

	// Start numbering the children from index 0
	for child in graph.neighbors(parent) {
	tree.push((child, index, depth));

matthewjberger / main.rs

Last active May 22, 2024 06:11

Topological sort of a petgraph graph for leaf parent chains - https://play.rust-lang.org/?version=stable&mode=debug&edition=2021&gist=f8197a11c35adf125c68e61748ab5394

	// petgraph v0.6.5
	use petgraph::graph::DiGraph;
	use petgraph::visit::{EdgeRef, Topo};

	fn main() {
	// Create a new directed graph
	let mut graph = DiGraph::new();

	// Add nodes and edges (similar to previous examples)
	let a1 = graph.add_node("A1");

matthewjberger / graph_equality.rs

Created May 15, 2024 22:55

Create a newtype for equating petgraph graphs (use this if you want to #[derive(PartialEq)] but your struct has a petgraph::Graph field)


	#[derive(Debug, Clone, Serialize, Deserialize)]
	pub struct CustomGraph {
	pub graph: petgraph::Graph<MakelineNode, ()>,
	}

	impl PartialEq for CustomGraph {
	fn eq(&self, other: &Self) -> bool {
	graph_eq(&self.graph, &other.graph)
	}

matthewjberger / types.rs

Last active May 3, 2024 03:52

Type id pattern matching in rust

	use std::any::TypeId;

	// Define some example types
	struct Foo;
	struct Bar;
	struct Baz;

	// Define a function to perform type-based pattern matching and return the value
	fn match_type<T: 'static>(value: T) -> Option<T> {
	// Get the TypeId of the value

matthewjberger / genvec.rs

Created April 28, 2024 18:15

Sparse vectors with generational indices in rust

	use self::error::GenerationError;
	use std::{
	collections::HashMap,
	ops::{Deref, DerefMut},
	};

	pub type Result<T, E = Box<dyn std::error::Error>> = std::result::Result<T, E>;

	pub mod error {
	use super::*;

matthewjberger / sm.rs

Created April 7, 2024 06:49

rust state machines

	//#![no_std]

	use serde::{Deserialize, Serialize};

	#[derive(Debug, PartialEq, Eq, Serialize, Deserialize, Clone, Copy)]
	pub enum State {
	State1,
	State2,
	State3,
	}

matthewjberger / broker.rs

Created March 31, 2024 03:42

A thread-safe pub/sub message broker in Rust

	use std::{
	collections::{HashMap, VecDeque},
	sync::{Arc, RwLock, Weak},
	};
	use uuid::Uuid;

	#[derive(Default)]
	pub struct Broker<T: Clone> {
	subscribers: Arc<RwLock<HashMap<String, Vec<Weak<RwLock<Client<T>>>>>>>,
	}

matthewjberger / alternate.rs

Last active March 18, 2024 03:04

Snappy and bincode data streaming to/from file on disk

	// [dependencies]
	// bincode = "1.3.3"
	// serde = { version = "1.0.197", features = ["derive"] }
	// snap = "1.1.1"

	use bincode::{deserialize, serialize};
	use serde::{de::DeserializeOwned, Serialize};
	use snap::{read::FrameDecoder, write::FrameEncoder};
	use std::{
	fs::{File, OpenOptions},

matthewjberger / cargo.toml

Created March 14, 2024 04:30

Snappy compression