jweinst1
/ hamming_sep_dist.cpp
Last active
December 26, 2025 22:52
and pop count of specific segments of bits for 8 bit dimension vectors
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <array> | |
| #include <cstdint> | |
| #include <cstddef> | |
| #include <cmath> | |
| #include <cstdio> | |
| #include <climits> | |
| #include <vector> | |
| #include <cassert> | |
| #include <random> | |
| #include <chrono> |
jweinst1
/ hamming_centers.cpp
Created
December 24, 2025 00:31
sorting bit sets of numbers based on hamming distance
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <array> | |
| #include <cstdint> | |
| #include <cstddef> | |
| #include <cmath> | |
| #include <cstdio> | |
| #include <climits> | |
| #include <vector> | |
| #include <cassert> | |
| #include <random> | |
| #include <chrono> |
jweinst1
/ lzsort.cpp
Last active
December 23, 2025 06:19
Automatic Sorting in Rust with bit RZ and LZ instructions
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <array> | |
| #include <cstdint> | |
| #include <cstddef> | |
| #include <cmath> | |
| #include <cstdio> | |
| #include <climits> | |
| #include <vector> | |
| #include <cassert> | |
| #include <random> | |
| #include <chrono> |
jweinst1
/ automeantest.cpp
Created
December 9, 2025 08:34
uses optimized popcount of integer series shifted right once to get very fast mean approximation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <array> | |
| #include <cstdint> | |
| #include <cstddef> | |
| #include <cmath> | |
| #include <cstdio> | |
| #include <climits> | |
| #include <vector> | |
| #include <random> | |
| #include <cassert> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <array> | |
| #include <cstdint> | |
| #include <cstddef> | |
| #include <cmath> | |
| #include <cstdio> | |
| #include <climits> | |
| #include <vector> | |
| #include <cassert> | |
| #include <random> | |
| #include <chrono> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| pub fn murmur3_x64_64(data: &[u8], seed: u64) -> u64 { | |
| let mut h1 = seed; | |
| let mut h2 = seed; | |
| const C1: u64 = 0x87c37b91114253d5; | |
| const C2: u64 = 0x4cf5ad432745937f; | |
| let mut i = 0; | |
| let len = data.len(); | |
| while i + 16 <= len { |
jweinst1
/ forward_back_context.py
Created
November 16, 2025 00:01
forward and back contexts of a word
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 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): |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <vector> | |
| #include <cstdint> | |
| #include <cstdio> | |
| #include <cassert> | |
| #include <iostream> | |
| #include <bitset> | |
| #include <queue> | |
| #include <unordered_map> | |
| #include <string> |
jweinst1
/ next_ge_bitset.cpp
Created
September 26, 2025 22:02
get the next greatest neighbor in bitset
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #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); | |
| } | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| >>> bin(0b10100 & ~0b1111) | |
| '0b10000' | |
| >>> bin(0b11000 & 0b1111) | |
| '0b1000' | |
| >>> bin(0b11000 & ~0b1111) | |
| '0b10000' | |
| >>> bin(0b01000 & ~0b1111) | |
| '0b0' | |
| >>> bin(0b11000 & ~0b1111) | |
| '0b10000' |
NewerOlder