mavam

19 ms·

91.
by mavam 11y ago
> I give my brain a break by using std::unique_ptr<HugeObject>. Unfortunately this comes at a cost. Most notably, now you're unnecessarily stressing the allocator. But worse, you no longer enjoy the benefits of value semantic
92.
by mavam 11y ago
Another way to frame this discussion would be in terms of xvalues. The standard defines an xvalue as an "eXpiring value", which is value near the end of it's lifetime [1,2]. struct X {}; void f() { X x; return
93.
by mavam 12y ago
Similar to this effort, Eric Niebler's range library [1,2] aims at improving algorithm composability. The range library offers both an eager and lazy API. This is the lazy version ( views ): int sum = accumulate(view::ints(1)
94.
by mavam 12y ago
KMP starts with the first character of the pattern (or substring/needle) and then jumps forward by the length of the mismatch. A related algorithm is Boyer-Moore (BM)( http://en.wikipedia.org/wiki/Boyer–Moore_string
95.
by mavam 12y ago
(Disclaimer: Bro team member) First, Bro is a Turing-complete scripting language ("the Python for the network") and Snort/Suricata a system centered around regular-expression matching [1]. These two paradigms have fundamental
96.
Trust relationships of intermediate SSL certificate authorities(notary.icsi.berkeley.edu)
1 points by mavam 14y ago|0 comments
97.
by mavam 14y ago
John D Cook's blog post actually inspired me to rename this work from cheatsheet to cookbook, as it outgrew the form factor of a classical printable cheatsheet. http://www.johndcook.com/blog/2010/10/04/probability-and-sta...
98.
by mavam 14y ago
Thanks for feedbach, this is much appreciated! I fixed the obvious bug in the most recent version. Here are some comments: - The Ai in the Law of Total Probability indeed have to be disjoint. I indicated this by using a squared union symb