Viewing profile — quinnftw

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/intern…

It could: What if a machine learning algorithm picked each of your dependency versions for you ~magically~

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…

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 …

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 yo…

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 t…

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.

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…

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 intervie…

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 an…

This is true, though generally anytime one uses `auto` it should be `const auto&` to avoid swallowing the quantifiers and potentially costly copies anyways.

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 bei…

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 th…

I think what you are describing here is simply "average number of citations per year", no?

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.

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::futu…

This particular one isn't large, but in general a pseudo-prime will produce similar effects.

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 al…

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 thre…

You could also do void foo(std::function callback);

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 …

OH! Haha my mistake, that wording is naturally ambiguous.

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 …

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.

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.