TODO lib

[MaisaMilena]

Bits

• [x] Bits.add - Bukzor
• [ ] Bits.sub
• [x] Bits.mul - jonathanrlouie
• [ ] Bits.div
• [ ] Bits.mod
• [ ] Bits.pow

Hint By just googling "binary addition" (or multiplication, division) etc. we can find some simple algorithms

Word

• [ ] Word.mul
• [ ] Word.div
• [ ] Word.mod
• [ ] Word.pow
• [ ] Word.shift_left
• [ ] Word.shift_right
• [ ] Word.add.aux
• [ ] Word.or

F64

• [ ] F64.add
• [ ] F64.mul
• [ ] F64.div
• [ ] F64.mod
• [ ] F64.pow
• [ ] F64.cmp
• [ ] F64.exp
• [ ] F64.log
• [ ] F64.max
• [ ] F64.min
• [ ] F64.exp
• [ ] F64.parse
• [ ] F64.sin
• [ ] F64.tan
• [ ] F64.to_u32

Pos32

• [ ] Pos32.to_v3
• [x] Pos32.dot - jonathanrlouie

String

• [ ] String.to_lower_case
• [ ] String.to_upper_case
• [ ] String.replace

  Others

• [ ] U32.show
• [ ] Buffer32.parse_hex

[jonathanrlouie]

I'll try implementing Pos32.dot

[jonathanrlouie]

I'd like to try implementing Bits.mul as well.

[jonathanrlouie]

I'd like to try implementing Bits.sub, Bits.div and Bits.mod, but I have a couple of questions about how that should be done:

1. What is the expected behavior for Bits.sub(a, b) when b > a?

2. What is the expected behavior for Bits.div(a, b)/Bits.mod(a, b) when b is zero?

EDIT: It seems to be common to return 0 in all these cases, so that's how I'm implementing them.

[MaisaMilena]

Moved to Formality repo