attractivechaos

22 ms·

1. 211.▲
   by attractivechaos 14y ago

   Suffix array is usually built for ONE string, but in his work, OP probably needs multiple strings, for which trie is a conceptually better representation.
2. 212.▲
   by attractivechaos 14y ago

   The problem with bioinformatics is not "prematured optimization", but rather no optimization at all.
3. 213.▲
   by attractivechaos 14y ago

   My major concern with gnome/unity/xfce is that the default font sizes look too big and really ugly. I guess choosing the right font sizes is not so trivial given various resolutions, but on fonts, every bit of effort will be paid off. And t
4. 214.▲
   by attractivechaos 14y ago

   I do not know how clang achieves that, either. BTW, with gcc, I usually do something like this: "gcc -E prog.c | grep -v ^# | indent > prog-fmt.c" This is quite clumsy, though.
5. 215.▲
   by attractivechaos 14y ago

   On error report: I wrote some programs in C that heavily reply on huge macros to mimic template in C++. The gcc error report is completely useless as it points to the line with the entire function expanded to a single line. Clang is much mo
6. 216.▲
   by attractivechaos 15y ago

   I agree. In particular I am not sure why "Clone in Mac" is put at an obvious place. I never tried it until a minute ago. I would rather see a "Download" button there. Perhaps only I have the minor complaint.
7. 217.▲
   ShowHN: Graphical view of HN polls on favorite/disliked programming languages(attractivechaos.github.com)

   9 points by attractivechaos 15y ago|0 comments
8. 218.▲
   by attractivechaos 15y ago

   Yes, that could explain off some differences between python and C++ in these two polls, but right now, over 95% python voters favor it as opposed to about 50% for C++. I can hardly believe your argument alone can explain off this huge diffe
9. 219.▲
   by attractivechaos 15y ago

   Thanks a lot (and sorry for repeated post; there was something wrong with my browser)! I have also got my version of the plot: http://attractivechaos.github.com/votes.png
10. 220.▲
    by attractivechaos 15y ago

    I like it. It is possible to show the other poll (on favorite languages) along side? Thank you!
11. 221.▲
    by attractivechaos 15y ago

    I do not know why someone has downvoted zxy. He/she has the point: python is used by many but few dislike it. Python is a third kind: the ones people like. Bjarne was looking for excuses for his bad C++.
12. 222.▲
    by attractivechaos 15y ago

    I agree this poll by itself is a little misleading, but if we take this poll and the poll on the favorite languages, we will get a better picture of what people are thinking. Here are the numbers for a few popular ones, as of now: C:780,22;
13. 223.▲
    by attractivechaos 15y ago

    For some tasks, JRuby is faster than python and for others, it is slower, but the difference is not big. PyPy is significantly faster in most cases than both.
14. 224.▲
    by attractivechaos 15y ago

    I think immutable strings are in general a good thing, but for some applications, having mutable strings will make my life much easier.
15. 225.▲
    by attractivechaos 15y ago

    That is interesting. According to the computer language benchmark games, Python programs always have fewer LOCs: http://shootout.alioth.debian.org/u64/benchmark.php?test=all... I know most programs there are written in an unusual way, but
16. 226.▲
    by attractivechaos 15y ago

    I actually quite like Javascript, especially for its speed. However, the major obstacle to me is that JS is locked in web development. It even does not have a standardized module to read files line by line, let alone other system-level stuf
17. 227.▲
    by attractivechaos 15y ago

    If comparing browsers is the purpose, then the author should not put WebM and H264 in the title.
18. 228.▲
    by attractivechaos 15y ago

    Can you find the proof that finding all LCS is O(n^3)? The author was talking about "the standard algorithm for computing LCS". I was assuming the standard algorithm finds one LCS only.
19. 229.▲
    by attractivechaos 15y ago

    The longest common substring problem (LCS) can be solved in O(n^2) time using dynamic programming, not O(n^3) as is stated by the author of that post. If the author is unable to get the basic fact right, I can hardly trust his benchmark. Al