« first day (1819 days earlier)      last day (3026 days later) » 

4:00 AM
3 mins ago, by quintopia
does this quote from quartata imply that he successfully found his limit?
> quartata...found his limit
I'm not sorry
 
lol
I hate this
 
@Calvin'sHobbies I missed you
 
I still don't understand why Drupal SE is such a spam magnet
 
Waht?
 
3 mins ago, by quintopia
> does this quote from quartata imply that he successfully found his limit?
 
Just reading Charcoal HQ transcript
 
lol
\o/
|O|
bai now
 
0
A: Sandbox for Proposed Challenges

mbomb007Cops and Robbers: Create/Escape Jail cops-and-robbers (Other name suggestions are welcome, probably relating to great escape movies or w/e, like The Italian Job, or Mission Impossible.) Based on this answer and comment from the Make Your Language Unusable challenge. Cops: (possible hastily-m...

 
4:08 AM
@RikerW What do you like about it?
 
Anonymous
@Dennis You remember how you were talking about wanting a Python port of shoco?
 
I do.
 
Anonymous
I did a thing
 
Cool!
s/pyshoco/psycho/
 
Anonymous
4:17 AM
It's kind of inefficient with memory, since i opted to make sure the output buffer was large enough for 2x the input plus a null terminator
 
PsychoPy is already a thing.
 
@Mego I saw that and thought "Mego's name is Ed von Schleck? Huh."
 
Anonymous
Which is mostly unnecessary for input and sometimes useful for output
 
@El'endiaStarman Of course it is.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ molarmanful.github.io/ESMin/…
Nothing happened just then.
 
4:21 AM
[views history of each deleted message]
 
@quartata \o/ safe!
 
@ՊՓԼՃՐՊՃՈԲՍԼ One more reason not to use Firefox.
 
Engraved elbereth on the up stair, then escaped from minetown.
 
@Dennis If you used a potato computer, you'd have no complaints.
 
Also made a string of elbereth's leading to/from the stairs for easy up/down.
Safe now!
@El'endiaStarman The first letter - word type thing especially.
 
4:24 AM
nice
 
Anonymous
Now I just need to add shoco to Seriously :P
 
@Mego No use LZString.
Better results :)
 
@RikerW I have no idea what you could be playing. Elbereth makes me think of Lord of the Rings, but minetown makes me think of Minecraft, but you can't engrave things on stairs in Minecraft...
 
ESMin uses LZString and shoco, and that works out fine, right?
 
nethack
 
4:25 AM
petjack
 
@quartata That was my next guess, but wasn't sure.
 
engraving elbereth make intelligent monsters that can see stay way from that tile
that behavior is a compile flag but it is on by default
 
@ETHproductions You really need to add empty arrays.
 
Japt has empty arrays, but not [0,1,2][1] syntax
 
4:29 AM
@RikerW Yeah. I lost motivation to continue expanding the vocabulary when I realized that 1) it's kinda hard to make compound words, 2) there's not as much precision, not like English, and 3) I easily run out of simple syllables before I cover simple concepts. The last one, especially, is one I'd like to fix by utilizing a computer program somehow to pick out the best base words, the most often used, to start with.
 
golfier code and output
 
If you're going for golfy: ethproductions.github.io/…
7 bytes. Beat that.
 
im gone for an hour....
 
@GamrCorps What convoluted old version of the userscript is that? :P
 
golfbabby
 
4:35 AM
@ETHproductions theres an updated version?
 
@GamrCorps You haven't heard about it? Awesome, you're one of today's lucky 10,000.
 
@El'endiaStarman I wouldn't mind helping, but I can't help too much cause busyness.
If you want I mean.
 
that is Conor's userscript
 
^ Yup.
 
4:36 AM
@ETHproductions Hey, I got mentioned! :P
 
I also use it because the main site design is wayyy better, too bad he never fixed that header bug
 
@ETHproductions thanks, Good to know that an updated version is up!
 
@GamrCorps np
 
7 chars.
And you can't even read it.
 
