Here‘s a thought: occasionally, I‘ll post an answer/question which I think deserves more attention than it actually gets. With the Best of 2020 coming up, thoughts on a „Underappreciated Post“ category? If I get support, I’ll post an answer to the (future/eventual) Best Of categories post
i thought i fuckin owned star 2 because i literally just had to change a | to an & but then 1. I realized I'd have to start with something nonempty 2. ?????
I don;t know why document.body.textContent.split("\n\n").map(l=>[...new Set(l)].filter(x=>l.split("\n").every(p=>p.includes(x))).length).reduce((a,b)=>a+b,0) doesn't work :(
My code was document.body.textContent.split("\n\n").map(l=>[...new Set(l)].filter(x=>l.split("\n").every(p=>p.includes(x))).length).reduce((a,b)=>a+b,0)
because if i'd just foldl1'ed by union instead of doing a for loop thing the only problem would be my retarded input code and not having to initialize the accumulator
i don't even know what the function signatures are in python's functools lmao
Javascript is like a bunch of people wanted to make a programming language but they didn't share any common goals or philosophies, but they all pushed the code to the same repository and made it work somehow
Trying to golf part1 of day 6 advent of code in bash. Any suggestions to improve: awk -v RS= '{$1=$1}1' | while read x; do <<<"$x" fold -w1 | sort -u | grep -v ' ' | wc -l; done | paste -sd+ | bc?
Yeah I don't care about that. I'd like a way to avoid that while read loop. Basically the cumbersomeness stems from the unix uniq tools being line-oriented.
I could probably also cram together a pure awk procedural solution that shorter than the above but that's not really in the spirit of what I'm trying to do, which is chain together simple commands to get the final result.
@Jonah instead of calculating the sum, you can just put wc -l outside the loop. And not sure if better, but I like xargs instead of while read. Latter gives me headaches. awk -v RS= '{$1=$1}1' | xargs -I {} sh -c 'echo -n {} | fold -w1 | sort -u' | wc -l
The shortest code to pass all possibilities wins.
In mathematics, the persistence of a number measures how many times a certain operation must be applied to its digits until some certain fixed condition is reached. You can determine the additive persistence of a positive integer by adding the d...
I'll wait a few days to start the bounty, that way you can let me know if a different answer would be a better demonstration of the language (or if this one's fine)
Looks like a pretty neat language, and the animation is really interesting
@Neil Thanks. I like using fmt instead of awk for the first step a lot.
@xash I like the xargs idea too. To make i work I had to make the following adjustment to remove the "sort of blank" lines before the wc step: awk -v RS= '{$1=$1}1' | xargs -I xx sh -c 'echo xx | fold -w1 | sort -u' | sed '/^\s*$/d' | wc -l
Quite new to this, I've got this small code I'd like to be able to execute in bash and php.
#!/bin/bash
<<a
<?php
$sqldb = "one";
$sqluser = "two";
$sqlpass = "three";
/*
a
sqldb="one"
sqluser="two"
sqlpass="three"
return 0
*/
?>
It works in bash if sourced (return), but I can't se...
Quite new to this, I've got this small code I'd like to be able to execute in bash and php.
#!/bin/bash
<<a
<?php
$sqldb = "one";
$sqluser = "two";
$sqlpass = "three";
/*
a
sqldb="one"
sqluser="two"
sqlpass="three"
return 0
*/
?>
It works in bash if sourced (return), but I can't se...
