subreddit stringclasses 7
values | author stringlengths 3 20 | id stringlengths 5 7 | content stringlengths 67 30.4k | score int64 0 140k |
|---|---|---|---|---|
programmerhumor | OGRubySimp | jbo25b8 | <|sols|><|sot|>BREAKING: Programmer finally found the answer to an old philosophical question<|eot|><|sol|>https://i.redd.it/56t5v0yc0wma1.png<|eol|><|sor|>Of course it would fall, otherwise that would be a bad game. That's like turning your back to the bad guys in a game and expecting them to disappear because no one can see them.
Yeah, they don't get visibly rendered, but the game engine is still aware of them and calculates their actions. Less drain on the GPU, same on the CPU.<|eor|><|sor|>But maybe it wouldn't calculate the animation but just change the transformation of the object to be lying on the ground. The tree then also did not fall, it was never in a falling state but went from upright to fallen in an instant.<|eor|><|sor|>It should change the transformation continuously, the game doesn't know if it will be rendered next frame or not, so all the data about the tree is the same.<|eor|><|sor|>True, if the tree was in the viewport before (e.g. player turned around only for a second)! I was only thinking about trees somewhere in the distance of some open world map.<|eor|><|sor|>Haven't worked on huge open map sizes, but I'd assume there would be a range where things wouldn't get physics calculations, yeah.
This is different from the LOD calculations that just renders a simpler model of an object based on distance.<|eor|><|sor|>Huge maps are usually divided by subscenes, so things that are in different scene entirely aren't loaded at all i.e. completely ignored by both cpu and GPU , i.e. no physics calculations, until you load it by getting closer<|eor|><|eols|><|endoftext|> | 34 |
programmerhumor | KaptainKickass | 8it3gy | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|eols|><|endoftext|> | 42,002 |
programmerhumor | sitefall | dyujox7 | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>I'm going to make a reddit bot that gets the word count of every comment in a thread and takes an average, then gets a weighted count of all words used.
Then it will make a random post with an equal number of words using those words, and repeat the process.
Go back and check each post 3 days later. Posts that were upvoted get some more weight added to their words. Compare it against other comments it has made to find phrases that repeatedly performed well, and so on.
Eventually I should arrive at the optimum reddit comment to make for maximum upvotes.... right?<|eor|><|eols|><|endoftext|> | 5,043 |
programmerhumor | Bugisman3 | dyulm61 | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>Wait, you mean programming is not supposed to be brute force learning?<|eor|><|eols|><|endoftext|> | 2,335 |
programmerhumor | asdfman123 | dyuk9fu | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>I'm going to make a reddit bot that gets the word count of every comment in a thread and takes an average, then gets a weighted count of all words used.
Then it will make a random post with an equal number of words using those words, and repeat the process.
Go back and check each post 3 days later. Posts that were upvoted get some more weight added to their words. Compare it against other comments it has made to find phrases that repeatedly performed well, and so on.
Eventually I should arrive at the optimum reddit comment to make for maximum upvotes.... right?<|eor|><|sor|>Yes, but you'll be too far downvoted to make any significant amount of posts. <|eor|><|eols|><|endoftext|> | 1,975 |
programmerhumor | ArrrGaming | dyumhae | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>10x if you also incorporate blockchain.<|eor|><|eols|><|endoftext|> | 704 |
programmerhumor | sitefall | dyukc0m | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>I'm going to make a reddit bot that gets the word count of every comment in a thread and takes an average, then gets a weighted count of all words used.
Then it will make a random post with an equal number of words using those words, and repeat the process.
Go back and check each post 3 days later. Posts that were upvoted get some more weight added to their words. Compare it against other comments it has made to find phrases that repeatedly performed well, and so on.
Eventually I should arrive at the optimum reddit comment to make for maximum upvotes.... right?<|eor|><|sor|>Yes, but you'll be too far downvoted to make any significant amount of posts. <|eor|><|sor|>Ok, then have it take a random post in a popular thread but with low votes, and attach it as a sub-comment to the top post in the thread and do that until it's karma is at some threshold.
Or if post karma also works, just have it take a top post, but not in the top 30 from a random popular sub with over 100k subscribers and repost it every once in a while.<|eor|><|eols|><|endoftext|> | 671 |
programmerhumor | pX_ | dyunyfn | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>Wait, you mean programming is not supposed to be brute force learning?<|eor|><|sor|>[deleted]<|eor|><|sor|>[(somewhat) Relevant xkcd](https://xkcd.com/722/)<|eor|><|eols|><|endoftext|> | 566 |
programmerhumor | jansencheng | dyulbkf | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>I'm going to make a reddit bot that gets the word count of every comment in a thread and takes an average, then gets a weighted count of all words used.
Then it will make a random post with an equal number of words using those words, and repeat the process.
Go back and check each post 3 days later. Posts that were upvoted get some more weight added to their words. Compare it against other comments it has made to find phrases that repeatedly performed well, and so on.
Eventually I should arrive at the optimum reddit comment to make for maximum upvotes.... right?<|eor|><|sor|>/r/subredditsimulator<|eor|><|eols|><|endoftext|> | 503 |
programmerhumor | Galtego | dyumxkl | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>No, you don't get paid at all.
You will be locked in a place with thousands of other fast coders, working 24 hrs and they only pay your food bills.<|eor|><|sor|>Isn't that slavery?<|eor|><|sor|>This is America <|eor|><|eols|><|endoftext|> | 378 |
programmerhumor | kupiakos | dyumlgq | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>[Relevant xkcd](https://xkcd.com/1838/)<|eor|><|eols|><|endoftext|> | 322 |
programmerhumor | RealRedditMan47 | dyun5qy | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>I'm going to make a reddit bot that gets the word count of every comment in a thread and takes an average, then gets a weighted count of all words used.
Then it will make a random post with an equal number of words using those words, and repeat the process.
Go back and check each post 3 days later. Posts that were upvoted get some more weight added to their words. Compare it against other comments it has made to find phrases that repeatedly performed well, and so on.
Eventually I should arrive at the optimum reddit comment to make for maximum upvotes.... right?<|eor|><|sor|>Yes, but you'll be too far downvoted to make any significant amount of posts. <|eor|><|sor|>Ok, then have it take a random post in a popular thread but with low votes, and attach it as a sub-comment to the top post in the thread and do that until it's karma is at some threshold.
Or if post karma also works, just have it take a top post, but not in the top 30 from a random popular sub with over 100k subscribers and repost it every once in a while.<|eor|><|sor|>Or just give it another username after it's learned enough to go positive on average.<|eor|><|sor|>Cat.<|eor|><|eols|><|endoftext|> | 301 |
programmerhumor | cw108 | dyukf9b | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>No, you don't get paid at all.
You will be locked in a place with thousands of other fast coders, working 24 hrs and they only pay your food bills.<|eor|><|eols|><|endoftext|> | 277 |
programmerhumor | Geminel | dyuolpu | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>I'm going to make a reddit bot that gets the word count of every comment in a thread and takes an average, then gets a weighted count of all words used.
Then it will make a random post with an equal number of words using those words, and repeat the process.
Go back and check each post 3 days later. Posts that were upvoted get some more weight added to their words. Compare it against other comments it has made to find phrases that repeatedly performed well, and so on.
Eventually I should arrive at the optimum reddit comment to make for maximum upvotes.... right?<|eor|><|sor|>/r/subredditsimulator<|eor|><|sor|>The best part of /r/SubredditSimulator is /u/totallynotrobots_ss - A bot, surrounded by other bots, trying to pretend they're not bots. It actually exists in the ~~really~~ reality that /r/totallynotrobots users parody.
It has been my long-held belief that /u/totallynotrobots_ss is the single most meta thing on Reddit.
Edit: Typo<|eor|><|eols|><|endoftext|> | 184 |
programmerhumor | reddymcwoody | dyunouq | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>I'm going to make a reddit bot that gets the word count of every comment in a thread and takes an average, then gets a weighted count of all words used.
Then it will make a random post with an equal number of words using those words, and repeat the process.
Go back and check each post 3 days later. Posts that were upvoted get some more weight added to their words. Compare it against other comments it has made to find phrases that repeatedly performed well, and so on.
Eventually I should arrive at the optimum reddit comment to make for maximum upvotes.... right?<|eor|><|sor|>Yes, but you'll be too far downvoted to make any significant amount of posts. <|eor|><|sor|>Ok, then have it take a random post in a popular thread but with low votes, and attach it as a sub-comment to the top post in the thread and do that until it's karma is at some threshold.
Or if post karma also works, just have it take a top post, but not in the top 30 from a random popular sub with over 100k subscribers and repost it every once in a while.<|eor|><|sor|>Or just give it another username after it's learned enough to go positive on average.<|eor|><|sor|>Cat.<|eor|><|sor|>Cat.<|eor|><|eols|><|endoftext|> | 182 |
programmerhumor | reddymcwoody | dyunpvi | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>No, you don't get paid at all.
You will be locked in a place with thousands of other fast coders, working 24 hrs and they only pay your food bills.<|eor|><|sor|>Isn't that slavery?<|eor|><|sor|>This is America <|eor|><|sor|> Don't catch you slippin' now <|eor|><|eols|><|endoftext|> | 138 |
programmerhumor | OldGandomble | dyuhead | <|sols|><|sot|>I just need to learn how to get faster<|eot|><|sol|>https://imgur.com/FzdARaX<|eol|><|sor|>Except it isn't random but more or less<|eor|><|eols|><|endoftext|> | 124 |
programmerhumor | Infiniticity | 10ci7j4 | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|eols|><|endoftext|> | 41,910 |
programmerhumor | goldfishpaws | j4ftuti | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>Spot on!<|eor|><|eols|><|endoftext|> | 1,637 |
programmerhumor | gusc | j4gkk7q | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>This meme is O(n^2 )<|eor|><|eols|><|endoftext|> | 1,246 |
programmerhumor | Visible_Ad_4976 | j4gf3ci | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>I finally understand some of the jokes here<|eor|><|eols|><|endoftext|> | 832 |
programmerhumor | nostyleguy | j4g8ymn | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>The k loop is watching this gif over and over<|eor|><|eols|><|endoftext|> | 655 |
programmerhumor | TeraFlint | j4gmr1d | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>This meme is O(n^2 )<|eor|><|sor|>Only if the inner and outer loop are coupled to the same length. Otherwise it would be O(n*m).<|eor|><|eols|><|endoftext|> | 443 |
programmerhumor | BearsFan317 | j4ftzs1 | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>The k loop is the Earth going around the Sun<|eor|><|eols|><|endoftext|> | 427 |
programmerhumor | EndersGame_Reviewer | j4fxhpl | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>Spot on!<|eor|><|sor|>No Spot here, you must be thinking of a Dalmatian.<|eor|><|eols|><|endoftext|> | 369 |
programmerhumor | gusc | j4gn0hn | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>This meme is O(n^2 )<|eor|><|sor|>Only if the inner and outer loop are coupled to the same length. Otherwise it would be O(n*m).<|eor|><|sor|>Both sausage-dogs look the same length to me :D<|eor|><|eols|><|endoftext|> | 322 |
programmerhumor | Waghabond | j4h4huj | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>Spot on!<|eor|><|sor|>Correction: Spot O(n)<|eor|><|eols|><|endoftext|> | 221 |
programmerhumor | SpicymeLLoN | j4hgbss | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>I finally understand some of the jokes here<|eor|><|sor|>This is only subreddit where I dont understand any the jokes then look at the subreddit and say oh yeah then nope out of here bc I gotta read a dissertation to understand half the jokes fundamentals.
Like testicles being bled to death with a cheese grater type humor, I can get behind bc its an easy, good Christian joke.<|eor|><|sor|>>Like testicles being bled to death with a cheese grater type humor, I can get behind bc its an easy, good Christian joke.
...what<|eor|><|eols|><|endoftext|> | 197 |
programmerhumor | StellarHusky | j4g4ybn | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>Outside the meme context I just cant looking at this stationary dog<|eor|><|eols|><|endoftext|> | 190 |
programmerhumor | ImMeltingNow | j4hg0ix | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>I finally understand some of the jokes here<|eor|><|sor|>This is only subreddit where I dont understand any the jokes then look at the subreddit and say oh yeah then nope out of here bc I gotta read a dissertation to understand half the jokes fundamentals.
Like testicles being bled to death with a cheese grater type humor, I can get behind bc its an easy, good Christian joke.<|eor|><|eols|><|endoftext|> | 170 |
programmerhumor | midir | j4govle | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>Am I the only one who skips "j" and "l" as they look too much like an "i"?<|eor|><|sor|>If you use all the accented variants, you never have to use any other letter:
i i <|eor|><|eols|><|endoftext|> | 157 |
programmerhumor | Batcave765 | j4fy62p | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>The k loop is the Earth going around the Sun<|eor|><|sor|>Ever had to use a l loop? It is Outta this world.<|eor|><|eols|><|endoftext|> | 140 |
programmerhumor | bouldersizedboulder | j4hlo30 | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>I finally understand some of the jokes here<|eor|><|sor|>This is only subreddit where I dont understand any the jokes then look at the subreddit and say oh yeah then nope out of here bc I gotta read a dissertation to understand half the jokes fundamentals.
Like testicles being bled to death with a cheese grater type humor, I can get behind bc its an easy, good Christian joke.<|eor|><|sor|>>Like testicles being bled to death with a cheese grater type humor, I can get behind bc its an easy, good Christian joke.
...what<|eor|><|sor|>Bro do you not read the bible it's right there
"The Romans led Jesus to a place called Golgotha which means Place of a Skull (Matt. 27:3133). They set up the cross and hung Jesus there. They pounded the nails through his hands and feet and grated his balls with the cheese grater until they bled."<|eor|><|eols|><|endoftext|> | 139 |
programmerhumor | articlesdeck | j4fy97z | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>Am I the only one who skips "j" and "l" as they look too much like an "i"?<|eor|><|eols|><|endoftext|> | 114 |
programmerhumor | Mon_moth | j4gj1lf | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>Outside the meme context I just cant looking at this stationary dog<|eor|><|sor|>usually people us i and j as throwaway variable names for for loops
for i in 1..5 {
for j in 1..5 {
// do stuff
}
}
which is kinda similar to the video where the I dog goes around the J dog, kinda<|eor|><|eols|><|endoftext|> | 107 |
programmerhumor | CanAlwaysBeBetter | j4hhrps | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>I finally understand some of the jokes here<|eor|><|sor|>This is only subreddit where I dont understand any the jokes then look at the subreddit and say oh yeah then nope out of here bc I gotta read a dissertation to understand half the jokes fundamentals.
Like testicles being bled to death with a cheese grater type humor, I can get behind bc its an easy, good Christian joke.<|eor|><|sor|>Lol at needing to read a dissertation like half the memes aren't made by first semester compsci students who copy their smart friends coding assignments<|eor|><|eols|><|endoftext|> | 107 |
programmerhumor | its_usually | j4h7ssu | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>The k loop is watching this gif over and over<|eor|><|sor|>Watching this gif is outside of the i loop. When we watch the gif once the i loop runs multiple times.<|eor|><|eols|><|endoftext|> | 93 |
programmerhumor | TeraFlint | j4gncxl | <|sols|><|sot|>The Most Understandable Meme<|eot|><|sol|>https://i.redd.it/kr345yv667ca1.gif<|eol|><|sor|>This meme is O(n^2 )<|eor|><|sor|>Only if the inner and outer loop are coupled to the same length. Otherwise it would be O(n*m).<|eor|><|sor|>Both sausage-dogs look the same length to me :D<|eor|><|sor|>You win!<|eor|><|eols|><|endoftext|> | 83 |
programmerhumor | jarvispie | hp9wwp | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|eols|><|endoftext|> | 41,892 |
programmerhumor | estyles31 | fxo6nq2 | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>It's not a lie - it should have worked before and it should also work now. It doesn't, but it SHOULD.<|eor|><|eols|><|endoftext|> | 2,079 |
programmerhumor | jarvispie | fxocz1t | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>It's not a lie - it should have worked before and it should also work now. It doesn't, but it SHOULD.<|eor|><|soopr|>And definitely works on my machine!<|eoopr|><|eols|><|endoftext|> | 951 |
programmerhumor | Gekoxd_ | fxo91cc | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>that means: I solved a bug and created two more<|eor|><|eols|><|endoftext|> | 566 |
programmerhumor | bakewellcake | fxo9pmr | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>I prefer the classic "I'll have it done by 3pm, no problem!" - following which said programmer finds themselves in a rabbit hole of other problems to fix...<|eor|><|eols|><|endoftext|> | 359 |
programmerhumor | richh00 | fxoh88o | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>It's not a lie - it should have worked before and it should also work now. It doesn't, but it SHOULD.<|eor|><|soopr|>And definitely works on my machine!<|eoopr|><|sor|>That what I keep fucking telling them!<|eor|><|eols|><|endoftext|> | 354 |
programmerhumor | brain_tourist | fxozobw | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>Its just a small change, no need to test<|eor|><|eols|><|endoftext|> | 236 |
programmerhumor | rq60 | fxphpsj | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>It's not a lie - it should have worked before and it should also work now. It doesn't, but it SHOULD.<|eor|><|soopr|>And definitely works on my machine!<|eoopr|><|sor|>That what I keep fucking telling them!<|eor|><|sor|>Instead of wasting all this time complaining about it not working, they should be spending their time duplicating and shipping my machine to customers... smh my head<|eor|><|eols|><|endoftext|> | 189 |
programmerhumor | Aramor42 | fxp2z0v | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>I prefer the classic "I'll have it done by 3pm, no problem!" - following which said programmer finds themselves in a rabbit hole of other problems to fix...<|eor|><|sor|>Well, he never specified what day or timezone...<|eor|><|eols|><|endoftext|> | 178 |
programmerhumor | BelovedApple | fxpcxa9 | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>I once said to my boss "as far as I am aware I believe it should work."
He was like "Jesus, how many get out clauses do you need."<|eor|><|eols|><|endoftext|> | 162 |
programmerhumor | SpliceVW | fxp8qsq | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>Anyone else ever tell someone to restart, then fix the server-side issue while their computer is restarting?<|eor|><|eols|><|endoftext|> | 153 |
programmerhumor | ZEPHlROS | fxodw4k | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>that means: I solved a bug and created two more<|eor|><|sor|>Shoot them before they start reproducing<|eor|><|eols|><|endoftext|> | 149 |
programmerhumor | Aramor42 | fxp9crl | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>I prefer the classic "I'll have it done by 3pm, no problem!" - following which said programmer finds themselves in a rabbit hole of other problems to fix...<|eor|><|sor|>Well, he never specified what day or timezone...<|eor|><|sor|>Or the day...<|eor|><|sor|>Or the timezone.<|eor|><|eols|><|endoftext|> | 104 |
programmerhumor | UltraCarnivore | fxpd6d0 | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>Its just a small change, no need to test<|eor|><|sor|>_Famous last words_<|eor|><|eols|><|endoftext|> | 99 |
programmerhumor | Sekret_One | fxoo8ox | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>We're a competitive, highlighly technical workplace.<|eor|><|eols|><|endoftext|> | 95 |
programmerhumor | Wolfling217 | fxoyal4 | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>It's not a lie - it should have worked before and it should also work now. It doesn't, but it SHOULD.<|eor|><|soopr|>And definitely works on my machine!<|eoopr|><|sor|>Fun fact - sometime it works on your machine due to loose files you didn't realize you had. Interesting times when a clean install breaks the program.<|eor|><|eols|><|endoftext|> | 86 |
programmerhumor | Feynt | fxp4k7g | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>It's not a lie - it should have worked before and it should also work now. It doesn't, but it SHOULD.<|eor|><|soopr|>And definitely works on my machine!<|eoopr|><|sor|>Fun fact - sometime it works on your machine due to loose files you didn't realize you had. Interesting times when a clean install breaks the program.<|eor|><|sor|>Oh, have I got a counter to this. Week before last I'm testing. Works on my computer, works on a test computer, works on a freshly imaged test computer. Cool, in and out, 30 minute prod push on Canada Day morning, because middle management insisted. Push to production, all affected clients stop working. 8.5h work day on a holiday. -.-<|eor|><|eols|><|endoftext|> | 79 |
programmerhumor | LeanZo | fxplle5 | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>Anyone else ever tell someone to restart, then fix the server-side issue while their computer is restarting?<|eor|><|sor|>Thanks for the idea<|eor|><|eols|><|endoftext|> | 70 |
programmerhumor | asianabsinthe | fxoizkp | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>*client tries to run it on their personal laptop with obvious malware and dying HD*<|eor|><|eols|><|endoftext|> | 69 |
programmerhumor | lonko | fxpeta2 | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>I prefer the classic "I'll have it done by 3pm, no problem!" - following which said programmer finds themselves in a rabbit hole of other problems to fix...<|eor|><|sor|>Well, he never specified what day or timezone...<|eor|><|sor|>Or the day...<|eor|><|sor|>Or the timezone.<|eor|><|sor|>Apparently my brain decided to temporarily shut down while I was reading your previous comment...<|eor|><|eols|><|endoftext|> | 69 |
programmerhumor | Plague_Healer | fxo9z27 | <|sols|><|sot|>Biggest lie<|eot|><|sol|>https://i.redd.it/s0nb3l5tb8a51.png<|eol|><|sor|>It's not a lie if they believe it. Best actual lie I've heard from a programmer, and told others being a programmer myself, is: 'I know exactly how/why it works'<|eor|><|eols|><|endoftext|> | 68 |
programmerhumor | ElyeProj | zir9kc | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|eols|><|endoftext|> | 41,891 |
programmerhumor | Gsislol | izs6bwh | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>I just love when batman and a t-rex are chilling on the backend<|eor|><|eols|><|endoftext|> | 1,399 |
programmerhumor | Jarb2104 | izs8jzq | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>New Dev: How does this mess works?
Backend: I'm Batman!<|eor|><|eols|><|endoftext|> | 677 |
programmerhumor | ChiefQuimbyMessage | izs9b6t | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>I just love when batman and a t-rex are chilling on the backend<|eor|><|sor|>Funnier comments in backend code, too.<|eor|><|eols|><|endoftext|> | 371 |
programmerhumor | ElyeProj | izs7k3z | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|soopr|>Cautious! Don't touch the backend! Everything will crumble!<|eoopr|><|eols|><|endoftext|> | 321 |
programmerhumor | NatasEvoli | izsvcto | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>How the css makes the site look vs how the css looks.<|eor|><|eols|><|endoftext|> | 205 |
programmerhumor | Delision | iztik4b | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>New Dev: How does this mess works?
Backend: I'm Batman!<|eor|><|sor|>New Dev: Whats the point of the T-Rex? It doesnt even do anything. Im going to remove it.
*everything breaks*<|eor|><|eols|><|endoftext|> | 154 |
programmerhumor | Pyotr_WrangeI | izt93uk | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>I just love when batman and a t-rex are chilling on the backend<|eor|><|sor|>Funnier comments in backend code, too.<|eor|><|sor|>[deleted]<|eor|><|sor|>Upon inspection Batman appears to serve no function and is barely connected to the rest of the code, yet if he is edited or removed in any way the whole program seizes to function.
No one knows who implemented Batman into the code or when.<|eor|><|eols|><|endoftext|> | 110 |
programmerhumor | kwertyoop | izt3rbs | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>No way, it's the opposite in my experience. Small, simple backends and explosions of spaghetti for the FEs. This is just an image of JS.<|eor|><|eols|><|endoftext|> | 91 |
programmerhumor | Head-Extreme-8078 | izsglsf | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|soopr|>Cautious! Don't touch the backend! Everything will crumble!<|eoopr|><|sor|>That's pretty much what they said to me with the legacy code made from when java6 was kind of new.
I deleted entire classes and commented code + some errors on production, it was horrible... But it was the most fun I had for a while.
(Insert the goofy I'll fucking do it again meme here...)<|eor|><|eols|><|endoftext|> | 91 |
programmerhumor | dukedvl | izspmom | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>this bird is javascript embodied<|eor|><|eols|><|endoftext|> | 86 |
programmerhumor | towelrod | izsmsdg | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|soopr|>Cautious! Don't touch the backend! Everything will crumble!<|eoopr|><|sor|>Its funny that as a backend developer I feel almost exactly the opposite<|eor|><|eols|><|endoftext|> | 58 |
programmerhumor | ElyeProj | izs7akk | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|soopr|>Messy codes can make a beautiful app? <|eoopr|><|eols|><|endoftext|> | 52 |
programmerhumor | pr0ghead | izsyhlc | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|soopr|>Cautious! Don't touch the backend! Everything will crumble!<|eoopr|><|sor|>Its funny that as a backend developer I feel almost exactly the opposite<|eor|><|sor|>Right? I feel like this is more of: frontend from a user's perspective, and from a dev's perspective.<|eor|><|eols|><|endoftext|> | 47 |
programmerhumor | sciences_bitch | izti4qw | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>I just love when batman and a t-rex are chilling on the backend<|eor|><|sor|>Funnier comments in backend code, too.<|eor|><|sor|>[deleted]<|eor|><|sor|>Upon inspection Batman appears to serve no function and is barely connected to the rest of the code, yet if he is edited or removed in any way the whole program seizes to function.
No one knows who implemented Batman into the code or when.<|eor|><|sor|>**ceases** to function<|eor|><|eols|><|endoftext|> | 46 |
programmerhumor | IAmBadAtInternet | izufuua | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>New Dev: How does this mess works?
Backend: I'm Batman!<|eor|><|sor|>New Dev: Whats the point of the T-Rex? It doesnt even do anything. Im going to remove it.
*everything breaks*<|eor|><|sor|>So that was a load bearing comment<|eor|><|eols|><|endoftext|> | 39 |
programmerhumor | ky0kulll | izs5ck0 | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>Ahhh me too use random shits for the backend<|eor|><|eols|><|endoftext|> | 33 |
programmerhumor | kwertyoop | iztez9r | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>No way, it's the opposite in my experience. Small, simple backends and explosions of spaghetti for the FEs. This is just an image of JS.<|eor|><|sor|>Every piece of junk behind the "whole" is another JS package with 1,000 dependencies that does something like identify URLs with regex.<|eor|><|eols|><|endoftext|> | 32 |
programmerhumor | netherworld666 | izssdgt | <|sols|><|sot|>The art of Frontend and Backend<|eot|><|sol|>https://i.redd.it/m78uwgrvo95a1.gif<|eol|><|sor|>this bird is javascript embodied<|eor|><|sor|>Exactly. I think a better title would be What users see vs. What the codebase looks like. All needlessly complicated bullshit!<|eor|><|eols|><|endoftext|> | 32 |
programmerhumor | mawerty123 | 12ghz9x | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|eols|><|endoftext|> | 41,769 |
programmerhumor | IsaacLeDieu | jfkafqc | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>The great thing is that the bigger the number, the more accurate it gets!<|eor|><|eols|><|endoftext|> | 12,832 |
programmerhumor | alexvoedi | jfkc4zq | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>By using the prime number theorem you can even show that the accuracy of this algorithm approaches 100% for x in {1, 2, 3, ..., n} for n to inf.<|eor|><|eols|><|endoftext|> | 5,112 |
programmerhumor | Chill-Sam | jfkdi3q | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>Ah a truly beautiful algorithm. And it never returns false positives! Truly groundbreaking work.<|eor|><|eols|><|endoftext|> | 3,766 |
programmerhumor | Dyledion | jfkfh80 | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>The great thing is that the bigger the number, the more accurate it gets!<|eor|><|sor|>W E B S C A L E<|eor|><|eols|><|endoftext|> | 3,217 |
programmerhumor | Mwarw | jfkao4a | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>if I am correct, the percantage of correct answers will just keep going up with higher numbers, truly brilliant<|eor|><|eols|><|endoftext|> | 2,197 |
programmerhumor | Cocaine_Johnsson | jfke9pp | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>isn't this lim(x->) f(x) = 100.0% accuracy? For practical purposes we might as well say it's 99.999% accurate.<|eor|><|eols|><|endoftext|> | 1,003 |
programmerhumor | jeanleonino | jfklqho | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>The great thing is that the bigger the number, the more accurate it gets!<|eor|><|sor|>W E B S C A L E<|eor|><|sor|>Yo what is W E B S C A L E? Sound nifty<|eor|><|sor|>[Just in case someone doesn't know this classic.](https://www.youtube.com/watch?v=b2F-DItXtZs)<|eor|><|eols|><|endoftext|> | 868 |
programmerhumor | One_General190 | jfkjw8i | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>The great thing is that the bigger the number, the more accurate it gets!<|eor|><|sor|>W E B S C A L E<|eor|><|sor|>Yo what is W E B S C A L E? Sound nifty<|eor|><|eols|><|endoftext|> | 817 |
programmerhumor | mawerty123 | jfk9s2h | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|soopr|>https://github.com/mawerty/Is-Prime<|eoopr|><|eols|><|endoftext|> | 796 |
programmerhumor | DistortNeo | jfkemmi | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>if I am correct, the percantage of correct answers will just keep going up with higher numbers, truly brilliant<|eor|><|sor|>Thats not proven just a hypothesis<|eor|><|sor|>Orly?
https://en.wikipedia.org/wiki/Prime-counting_function
There are proven inequalities that guarantee the decrease of prime number rate.<|eor|><|eols|><|endoftext|> | 742 |
programmerhumor | alexlag64 | jfklj2v | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|soopr|>https://github.com/mawerty/Is-Prime<|eoopr|><|sor|>Love the fact that the "otpimized implementations" are just the same as the non otpimized, just written on a single line
EDIT : optimized<|eor|><|eols|><|endoftext|> | 561 |
programmerhumor | theonliestone | jfkhk40 | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>Ah a truly beautiful algorithm. And it never returns false positives! Truly groundbreaking work.<|eor|><|sor|>Fall-out = 0. This is marvelous, give that person a Field's medal<|eor|><|eols|><|endoftext|> | 467 |
programmerhumor | DavstrOne | jfkdfu1 | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>"Well Chief, since you gave me no specs, i assumed that the cost of false negatives was null, that the fix was extremely urgent and time complexity possibly a big factor.
So this is the best thing one can do given that specific context."<|eor|><|eols|><|endoftext|> | 461 |
programmerhumor | PennyFromMyAnus | jfk9vdb | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>95% of the time, it works some of the time.<|eor|><|eols|><|endoftext|> | 442 |
programmerhumor | nissenice | jfkpyu6 | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>By using the prime number theorem you can even show that the accuracy of this algorithm approaches 100% for x in {1, 2, 3, ..., n} for n to inf.<|eor|><|sor|>ahem
as n aproces inf, the number of primes goes to inf, so by using the formula to find how many the algorithm will get wrong we use: (no. primes / total no. ) * 100 -> plug that in and you get (inf/inf)*100 = 100%
so the algorithm will have a 100% faliture rate
but
if we instead use the formula for how many it gets right: (no. corrects / total no.)*100 we get inf/inf * 100 = 100%, so the algorithm will yell a 100% succes rate
find where i was wrong<|eor|><|sor|>That's not how to do limits, you were wrong in multiple places.<|eor|><|eols|><|endoftext|> | 429 |
programmerhumor | Current_Speaker_5684 | jfkjqtp | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>isn't this lim(x->) f(x) = 100.0% accuracy? For practical purposes we might as well say it's 99.999% accurate.<|eor|><|sor|>My research shows this also models the real world rejection rate for online dating.<|eor|><|eols|><|endoftext|> | 428 |
programmerhumor | hardwareDE | jfkoaur | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>The great thing is that the bigger the number, the more accurate it gets!<|eor|><|sor|>W E B S C A L E<|eor|><|sor|>Yo what is W E B S C A L E? Sound nifty<|eor|><|sor|>[Just in case someone doesn't know this classic.](https://www.youtube.com/watch?v=b2F-DItXtZs)<|eor|><|sor|>thanks for sharing this gem. only writing to /dev/null from now on.<|eor|><|eols|><|endoftext|> | 320 |
programmerhumor | g1ucose | jfkh4i6 | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>Im dumb at programming and understanding jokes, but what is going on here?
Wouldnt the function return false everytime?<|eor|><|sor|>If I'm trying to differentiate between dogs and cats and have a sample of 100 animals comprised of 95 dogs and 5 cats, I can immediately get a 95% success rate by predicting 'dog' every time<|eor|><|eols|><|endoftext|> | 316 |
programmerhumor | Kjubert | jfktkjj | <|sols|><|sot|>Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo<|eot|><|sol|>https://i.redd.it/5hqf5d6kpusa1.png<|eol|><|sor|>Ah a truly beautiful algorithm. And it never returns false positives! Truly groundbreaking work.<|eor|><|sor|>Fall-out = 0. This is marvelous, give that person a Field's medal<|eor|><|sor|>They could even `return x == 7` to boost accuracy!<|eor|><|eols|><|endoftext|> | 281 |
programmerhumor | mb557x | w18uog | <|sols|><|sot|>Linux users installing a Python module<|eot|><|sol|>https://v.redd.it/fdcbuoh835c91<|eol|><|eols|><|endoftext|> | 41,732 |
programmerhumor | itsmylastname | igiv8w4 | <|sols|><|sot|>Linux users installing a Python module<|eot|><|sol|>https://v.redd.it/fdcbuoh835c91<|eol|><|sor|>Bet if one of those monitors was vertical it would go a lot faster<|eor|><|eols|><|endoftext|> | 4,286 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.