Bai guys for bedtime!
:P
 
4:38 AM
What if I make a language where the empty program is "Hello, World!", unless an integer is input, then it's a primality test, unless the integer is 0 or 1, then it's a truth machine?
 
And reading the Simarillion.
 
@ETHproductions That wouldn't be very useful.
 
@ՊՓԼՃՐՊՃՈԲՍԼ Well there'd be more to the language :P
 
Add it to Japt.
(Just don't submit it as answers to catalogs...)
 
Yeah, duh
Ooh, ooh, empty program is a rickroll
 
4:40 AM
@ETHproductions wow.
 
@ETHproductions you might want to tell them that the favicon for chat is broken
 
@GamrCorps Yep, I've noticed that. I need to go to bed as well though, so I'll look into it tomorrow
 
@ETHproductions who would I tell about that? I fixed it in the old userscript as well
 
@GamrCorps Me, @ՊՓԼՃՐՊՃՈԲՍԼ, and @Doᴡɴɢᴏᴀᴛ are pretty much the owners of the project
 
Ok, Ill just write up the solution and post it in the graduation design chat then
 
4:42 AM
@GamrCorps Ooh, u haz fix? plz pull request
 
5 hours ago, by quartata
Lesson learned: if you've been poisoned, just drink two six-packs of beer and you'll be OK
I meant this quote of course
 
hic
 
@GamrCorps Yeah, if you haz GitHub, you can just do it there, but the chatroom is fine azwell
 
@quartata did you clean up the mess
 
@ETHproductions kk
 
4:44 AM
k, goodnight
 
night
 
Anonymous
Making distutils do the work >>> makefiles
 
@Mego hi whats up
 
@Mego hi whats up
 
@Mego ya oughta delete seriously herokuapp, and just make TIO the official online version. it works better :D
 
4:56 AM
OK seriously why does Drupal SE get so much spam
At this rate I am going to get Deputy there
 
Wow. Downvotes
-263
Q: A New Code License: The MIT, this time with Attribution Required

samthebrandUpdate: January 15, 2016 Thank you for your candidness, patience and feedback. We're going to delay the implementation for now - we'll be back soon to open some more discussions. Important context for those arriving from reddit and slashdot links: The status quo is not "public domain"; a...

I think this is an improvement over last month's new license proposal, but I still downvoted
 
5:14 AM
@trichoplax Had you not seen that? It's probably one of the most downvoted posts in the history of SE. :P
 
0
A: Sandbox for Proposed Challenges

DoᴡɴɢᴏᴀᴛI'm still working on this, I'm sandboxing this to get my ideas down but I still need to add all the test cases and all. What's the Language? code-challenge test-battery Recently, the PPCG design leaderboard has been having some trouble parsing answer headers. In this challenge you'll be ta...

 
I love the title of this one:
28
Q: Why do I get one extra wrong solution?

TheLogicGuyI'm trying to solve this equation: $$2-x=-\sqrt{x}$$ Multiply by (-1): $$\sqrt{x}=x-2$$ power of 2: $$x=\left(x-2\right)^2$$ then: $$x^2-5x+4=0$$ and that means: $$x=1, x=4$$ But $1$ is not a correect solution to the original equation. Why have I got it? I've never got a wrong solution to an e...

 
hey guys!
 
A very insightful thing. I would never take x >=2 seriously when I was in school. — user230452 yesterday
wtf does that mean
 
5:29 AM
It's an extra wrong comment.
 
:P
 
^^
 
Hey, I just realized I'm currently leading for 3 of the 4 open bounties.
 
good job....
your spoonerise words answer is so hard to further golf...i think it may be impossible...
I am almost fully given up so here it is again to anybody else who wants to golf it:
41
Q: Spoonerise words

xnorGiven two words, spoonerise them by switching their initial consonant clusters. Fewest bytes wins. plaster man -> master plan blushing crow -> crushing blow litigating more -> mitigating lore strong wrangler -> wrong strangler def ghi -> ghef di few years -> yew fears The consonants appearing ...

@Dennis how can you be leading for thr expand the number one? he can give it to anybody he wants...
 
I like pickles
3
 
5:35 AM
@Dennis I'll try Expand the Number.
 
I am stupid!
@ThomasKwa you know cjam?
autocorrect - "cjam" -> "cham"
 
@Dennis that is very interesting
 
^
 
@AlexA. ಠ_ಠ
 
Is me being stupid not interesting? good!
 
5:37 AM
@ThomasKwa No need to. :P
 
how about a straight number theoretic FFT code-golf challenge?
 
although I assume that is one command in mathematica :)
 
