FWIW iSSH on iOS has good X support.
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
clang uses the same ABI as gcc and if you find that something is binary incompatible then it is a bug.
> approximately 60Gb of storage Is that Gb or GB?
I use clang complete for vim. For me it is more precise than Visual Studio 2010 Intellisense (they use edg for code completion).
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 (ideally) "throw" away half of the array…
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.
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 <algorithm> #include <vector> #include <iostream>…
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 example if you had this code:…
Even better: for (auto &x : vec) { }
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 called after throwing an instance of…
140x speedup was compared to optimized python version. I've tried it vs. pypy now (version 1.5) - it is 20x faster.
next_permutation is in standard library (header algorithm).
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 computer it is about 140x faster than…
Wow, that is amazing. I honestly never tried that and assumed (because of short circuiting) that it can't be overloaded.
Actually you can't overload && although you can overload &.
April 1st?
What does LBS mean?
C++0x solves that issue by introducing rvalues.
IEEE is much more expensive.
> 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 other hand function arguments (which…
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 Quicksort with in-place partition.
> Still not convinced? Try this one (suggested by Mark Scarbrough ): #define DEVICE_COUNT 4 uint8 *szDevNames[DEVICE_COUNT] = { "SelectSet 5000", "SelectSet 7000"}; /* table has two entries of junk */ Actually, the…
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
80% per month sounds crazy, but it is not even close to top 6: http://en.wikipedia.org/wiki/Hyperinflation#Worst_Hyperinfla...
FWIW iSSH on iOS has good X support.
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
clang uses the same ABI as gcc and if you find that something is binary incompatible then it is a bug.
> approximately 60Gb of storage Is that Gb or GB?
I use clang complete for vim. For me it is more precise than Visual Studio 2010 Intellisense (they use edg for code completion).
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 (ideally) "throw" away half of the array…
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.
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 <algorithm> #include <vector> #include <iostream>…
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 example if you had this code:…
Even better: for (auto &x : vec) { }
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 called after throwing an instance of…
140x speedup was compared to optimized python version. I've tried it vs. pypy now (version 1.5) - it is 20x faster.
next_permutation is in standard library (header algorithm).
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 computer it is about 140x faster than…
Wow, that is amazing. I honestly never tried that and assumed (because of short circuiting) that it can't be overloaded.
Actually you can't overload && although you can overload &.
April 1st?
What does LBS mean?
C++0x solves that issue by introducing rvalues.
IEEE is much more expensive.
> 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 other hand function arguments (which…
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 Quicksort with in-place partition.
> Still not convinced? Try this one (suggested by Mark Scarbrough ): #define DEVICE_COUNT 4 uint8 *szDevNames[DEVICE_COUNT] = { "SelectSet 5000", "SelectSet 7000"}; /* table has two entries of junk */ Actually, the…
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
80% per month sounds crazy, but it is not even close to top 6: http://en.wikipedia.org/wiki/Hyperinflation#Worst_Hyperinfla...