« first day (838 days earlier)      last day (3194 days later) » 

2:00 PM
Go read about the differences. I can't remember exactly what the difference is, but If is nice for things like...
 
I'm trying to phase out all the VB method calls.
 
well... I don't know..
If only evaluates the side it needs to
 
That is, instead of IsNothing(var), I am using var Is Nothing.
@nhgrif Yeah, it short-circuits.
I.e.: If(text Is Nothing, 0, text.Length) is safe, IIf(text Is Nothing, 0, text.Length) is not.
Because IIf will evaluate both.
Whereas If will evaluate the one that it needs to.
Similarly to And vs AndAlso.
AndAlso short-circuits.
 
Right
 
(Which, he didn't understand short-circuiting vs. non-short-circuiting either.)
 
2:02 PM
That's because And is a bitwise operator, not a boolean operator.
 
@nhgrif Correct.
 
Like Or is bitwise and OrElse is Boolean.
 
Yep.
For example, I have a line (which needs a lot of cleaning, albeit) that is: CanUse = B And Not (C And D) And ((F = "O" And ((C And (A Or G)) Or (D And (A Or H)))) Or (F = "A" And ((C And (A And G)) Or (D And (A And H)))) Or ((Not C And Not D) And A))
And he couldn't understand how such a thing could work...lol
                            ' --------------------------------------------------------------------------------------
                            ' This is whether or not the coupon can be used, based on the following requirements:
                            ' B must be True indicating that they are eligible to use this coupon.
                            ' C and D cannot be the same.
                            ' --------------------------------------------------------------------------------------
That's the comment block above it, as well.
 
1
Q: Ember.js blog app architecture

SunriseI decided to create simple blog app by using Ember.js which should has the following interface For this purpose I created blog route which contain the following code: import Ember from 'ember'; export default Ember.Route.extend({ setupController: function (controller, model) { controll...

 
Apparently, you can also null-coalesce with If.
 
2:08 PM
I think we're getting off-topic from the original question here, but this is a serious issue so I recommend you take your code over to the CodeReview site and ask a more direct question there about how to improve it, particularly with regard to database security. You'll need to supply other parts of your PHP code as well to give the full picture. — Simba 29 secs ago
 
I.e.: If(result, "Alternative") will return result unless it's Nothing, then it returns Alternative.
 
Greetings
 
@IsmaelMiguel Greetings.
 
Wouldn't it be better to create a room to talk about Swift?
It isn't a topic about the website in general
And important messages may be obfuscated by the wall of messages
 
@IsmaelMiguel Why? There's no official site business going on, so what's wrong with Swift talk
 
2:09 PM
Nothing
 
@IsmaelMiguel This coming from the guy that talks about how he burned a pizza in here the other day.
 
@IsmaelMiguel That's what we have stars for
 
I just think it would be better to talk in a new room
 
@EBrown Oh, sorry for not wanting to bloat the chat with 100 messages about Swift
I'm interested in the talk
Just wanted to separate business from other things
18 < 100
 
2:11 PM
Why can't this be business? We haven't an election, or drama, or conflicts going on. Why can't Swift be business?
 
You are getting me wrong
 
I mean, it's interesting to wait until the conversation is done to make these complaints.
2
 
@nhgrif That ^^
 
@nhgrif didn't he just log in?
 
2:12 PM
@Quill I did
 
Hey @Phrancis, how goes the new job?
 
@EBrown I wasn't looking at the chat
 
That was literally at the very beginning of Swift discussion.
 
I was on 30 minutes ago
 
2:13 PM
@EBrown ctrl+w - wait 30 minutes - ctrl+shift+t?
 
But the conversation kept going on and on
 
@Quill Hey it goes great! I'm working on a big cleanup job right now involving cursors and dynamic querying! How goes it yourself?
 
@Quill Something close to that. I had to walk to work
 
@Phrancis I've got finals in the next few weeks, and I'm finally managing to pass calculus by learning .
 
Nice nice
 
2:16 PM
is a cool language. For such a small device, it really has lots of features.
 
Greetings, Programs.
 
@Donald.McLean Greetings, user
 
@Phrancis Are those similar to prepared statements?
 
@Quill No, prepared statements are stored procedures/functions, basically containers where you can put any number of statements/operations and execute as a batch
 
@Phrancis Oh, so what are cursors then?
(Sorry for the basic question)
 
2:20 PM
A cursor in SQL is kind of roughly equivalent to a point in programming... sort of...
 
@Phrancis Don't forget that functions return values and procedures have out parameters.
 
@Quill Cursors are analogous for loops, e.g., for record in records { perform these operation }
 
@Phrancis ah, I see
 
i.e. if you're using a cursor, you're probably doing it wrong
2
 
And if you're doing a for-in loop in SQL, there's a good chance you're doing it wrong.
 
2:21 PM
lol
2
 
Not used very often in Sql, but sometimes you just need them
 
Very rarely.
 
Right. This is one of those rare cases
 
Any time spent investigating a way to not use the cursor is time well spent.
 
@Mat'sMug So I was unprepared for GitHub spamming my email.
 
2:22 PM
@nhgrif Already did that, this is kind of a last recourse
 
@Mat'sMug Yeah, I saw the SO qs about set-based queries vs cursors
 
@EBrown wait 'till @Hosch250 starts contributing to your repo then!
2
 
I am now getting all of the autolayout tasks for the project I'm working on.
 
@Mat'sMug He's more than welcome to. I would greatly appreciate the assistance on it. :)
It's a pretty large task to take on.
 
just kidding really. I don't even know how many unread GitHub notifications I have in my inbox
could be a thousand
 
2:25 PM
@Mat'sMug ^^
 
@EBrown Make a filter
 
geez
 
I did. The [Rubberduck] ones are filtered the Inbox.Rubberduck folder.
 
@Quill Example cursor I made - The cursor starts at line 50 declare _nums cursor for
 
@Mat'sMug The blue numbers are unread email counts. :)
 
2:26 PM
@Phrancis soo.. our postgres procedures that maybe or maybe not should be views are making extensive use of FOR ... IN EXECUTE SELECT.
 
I just happened to notice (this morning, when I was deleting spam) a bunch of emails from random names, that said [Rubberduck] something something something... in the subject.
 
Wasn't it in German?
 
@EBrown if you're getting issues and pull request notifications...
 
@Mat'sMug It's not bother, I was just unprepared...lol
 
cough it's an active project ;-)
 
2:33 PM
I wasn't aware that GitHub emailed those as well.
The notifications don't bother me, I just didn't expect email spam along with it.
 
you can cherry-pick which notifications you get if you want
 
It's fine though, I made them a folder. :)
 
13 more stars and the main repo will have 100 stargazers
 
I still need 97 for that. :)
 
@Vogel612 Any particular reason for making extensive use of FOR loops in your Postgres procedures?
 
2:39 PM
Calculations, nested for loops conditional calculations and RETURN NEXT
also dynamically built sql.
 
Ah. Sounds like you do in fact need loops
 
@Mat'sMug Can I borrow your best-practices brain for a second?
 
sure what's up?
 
Does this extension method look appropriate:
        public static Direction? GetDirection(this IVector2 vector)
        {
            if (vector.R > 0)
            {
                double theta = vector.Theta;

                if (Math.Abs(theta) <= Math.PI * 0.25f)
                    return Direction.Right;

                if (Math.Abs(theta) >= Math.PI * 0.75f)
                    return Direction.Left;

                if (theta >= Math.PI * 0.25f && theta < Math.PI * 0.75f)
                    return Direction.Down;

                return Direction.Up;
Originally, I had all the if blocks as if/else if/else if/else respectively, but it seems with my early-returns I can forget that.
 
2:55 PM
you can remove a nesting level by returning null right away if (vector.R <= 0)
 
Ah, doh!
Now I just need to test the code changes I made to Form.Activate() and commit that as well.
With Git I don't need to leave dead-code, do I? Because I can just revert that specific commit.
 
kill dead code. with fire.
3
 
Optimization questions are more appropriate for codereview.stackexchange.comSamuel 45 secs ago
 
So my CR rep has officially passed my SO rep. :)
4
 
@EBrown That's my programmed goal.
> I have done this but code
I think he forgot a 't'
 
3:01 PM
butt code?
 
@Mat'sMug If you want to be bad, yes
I didn't say where it was missing
 
Relatively long code answer coming up, I'll need some critique on it.
 
But seriously
Look at the code:
 static int pairs(int[] a,int k) {
   int counter=0;
   for (int i : a.length ) {
     for(int j=i+1;j<a.length;j++){
        if(a[i]-a[j]==k||a[i]-a[j]==-k){
            counter++;

         }
     }
  }

return counter;
}
 
ugh
 
I'm voting to close this question as off-topic because it's an optimization question. The code works but isn't the most efficient implementation. More appropriate for codereview.stackexchange.com — Samuel 36 secs ago
 
3:03 PM
Oh yeah, now you see why the missing 't'
 
suffocating
 
Everytime I see that code, I imagine a sheep saying "Baaaaaaaahd"
 
0
A: RPG game using XNA

EBrownThere are a lot of ways to shorten this, my favourite is to create a Character or Player class and move the movement code into it. For example, I have a world class that has an Update method as follows: public void Update(MouseState mState, GameTime gameTime, bool hasFocus) { Vector2F vecto...

Of course, some code in my answer is now outdated. :P
 
Question:
Having too many classes and interfaces can cause slow code?
 
3:19 PM
@IsmaelMiguel That probably depends on the language, and the coupling.
 
-2
Q: Simple tic-tac-toe game in Javascript and HTML

Tapojyoti GhoshI'm relatively new to programming and just finished writing a simple tic-tac-toe game in Javascript. Please tell me if it's generally OK or if some features are lacking and if so how to add them. Any other comments or suggestions for improvement are welcome. Link(it's a 6kb HTML file contaning j...

2
Q: Long running time on VBA macro which filters and splits dataset into new workbooks

AymorThe VBA macro below uses a worksheet (source_data_worksheet) to filter and split out the records based on about a dozen unique column (D) values in a dataset of about to separate workbooks which are saved to a folder. There are over 10,000 records x 18 columns total with text and numbers (the o...

 
@IsmaelMiguel at least for java not in the long run
it's true that invokeinterface is slightly slower than invoke, but the JIT can inline and learns quite well
 
I was thinking about C# and C++
Because Tera is f*cking slow and CPU-hungry
Maybe they are doing best practices and that slows the game?
 
@CaptainObvious May I remind people to add comments when they downvote and there are no other comments already?
11
User noticed that question got -2, user deleted question. Will user come back?
 
@SimonAndréForsberg will user RTFM?
 
3:30 PM
@SimonAndréForsberg I think I saw that when it was at 0. (Didn't up- or down-vote.)
 
@Mat'sMug We don't have a FM here. We only have a M. Or rather, a HC.
 
@SimonAndréForsberg Should this be pinned?
 
Nah. Starring it is enough.
 
I think it is pin-worthy but I'm no Room Owner
 
0
Q: Optimizing code for finding total number of combination from given numbers whose difference is given?

Rahul Singhpairs is function which return total number of combination whose difference is k. static int pairs(int[] a,int k) { int counter=0; for (int i : a.length ) { for(int j=i+1;j<a.length;j++){ if(a[i]-a[j]==k||a[i]-a[j]==-k){ counte...

 
3:37 PM
@Malachi IceDragon with GreaseMonkey.
 
Firefox doesn't have GM_Notifications API so I am currently trying to fix that issue
 
@Malachi You can try HTML5 notifications
 
I posted this question on codereview.stackexchange.com but d'nt get any reply. So it sholud be on stack overflow for discussion . — Rahul Singh 53 secs ago
 
I found an alternative, but can't get my code to play along
we are talking about it in here --> JavaScript Libraries
 
912 reviews done - 88 to go.
The last one needs to be VTC'ed.
 
3:47 PM
For any badge?
 
0
Q: Inserting Foreign key in Java to Database

CoderSheiHi i just wanted to ask some of my codes i am always getting nullpointer exception,i have a query here in my Netbeans IDE to pass with the value pStmt2 = conn.prepareStatement("insert into Audittrail_tbl (Payment,Customer_ID) values (?,(Select Name_ID from Customer_tbl where FName ='"+txtFName.g...

 
@Hosch250 then you can go for Copy Editor
 
@IsmaelMiguel The gold Reviewer badge for the First Posts queue.
 
Oh, nice!
 
@Quill I'm working on it. And Marshal.
 
3:48 PM
I want gold too!
 
That question needs to be closed as broken.
 
0
Q: Inserting Foreign key in Java to Database

CoderSheiHi i just wanted to ask some of my codes i am always getting nullpointer exception,i have a query here in my Netbeans IDE to pass with the value pStmt2 = conn.prepareStatement("insert into Audittrail_tbl (Payment,Customer_ID) values (?,(Select Name_ID from Customer_tbl where FName ='"+txtFName.g...

 
@Hosch250 I'm working on Marshal also. One of these days when Mat'sMug and Simon are online, I might with their permission start going through the queries.
 
@Hosch250 poof, done.
 
@Quill I got Marshall.
@SimonAndréForsberg Good.
@Quill It will take longer, but you could start working on it slowly - one/two questions a day.
 
3:52 PM
@Hosch250 I know, sorry, my wording was wrong.
 
Not right on top of each other, but just like you happened on them by chance.
 
@Hosch250 I'm active enough to get that many anyway, but, yeah, thanks for the advice
 
@Quill If you want me to process flags, please wait a couple of days until I am no longer sick!
 
3 mins ago, by Quill
@Hosch250 I'm working on Marshal also. One of these days when Mat'sMug and Simon are online, I might with their permission start going through the queries.
> With their permission
 
3:56 PM
Should this be a Stack Overflow question?
1
Q: Legacy application unreachable code

Nenad BulatovicI am debugging one legacy J2EE application I and think I found some dead code and some redundant condition checks. Please give me your thoughts on my observations i.e. if they are valid. Please note that I am not permitted to rewrite this block, only to fix something if wrong or redundant. ... e...

 
> Please note that I am not permitted to rewrite this block
 
@200_success meh. It's specific, but it's as close to real code as it gets ...
also it's probably not specific enough.
somewhat limbo-ey
@Quill external constraint that does not restrict the scope of reviews overall, just the usefulness of certain points to OP
 
I'm not a code review expert but... this seems more fit for the code review site. — Dason 42 secs ago
 
indeed. if code needs to change, we can give OP some ammo to back up why
 
@SimonAndréForsberg To be quite honest, I thought that was a Javascript question at first.
 
4:04 PM
@Dason The question is asking why a code is slower than the other. This type of question is off-topic on Code Review since the intention is to obtain an explanation about the code and not a review. — Ismael Miguel 41 secs ago
 
Also, I thought for (int i : a.length ) was valid Java?
 
@EBrown If it was for(int i : a), it would be valid.
(I read about it)
That is, assuming a is an array
 
That's what it is.
 
Then the way I said is valid
 
@EBrown the thing after the colon must be an Iterable
int usually doesn't implement iterable
 
4:06 PM
@Vogel612 Indeed, just found that on the Oracle stuff.
 
@Vogel612 Close it as broken?
 
wat?
context??
 
I'm asking
 
@EBrown This is how to do it:
2
A: Optimizing code for finding total number of combination from given numbers whose difference is given?

Simon André ForsbergCurrent complexity is \$O(n^2)\$, you can accomplish this with \$O(n log n)\$ instead by sorting the array first and then loop through the elements. Let's say that you know that the array is sorted, and the array is for example 4 8 15 16 23 42 and you want to find the diff 7: Let's initialize t...

 
@SimonAndréForsberg That is a way to do it.
 
4:11 PM
@EBrown This is how to do it in a complexity that is better than O(n^2)
 
@SimonAndréForsberg Indeed.
 
@IsmaelMiguel what question?
 
the legacy code one doesn't use an enhanced for-loop ....
 
@EBrown and can be written as only one for-loop
 
4:13 PM
@Hosch250 this should work for you in GreaseMonkey --> github.com/malachi26/ReviewQueueNotifier/blob/Development/…
 
@SimonAndréForsberg I'll probably just delete my answer anyway.
 
@Vogel612 I believe he's talking about the question I just answered
@EBrown I wouldn't recommend that.
 
now to get some work done....
 
@SimonAndréForsberg Why? It carries no merit at this point.
 
@SimonAndréForsberg hmm makes more sense...
 
4:15 PM
@EBrown well, choice is yours of course. You did clear up the formatting of the code, but you haven't mentioned the formatting issues (yet...)
and the current advice in it isn't "bad" really...
@EBrown For future reference, whenever you encounter a question that is about arrays/lists/stuff, ask yourself: Would it help if the values were sorted?
 
@SimonAndréForsberg Probably will help
 
@SimonAndréForsberg I honestly didn't want to have to put a lot of time into this question.
 
Sometimes it can help reducing the time complexity to O(n log n), sometimes it just does unnecessary work.
I didn't put a lot of time into it, I just thought "there's a faster way to do this using a different approach", and wrote that.
 
Personally I always half-split for things like this.
 
half-split?
 
4:19 PM
Start in the middle and move left/right from there.
I.e. for this case, start at the middle element, if the difference between the current element and the middle element is greater than k, we know we need to move closer to the current element, so then move to the element halfway between the middle element and our initial element.
Which can help you reduce it even further, and process it in parallel for certain things.
Though, most of my array applications like that are searching more than anything.
"What element is missing from {1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13} given that each element should be prev-element + 1?" Start at index 6, which is value 7, which is larger than what it should be, so then move to index 3, which is value 3, which is where it should be, so move to index 5, which is value 6, which is larger than it should be, so move to index 4, which is value 4, which is what it should be. Thus, we are missing value 5 from index 5.
 
@EBrown that is making it more complicated IMO. Then you would have to choose between "increase lowIndex" and "decrease highIndex".
@EBrown index 5 has value 6. fixed that for you.
 
@SimonAndréForsberg Yes, but depending on the size of the data-set, it could be faster.
(Of course, not if you use "big-O" notation, but personally I'm not a fan of it anyway.)
 
that search-middle-approach is a binary search, that's O(log n), sure that helps a lot
 
@SimonAndréForsberg It's extremely quick on obscenely large data-sets.
Of course, you should also factor in the distribution of your triggers.
 
@EBrown I can't prove you wrong on that one.
@EBrown yeah, that's the whole point of O(log n) approaches...
 
4:27 PM
One of the projects I have at home has a data set which is 1 million+ records at any given point in time, and they are all supposed to increment a specific interval (a[n] = a[n - 1] + 1).
The half-split (or "search-middle-approach" as you refer to it) is extremely quick there compared to the alternatives.
 
@EBrown Why are you not a fan of big-O notation?
 
@SimonAndréForsberg I've just never liked it. I hate how O(2n) reduces to O(n).
But, when you consider that in my data-set the missing elements are more likely to be at the beginning, you can make some other alterations to the algorithm to take that into account.
 
'night
 
@Quill Later. :)
 
for (int i : array) { a += i; b *= i; }
vs.
for (int i : array) { a += i; }
for (int i : array) { b *= i; }
Which is faster?
(and what are the complexities?)
 
4:30 PM
@SimonAndréForsberg My bet would be the first one.
@SimonAndréForsberg Well, from what I was taught it would be O(n) for both.
 
exactly. But wouldn't you say that the second one is O(2n) ?
 
@SimonAndréForsberg Nope, because in big-O O(2n) reduces to O(n).
Because big-O is only concerned about how the complexity scales. Both are linear-complexities.
That is, as the data-set grows, the complexity grows in a linear scale to the data-set.
 
@EBrown that is my whole point exactly. The second one can be said as O(2n), but in reality it is doing the same thing as the first one. Their complexities are equal.
4 mins ago, by EBrown
@SimonAndréForsberg I've just never liked it. I hate how O(2n) reduces to O(n).
 
@SimonAndréForsberg Except the problem is that in the real world the second one is significantly slower.
 
I find it fully reasonable that O(2n) reduces to O(n)
@EBrown for some values of "significantly"?
 
4:33 PM
@SimonAndréForsberg But I don't, which is why I don't use it. :P
 
I don't think there will be any significant difference at all.
 
I'd rather represent them by the actual complexities, where the second method scales twice as quickly as the first.
But big-O finds that irrelevant.
The big-O notation finds coefficients unnecessary.
Unless that coefficient is n.
Or some function of n.
 
@EBrown maybe I should run these through github.com/rolfl/MicroBench and see what the actual values are...
 
@SimonAndréForsberg That would be interesting, though it would likely optimize the second version.
 
hmm... damn JIT...
 
4:37 PM
0
Q: Simple function to verify if a number is integer

Ismael MiguelSometimes, there's the need to verify if a given number is an integer or a decimal. Since Javascript doesn't distinguish between both, I've made an extremelly basic function. function isInteger(num){ var numCopy = parseFloat(num); return !isNaN(numCopy) && numCopy == numCopy.toFixed(); }...

 
@CaptainObvious Warning: huge code ahead!
 
I only just noticed this: stackoverflow.com/10m
pretty cool
 
Wow
Where did you found that?
 
Jeremy Banks won?
BTW, those downvotes are piling up fast...
 
@IsmaelMiguel stackoverflow.com/questions/10000000
 
4:47 PM
That question does not deserve 17 upvotes.
It should actually be closed as gimme teh codez.
At least it is just a guest user.
 
@Hosch250 That was 1 million, whoops
 
@Quill Downvoted. It's really bad
 
> Together, we've built a place where every 12 seconds a developer posts an answer that helps fellow coders.
I seriously doubt that all those answers actually help... considering how much crap there is
 
@Quill Interestingly enough, that leads to an answer.
 
@Hosch250 I've either got it completely wrong, or I've got it completely wrong
 
4:51 PM
@Quill question number 10 million != post id 10 million
 
22 secs ago, by Quill
@Hosch250 I've either got it completely wrong, or I've got it completely wrong
 
remember that there's a whole bunch of deleted questions, that doesn't count for the "question number 10 million"
 
@SimonAndréForsberg Did you figure anything out about the comparison of those two loops?
 
@EBrown nope. Haven't tried to figure anything out either. There are more important issues in the world.
 
5:10 PM
@SimonAndréForsberg Well I did, in C#, and the results solidify my point: I ran a test of 100,000,000 numbers, 0 trough 100,000,000, keeping a running sum and a running difference. The results indicated: ~308ms for the combined loop, and about ~515ms for the separate loops. Indicating, that the separate loops are (as predicted) slower.
            int arraySize = 100000000;
            int[] arrayValues = new int[arraySize];
            for (int i = 0; i < arraySize; i++)
                arrayValues[i] = i;

            int sum = 0;
            int diff = 0;
            sw1.Start();
            for (int i = 0; i < arraySize; i++)
            {
                sum += arrayValues[i];
                diff -= arrayValues[i];
            }
            sw1.Stop();

            Console.WriteLine("Combined loop: {0}ms", sw1.ElapsedMilliseconds);
            sw1.Reset();

            sum = 0;
            diff = 0;
            sw1.Start();
            for (int i = 0; i < arraySize; i++)
                sum += arrayValues[i];
            for (int i = 0; i < arraySize; i++)
                diff -= arrayValues[i];
            sw1.Stop();

            Console.WriteLine("Separate loops: {0}ms", sw1.ElapsedMilliseconds);
            Console.WriteLine("Results: Sum: {0}, Difference: {1}", sum, diff);

            sw1.Reset();
 
I posted my version of this in Python to CodeReview if you're interested in seeing how I tried to handle it. — SuperBiasedMan 9 secs ago
 
@Duga Is that the 10.000.000th?
Nope
 
0
Q: Pitch Detection (FFT / Harmonic Product Spectrum) - What's wrong?

Andreas KühntopfI've whipped together a small example that tries to use the Harmonic Product Spectrum Algorithm to extract the pitch of a simple sine wave. I'm not sure about my implementation and if i understood everything completely, that's why i'm hoping for some helping hand here. The code is here: https://...

0
Q: Recursive Fibonacci Generator that tries to guard against too much recursion

SuperBiasedManI decided to write a function that would generate an index of the Fibonacci sequence making use of Python's mutable default parameter. It's inspired by a question I answered on Stack Overflow where someone was converting a script with this idea from Javascript to Python and I wanted to expand on ...

0
Q: Implementation of Line Drawing Algorithm doesn't work properly

anonymous#include <iostream> #include "utils.h" void BresenhamLine(double x1, double y1, double x2, double y2, int color) { if(x1>x2 || y1>y2) { Swap(x1, x2); Swap(y1, y2); } double x = x1; double y = y1; double dx = x2 - x1; double dy = y2 - y1; double dt ...

0
Q: Lorem ipsum chat bot

ScottI made a chat bot that emulates an SMS app found on smartphones, etc. It responds with random lorem ipsum text. I'm wondering if my functions are too long and how/if I should refactor further. It reads in a JSON object, which consists of an array of word lengths and words sorted by length (i.e. ...

 
http://www.commitstrip.com/en/2015/08/20/the-moral-of-the-ashley-madison-leak/
CommitStrip - Blog relating the daily life of web agencies developers
The moral of the Ashley Madison leak
CommitStrip
1440090676
 
this site would probably be a better place to ask codereview.stackexchange.comMatt Bodily 11 secs ago
 
5:19 PM
@CommitStrip Why do we have this thing?
 
there's one for xkcd, too
 
@IsmaelMiguel
 
But it's garbage, in my horrible opinion
The xkcd is acceptable
The commitstrip is boring
 
@IsmaelMiguel I really want to flag this message.
 
@EBrown Go ahead, flag it. You are free to do what you want. This is a free world. For some values of free.
 
5:22 PM
Don't hate on CommitStrip. It's moderately entertaining and breaks some of the boring-ness that is IT.
 
Yes, by introducing another type of boredoom
 
You don't have to read it.
 
I know
I just asked why we have that
And gave my opinion
 
you can ignore the user
 
We have it because most of us find it entertaining.
 
5:24 PM
@DanLyons Great idea!
I don't have the option to ignore :/
@EBrown Now I know.
 
when I click on the user image, I get the option to hide/ignore
 
Weird
Stupid me -.-
I clicked on the message arrow -.-
I always assume that clicking on the photo will open the user's profile
 
@EBrown well that particular one was meh.. but sometimes they're just outright LOL
 
@Mat'sMug For some values of "LOL"?
 
I thought this one was pretty good
 
5:27 PM
@Mat'sMug I find many of them pretty damn funny.
Like this one.
 
@EBrown I don't get it
 
I honestly don't get them...
 
5:31 PM
flash was awesome
 
@Mat'sMug The flash one was the best.
Damnit, beat me to it. :)
 
:)
 
0
Q: Compute correlation (3 types) of stock ticker

PulkownikI developing web application and logged in user can find most correlated stocks for selected stock ticker. User choose ticker, period of time (10, 30, 60, 90) and type of correlation (KENDALLS, PEARSONS, SPEARMANS). Then on the server side the 'magic' happen and server response to client list of ...

 
I only got the flash one, and it wasn't that good.
 
5:35 PM
Oh buddy. That code needs some work. You might want to pass it off to codereview.se — Zachary Dow 43 secs ago
 
that one primarily depends on how much you hate flash
 
@IsmaelMiguel you're into unix right? try russian roulette
 
@DanLyons I like flash
 
other than that, I give up
 
IMO, for all its faults, flash still does a handful of things far better than raw js/html
 
5:36 PM
@Mat'sMug I forgot about that one! That's so perfect. :)
 
you'll probably never see a newgrounds site built in pure js/html, for example
 
@Mat'sMug I saw that code before. It kills the root if the random number is 6
 
@Mat'sMug That's @Doorknob - if Linux ceased to exist, so would he.
 
@CommitStrip @IsmaelMiguel that particular one wasn't very funny, but I have really enjoyed some of them.
 
@DanLyons One of them is playing video.
 
5:37 PM
I did a tech evaluation of Flash and just found it really confusing. It's so much like Java in many ways, but it's almost like they deliberately made key syntax changes just to confound Java developers.
 
@SimonAndréForsberg So far, none was funny
 
@IsmaelMiguel Sorry you feel that way, but many others of us feel differently.
 
feel free to ignore the feed
 
@SimonAndréForsberg I know.
@Mat'sMug I did. I'm a happier man now
 
as an Android 2.3 user myself, I do find this one funny commitstrip.com/en/2015/08/page/6
 
5:40 PM
@SimonAndréForsberg That was definitely a good one.
 
Can someone translate that?
 
TTGTL.
 
Time To Go To Lunch?
 
1
Q: Selecting mail messages that meet one of four search criteria

Ekinselect * from Mail where admin_status = 1 and admin_id = 4 and core_event_id =0 and user_id !=0 and mail_reply_status = 0 and sent_to = 0 and admin_inbox_date > DATE_SUB(CURDATE(), INTERVAL 48 HOUR) or ( admin_status = 1 and admin_id = 4 AND sent_to = 0 and mail_reply_status = 0 and u...

 
twitch plays iptables
heh
 
5:52 PM
@GraceNote why do I read "having a logo" as "possibility for site-specific swag"? ;-) — Mat's Mug 25 secs ago
 
0
Q: JQuery slider doesn´working

Kraftinger LpI want to show div by sliding it to right, but it doesn´t working. This is my code: $(document).ready(function() { $('.socialli').hover( function () { $(this).find(".slili").show(slide{"direction","right"} ,400); }, function () { ...

 
@CaptainObvious Broken
 

« first day (838 days earlier)      last day (3194 days later) »