Packages

nstandard

0.5.0
0.5.0 0.4.0 0.3.0 0.2.0 0.1.1

A standard library setup based on the Nerves project standard practices.

HexDocs HexPreview

Current section

21 Dependants

Jump to
Readme
5 Versions
5 Dependencies
21 Dependants
Activity

Packages depending on nstandard

21 packages
  • a_k_s_primality_test v1.1.1 requires ~> 0.1

    A pure Elixir implementation of the AKS (Agrawal-Kayal-Saxena) primality test algorithm.

    Updated 11 months ago

    45 320
    recent downloads
  • confuse v0.4.0 requires ~> 0.1

    Configuration parser for libconfuse style config files.

    Updated 1 month ago

    2 334
    recent downloads
  • entrace v0.2.0 requires ~> 0.2

    Easy tracing on the BEAM with Elixir

    Updated 3 months ago

    1 550
    recent downloads
  • epmd_up v1.0.5 requires ~> 0.1

    EpmdUp: A simple Elixir module to check and manage the Erlang Port Mapper Daemon (epmd).

    Updated 8 months ago

    352
    recent downloads
  • get_host v1.0.2 requires ~> 0.1

    GetHost: A cross-platform Elixir library for retrieving the fully qualified hostname of a system.

    Updated 11 months ago

    259
    recent downloads
  • node_activator v1.1.2 requires ~> 0.1

    A module to activate VM nodes.

    Updated 11 months ago

    134
    recent downloads
  • sv_port_sim v0.2.0 requires ~> 0.3

    SvPortSim: Elixir interface for driving Verilated SystemVerilog modules through Ports, with each simulation instance managed as a GenServer.

    Updated 2 weeks ago

    85
    recent downloads
  • lehmer_gcd v1.0.2 requires ~> 0.1

    An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.

    Updated 11 months ago

    75
    recent downloads
  • binary_extended_gcd v1.0.1 requires ~> 0.1

    A fast implementation of the binary extended GCD algorithm for Elixir.

    Updated 11 months ago

    59
    recent downloads
  • binary_gcd v1.1.0 requires ~> 0.1

    An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations...

    Updated 11 months ago

    56
    recent downloads
  • fwup_delta v0.2.0 requires ~> 0.1

    A library for generating delta firmware compatible with fwup

    Updated 3 months ago

    49
    recent downloads
  • modular_inverse v1.0.1 requires ~> 0.1

    A fast and efficient Elixir library for calculating modular multiplicative inverses.

    Updated 11 months ago

    48
    recent downloads
  • prime_factorization v1.1.0 requires ~> 0.1

    A fast and efficient Elixir library for prime factorization of integers.

    Updated 11 months ago

    40
    recent downloads
  • montgomery_reduction v1.0.1 requires ~> 0.1

    A high-performance Elixir library for efficient modular arithmetic using Montgomery reduction.

    Updated 11 months ago

    39
    recent downloads
  • trailing_zeros v1.0.1 requires ~> 0.1

    A fast and efficient Elixir library for counting trailing zeros in the binary representation of integers.

    Updated 11 months ago

    38
    recent downloads
  • common_twos v1.0.0 requires ~> 0.1

    A utility library for finding common factors of 2 between two numbers using efficient bitwise operations.

    Updated 11 months ago

    32
    recent downloads
  • binary_lehmer_gcd v1.0.0 requires ~> 0.1

    A high-performance implementation of the greatest common divisor (GCD) algorithm that combines binary GCD with Lehmer's algorithm for optimal performance on large integers.

    Updated 11 months ago

    31
    recent downloads
  • bit_length v1.0.0 requires ~> 0.1

    A utility library for calculating the bit length of integers in Elixir.

    Updated 11 months ago

    31
    recent downloads
  • crandall_reduction v1.0.0 requires ~> 0.1

    A pure Elixir implementation of the Crandall reduction algorithm for efficient modular arithmetic.

    Updated 11 months ago

    29
    recent downloads
  • perfect_power v1.0.0 requires ~> 0.1

    A mathematical library for detecting perfect powers in Elixir.

    Updated 11 months ago

    25
    recent downloads
  • fermat_primality_test v1.0.0 requires ~> 0.1

    A probabilistic primality test implementation in Elixir based on Fermat's Little Theorem.

    Updated 11 months ago

    25
    recent downloads
21 packages of 21 total

Checksum

Dependency Config

mix.exs

rebar.config

Gleam

erlang.mk

Package Details

Downloads Last 30 days, all versions
0 50 100 150 200

this version

1 501

yesterday

6

last 7 days

239

all time

11 793

Last Updated

May 13, 2026

License

Apache-2.0

Build Tools

mix

Publisher

lawik lawik

Links

Owners