Josh Weinstein jweinst1

🎯

Focusing

On a mission to write the fastest software in the world - 中文名字：马龙

jweinst1 / bitsorter.cpp

Last active December 8, 2025 06:34

automatic bit sorting in C++

jweinst1 / murur3.rs

Created November 29, 2025 22:26

murmur3 in rust

jweinst1 / forward_back_context.py

Created November 16, 2025 00:01

forward and back contexts of a word

	class WordContext(object):

	def __init__(self, direction, terms):
	self.direction = direction
	self.terms = terms

	def __repr__(self):
	return f"{self.direction} - {self.terms}"

	def make_context_list(seq, target):

jweinst1 / hamming_skip_gram.cpp

Created November 3, 2025 00:08

hamming in a skip gram context

jweinst1 / next_ge_bitset.cpp

Created September 26, 2025 22:02

get the next greatest neighbor in bitset

	#include <iostream>
	#include <bitset>

	int next_ge(uint64_t S, int k) {
	uint64_t mask = ~((1ULL << k) - 1);
	uint64_t candidates = S & mask;
	return __builtin_ctzll(candidates);
	}

jweinst1 / add_not_bits.txt

Last active September 26, 2025 00:26

closest sub mask in a mash set

jweinst1 / down_up_submask_iter_bench.cpp

Last active September 21, 2025 08:23

Bench mark of neighbor iteration in submasks

jweinst1 / iter_by_trail_zeros.txt

Last active September 20, 2025 19:22

a way to check for nearest neighbor with bit ops and xor sets with mash

jweinst1 / bit_state_machine.txt

Created September 16, 2025 22:34

bit state machine

jweinst1 / bit_maybe_set.rs

Last active September 15, 2025 22:10

Bit set in rust that stores vectors for membership



	fn sub_distance<const S: usize>(v1:&[u64;S], v2:&[u64;S]) -> u64 {
	let mut total = 0;
	for i in 0..S {
	total += v1[i] - v2[i];
	}
	return total;
	}