« first day (1918 days earlier)      last day (2917 days later) » 

9:00 AM
> var X = require('../');
can't try it
 
oh what does that line do?
maybe that is what is breaking for me
 
requires the module from up one directory
> Error: Cannot find module '../'
For me
 
oh I don't get an error
you would need to do "npm install xlsx" sorry
or the sudo version
 
what happens when you do ./xlsx.js
do you get a prompt?
 
yes it just returns the prompt
the script is called xlsx strangely
 
9:03 AM
have you tried typing --help in the prompt?
 
sorry... which prompt?I mean the bash prompt
the code effectively does nothing
at least for me
 
what happens when you run it with no arguments?
 
same
hmm.. made it is "node"
if I run node from the command line what should happen?
as in /usr/sbin/node
 
do node <filename> to run a file in node
 
ok but should "node --help" do something?
for example
 
9:05 AM
No
Well, yes
But that's the node help
 
basically I would like to do something that is supposed to actually print something on the screen
right but I get nothing
node --help does nothing
just returns the bash prompt
 
Then maybe you broke node?
 
well I just installed it :)
 
Screenshot?
 
but if node --help is meant to do something then that is very helpful
no
 
9:07 AM
does running node show a prompt?
 
I mean..no
it just returns the bash prompt
 
wat
 
I might ask on SO :)
maybe it's the wrong "node"?
 
Um
Does python show a prompt?
 
@Mego im ok with that
 
9:09 AM
@MarsUltor yes
@MarsUltor apparently it's the wrong node!
 
@Lembik Yeah, probably
 
node - Amateur Packet Radio Node program (transitional package)
:-D
that's very funny
@MarsUltor thanks for the help!
 
that's pretty
is that one big gif?
 
@Lembik Yes. :3
 
9:16 AM
I feel there should be a good lossless video format for this sort of thing
 
Anonymous
Yay, all my unit tests pass! ...oh no, all my unit tests pass, that means my tests aren't robust enough.
7
 
assuming that each frame is being stored independently for gif
 
FRUITW'd /o\
 
Anonymous
@Lembik webm is pretty commonly used for HTML5 video nowadays (as a GIF replacement)
 
@Mego You need to test coverage
 
9:17 AM
@Lembik Gifs are also quite compressed, aren't they?
 
Anonymous
I know I need better test coverage :P
 
(This image just rotates)
 
Anonymous
My coverage is probably around 70% right now
 
Coverage of what?
 
@flawr Test coverage.
 
Anonymous
9:18 AM
Which is a whole lot better than the ~5% I had when I started converting over to the unittest framework
 
Anonymous
Test coverage - how much of my code my unit tests actually test
 
A metric of how much of the code the tests got covered.
 
I don't understand the point of unit tests, why dont you just test every possible input? There are only finitely many!
 
@Mego ninja'd
 
@flawr in an animated gif is each compressed frame stored separately?
@Mego interesting
 
9:19 AM
@Lembik No.
 
@Mego also coverity
 
Anonymous
@flawr Oh that's a great idea. Lemme whip up an algorithm to determine the exoected output for any given input.
 
@Mego What is this for?
 
Anonymous
@MarsUltor Yeah I'm not spending money on a free (as in beer and as in speech) and open-source project
 
@flawr OK. Do you know how the inter frame compression works? The wiki doesn't seem to mention it
 
Anonymous
9:21 AM
@MarsUltor Actually
 
Actually has finitely many possible inputs?
 
Anonymous
flawr was making a joke, and I was continuing it :P
 
@Lembik I once read something about it, but right now I'm trying to find a source before telling any bullshit=)
 
But it doesn't support python
 
@Mego What joke??
 
Anonymous
9:23 AM
Kif-style sigh
 
@flawr "Animated GIFs use a lossless algorithm at this stage. Each frame can specify the updated picture region and the delay until redrawing, to avoid encoding whole and repeated frames. And that is about all that it does." I found that about inter frame compression
 
Anonymous
Yeah animated GIFs are horrible when it comes to file size
 
Anonymous
Each frame is stored in a stream format, individually compressed, but it doesn't take advantage of inter-frame compression (like MP4)
 
@Mego thanks.. this is as I suspected
 
@Lembik Yeah about that. The problem is that you need more computing power the more you use inter frame compression.
 
9:25 AM
@flawr which kind of video codec that allows algorithmic pattern morthing ?
 
