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

Another update from ingydotnet^djgoku

Browse source
This commit is contained in:
Ingy döt Net 2015-11-18 06:14:39 +00:00
parent 91df62d461
commit 948b86eafa
7604 changed files with 108452 additions and 22726 deletions
Download patch file Download diff file Expand all files Collapse all files

184
Task/Topswops/Eiffel/topswops-1.e
View file

@ -1,109 +1,111 @@
class
TOPSWOPS
create
make
feature
make(n: INTEGER)
local
perm,ar: ARRAY[INTEGER]
i,j,k, tcount, count: INTEGER
do
create perm_sol.make_empty
create solution.make_empty
from j:= 1
until j> n
loop
create ar.make_filled (0, 1, j)
from
k:=1
until
k>j
loop
ar[k]:=k
k:= k+1
end
permute(ar, 1)
from
i:= 1
until
i> perm_sol.count
loop
tcount:= 0
from
until
perm_sol.at (i).at (1)=1
feature
make (n: INTEGER)
-- Topswop game.
local
perm, ar: ARRAY [INTEGER]
tcount, count: INTEGER
do
create perm_sol.make_empty
create solution.make_empty
across
1 |..| n as c
loop
perm_sol.at(i):=reverse_array(perm_sol.at(i))
tcount:= tcount+1
create ar.make_filled (0, 1, c.item)
across
1 |..| c.item as d
loop
ar [d.item] := d.item
end
permute (ar, 1)
across
1 |..| perm_sol.count as e
loop
tcount := 0
from
until
perm_sol.at (e.item).at (1) = 1
loop
perm_sol.at (e.item) := reverse_array (perm_sol.at (e.item))
tcount := tcount + 1
end
if tcount > count then
count := tcount
end
end
solution.force (count, c.item)
end
if tcount>count then
count:= tcount
end
i:= i+1
end
solution.force(count, j)
j:=j+1
end
end
solution: ARRAY[INTEGER]
solution: ARRAY [INTEGER]
feature {NONE}
perm_sol: ARRAY[ARRAY[INTEGER]]
reverse_array(ar:ARRAY[INTEGER]):ARRAY[INTEGER]
require
ar_not_void: ar /= void
local
i,j:INTEGER
new_array: ARRAY[INTEGER]
do
create new_array.make_empty
new_array.copy(ar)
perm_sol: ARRAY [ARRAY [INTEGER]]
reverse_array (ar: ARRAY [INTEGER]): ARRAY [INTEGER]
-- Array with 'ar[1]' elements reversed.
require
ar_not_void: ar /= Void
local
i, j: INTEGER
do
create Result.make_empty
Result.deep_copy (ar)
from
i:= 1
j:=ar[1]
i := 1
j := ar [1]
until
i>j
i > j
loop
new_array[i]:=ar[j]
new_array[j]:=ar[i]
i:=i+1
j:=j-1
Result [i] := ar [j]
Result [j] := ar [i]
i := i + 1
j := j - 1
end
Result:= new_array
ensure
same_length: ar.count = Result.count
end
permute(a: ARRAY[INTEGER]; k: INTEGER)
require
ar_not_void: a.count>=1
k_valid_index: k>0
local
i,t: INTEGER
temp: ARRAY[INTEGER]
do
create temp.make_empty
if k=a.count then
across a as ar loop temp.force (ar.item, temp.count+1) end
perm_sol.force(temp, perm_sol.count+1)
else
from
i:= k
until
i> a.count
loop
t:= a[k]
a[k]:= a[i]
a[i]:= t
permute(a,k+1)
t:= a[k]
a[k]:= a[i]
a[i]:= t
i:= i+1
same_elements: across ar as a all Result.has (a.item) end
end
end
end
permute (a: ARRAY [INTEGER]; k: INTEGER)
-- All permutations of array 'a' stored in perm_sol.
require
ar_not_void: a.count >= 1
k_valid_index: k > 0
local
i, t: INTEGER
temp: ARRAY [INTEGER]
do
create temp.make_empty
if k = a.count then
across
a as ar
loop
temp.force (ar.item, temp.count + 1)
end
perm_sol.force (temp, perm_sol.count + 1)
else
from
i := k
until
i > a.count
loop
t := a [k]
a [k] := a [i]
a [i] := t
permute (a, k + 1)
t := a [k]
a [k] := a [i]
a [i] := t
i := i + 1
end
end
end
end

25
Task/Topswops/Eiffel/topswops-2.e
View file

@ -1,14 +1,21 @@
class
APPLICATION
inherit
ARGUMENTS
create
make
feature
make
do
create ts.make (10)
across ts.solution as t loop io.put_string (t.item.out+"%N") end
end
ts: TOPSWOPS
feature
make
do
create topswop.make (10)
across
topswop.solution as t
loop
io.put_string (t.item.out + "%N")
end
end
topswop: TOPSWOPS
end