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

Add tasks for all the new languages

Browse source
This commit is contained in:
Tina Müller 2016-12-05 23:44:36 +01:00
parent 9dc3c2bb62
commit bba7bfd280
13208 changed files with 134745 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

3
Task/Parallel-calculations/Oforth/parallel-calculations.oforth Normal file
View file

@ -0,0 +1,3 @@
import: parallel
: largeMinFactor dup mapParallel(#factors) zip maxFor(#[ second first ]) ;

13
Task/Parallel-calculations/SequenceL/parallel-calculations-1.sequencel Normal file
View file

@ -0,0 +1,13 @@
import <Utilities/Conversion.sl>;
import <Utilities/Math.sl>;
import <Utilities/Sequence.sl>;
main(args(2)) :=
let
inputs := stringToInt(args);
factored := primeFactorization(inputs);
minFactors := vectorMin(factored);
indexOfMax := firstIndexOf(minFactors, vectorMax(minFactors));
in
"Number " ++ intToString(inputs[indexOfMax]) ++ " has largest minimal factor:\n" ++ delimit(intToString(factored[indexOfMax]), ' ');

1
Task/Parallel-calculations/SequenceL/parallel-calculations-2.sequencel Normal file
View file

@ -0,0 +1 @@
factored := primeFactorization(inputs);

5
Task/Parallel-calculations/Sidef/parallel-calculations.sidef Normal file
View file

@ -0,0 +1,5 @@
var nums = [1275792312878611, 12345678915808973,
1578070919762253, 14700694496703910,];
var factors = nums.map {|n| prime_factors.ffork(n) }.map { .wait }
say ((nums ~Z factors)->max_by {|m| m[1][0] })