The most important example is perhaps and , both of which have the same Lie algebra, but are not isomorphic.
Learned readers will ask themselves: so why use an unbalanced tree instead of balanced one, which offers better asymptotic times en.wikipedia.org/wiki/Self-balancing_binary_search_tree?
A solution to Laplace's equation.
Has some of the best map data available for the United Kingdom, but their data appears to be proprietary?
New developers won't want to learn your project, because they would rather shoot themselves.
Of course, at some point software gets large enough that things won't fit anymore in 5 seconds. But then you must have either some kind of build caching, or options to do partial builds/tests that will bring things down to that 5 second mark.
A slow build from scratch will mean that your continuous integration costs a lot, money that could be invested in a new developer!
One anecdote comes to mind. Ciro Santilli was trying to debug something, and more experience colleague came over.
To reproduce a problem, ciro was running one command, wait 5 seconds, run a second command, wait 5 seconds, run a third command:
cmd1
# wait 5 seconds
cmd2
# wait 5 seconds
cmd3
The first thing the colleague said: join those three commands into one:And so, Ciro was enlightened.
cmd1;cmd2;cmd3
Unlisted articles are being shown, click here to show only listed articles.