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

Data update

Browse source
This commit is contained in:
Ingy döt Net 2024-03-06 22:25:12 -08:00
parent ed705008a8
commit 0df55f9f24
2196 changed files with 32999 additions and 3075 deletions
Download patch file Download diff file Expand all files Collapse all files

24
Task/Twelve-statements/Elena/twelve-statements.elena
View file

@ -6,7 +6,7 @@ extension op
{
printSolution(bits)
= self.zipBy(bits,
(s,b => s.iif("T","F") + (s.xor:b).iif("* "," "))).summarize(new StringWriter());
(s,b => s.iif("T","F") + (s.xor(b)).iif("* "," "))).summarize(new StringWriter());
toBit()
= self.iif(1,0);
@ -16,46 +16,46 @@ puzzle = new Func1[]
{
(bits => bits.Length == 12),
(bits => bits.last(6).selectBy:(x => x.toBit()).summarize() == 3 ),
(bits => bits.last(6).selectBy::(x => x.toBit()).summarize() == 3 ),
(bits => bits.zipBy(new Range(1, 12),
(x,i => (i.toInt().isEven()).and:x.toBit())).summarize() == 2 ),
(x,i => (i.toInt().isEven()).and(x).toBit())).summarize() == 2 ),
(bits => bits[4].iif(bits[5] && bits[6],true) ),
(bits => ((bits[1] || bits[2]) || bits[3]).Inverted ),
(bits => bits.zipBy(new Range(1, 12),
(x,i => (i.toInt().isOdd()).and:x.toBit() )).summarize() == 4 ),
(x,i => (i.toInt().isOdd()).and(x).toBit() )).summarize() == 4 ),
(bits => bits[1].xor(bits[2]) ),
(bits => bits[6].iif(bits[5] && bits[4],true) ),
(bits => bits.top(6).selectBy:(x => x.toBit() ).summarize() == 3 ),
(bits => bits.top(6).selectBy::(x => x.toBit() ).summarize() == 3 ),
(bits => bits[10] && bits[11] ),
(bits => (bits[6].toBit() + bits[7].toBit() + bits[8].toBit())==1 ),
(bits => bits.top(11).selectBy:(x => x.toBit()).summarize() == 4 )
(bits => bits.top(11).selectBy::(x => x.toBit()).summarize() == 4 )
};
public program()
{
console.writeLine();
for(int n := 0, n < 2.power(12), n += 1)
for(int n := 0; n < 2.power(12); n += 1)
{
var bits := BitArray32.load(n).top(12).toArray();
var results := puzzle.selectBy:(r => r(bits)).toArray();
var results := puzzle.selectBy::(r => r(bits)).toArray();
var counts := bits.zipBy(results, (b,r => b.xor:r.toBit() )).summarize();
var counts := bits.zipBy(results, (b,r => b.xor(r).toBit() )).summarize();
counts =>
0 { console.printLine("Total hit :",results.printSolution:bits) }
1 { console.printLine("Near miss :",results.printSolution:bits) }
12 { console.printLine("Total miss:",results.printSolution:bits) };
0 { console.printLine("Total hit :",results.printSolution(bits)) }
1 { console.printLine("Near miss :",results.printSolution(bits)) }
12 { console.printLine("Total miss:",results.printSolution(bits)) };
};
console.readChar()

2
Task/Twelve-statements/Wren/twelve-statements.wren
View file

@ -1,4 +1,4 @@
import "/fmt" for Conv, Fmt
import "./fmt" for Conv, Fmt
var predicates = [
Fn.new { |s| s.count == 13 }, // indexing starts at 0 but first bit ignored