aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

September 2017 Update

Browse source
This commit is contained in:
Ingy döt Net 2017-09-23 10:01:46 +02:00
parent bba7bfd280
commit ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
Download patch file Download diff file Expand all files Collapse all files

239
Task/Zeckendorf-arithmetic/Elena/zeckendorf-arithmetic.elena Normal file
View file

@ -0,0 +1,239 @@
import extensions.
const dig = ("00","01","10").
const dig1 = ("","1","10").
sealed struct ZeckendorfNumber :: BaseNumber
{
int dVal.
int dLen.
clone
= ZeckendorfNumber $new(dVal,dLen).
stacksafe explicit n(LiteralValue s)
[
int i := s length - 1.
int q := 1.
dLen := i / 2.
dVal := 0.
while (i >= 0)
[
dVal += ((intConvertor convert(s[i]) - 48) * q).
q *= 2.
i -= 1.
].
]
stacksafe $readContent vint:val vint:len
[
val int := dVal.
len int := dLen.
]
sealed $a(IntNumber n)
[
int i := n.
while (true)
[
if (dLen < i)
[
dLen := i.
].
((dVal >> (i * 2)) && 3) =>
0 [ ^ $self ];
1 [ ^ $self ];
2 [
ifnot ((dVal >> ((i + 1) * 2)) allMask:1)
[
^ $self.
].
dVal += (1 << (i*2 + 1)).
^ $self.
];
3 [
dVal := dVal && ((3 << i*2) inverted).
$self $b((i+1)*2).
].
i += 1.
].
]
inc
[
dVal += 1.
$self $a(0).
]
$b(IntNumber pos)
[
if (pos == 0) [ ^ $self inc ].
ifnot((dVal >> pos) allMask:1)
[
dVal += (1 << pos).
$self $a(pos / 2).
if (pos > 1) [ $self $a((pos / 2) - 1) ]
];
[
dVal := dVal && (1 << pos) inverted.
$self $b(pos + 1).
$self $b(pos - (pos > 1) iif(2,1)).
].
]
$c(IntNumber pos)
[
if ((dVal >> pos) allMask:1)
[
dVal := dVal && (1 << pos) inverted.
^ $self
].
$self $c(pos + 1).
if (pos > 0)
[
$self $b(pos - 1).
];
[
$self inc.
]
]
constructor $sum(ZeckendorfNumber n, ZeckendorfNumber m)
[
int mVal := 0.
int mLen := 0.
n $readContent vint:dVal vint:dLen.
m $readContent vint:mVal vint:mLen.
0 till((mLen + 1) * 2) do(:GN)
[
if (mVal shiftRight:GN; allMask:1)
[
$self $b(GN).
].
].
]
constructor $difference(ZeckendorfNumber n, ZeckendorfNumber m)
[
int mVal := 0.
int mLen := 0.
n $readContent vint:dVal vint:dLen.
m $readContent vint:mVal vint:mLen.
0 till((mLen + 1) * 2) do(:GN)
[
if (mVal shiftRight:GN; allMask:1)
[
$self $c(GN).
].
].
while ((((dVal >> (dLen*2)) && 3) == 0) || (dLen == 0))
[
dLen -= 1.
].
]
constructor $product(ZeckendorfNumber n, ZeckendorfNumber m)
[
n $readContent vint:dVal vint:dLen.
var Na := m.
var Nb := m.
var Nr := 0n.
var Nt := 0n.
0 to((dLen + 1) * 2) do(:i)
[
if (((dVal shiftRight:i) && 1) > 0)
[
Nr += Nb
].
Nt := Nb.
Nb += Na.
Na := Nt.
].
Nr $readContent vint:dVal vint:dLen.
]
constructor $new(IntNumber v, IntNumber l)
[
dVal := v.
dLen := l.
]
literal
[
if (dVal == 0)
[ ^ "0". ].
literal s := dig1[(dVal >> (dLen * 2)) && 3].
int i := dLen - 1.
while (i >= 0)
[
s := s + dig[(dVal >> (i * 2)) && 3].
i-=1
].
^ s.
]
add(ZeckendorfNumber n)
= ZeckendorfNumber $sum($self, n).
subtract(ZeckendorfNumber n)
= ZeckendorfNumber $difference($self, n).
multiply(ZeckendorfNumber n)
= ZeckendorfNumber $product($self, n).
}
program =
[
console printLine("Addition:").
var n := 10n.
n += 10n.
console printLine(n).
n += 10n.
console printLine(n).
n += 1001n.
console printLine(n).
n += 1000n.
console printLine(n).
n += 10101n.
console printLine(n).
console printLine("Subtraction:").
n := 1000n.
n -= 101n.
console printLine(n).
n := 10101010n.
n -= 1010101n.
console printLine(n).
console printLine("Multiplication:").
n := 1001n.
n *= 101n.
console printLine(n).
n := 101010n.
n += 101n.
console printLine(n).
].