it's sort of like trying to argue that "Whose Line" is not a game without points. There are types there, but they don't matter at all. You can cast anything to anything and it will never fail.
I'm guessing his assertion that the person of interest is no programmer has more to do with Gayle's book being full of platitudes and errors than her sex.
this type of encrypted messaging is super common between banks and third parties. it's usually done in a similar manner to what is implemented here but in SFTP and every bank has it quirks/a different system for ACKing transmissions. a standard would be nice :)
I can give you some sense of why I use Java and enjoy it today in an "enterprise" setting. The JVM is excellent. Java 8 in particular is quite fun to use, streams in particular. The tool support isn't quite there yet for all of Java 8, however. In recent versions the concurrency APIs are quite diverse and easy to use (as much as multithreaded programming can be). There are also lots of good libraries -- Guava, Guice, and jOOQ to name a few. Java is also quite fast -- it's consistently outperformed by C and C++ but it's still competitive and much easier to write.
No, you're missing the point -- using a regex does not allow you to read in less than all of the input (in the best case, even). If you grep a 1GB file with a regex you must read 1GB from disk, no exceptions, and that's many orders of magnitude slower than anything on the CPU (or in memory). With Boyer-Moore you can do less than 100% of the file size in I/O, especially if the given pattern is long relative to the full text.
People are probably willing to pay you to do this, but not advertising it so much. Most tech companies (at least in the US) are desperate for work. Less than 40 hours is a week is a tough sell because many people feel the onboarding process eats up a lot of time. Primarily, since it's the norm to work 40+ hours (and believe me, it's not difficult to do this and be actually writing code more than 50% of the time) employers expect it.
> I sincerely think it is quite unrealistic to ask a knowledge worker consistently deliver at full throttle for 40 hours every week (never mind the enslaving 60+ hours on many companies)
I really disagree with this. Have you tried before?
If you don't have the entire string in memory then Boyer-Moore is usually fastest because you can avoid doing a lot of I/O (since you skip comparing many subsequences, you don't have to read those subsequences in the first place). This is why grep is very fast given a static string pattern to search for, even on huge files, but grepping for a regex is dog slow.