Viewing profile — dzorz
dzorz
HN member- Joined
- Fri, Aug 24, 2007, 4:04 PM UTC
- HN karma
- 174
- Public activity
- 88 items
- HN profile
- View on Hacker News ↗
About dzorz
No profile information was provided.
Recent public activity
-
comment
Comment #4985187
FWIW iSSH on iOS has good X support.
-
comment
Comment #4560759
This is part of your /etc/shadow file: root:censored We can still read /etc/ssh/ssh_host_rsa_key, etc. Edit: removed hash, sorry
-
comment
Comment #3840252
clang uses the same ABI as gcc and if you find that something is binary incompatible then it is a bug.
-
comment
Comment #3831635
> approximately 60Gb of storage Is that Gb or GB?
-
comment
Comment #2912562
I use clang complete for vim. For me it is more precise than Visual Studio 2010 Intellisense (they use edg for code completion).
-
comment
Comment #2623179
It uses heap only as a fallback if maximum recursion depth is reached. The key difference between __introselect and the posted article is that __introselect uses pivoting to (ideal…
-
comment
Comment #2622402
The original article uses heap to get top K numbers. It's runtime complexity is O(N*log(K)) and nth_element is O(N), so the algorithms are not similar at all.
-
comment
Comment #2621716
Here is a solution in C++. It reads K and then N numbers from stdin and then prints K largest. The complexity of nth_element is O(N). #include #include #include #include using name…
-
comment
Comment #2615981
If you compile recent clang, it supports range based for loops. Using https://github.com/Rip-Rip/clang_complete you can use smart context-aware completion with vim/emacs. For examp…
-
comment
Comment #2615804
Even better: for (auto &x : vec) { }
-
comment
Comment #2597818
I managed to compile the program using shedskin, but it throws a runtime error after it finds the first solution: ==== solution 1 ===== (0, 2, 5, 7, 9, 4, 8, 1, 3, 6) terminate cal…
-
comment
Comment #2597729
140x speedup was compared to optimized python version. I've tried it vs. pypy now (version 1.5) - it is 20x faster.
-
comment
Comment #2597574
next_permutation is in standard library (header algorithm).
-
comment
Comment #2597519
I think this is an example where C++ really shines. The code is not much longer (44 vs 33 lines, although the output in python version is much nicer) than the python code and on my…
-
comment
Comment #2549744
Wow, that is amazing. I honestly never tried that and assumed (because of short circuiting) that it can't be overloaded.
-
comment
Comment #2549067
Actually you can't overload && although you can overload &.
-
comment
Comment #2395111
April 1st?
-
comment
Comment #2304323
What does LBS mean?
-
comment
Comment #2222994
C++0x solves that issue by introducing rvalues.
-
comment
Comment #2136209
IEEE is much more expensive.
-
comment
Comment #2027417
> it's because expressions separated by a comma can be evaluated in any order (I believe). Expressions separated by the comma operator are always evaluated left to right. On the ot…
-
comment
Comment #1994606
Although this version is very simple, concatenating and creating lists at runtime ruins performance (and it takes extra memory). Please make it a good example by doing a version of…
-
comment
Comment #1990529
> Still not convinced? Try this one (suggested by Mark Scarbrough ): #define DEVICE_COUNT 4 uint8 *szDevNames[DEVICE_COUNT] = { "SelectSet 5000", "SelectSet 7000"}; /* table has tw…
-
comment
Comment #1913677
I think uzbl is much more promising. It is built on WebKit and with little tweaks you can install it without X: http://lug.rose-hulman.edu/wiki/DirectFB
-
comment
Comment #1758007
80% per month sounds crazy, but it is not even close to top 6: http://en.wikipedia.org/wiki/Hyperinflation#Worst_Hyperinfla...