@Lembik What is a number theoretic fast Fourier transform?
We've had at least one FFT challenge so far if I'm not mistaken
 
@AlexA. It is the FFT over finite fields basically.. explained in detail at apfloat.org/ntt.html
 
5:41 AM
Hello!
 
6:02 AM
why is this old challenge suddenly getting answers?
18
Q: Calculating (3 + sqrt(5))^n exactly

orlpToday your goal is to find integers a and b given non-negative integer n such that: You should write a program or a function that takes parameter n and outputs a and b in a format of your choice. Standard loopholes apply. Additionally, it's intended that you implement the above problem using ...

got two today already
@Dennis ^
 
@RikerW I'm not planning on working on it anytime soon.
 
@orlp Three, actually. Alex edited his Julia answer, bumping the question to the front page.
 
6:57 AM
i don't really know what i expected with the spoonerise words bounty
i guess i thought python's regex library had a smaller feature set
well, congrats to dennis unless someone can whip something up
 
7:36 AM
@xnor You thought Python didn't have capturing groups?
 
@Dennis "This comment is not eligible for voting or flagging" when trying to vote on the Best of PPCG comments (because of the post being locked maybe?)
 
7:54 AM
@plannapus fixed
I can't pin a new chat message until tonight though
 
Thanks!
 
8:30 AM
1
Q: MarGolf Meets Langton's Anthill

busukxuanThis is Markov. Markov's golf ball rolls around randomly. Markov's ball will hole however he strikes it. Markov is smart. Be like Markov. And this: is an anthill in Langton's backyard. The anthill is big enough to hold Markov's golfball, MarGolf. However, the anthill moves and changes directio...

 
9:20 AM
they say you should write functions in your code
pros: less redundancy, more readable, more reusable
cons: after writing one function you have an excuse to procrastinate
 
 
1 hour later…
10:39 AM
@undergroundmonorail plus: it is a few chars shorter
minus: it needs a wrapper
 
 
2 hours later…
12:35 PM
in C I just learned that (n+1)%8 is very dangerous and potentially slow
is there a nice way to see the assembly created by this code?
for gcc, say
 
204
A: Using GCC to produce readable assembly?

Bastien LéonardIf you compile with debug symbols, you can use objdump to produce a more readable disassembly. >objdump --help [...] -S, --source Intermix source code with disassembly -l, --line-numbers Include line numbers and filenames in output Example: > gcc -g -c test.c > objdump -d ...

 
@Doorknob nice link!
 
Dangerous?
 
@feersum yes! If n is an unsigned int then n+1 is a signed int it seems
and can therefore overflow in horrible ways
 
No, it's the other way around.
If either is unsigned the result is unsigned.
 
12:38 PM
hmm. that would make much more sense!
the person who told me seemed very confident about it
what type is 1?
 
int
 
is that signed?
 
yes
 
and the sum definitely gets promoted to unsigned?
 
yes, if n is unsigned
 
12:42 PM
thanks.. I will go back to my source and complain :)
 
1:12 PM
"Installing update 3 of 245" ಠ_ಠ
I'm still installing requirements for the Intel compiler. 17h later...
 
1:33 PM
@mınxomaτ FTFY:
17 hours later...
 
@Mego Wow ... not sure what he's got against your language ... ;-)
4
Q: Accurate email syntax validation (no seriously)

