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

June 2018 Update

Browse source
This commit is contained in:
Ingy döt Net 2018-06-22 20:57:24 +00:00
parent ba8067c3b7
commit 22f33d4004
5278 changed files with 84726 additions and 14379 deletions
Download patch file Download diff file Expand all files Collapse all files

92
Task/Amb/Julia/amb.julia
View file

@ -2,51 +2,55 @@
# arbitrary number of iterable objects and returns the first solution found as an array
# this function is in essence an iterative backtracking solver
function amb(failure,objs...)
n=length(objs)
if n==1 return end
states=cell(n)
values=cell(n)
# starting point, we put down the first value from the first iterable object
states[1]=start(objs[1])
values[1],states[1]=next(objs[1],states[1])
i=1
# main solver loop
while true
# test for failure
if i>1&&failure(values[i-1],values[i])
# loop for generating a new value upon failure
# in fact this would be way more readable using goto, but Julia doesn't seem to have that :(
while true
# if we failed, we must generate a new value, but first we must check whether there is any
if done(objs[i],states[i])
# backtracking step with sanity check in case we ran out of values from the current generator
if i==1 return else i-=1; continue end
else
# if there is indeed a new value, generate it
values[i],states[i]=next(objs[i],states[i])
break
end
end
else
# no failure branch
# if solution is ready (i.e. all generators are used) just return it
if i==n return values end
# else start up the next generator
i+=1
states[i]=start(objs[i])
values[i],states[i]=next(objs[i],states[i])
end
end
function amb(failure, itrs...)
n = length(itrs)
if n == 1 return end
states = Vector(n)
values = Vector(n)
# starting point, we put down the first value from the first iterable object
states[1] = start(itrs[1])
values[1], states[1] = next(itrs[1], states[1])
i = 1
# main solver loop
while true
# test for failure
if i > 1 && failure(values[i-1], values[i])
# loop for generating a new value upon failure
# in fact this would be way more readable using goto, but Julia doesn't seem to have that :(
while true
# if we failed, we must generate a new value, but first we must check whether there is any
if done(itrs[i], states[i])
# backtracking step with sanity check in case we ran out of values from the current generator
if i == 1
return
else
i -= 1
continue
end
else
# if there is indeed a new value, generate it
values[i], states[i] = next(itrs[i], states[i])
break
end
end
else
# no failure branch
# if solution is ready (i.e. all generators are used) just return it
if i == n return values end
# else start up the next generator
i += 1
states[i] = start(itrs[i])
values[i], states[i] = next(itrs[i], states[i])
end
end
end
# Call our generic AMB function according to the task description and
# form the solution sentence from the returned array of words
println(join(amb(
(s1,s2)->s1[end]!=s2[1],
["the","that","a"],
["frog","elephant","thing"],
["walked","treaded","grows"],
["slowly","quickly"]
)," "))
amb((s1,s2) -> s1[end] != s2[1], # failure function
["the", "that", "a"],
["frog", "elephant", "thing"],
["walked", "treaded", "grows"],
["slowly", "quickly"]) |>
x -> join(x, " ") |>
println