quinnftw

8 ms·

1.
by quinnftw 3y ago
Looking at the code this appears [1] to be a very thin wrapper around go's built in file server from the http package. [1]: https://github.com/eliben/static-server/blob/main/internal/s...
2.
by quinnftw 5y ago
It could: What if a machine learning algorithm picked each of your dependency versions for you ~magically~
3.
by quinnftw 8y ago
I run a 2010 MacBook pro which I have upgraded the RAM and swapped out the disk for an SSD (luckily 2010 was pre motherboard soldering nonsense). It still runs like a champ 8 years later.
4.
by quinnftw 9y ago
I wonder if one could introduce a secondary classifier which is immune (or more resistant) to this kind of attack as a fail safe. One idea that comes to mind is to back the neural net with a random forest, which I imagine would be very har
5.
by quinnftw 9y ago
You can use caching to mimic this behaviour in Flask, I.e. http://flask.pocoo.org/docs/0.12/patterns/caching/ I'm not sure how this works with multiple threads though, I imagine you would have to sy
6.
by quinnftw 9y ago
Cruising along with frequent pit stops for garbage collection. All jokes aside I agree with you to some extent: C++ can be frustrating to work with, and there are a lot of quirks that make it really easy to blow your foot off. These quirks
7.
by quinnftw 9y ago
I thought this aswell, but you have it backwards. The point is to convert a string to it's corresponding enum, not the other way around.
8.
by quinnftw 9y ago
Genuine curiosity because I don't have a whole lot of experience with embedded systems: Why not just use C then? Either way I would argue that using sizeof in that way is a sketchy practise.
9.
by quinnftw 9y ago
One nitpick (and this applies to almost every site of this genre, i.e. geeksforgeeks, hackerrank, etc.): The code listed as "C++" is essentially C with ostreams. If I were interviewing someone and they claimed to know C++, and th
10.
by quinnftw 9y ago
I'd be interested in seeing the rational behind the fairshare policy. I suppose theoretically the firstfit policy could result in starvation via one thread constantly preempting another during the lock contention, but I don't ima
11.
by quinnftw 10y ago
This is true, though generally anytime one uses `auto` it should be `const auto&` to avoid swallowing the quantifiers and potentially costly copies anyways.
12.
by quinnftw 10y ago
Call me naive, but I REALLY think people are overreacting on this. Yes, the timing does seem quite coincidental given the Cloudflare bug, but Google has a pretty good record of being transparent with these things. On top of this, Google do
13.
by quinnftw 10y ago
Potentially, yes. Assuming that you are correctly synchronizing the actions inside each Task as to avoid race conditions (a big assumption), there is no control on the number of threads here. What if your program is already using a bunch
14.
by quinnftw 10y ago
I think what you are describing here is simply "average number of citations per year", no?
15.
by quinnftw 10y ago
Yes but mkfile uses syscalls to create and write to the file. With a smaller buffer more write syscalls are required to populate the file.
16.
by quinnftw 10y ago
I've found that most of my multithreading needs can be serviced by a simple thread pool that I rolled using the constructs that c++ provides (std::queue, std::thread, and std::future mainly). Obviously it's not heavily optimized,
17.
by quinnftw 10y ago
This particular one isn't large, but in general a pseudo-prime will produce similar effects.
18.
by quinnftw 10y ago
I noticed that too, I think he may be referring to the fact that generating super large actual prime numbers is hard, so people use probabilistic algorithms to generate probably almost primes
19.
by quinnftw 10y ago
Not quite. You can submit as many jobs as you'd like to the pool and it will delegate them to 16 threads. The pool maintains a queue of work to be done and the fixed number of threads consume from the queue.
20.
by quinnftw 10y ago
You could also do void foo(std::function<void(int)> callback);
21.
by quinnftw 10y ago
A few issues with this implementation: Is it really nessecary to allocate all of the hash buckets up front? Why not initialize them to null and then allocate them as you need? Why not use some kind of managed container like std vector to st
22.
by quinnftw 10y ago
OH! Haha my mistake, that wording is naturally ambiguous.
23.
by quinnftw 10y ago
You would think someone that works at LinkedIn, a company that likely employees hundreds (thousand(s)?), of engineers would have this proof read before sending it off to potential applicants. This is a real turn off.
24.
by quinnftw 10y ago
I develop solely in UNIX environments so I can't comment on its performance on windows, but it's fantastic on UNIX and very easy to write / configure.
25.
by quinnftw 10y ago
To piggy back on this comment: what build system are you using? I've found that bazel has greatly reduced compile times, even when using boost and opencv.
26.
by quinnftw 10y ago
Something to note: you state that BST's have logarithmic time in order successor, but many implementations use threaded binary trees which provide an amortized constant successor operation. Great article though.
27.
by quinnftw 10y ago
Is this not a binary perceptron? How do you plan to classify all 10 digits with this?
28.
by quinnftw 10y ago
I'm not sure I would classify printing hand written strings as having a bot "write" the article.
29.
by quinnftw 10y ago
Personally I would use a macro such as: #define DISALLOW_COPY_AND_ASSIGN(TypeName) \ TypeName(TypeName&) = delete; \ void operator=(TypeName) = delete; Introducing a virtual base class for disabling copying
30.
by quinnftw 10y ago
Or if you want a non-obfuscated version https://gist.github.com/Quinny/09e34afb1d187e43dea2f3c3b0c04...

More ›