Anonymous
WebM is a lot better. Like MP4, it compresses the video into a sequence of key frames and deltas.
 
@flawr all true.. but computer power is free these days :)
@Mego is there a simple tool to make webm like there is to make animated gif?
 
@flawr yes inter-frame compression
 
Anonymous
CPU time is a whole lot more abundant than bandwidth
 
Anonymous
@Lembik Gfycat works really well
 
9:26 AM
oh cool!
 
Anonymous
Upload a video, select a slice up to 15 seconds, get your webm
 
What does imgur use for their gifv's?
mp4?
 
Anonymous
Also webm
 
it decomposes the image into segments using countour detection than move it upon the background thru an algorithmic process
kinof genuine sort of compression
 
Anonymous
 
9:28 AM
on another note.. I was thinking of posing a challenge for code to find efficient matrix multiplication algorithms (a la strassen)
does this sound interesting?
 
Anonymous
Raw video file is i.imgur.com/m8FE7wm.webm
 
that's a big fish!!
 
@Lembik what do you mean, to find?
I think we'd have to rely on known algorithms???
 
Anonymous
@Lembik I was hungry; don't judge me
 
@flawr so if you fix the size of two matrices that you want multiply together, say 2 by 2
you can search for the minimum number of multiplications needed to achieve this by any algorithm
in this case it is 7 which is Strassen's algorithm
 
Anonymous
9:30 AM
@MarsUltor That would be fantastic if it supported Python
 
you can then search for the minimum number of additions too. I can't remember what that is
for 3 by 3 the answer is unknown
and for 2 by 3 I am not sure what it is
@flawr does that make sense?
 
Anonymous
Clearly the most efficient method to compute matrix multiplication is to use the builtin and not think about it any further. It's incredibly efficient, because you use essentially 0 brainpower on it.
 
@Mego well :)
@Mego the game here is that once you have the minimum number of multiplications for small matrices you then apply it recursively to large ones
 
@Lembik I think I get it, but on the other hand I think this is a quite difficult challenge.
 
so for strassen's algorithm you get n^(log_2(7)) complexity to multiply two n by n matrices
 
9:32 AM
I do not think it is exaclty n^(log_2(7))
I just recently had to calculate this=)
Rather like O(n^(log_2(7)))
 
@flawr I was thinking of making the multiplication mod 2 which might make it very slightly better
 
You mean making the challenge about multiplying matrices over F_2?
 
@flawr you are right.. I left out the O
@flawr yes. that might be slightly easier
I mean the code needed to search for the optima might be slightly easier
 
@Lembik Well the O makes a significant diffference here. There is the Coppersmith-something algorithm which is like n^2.3...
But has a huge constant factor IIRC
 
@flawr yes, However this method won't give huge constants
 
as you would get an explicit description of which multiplications and additions to do
 
hmmm lemme guess, that s not very nice !!!
 
@flawr for Coppersmith-Winograd no one has ever even implemented it! :)
 
How can you be so sure about taht? :D
 
which is always a bad sign
@flawr well the question has been asked and answered online. So only as sure as that
 
Anonymous
9:37 AM
The coverage package says my test coverage is 70%
 
@Mego It is lying.
 
Anonymous
I'm sure
 
Anonymous
It's either lying or confused
 
Anonymous
19 mins ago, by Mego
My coverage is probably around 70% right now
 
Anonymous
9:38 AM
There is no way that guess was that accurate
 
@flawr but I think it could be a fun and difficult challenge :)
 
@Lembik So you suggest making a challenge where given the size of two matrices, you have to find an multiplying algorithm that is as efficient as possible (considering the number of multiplications)
 
Anonymous
Alternatively, "write a program that generates a program that optimizes for a specific test case"
 
Still, I think that this is insanely difficult=)
@Lembik Nice link!
I thought about another challenge recently: Given two (unlabelled) graphs, determine whether the first one one is a sub-graph of the second one.
 
10:13 AM
This one:
 
@flawr yes exactly. If the number of mults is equal you will then be judged on the number of additions (or subtractions)
@flawr isn't the subgraph isomorphism?
 
@CᴏɴᴏʀO'Bʀɪᴇɴ @EᴀsᴛᴇʀʟʏIʀᴋ RDFTD
It turns into Future Bass halfway through it. :ᴅ It's so good.
 
@Lembik I don't understand what you wanna say?
 