SuperBiasedManSo a friend happened to show me how odd and specific the general email syntax rules are. For instance, emails can have "comments". Basically you can put characters in parentheses that are just ignored. So not only is it valid, email(this seems extremely redundant)@email.com is the same email as e...

 
We failed to travel into the future!
Okay, we're done with time travelling for today. :)
 
1:45 PM
@mınxomaτ ಠ__ಠ
 
Can we have a companion poll? Worst of PPCG 2015. Scored by downvotes instead of up, obviously.
 
Sure. What would the prizes be?
 
Are there prizes for the other one? o_O
I might have paid more attention to it if I knew there was swag involved.
Anyway, I'd suggest a goat for the "worst of" prize. If we have any lying around, that is.
 
@MartinBüttner did you learn Mathematica because of this site?
 
@Geobits @Doᴡɴɢᴏᴀᴛ may have some ;-)
 
2:57 PM
@Dennis Why @MartinBüttner did not say this in chat? Are you replacing him?
 
7 hours ago, by Martin Büttner
I can't pin a new chat message until tonight though
 
@Geobits @Doᴡɴɢᴏᴀᴛ can make a challenge about the prize laureats... wait, that's Calvin's Hobbies' job.
 
Also, excellent way of doing the voting. Who came up with that plan?
 
@TimmyD @Geobits, in the following message...
13 mins ago, by Geobits
Can we have a companion poll? Worst of PPCG 2015. Scored by downvotes instead of up, obviously.
@TimmyD Strange. I asked Dennis...
 
No, meaning put each nomination as a comment and score based on comment votes. Solves the issue of needing to re-post categories as each a new question on Meta.
 
3:01 PM
@Geobits A few people offered rep for some categories. Looks like only two of those categories made it though...
 
@TimmyD @Martin-- wait, that's Dennis' job.
 
@Dennis Huh. Maybe a goat is too much for the other, then. I'd take a goat over a bounty-prize any day.
 
Maybe a Downgoat. :P
 
@MartinBüttner the way you put up voting for Best Of has a flaw: you can see vote counts.
 
I see you've unmasked my clever pun >_>
 
3:03 PM
That's a big flaw.
 
It was meant to be that and a tie to Monty.
 
Ahem
8 mins ago, by TimmyD
@Geobits @Doᴡɴɢᴏᴀᴛ may have some ;-)
 
That got lost in the multi-pings I got around then ;)
 
@TimmyD That would have been me.
 
Nice.
 
3:05 PM
@zyabin101 It's also like basically all other voting on the site. Except for moderator elections, I don't think there are any private vote counts.
 
@zyabin101 1. Why would it matter which moderator pinned a message? We are a team. Which one steps forward to do something is completely irrelevant. 2. Hiding the vote counts seems both unnecessary and impossible to prevent. Why would this be an issue anyway? 3. Why are you pinging Martin every 5 seconds?
 
@Dennis With 1) I agree, 2) I think that puts the competitors at an unfair advantage over each other. 3) I don't ping too often >O
 
Which competitors exactly have an advantage?
 
I agree it's subject to bandwagoning, but I don't think that's a big issue for a simple poll with no major importance.
 
@Rainbolt Stack Exchange will limit comments shown to 5 best per post, and people will only sometimes use the see all *n* comments feature.
 
3:12 PM
At least for me, the comments on that page are not limited to five shown.
 
I've personally only voted for one submission so far, and it had 0 votes (where every other submission had at least 1)
 
@zyabin101 When does that happen?
 
@zyabin101 None of the comments are hidden right now. Unless somebody adds more comments, that will not change. The limit is per page, not per answer.
 
This one has more comments than any other post in that thread:
 
I think it would be a much worse problem is the voters were public. People like to bandwagon with mods and high profile people
 
3:13 PM
@Rainbolt Calculating Waves Nomination! XD
 
(often for a good reason, what mods/high profile people think is usually quite correct)
 
I know one mod who is usually wrong
6
 
Hehe
 
@Rainbolt Triggering...
 
So much for subtlety.
 
