The can’t find the difference meme would fit better.
The can’t find the difference meme would fit better.
Inline code
in `back ticks`
Multiline code
in
` ` `
triple back tics
` ` `
I don’t know how to escape triple back tics inside a code block, just ignore the spaces
A yes, the two genders of binary file formats: renamed sqlite file and renamed zip folder.
… or one second back, that’s the problem.
spy satellites > spys > conflicts caused by information mismatch
What is the methodology called where you:
Plan to go to orbit, blow up seconds into the flight, and declare it a success.
Plan to refuel in orbit, make it minutes before the rocket brakes. Fire the FTS, it fails, the rocket blows up a minute later und declare it a successful test of the FTS.
Argue to NASA that you are not the limiting factor to the moon mission planed for the end of the year, despite delivering none of the milestones.
FTS = flight termination system
I think Dylan Beattie once said: If you don’t have a plan, how can you choose not to follow it?
Instead of
if let Some(a_) = a{
()
} else if let Some(b_)=b{
()
} else {
dostuff
}
you could just use
if a.isNone()&&b.isNone(){
dostuff
}
Also if you don’t use the value in a match just use _
While that works for “news agencies” it’s a free money glitch when used in a customer support role.
Hate to break it to you, but if you store your food for years above freezing and without a protective atmosphere in a plastic container it’s spoiled anyway.
Go speak Lojban with people numbering “beyond what can be counted on the fingers of one hand”.
It needs to happen twice. I would help you but I still poses the indestructibility of youth.
I think the person also needs to be Catholic.
The absence of coincidence
Look up the strong law of small numbers.
Also, one of their examples of AI was an exhaustive search.
Com’on, just 'cause it ain’t faster, doesn’t mean it’s a waste of time. They can give a text a relaxed and casual tone.
[…] would someone like monkeymant59h@icloud.com really be dishonest?
Iphone users can never be evil, I have learned that from watching films.
Sleep sort is kind of like count sort but with added overhead. Both have a complexity of O(n+m) with n being the length and m the value of the max element.
The optimum of O(n * log n) is based on the assumption that the only information about the values is obtained by comparison. If you operate on integer keys I would recommend radix sort. It has a complexity of O(n * w) where w is the length (read logarithm) of the key.
I can’t find the name/source at the moment, but if you enumerate all turing machines and run them concurrently* you will find the optimal algorithm for your problem in O(1) and executed that.
To my knowledge the algorithm is so inefficient on small input that it takes hours to solve integer addition.
* You run the first turing machine one step, than the first two one additional step, that the first tree… This allows you to run an unlimited amount of TMs an unlimited amount of steps.
Look at me, I have a friend at bell labs.
We had to use vacuum tubes, and we liked it.
The main difference is that WASM is an agnostic bytecode without a gc while the jvm is opinionated in a java way. It has a gc, focus on dynamic dispatch and it has knowledge of concepts like exceptions, classes and visibility.
All this leaking of abstractions means languages like java and kotlin are well suited, scala has hit problems and c couldn’t be compiled to java bytecode.
As a climber I have to disagree, figure 8 knots are the best, especially when double back.
It’s the one knot I trust my life to on a weekly basis and I have rarely encountered a situation where they weren’t part of the solution.