RIGFTD: None for today. :(
 
@zyabin101 ʜᴡᴀᴛ ɪs RIGFTD?
 
10:20 AM
@VTCAKAVSMoACE Random infographic for the day.
 
I choose an infographic from Imgur every morning to feature in chat every day. Sadly, I caught none this morning.
 
@zyabin101 Take this instead.
 
0
A: Sandbox for Proposed Challenges

flawrDetermine whether one graph is a subgraph of the other mathgraph-theorydiscrete-math Given two unlabelled graphs as adjecency matrices with the same number of vertices, the goal is determining whether the first graph is a subgraph of the second one. Definitions A graph G=(V,E) comprises a set...

 
@flawr Oooooh, I've seen it on Imgur yesterday, too.
 
10:29 AM
@flawr the link was just showing someone else who had done the same thing
except not over a finite field.. so not as good :)
 
11:16 AM
user image
5
(Via Facebook.)
 
@El'endiaStarman JPEG'd to death? Comic f*cking Sans? It couldn't be from anywhere but facebook ;-)
 
@trichoplax o/
Keeping this room alive.
 
:)
Oct 15 '15 at 13:54, by trichoplax
There are other rooms??
 
kek
That was a few days after I joined. O.o
 
And now you're an established part of the community with a type of vote named after you
 
11:24 AM
;P
 
@mınxomaτ ¯\_(ツ)_/¯
 
Ooh, today's the 100th anniversary of Claude Shannon's birthday, the guy that "Shannon entropy" is named after. Known as "the father of information theory".
3
 
How random is that?
 
ಠ_ಠ
 
11:28 AM
:P
 
:ᴅ :ᴘ
 
:d :p
 
SMALL CAPS EMOJIS ARE SO ADORABLE
They're like the poops in Binding of Isaac. :ᴅ
 
@VTCAKAVSMoACE D'AWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW--- throat
 
11:30 AM
hwat
 
@VTCAKAVSMoACE I DO LIKE THEM, TOO
THEY ARE SO ADORABLE
:ᴅ
 
^ That's what it reminds me of.
They're called small Dingles, right?
Apparently, they're called Dips
 
12:00 PM
0
Q: exponential without exponential

Kenny LauYour goal is to calculate the exponential of a float (e**x) up to 2 decimal places for any float within 1 to 10. The accepted error range is 0.01. However, you must not use the built-in exponential function or the logarithm function. In fact, attempts to circumvent this by (2**x)**(1/ln(2)) are...

 
@El'endiaStarman I do only understand 7,9,10,15
 
12:22 PM
1. Eskimos build igloos
2. Won is a Chinese soup
3. Scope is a brand of mouthwash
4. "Bananosecond" is a mash-up of banana and nanosecond
5. "Billigram" sounds like "Billy Graham", a very famous Christian evangelist
6. "Knotfurlong" sounds like "Not for long"
7. "Lite" is a category of beers and sounds like "light"
8. Rod Serling was an actor in the TV series "Twilight Zone" and is a pun on an archaic measurement unit: ?
9. "Semi" means half and "colon" means large intestine
10. A megahertz is 1,000,000 oscillations per second
@flawr: ^
 
Haha, thanks=)
I still do not get 1, but I do quite like 16,13 now that I get it=)
 
