120 karma · joined September 21, 2013
class Person { int age = 0; };
I wish rust would make default struct field values this easy to write.
The problem is the anti-competitive behavior. Businesses are generally rational actors, so clearly our system isn't working. It's unclear what the boundaries are until years in court, and even then it only applies to a single company.
> Additionally, a subset of low entropy variations are included in network requests sent to Google. The combined state of these variations is non-identifying, since it is based on a 13-bit low entropy value (see above).
Is valid if a and b are types.
I've heard this said before, I've had the opposite experience. ST offers a small api and it was easy for me to make something work with a single .py file. I gave up trying the same thing in Atom; the api is larger and lower-level. Admission: I don't know coffeescript.
ST of course isn't nearly as flexible, there are many things you just can't do.
What Clinton did was dumb, but no one should have sent her classified emails in the first place. If the people sending the 'classified' documents were doing it through the right channels, it wouldn't be getting to her email server.
Odd complaint, especially to be levied against C.
http://www.informit.com/articles/article.aspx?p=2213858
Don Knuth: As you say, I've come to believe that P = N P, namely that there does exist an integer M and an algorithm that will solve every n-bit problem belonging to the class N P in nM elementary steps. ... My main point, however, is that I don't believe that the equality P = N P will turn out to be helpful even if it is proved, because such a proof will almost surely be nonconstructive. Although I think M probably exists, I also think human beings will never know such a value. I even suspect that nobody will even know an upper bound on M. ... The moral is that people should distinguish between known (or knowable) polynomial-time algorithms and arbitrary polynomial-time algorithms. People might never be able to implement a polynomial-time-worst-case algorithm for satisfiability, even though P happens to equal N P.
Say I have 3 members that must be set, and 5 optional members. Go's solution is to make the 3 critical members private so that someone using this struct will probably figure out they should use a construction function. And doing this means replacing all code that creates my struct with calls to a 'New' function. With all this friction, people aren't likely to do the right thing.
At least in C++ with public members I can initialize appropriately in the constructor. Of course littering my code-base with public members would be bad practice in the first place.
I'm a Git novice, maybe managing submodules isn't as bad as it seems to me or the author of this article. What is your experience?
INFO: Couldn't find Jewel package, attempting installation... ----------------------------------------------- We couldn't install Jewel.jl for you. Try using Pkg.add("Jewel") in a Julia repl.
Asymptotic complexity is the best place to start. I thank academia for this 'naive' model.