npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

tritwise

v1.0.0

Published

tritwise operations

Downloads

15

Readme

tritwise

Tritwise operations

var tritwise = require('tritwise');

Operates on each trit (base 3 digit) of the inputs, in balanced ternary notation.

The width of the "tryte" (analogous to byte) is set in tritwise.tryte_size, and defaults to 5 trits.

Unary (1-input) operations:

a NTI(a) STI(a) PTI(a) FD(a) RD(a)
i   1     1      1      0     i
0   i     0      1      0     0
1   i     i      i      1     0

Simple ternary inverter (STI) inverts 1/i and keeps 0, negative/positive ternary inverter (NTI and PTI) replace 0 with i or 1. FD and RD are forward and reverse diodes, only allowing 1 or i and replacing all others with 0. Other unary operations are possible but STI is the most analogous to binary (base 2) invert (NOT), in that it negates the sign of the value, and flips all the trits:

tritwise.STI(33);   // -33
tritwise.STI(-33);  // 33
tritwise.PTI(-8);   // 119
tritwise.FD(107);   // 108

Dyadic (2-input) operations:

TOR(a,b)  prefers 1,0,i (maximum)
TAND(a,b) prefers i,0,1 (minimum)
BUT(a,b)  prefers 0,i,1

TOR and TAND are comparable to binary base-2 OR and AND. Binary OR and AND "prefer" 1,0 or 0,1 from the bitwise inputs, respectively; similarly, TOR and TAND prefer 1,0,i or i,0,1, respectively. The output trits always match either of the two inputs. In situations where zero is preferred, the BUT function can be used to prefer 0,i,1.

References: Ternary computing Testebed: 3-Trit Computer Architecture, Appendix A, Section 4 "Dyadic Functions"