12:42 PM
First person to figure this out gets a cookie (looking at you, @MartinBüttner):
Count[Normal@SeriesData[x,0,Reverse@RealDigits[EulerGamma,10,#][[1]],0,#,1]~NRoots~x,_Real,{1,2}]&
 
Bas
@LegionMammal978 The answer is 6
 
@Bas Incorrect. It is a function.
 
Bas
@LegionMammal978 The answer is an anonymous function which returns 6 upon execution
 
@Bas For what input(s)?
 
Bas
@LegionMammal978 Every input :D
@LegionMammal978 Okay I give up, I was hoping you'd believe me for free cookies
 
12:44 PM
@Bas Incorrect. f[1] == 0.
 
Bas
I don't even know mathematica
 
Okay, from the OEIS:
> Number of real roots of the polynomial sum_{k=0..n-1} A001620(1+k-n)*x^k, whose coefficients are the decimal digits of the Euler-Mascheroni constant.
 
Bas
@LegionMammal978 Pronounce that entire sentence right and I'll give you a cookie
 
I'm quite sure text2speech doesn't know the word "Euler" even.
 
12:50 PM
@El'endiaStarman I think "a straight line" is just the non-funny line that sets up the next joke. Like the "straight man" is the one in a comedy duo who says something to set up the punchline for the other one.
Nothing funny, but makes the joke possible
 
@KennyLau Fine, text2speech.org/FW/…
> Number of real roots of the polynomial produced by the sum of O E I S sequence A zero zero one six two zero applied to one plus K minus N all times X to the K with K going from zero to N minus one, whose coefficients are the decimal digits of the oiler mass care ony constant.
 
1:45 PM
Holy crap, I just read the darkest Academia post
 
you should really turn on some lights then
 
ಠ_ಠ
 
@VTCAKAVSMoACE Link?
 
the cool thing bout ppcg, the challenges arent time-bounded
 
2:14 PM
Welp. My outgoing firewall to help me work is officially useless.
 
Anyone know what the "HP" might mean in this floor plan? liveluma.com/?floor-plans=2304
I'd guess water heater but the acronym doesn't make sense
Perhaps it's "Harry Potter" cupboard
 
-2
Q: a recursive function for sorting a singly linked list?

Charles hegWrite a method which takes ONE PARAMETER only and does not use any auxiliary method to sort a singly linked list.

 
too late >_<
 
2:29 PM
what's our stance on challenges of creating a class (or its equivalent)?
meaning a bunch of methods and some variables
 
@KennyLau Probably a little broad, since languages define classes totally differently.
 
@VTCAKAVSMoACE e.g. a matrix class?
that would include addition and transpose (only)
just as an example
 
@KennyLau I don't follow.
Like, a code that generates a class?
 
a code containing two methods
 
A class that is instantiable and has certain members?
 
2:40 PM
no need to be instantiable (how do you do that in esolangs)
 
Oh, well, yeah, I guess. The language would be OOP restricted, probably.
I think I still don't follow. :P
 
just two methods basically?
I don't really know how to expand it to esolangs
code jam!!!!
in 1 hour 12 minutes
 
@KennyLau \o/
 
@Maltysen Could you help me golf this code?
0
A: Compute the Adler-32 checksum

Kenny LauPyth, 25 bytes im%sd65521,mhsd._QhsQ^4 8 Try it online! Translation of my answer in Jelly.

 
@KennyLau Daaaaarn, I forgot. Don't worry, I'll take code together and build the "Friends of PPCG" leaderboard for the code jam when it ends.
 
2:54 PM
0
Q: Special method to sort linked list

user2719152Is it possible to write a recursive method which does not use any auxiliary method and only takes one parameter, sorts the singly linked list?

 
Thanks to @MarsUltor's code jam leaderboard snippet, I'll be able to snapshot the leaderboard at several moments.
 
Wait, so, question: what are code jams?
 
It's like alphabet soup for bread
 
@HelkaHomba hwat
 
code jam!!!!
in 0 hour 57 minutes
 
3:03 PM
 
@HelkaHomba He said jams, not one jam.
 
FRUITW'd /o\
 
Good morning TNB.
 
bah, photoshock
 
3:06 PM
Competitive programming is a mind sport usually held over the Internet or a local network, involving participants trying to program according to provided specifications. Competitive programming is recognized and supported by several multinational software and Internet companies, such as Google, Facebook and IBM. There are several organizations who host programming competitions on a regular basis. A programming competition generally involves the host presenting a set of logical or mathematical problems to the contestants (who can vary in number from tens to several thousands), and contestants are...
 
@Agawa001 gimp, actually
 
bah, gimp
 
@zyabin101 Ah, okie.
 
@DrGreenEggsandHamDJ Good morning part of TNB
 
it is clear that is grape jam
 
3:09 PM
@zyabin101 ¯\_(ツ)_/¯
I know it's not morning everywhere.
 
do anyone have the opening password for spoj challenges ?
 
55 mins ago, by Helka Homba
Anyone know what the "HP" might mean in this floor plan? http://liveluma.com/?floor-plans=2304
 
Health points?
 
ah, thx
 
3:17 PM
@VTCAKAVSMoACE dude, up at 5 is my limit... yawns
monking
 
monring
 
moaning
 
no
monring
 
Only 39min 8sec until Code Jam!
 
3:20 PM
@EᴀsᴛᴇʀʟʏIʀᴋ Good monking!
 
mooring from moors
 
@PhiNotPi Daaaaarn!
 
@EᴀsᴛᴇʀʟʏIʀᴋ goom monking
 
good afteryesterday
 
shit, you people can code this early???
>.<
gtg, bai!
 
3:24 PM
bai
Hello @NeoKo!
 
@Downgoat Hello
 
@EᴀsᴛᴇʀʟʏIʀᴋ "This isn't a programming question. It is just a really unclear challenge" wat?
It's clearly a "gimme teh codez"
 
@EᴀsᴛᴇʀʟʏIʀᴋ not really
 
@DrGreenEggsandHamDJ but it is a challenge, nonetheless.
 
I disagree.
What's the winning criteria?
 
3:30 PM
@PhiNotPi CodinGame also has a contest starting at that time.
And codechef had one start 1.5 hours ago.
 
those machines are picky
 
> A weasel shut down the world's most powerful particle smasher when it wandered onto a 66,000-volt transformer and caused a short circuit - Pop goes the weasel
 
> caused by the weasel, which did not survive
 
I thought a weasel roaming in the Large Hadron Collider would be alive and poop out avocads...
 
3:44 PM
Anyone know a way of visualizing graphs?
Without having to position every vertex by hand?
 
@DrGreenEggsandHamDJ unclear, but phrased as a challenge and obviously is asking for one.
I think meta says 'pls send teh codez' are allowed as long as they also ask for avocad.
 
@flawr networkx
 
@HelkaHomba read about that. :P
 
@EᴀsᴛᴇʀʟʏIʀᴋ Link on that? If that is true, then it needs to change immediately.
 
@Maltysen Trying that, thanks!
 
3:50 PM
"Gimme teh codez" are the garbage dump of SO. Why should they be on-topic here?
 
@DrGreenEggsandHamDJ I agree with Riker on this point. If "Gimme teh codez" was well-speced and everything, with an objective winning criterion, then it should be on topic here
however, there is a very high correlation between those and being low-quality for other reasons
 
good luck to code jammers :)
 
3 minutes
 
@aditsu did you make it last time?
 
you mean 1A? no, I'm participating now
 
3:58 PM
@aditsu oh, good luck to you too
 
thanks
 
Ever wanted to give a TED talk? Now you can do it anonymously.
 
Hey @zyabin101? How does the leaderboard look currently?
 
about to start
 
Sorry for the multiple pings
 
4:00 PM
started
 
@Maltysen Looks great
 
which contest is on the way now ?
 
4:16 PM
@Maltysen Can't seem to find how to plot?
 
@KennyLau it says registrations are closed!
 
@Agawa001 too late lol
 
why m i late allll the time ?
 
10
Q: Should homework be allowed?

TheDoctorRecently, browsing questions of PPCG, i have found a lot of questions that are simply for the purpose of offloading their homework assignments, due to lasiness or easiness of this platform. For this reason, i believe we should ban homework questions. Any input? Some examples: Factor numbers fo...

 
@quartata That's not really relevant because all of the questions linked were .
 
4:31 PM
True, but the answers cover what you're asking
 
The top 2 answers are both semi-joke answers. The third answer I think nails it.
>"So I lean toward banning homework questions when it seems obvious that they are looking for someone to do their assignment for them. E.g. if their request is language-specific, that would be a red flag that they have to write something in Scheme or Java or whatever for class. Or if it has the kind of silly constraints that indicate an arbitrary aspect of a class assignment.

However, I'd be open to accepting homework questions when the questioner honestly tells us it is such, and lets us know what language(s) they are doing the assignment in. We could have a standard policy to submit answ
 
cat
@QPaysTaxes By the way, one of Factor's developers, Björn Lindqvist is active on SO, so you can ask there :D
^ that answer tho
 
the first people are done after 38 minutes. what. on earth.
 
@MartinBüttner haven't gotten A yet D:
\o/ got A
 
cat
4:44 PM
@MartinBüttner ?
 
@cat code jam
 
cat
@quartata code jelly?
google code jam? I wasn't paying attention
 
Blarg. B is giving me the runaround
 
wait B looks really easy
I'm probably misunderstanding something, but …
 
Simple and easy are two different things for this one
 
4:49 PM
@Sherlock9 what about brute force though?
 
Think of the large case
 
@Sherlock9 oh I wasn't planning on trying that ;P
 
Ah, screw it. Brute force it is
 
screwing works better using brute force
3
 
@Optimizer ._.
 

« first day (1918 days earlier)      last day (2917 days later) »