46 Repositories
Rust number-representation Libraries
Rust library of custom number malarkey, including variable-bit-width integers
Numberwang The Numberwang crate is a library of custom number types and functionality, including variable-bit-width integers. It is named after the fi
Social media style compact number formatting for rust.
prettty-num Format integers into a compact social media style format, similar to using Intl.NumberFormat("en", { notation: "compact" }); as a number f
🦀 Stupid simple presentation of the number of words, characters and lines on your clipboard.
clipcount: Counting words from the clipboard content Why does this exist? Do you find yourself often needing to count the number of words in a piece o
A brand-new multi-scenarios smart contract compiler framework
The Smart Intermediate Representation The Smart Intermediate Representation(short for IR) project is a new compiler framework intended for smart contr
simple lottery maker made with rust, just web framework
Toy project for fun It's just for fun! making plausible lottery numbers for Korea made with rust This lottery web framework generates and presents pla
Count number of ifs in your rust project!
A long awaited solution for a widely encountered problem! The will count the number of ifs in your rust project! (it can also collect some other numer
A command-line utility which aligns a block of text within the terminal (or a specified number of columns), written in Rust.
align: a command line utility for aligning text. ⭐ Overview Aligns text within the terminal (or a specified number of columns). The text is treated as
A Rust trait to convert numbers of any type and size to their English representation.
num2english This Rust crate provides the NumberToEnglish trait which can be used to convert any* number to its string representation in English. It us
A compiler to convert Cairo's intermediate representation "Sierra" code to MLIR.
Cairo Sierra to MLIR compiler A compiler to convert Cairo's intermediate representation "Sierra" code to MLIR. Documentation There is an mdbook in the
A plugin to enable random number generation for the Bevy game engine.
bevy_turborand A plugin to enable random number generation for the Bevy game engine, built upon turborand. Implements ideas from Bevy's Deterministic
Python module implemented in Rust for counting the number of one bits in a numpy array.
bit-counter Package for counting the number of one bits in a numpy array of uint8 values. Implemented as a Python module using Rust, providing high pe
Fixed point to floating point (and back) conversion utility
fixed2float Simple utility for fixed point to real number conversions, using the VisSim (Fxm.b) and Q (Qm.n) notations. Usage as a dependency of your
1️⃣ el lisp number uno - one lisp to rule them all 🏆
luno el lisp number uno luno is the one lisp to rule them all. Still experimental, do not use it in production yet. goals embeddable small size simple
SWC Transform to prefix logs. Useful for adding file and line number to logs
SWC Transform to prefix logs. Useful for adding file and line number to logs
Convert number like 42 to forty-two
num2words Convert number like 42 to forty-two Usage This crate can be either used as a library or a binary. Library Example usage: use num2words::Num2
An Intermediate Representation which can be compiled into WebAssembly
WebAssembly Intermediate Representation This is an Intermediate Representation which can be compiled into WebAssembly. The source code is in an experi
This crate allows to generate a flat binary with the memory representation of an ELF.
flatelf Library This crate allows to generate a flat binary with the memory representation of an ELF. It also allows to generate a FLATELF with the fo
Rust port of Ghidra's SLEIGH decompiler
Rust port of Ghidra's SLEIGH decompiler. This library allows you to decompile or translate machine code for multiple architectures.
A pure, low-level tensor program representation enabling tensor program optimization via program rewriting
Glenside is a pure, low-level tensor program representation which enables tensor program optimization via program rewriting, using rewriting frameworks such as the egg equality saturation library.
A Rust proc-macro crate which derives functions to compile and parse back enums and structs to and from a bytecode representation
Bytecode A simple way to derive bytecode for you Enums and Structs. What is this This is a crate that provides a proc macro which will derive bytecode
Some collections to store a fixed number of elements of a specific type.
This repo provide some useful data-structures, such as: Array, HashMap, HashSet, BTreeMap, BTreeSet, etc... That lives on the stack. It's a good choic
Self Organizing Map (SOM) is a type of Artificial Neural Network (ANN) that is trained using an unsupervised, competitive learning to produce a low dimensional, discretized representation (feature map) of higher dimensional data.
som Self Organizing Map Pre-requisites Setup rust To download Rustup and install Rust, run the following in your terminal, then follow the on-screen i
An interpreter for Rust's mid-level intermediate representation
Miri An experimental interpreter for Rust's mid-level intermediate representation (MIR). It can run binaries and test suites of cargo projects and det
An efficient method of heaplessly converting numbers into their string representations, storing the representation within a reusable byte array.
NumToA #![no_std] Compatible with Zero Heap Allocations The standard library provides a convenient method of converting numbers into strings, but thes
Rust implementation of custom numeric base conversion.
base_custom Use any characters as your own numeric base and convert to and from decimal. This can be taken advantage of in various ways: Mathematics:
A collection of numeric types and traits for Rust.
num A collection of numeric types and traits for Rust. This includes new types for big integers, rationals (aka fractions), and complex numbers, new t
CBOR: Concise Binary Object Representation
CBOR 0x(4+4)9 0x49 “The Concise Binary Object Representation (CBOR) is a data format whose design goals include the possibility of extremely small cod
A Rust library for random number generation.
A Rust library for random number generation.
Abstract bootstraps.
abstraps Extensible compiler middle layer with abstract interpreters. This project started off as an experiment in compiler design. Specifically, the
Simple and efficient time representation in Rust.
timens-rs Simple and efficient timestamp representation. The main objective being interoperability with OCaml Core_kernel.Time_ns. A significant part
PyQIR is a set of APIs for generating, parsing, and evaluating Quantum Intermediate Representation (QIR).
PyQIR PyQIR is a set of APIs for generating, parsing, and evaluating Quantum Intermediate Representation (QIR). It consists of the following component
A small random number generator hacked on top of Rust's standard library. An exercise in pointlessness.
attorand from 'atto', meaning smaller than small, and 'rand', short for random. A small random number generator hacked on top of Rust's standard libra
A Rust attribute macro to limit a function's number of runs over a specified period of time
throttle_my_fn: A Rust attribute macro to throttle the execution of functions throttle_my_fn is a Rust attribute macro to limit a function's number of
Bril: A Compiler Intermediate Representation for Learning
Bril: A Compiler Intermediate Representation for Learning Bril (the Big Red Intermediate Language) is a compiler IR made for teaching CS 6120, a grad
Generating the nth Fibonacci number
Generating the nth Fibonacci number Per Wikipedia, "In mathematics, the Fibonacci numbers, commonly denoted Fn, form a sequence, called the Fibonacci
TTVM Intermediate Representation driver
ttir - TTVM IR Driver ttir is driver for the TTVM IR located in ttvm. Usage Run the following command in your shell: cargo install ttir Features Easy
Outputs a random number of 🌈's
Rainbows Outputs a random number of 🌈 's. Rust implementation of rainbows. 📦 Installation Install Rust and Cargo Run cargo install rainbows $ rainbo
📘 Utilities for the Fibonacci Number and Sequence
Fibora Port of fibonacci-deno for Rust. Utilities for the Fibonacci Number and Sequence. Usage This package exposes two Functions, fibonacci and fibon
File Tree Fuzzer allows you to create a pseudo-random directory hierarchy filled with some number of files.
FTZZ File Tree Fuzzer allows you to create a pseudo-random directory hierarchy filled with some number of files. Installation $ cargo +nightly install
Number names is a Rust library to provide formatted string names for cardinal and ordinal numbers.
Number Names Number names is a Rust library to provide formatted string names for cardinal and ordinal numbers. At this time, only American English is
Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Fast and easy random number generation.
alea A zero-dependency crate for fast number generation, with a focus on ease of use (no more passing &mut rng everywhere!). The implementation is bas
a simple compiled language i made in rust. it uses intermediate representation (IR) instead of an abstract syntax tree (AST).
a simple compiled language i made in rust. it uses intermediate representation (IR) instead of an abstract syntax tree (AST).
Calculate primes since the first number until the 10001th
find_prime Explaining this code: find_prime is a function that takes the nth index to be calculated. Note that this nth does not follow the array conv
A bit-packed k-mer representation (and relevant utilities) for rust
K-mer class for rust The purpose of this repository is to build a simple library that exposes a bit-packed k-mer class for use in rust-based bioinform
A number of collections, such as linked-lists, binary-trees, or B-Trees are most easily implemented with aliasing pointers.
StaticRc is a safe reference-counted pointer, similar to Rc or Arc, though performing its reference-counting at compile-time rather than run-time, and