1. Only showing results from lib.rs

    Clear filter to show all search results

  2. Jan 29, 2025Approximately 3 times faster than GNU Factor. Permits constant-time evaluation, although this is impractical for 128-bit integers. Provides a C-style api. Note that this library uses Pollard-rho with deterministic parameters, so factorisation may loop indefinitely although this is extremely improbable. A semiprime N will fail at a rate of 0.5^x ...
  3. Oct 10, 2024Balanced text chunking means that all chunks are approximately the same size. See my blog post on text chunking for implementation details. A novel balanced text chunker that creates chunks of approximately equal length; More accurate than unbalanced implementations that create orphaned final chunks; Optimized with a parallelization
  4. Mar 5, 2024106 downloads per month . MIT license . 58KB 1K SLoC gen-rs. This is evolving software. Expect breaking API changes. gen-rs is an experimental crate for probabilistic programming in Rust. gen-rs was inspired by GenTL, but with Rust-native constructs.. It approximately* implements the Generative Function Interface as specified in the Gen.jl whitepaper and Marco Cusumano-Towner's thesis.
  5. Dec 19, 2024The code coverage is approximately 90%, providing strong confidence in correctness. You can generate the code coverage report using tarpaulin. Contributing. Contributions are welcome! Whether it's improving documentation, fixing bugs, or suggesting new features, feel free to open an issue or submit a pull request (PR). When contributing ...
  6. Jan 23, 2025SAME messages are always transmitted three times, in separate "bursts," for redundancy. When decoding the start of message headers (ZCZC), samedec will use all three bursts together to improve decoding—if possible.. If one retransmission is missed, samedec will automatically fall back to decoding with only two bursts. The decoder imposes a delay of approximately 1.311 seconds on all received ...
  7. Oct 30, 2024A heuristic strategic ensures that the tree is approximately load-balanced. The implementation of the load-balancing and the 2:1 balancing are modeled after the paper Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel by Sundar et. al. The underlying implementation relies on parallel sorting of Morton keys, which is ...
  8. Sep 8, 20248,042,553 downloads per month Used in 38,004 crates (495 directly). MIT/Apache. 260KB 5.5K SLoC backtrace-rs. Documentation. A library for acquiring backtraces at runtime for Rust. This library aims to enhance the support of the standard library by providing a programmatic interface to work with, but it also supports simply easily printing the current backtrace like libstd's panics.
  9. Can’t find what you’re looking for?

    Help us improve DuckDuckGo searches with your feedback

Custom date rangeX