3:16 PM
@Geobits This is the Internet ... we don't really do "subtle."
 
When the official contest ends, I will have to do an unofficial rematch with some forms that close the flaws that SE has at Best Ofs. :/
 
0
Q: Basic Arithmetic without Basic Arithmetic

senegromThis challenge is inspired by this (and ignores this), but hopefully extends the scope slightly: We call a "basic arithmetic operator" any function/operator/command of your chosen language that is able to take two integers (call them aand b) as input (or read two integers from stack or STDIN o...

 
0
Q: I have a poor answer in an already-used langauge but want help golfing it further

SnoringFrogI'm still fairly new to code golf, but I've run into this problem quite a bit already (in part because I'm new, I imagine). I'll find a challenge I think I can tackle and work up a solution. When I go to submit it, I find not only has the language I selected already been used, but the current sub...

 
3:46 PM
hey, can we do another one-off Fortnightly challenge?
I really have enjoyed working with you guys on the past ones
(anybody have any ideas)?
 
@Rainbolt Nice cheat on "If it's a rule, then we should get rid of it." ;-)
 
When Alex does visit chat? I triggered him, but no reactions and one innocent victim.
 
HEY GUYS: NEW CHALLENGE
I will give a 100 rep bounty to the first answer in Marbelous. Falling apples computed by falling marbles...it's just too fitting. — quintopia 56 secs ago
 
4:18 PM
marbelous people: how do we represent negative numbers?
using the first bit to determine the sign?
 
TOTE: Create a language called NODO
 
While I was googling for a PPCG challenge I've come across this: (slightly NSFW so I won't onebox) i.imgur.com/j6ZYgFH.jpg
4
 
4:34 PM
@randomra This site is addictive enough that I'd consider the entire site NSFW
 
OK, seems like all the trouble (and 30GB occupied HDD space) for the Intel C++ compiler was well worth it. Here's a very brief first report of improvements I observed so far. Later today I'll test it on my AMD machine to see if the improvements hold.
 
30GB for a compiler? o.O
 
It requires a bunch of weird Server SDKs from Microsoft, in addition to a full install of VS15 (with all SDKs, which is 18GB on it's own).
 
Oh - didn't realize it had hooks into VS. Yeah... Don't get me wrong, it's a great IDE and incredibly powerful ... it's just ... big.
 
However, it exceeded my most optimistic expectations, so I'll stick with it. Once it is installed, it's quite easy to use.
 
4:48 PM
@mınxomaτ Map for disk space usage?
 
@TimmyD I don't use VS (or MSVC). I just use ICL as a drop-in replacement for GCC as a command line tool from now on.
But ICL doesn't like the GCC libs, so MSVC has to be installed.
 
ahhh...
That makes sense
 
5:15 PM
@mınxomaτ Invoked with no additional arguments? Literally, as in no optimization?
 
@feersum Yeah
 
Why would you compare that?
 
To have a starting point. Read the paragraph at the end.
Long story short: I developed ANNode using GCC from the beginning and already had a set of build options that produces the most optimized GCC binary (Os, no aliasing check, no frame poiner, SSE3+ arch flags etc.), but ICL's -fast option still crushes the GCC performance. But(!) I still suspect the binary to be susbstantially slower on AMD64, but I'll have to test that. :)
 
5:42 PM
On my AMD A8 APU, the speed improvement is 75,5%. Still faster than GCC. (I had to crosscompile targeting the AMD CPU from the PC I currently have ICL installed on. I used -O3 /arch:SSE3 instead of /fast, since the latter creates a binary specifically for the exact CPU the compiler run on).
 
@mınxomaτ I read "Microsoft" as "Minecraft" and was wondering why the hell Minecraft sold SDKs...
 
@mınxomaτ it looks like you are interested in compression, have you looked at Brotli?
 
I'm interested in general-purpose ANNs. That was my research project for a number of years now. It just happens to produce an extreme compression ratio. Brotli is sort of the other ende of the scale, very good compression, but not as good. Although ANNode is completely impractical for time reasons. But I guess a comparison would be nice, seems like there are some numbers on that: cran.r-project.org/web/packages/brotli/vignettes/…
 
