Add Iso for Int and List of digits.

[NightRa]

Add Iso for Int and List of digits.

[julien-truffaut]

good idea, it should be something like:
digits[T : Bits]: Iso[T, List[T]]
digits.get(3) == List(0, 0, ...., 1, 1)
digits.modify(1, reverse) == ~1

[NightRa]

It could be done for any base.
Both base 2 and base 10 would be useful.

[julien-truffaut]

or any base from 2 to 36 like http://hackage.haskell.org/package/lens-4.1.2/docs/Numeric-Lens.html

[NightRa]

@julien-truffaut Or any supplied base.
We could at first make a an iso to a list of divisors:
For example base 16 would have numbers in the range [0..15] in the list, and then map them accordingly to some sequence.

[julien-truffaut]

right, if someone provide all values of a base then it is easy to make the mapping

[NightRa]

Oh I thought of a problem: We need to have an Iso between Int and a list of digits, not represented directly by ints.
If we had dependant types...

[julien-truffaut]

we probably want to create an Iso between a List of digits and a BigInt then we can create a Prism between BigInt and Int

[NightRa]

@julien-truffaut Well we could generalize such things efficiently with Spire...

[NightRa]

BTW, I started working on this.

[NightRa]

We could generalize the number parsing with Abilian Group too.

[julien-truffaut]

From the recent activity on this ticket, I suppose no one is really interested by it. So I propose we close this issue.