Hacker News Reader

Comment by denzil_correa | Hacker News Reader

An important comment on the bug from a Chromium employee [0]

    Hacker News crowd, let's please stop the "me too" party 
    here, and please file separate bugs for separate issues 
    (even if they're similar). Keeping the signal-to-noise 
    ratio sane on this one raises the chances that it gets 
    addressed :)
    So you can help by only commenting if you have technical    
    comments on how to fix the problem in Chrome. It'd be a 
    shame if we had to lock this bug to prevent further 
    useless comments.

[0] https://code.google.com/p/chromium/issues/detail?id=224182#c...

View on HN

You can always tell if something is garbage on here by looking at the average length of the comments. Almost every single comment on this link is an inane one-liner that adds nothing to any meaningful discussion. And lo and behold, it's the same sort of shitty discussion as on the bug report itself.

Compare this with the comments on the 21 Nested Callbacks link: https://news.ycombinator.com/item?id=5447287

Agreed. I'd pay for a Chrome extension that would score HN stories by this metric.

Reminds me of all the +1 comments on GitHub issues. They add nothing to the conversation and you can easily subscribe to an issue by clicking the "watch" button.

Your comment is no better.

Isn't it nice to know that there really are a bunch of other people who:

1. Have the problem

2. Take the time to voice their wish for a fix

Even the coolest bug will remain unfixed if only one person reports it.

> Even the coolest bug will remain unfixed if only one person reports it.

Is that true? The priority of the bug should depend on the properties of the bug and not on the number of bug reporters.

One rather important property is how many people are suffering from it.

You can star it. That would tell the developers how many people care about it in O(1) time, without having to wade through O(n) comments.

Alright, O(log n) time.

Why O(log n)? Is there a binary search involved somewhere (for example)? All you have got to do to find out how many people voted for it is to look at the vote count and this seems like an O(1) operation doesn't it?

The number n has log(n)/log(10) digits so it technically take log(n) time to read it.

only if log(n) > 7. Otherwise, subitization gives constant time reading of the magnitude of n.

Technically, O(log(n) <= 7 ? 1 : log(n)) is still O(log(n)) ... :)

Reply on news.ycombinator.com