@NathanMerrill No, I learned it during my physics degree (we had two "practical maths", i.e. computational maths, courses where we only used Mathematica)
 
5:58 PM
@mınxomaτ my last semester at university was a general purpose ANN that could play an arbitrary board/card game
gotcha :)
but had similar problems to yours: it takes a long time to learn
 
@NathanMerrill I just downloaded the corpus, let's see how it compares. The best Brotli ratio seems to be 4.347.
 
@NathanMerrill why did you ask? :)
 
just curious
 
6:18 PM
@NathanMerrill It actually takes only a few ns to ms to train for a single file in an archive. It's just that compression itself takes some time :)
 
it seems like that could be improved
but my knowledge on compression is very limited
 
Not really. Extreme compression takes extreme amount of time. It's either CPU time or ratio, you're always trading one for another.
 
so, could your NN handle "average compression"?
 
@NathanMerrill what time is it for you?
 
11:21
am
 
6:21 PM
So midwest?
Or like idaho/utah?
 
utah :)
 
@RikerW You're always on when I'm on o_o
 
@NathanMerrill Yes, it has N levels. Where 1 is the least compression but fastest.
 
@CᴏɴᴏʀO'Bʀɪᴇɴ Yeah. :P
 
1
Q: Bouncing in an array

AdnanIntroduction Arrays can also be seen as a field for a bouncing ball. This of course sounds very vague, so here is an example: [1, 2, 3, 4, 5, 6, 7, 8, 9] [9, 8, 7, 6, 5, 4, 3, 2, 1] [1, 2, 3, 4, 5, 6, 7, 8, 9] Would result in: [1, 8, 3, 6, 5, 4, 7, 2, 9] [9, 2, 7, 4, 5, 6, 3, 8, 9] [1, 8, 3,...

 
6:22 PM
BOUNCY BALLS!!! :P
 
@mınxomaτ so, if you reduce the level so that it is as fast as Brotli, how does it compare?
(or other compression algorithms)
 
hello
ITS SO CUTE \o/
 
@NathanMerrill N=3 is about 7z speed and compression-wise, but ANNode is made for extreme levels, so I don't care about those lower levels (so they are not optimized). It just shows that it can scale.
 
ah ok
 
I'm currently focusing on optimizing the speed of N=9.
 
6:26 PM
so, do you modify an existing compression algorithm, and your NN simply adjusts the parameters?
 
No, everything is proprietary.
 
cool :P
 
It basically performs training on chunks of bytes to build weighted values for the decompressor that can accurately "predict" the next few bytes. Thus, those predicted bytes can simply be deleted from the file.
Allocated memory. More memory = greater chunks.
 
er, so do you have a bit that says "prediction right" or "prediction wrong"?
for each chunk?
 
No, the compressor ensures that the results are within error and always come out correct.
 
6:30 PM
ah ok
how does your (decompression speed)/(compression speed) ratio compare?
 
1:1
It's one ANN for both. Only the weight LUTs are switched.
 
because most other compression algorithms take significantly shorter to decompress
 
Yes, that is the opposite approach.
 
@ThomasKwa Teach me your ways: how did you get 38 upvotes on this? O_O
 
Bu those algorithms have enormous compression times when you increase their block size (ie. better compression). Mine grows somewhat reasonable (you just need to throw a lot of memory at it :) ).
 
6:35 PM
so, this seems like an algorithm to use when you are doing one-off compression to do large file transfers
 
No it's completely impractical for larger files. It's just an experiment to achieve the best compression possible in N memory ;)
I was able to speed it up from <1B/s to about 400B/s in the last three months. I suspect somewhere around ~1400B/s is the limit for consumer CPUs
 
0
Q: Implement FBLint

