techgeek1

use std::cell::Cell;

/// A thunk used for lazy generation and caching of values
struct Thunk<T: Copy> {
    /// Cached value stored in the thunk
    value: Cell<Option<T>>,
    
    /// Generator function to generate a missing value
    generator: fn() -> T
}

techgeek1

/// AVX implementation of the Harley-Seal algorithm for counting the number of bits in a bitset
/// 
/// # Safety
/// Assumes that the input is `BITSET_SIZE_IN_WORDS` in length 
pub unsafe fn cardinality(bitset: &[u64]) -> usize {
    debug_assert!(bitset.len() == BITSET_SIZE_IN_WORDS);
    
    let d = bitset.as_ptr() as *const Register;

techgeek1

Techgeek1's Links

General Topics

General computer science topics applicable to any subdomain.

Algorithms

• Radix Sort Revisited

Data Structures

• The Slot Map Data Structure

techgeek1

#!/bin/bash

# --- Packages ---

# NOTE: I've noticed some issues where installs may fail if rapidly queued, to prevent this
#       an artificial delay is inserted since this seems to make the behavior much more
#       predictable

# Some operations seem to fail if time is not given for the system to do some kind of 
# processing under the hood, so we insert artificial delays to help the process along