Pretty sure at that range they’re dead no matter what. May as well crack one last joke.
You can search for them, but I think the one I have is similar to a Uni Kuru Toga pencil. I don’t write as much as I used to, but it’s awesome for taking notes.
Mechanical pencils for the win! Did you know there’s even ones that rotate the lead for you as you write so there’s always a sharp point?
It’s sad that the best most startups can hope for is to be bought by a giant corporation. Not a lot of people are interested in just having a successful long-term business.
Just useful enough to become incredibly dangerous to anyone who doesn’t know what they’re doing. Isn’t it great?
If it’s someone else’s job to design things, then that’s a pretty terrible specification. But depending on your role, it’s common enough for there to be one person who designs and builds a feature like “User projects dashboard”, and the job is to decide what’s important based on the product. Especially with smaller companies.
If you remember what battery powertools were like in early 2010s, it’s super obvious how far we’ve come. The higher end things like battery powered lawn mowers didn’t exist, and if you wanted real power, you needed a cord.
Sounds like you’re doing the job of a PM to me, but I guess that’s just confirming your point that titles aren’t comparable
I’d expect in most cars it’s as simple as pulling a fuse for the cellular radio. But depending on how the car is designed that might break other features like the infotainment or keyless entry. It’s hit or miss how any given car will react to things being unplugged.
Am I the only one left writing pure JS webpages? I swear for the stuff I’ve done recently, adding React or even jQuery makes things 10x more complicated and bloated. The base JS support browsers have now is actually great. It’s not like the old days trying to support every browser back to IE6
I learned this in highschool when I discovered sending ping floods from a 1gbit VPS to a slow residential Internet connection can take down your Internet even if the router doesn’t respond to pings. The bandwidth still all needs to make it to the router in your house to be dropped.
Unless you’re rebasing or something, you should never need --force
. It’s a good way to accidentally delete or overwrite a remote branch.
I usually use the +syntax for force-pushing a specific branch:
git push origin +my_branch
It’s what Microsoft would do in the same situation. It’s only fair
I’m on a prepaid plan, and got in on a really good deal. They were offering $25/month off indefinitely for signing up for auto-pay (Basically 35% off, lol). It made the plan cheaper and better than most of their monthly plans. I’m happy to know it also saved me from giving out my SSN.
Exactly this. You don’t realize how useful they are until you’ve had a good one. The amount of BS from other teams they can shield you from can make focusing on your own job so much easier.
Unfortunately the ratio of good to bad PMs leaves a lot to be desired.
That does seem to be the case. As long as any modifications to the source are publicly available. Which is pretty reasonable.
It’s in the RSALv2:
You may not make the functionality of the Software or a Modified version available to third parties as a service
You may not X in a way that Y
implies that You may X in a way that does not Y
, and is more specific (and changes the meaning of the license) vs You may not X
The legal distinction in this case allows for distributing the software for example as source code, but not as a service.
A quadratic function is just one possible polynomial. They’re also not really related to big-O complexity, where you mostly just care about what the highest exponent is:
O(n^2) vs O(n^3)
.For most short programs it’s fairly easy to determine the complexity. Just count how many nested loops you have. If there’s no loops, it’s probably
O(1)
unless you’re calling other functions that hide the complexity.If there’s one loop that runs N times, it’s
O(n)
, and if you have a nested loop, it’s likelyO(n^2)
.You throw out any constant-time portion, so your function’s actual runtime might be the polynomial:
5n^3 + 2n^2 + 6n + 20
. But the big-O notation would simply beO(n^3)
in that case.I’m simplifying a little, but that’s the overview. I think a lot of people just memorize that certain algorithms have a certain complexity, like binary search being
O(log n)
for example.