J Atkin(FB, or Functional-Basic, as found here Interpret Functional-Basic) Task Implement a linting program for FB, similar to JSLint for JavaScript. Error types Invalid identifier Identifiers can only have upper and lower case ASCII letters. Locations: The identifier right after a let expressi...

 
@CᴏɴᴏʀO'Bʀɪᴇɴ Remember that upvotes are inversely proportional to effort squared.
 
6:57 PM
@CᴏɴᴏʀO'Bʀɪᴇɴ You code in Jelly on a phone. I feel like I earned it.
 
Poor Dennis: he can't vote on the Best of PPCG
 
@ThomasKwa True :P
@feersum This is true can confirm
26
A: Shorten an already short mathematical expression

Cᴏɴᴏʀ O'BʀɪᴇɴEmotinomicon, 48 bytes / 13 characters I do it, not because it is short, but because it is fun. Try it here. You'll have to copy+paste it into the textbox. 😼⏪🆙😦✖😎😿➕😨😼🆙😄⏩ Explanation: 😼 ⏪ 🆙 😦 ✖ 😎 😿 ➕ 😼 🆙 😄 ⏩ explanation 😼 ...

30
Q: The Rien Number

Cᴏɴᴏʀ O'BʀɪᴇɴThe Champernowne constant is a number that is constructed by concatenating the first n numbers, with n tending to infinity. It looks something like this: 0.123456789101112131415161718192021222324252627282930... Now, I will describe to you the Rien number. It can be thought of as a minimization...

I spent five minutes on each.
:P
 
@NathanMerrill Well, if he has at least one sock
 
He needs two socks though :(
 
I thought we were all barefoot around here!
 
7:05 PM
@NathanMerrill It's still chewing on the test files, but it managed to compress the kennedy.xls from 1MB to 12KB (a ratio of 82!)
 
It took 2751.98s to do that though ^^
 
what's your run time as compared to total size?
(not block size)
is it O(N)?
N^2?
 
N is not applicable in this way, since different filters are used for differen file types, sizes and Ns.
 
I wasn't using N (as you used it above)
are you able to predict how long a file will take?
 
7:14 PM
I'm using a simple timer for that. Once initialized, the compression speed is constant.
 
then I'm confused. You simply say "compress for X duration"?
 
@ThomasKwa What symbol do you use for the ^-1 key?
 
I mean that from one completed (ie processed) chunk, you can predict the runtime, because it will be equal. It is constant, because all possible weight inputs are stored in a rather large LUT created during initialization.
 
2D pattern matching languages can shine again:
3
Q: Bouncing in an array

AdnanIntroduction Arrays can also be seen as a field for a bouncing ball. This of course sounds very vague, so here is an example: [1, 2, 3, 4, 5, 6, 7, 8, 9] [9, 8, 7, 6, 5, 4, 3, 2, 1] [1, 2, 3, 4, 5, 6, 7, 8, 9] Would result in: [1, 8, 3, 6, 5, 4, 7, 2, 9] [9, 2, 7, 4, 5, 6, 3, 8, 1] [1, 8, 3,...

 
0
A: Sandbox for Proposed Challenges

I Can Haz HatsColor Inversion In this challenge, we will be inverting the colors in a .BMP file. We define "Color Inversion" (really the negative) in the following manner: If you have color given by RGB values (a,b,c) then the inverse of this color is (255-a, 255-b, 255-c). Given a .BMP file as input (eit...

 
7:29 PM
@Sp3000 if Slip would have a sequential output option the Bouncing array soltion could be $6(^3.+^1.*)+
 
@Adnan as nice as it is to get answers to your challenges (and as much as upvotes on them help your HNQ position), I would really recommend not to insta-upvote every answer you get before it either has a thorough explanation or you've tested it sufficiently to be sure that it works for all inputs.
2
 
7:45 PM
^
 
somebody should make a sock that randomly types ^
 
How about no
 
must. fight. urge. to send a single ^
 
@MartinBüttner can mods see who upvoted?
 
7:59 PM
^ (seriously ^)
 

« first day (1819 days earlier)      last day (3026 days later) »