okl

Samba has its own user DB with the default auth backend and allows per share restrictions. Same with Postgres. "PostgreSQL database user names are logically separate from user names of the operating system in which the server runs." [https://www.postgresql.org/docs/current/client-authenticatio...]

Pictures: https://technikmuseum.berlin/ausstellungen/dauerausstellunge...

Commit which introduced the problem: https://git.kernel.org/pub/scm/linux/kernel/git/torvalds/lin...

The nested switch/case with return in the default path, then expecting fall-through, looks bogus to me.

You could solve that with a git alias as well which might be a bit more orderly as it would be defined in the git config. You can prepend the command defined for a git alias with an exclamation mark to run anything (not limited to git subcommands). Last example on this page: https://git-scm.com/book/en/v2/Git-Basics-Git-Aliases

tig is great. One of my favourite features is that you can define your own shortcuts in the global .gitconfig. For example, when I press `=` it creates a fixup commit for the selected commit. That, together with the ability to stage single lines completely changed my workflow.

Recently, I have become a bit lazy and use PyCharm to stage and commit changes. Its diff viewer also supports staging single lines but its better integrated. For example, pressing F4 jumps to the current file/line in the main window.

There is some builtin command that you could run to reset the counter. YMMV depending in Windows Version.

I think it was `slmgr -rearm`

Don't know why they would ship with this...

Don't know if that's what you're looking for but JetBrains tools have a Local History that saves all your local edits. It also notes whether unit tests where passing/failing at that point and let's you revert separate hunks.

Couldn't imagine buying a damned plastic bag every single time I went shopping for groceries. I've been using the same fabric bags for 15 years. It is such stupidity, being to lazy to pack a bag, that humanity wastes resources on.

For portable you could buy a Diamond antenna but beware of fakes (https://forums.radioreference.com/threads/how-to-spot-a-fake...) See that you buy one with the right connector (RP?, male/female). I have an srj77 from diamond on my anytone that fits and works fine.

For larger handheld or fixed you could build/buy a yagi antenna that has a higher directionality/gain.

A minimum solution could be an instruction fetch buffer that memorizes the last N instructions (maybe even after decoding?) to alleviate pipeline bubbles and when jumping back.

Unfortunately, the bandwidth on the RTL-based dongles is quite limited. This means that you'll only see some kHz of spectrum around your LO frequency.

With a directional/high-gain antenna you're increasing the ERP (effective radiated power) which may well put you above the legal limits in your jurisdiction. So be careful.

Aside from that, a much simpler antenna is this one, which can be built from a metal can + connector + wire stub. Directionality is likely a bit worse but I've used it successfully over a distance a bit lower than a kilometer. https://web.archive.org/web/20060516103023/http://www.saunal...

You're right and it is, for example, captured in the Fed's double mandate of price stability and maximum employment: https://www.stlouisfed.org/in-plain-english/the-fed-and-the-...

That's why they have restricted it, e.g., https://www.reuters.com/business/finance/turkey-imposes-rest...

Git already has a similar feature. It's called worktree https://git-scm.com/docs/git-worktree

For example: `git worktree add <folder> <commit-hash>` checks out that commit in that folder.

I try to explain with a practical example: Let's say I define a list with worst-case lookup time of O(n). Simplified this means that when I have a list of 100 elements and append 1 element, then the worst case lookup time increases from 100C to 101C where C is some constant time. The O(n) tells me how the runtime of the operation changes if I alter the input size.

Now the OP's idea is this: I'll fix the size of allowed elements in my list to some maximum value, lets say n=5, and then you always end up with the same worst-case time, O(1), because the input size is constant. With 5 elements it looks silly but you could say n = (very large number that won't be exceeded ever) and conclude that O(n=1). In OPs case the n is the number of bits in the key (implies a radix-tree)

=> If an algorithm is defined as being unscalable (fixed input), what sense does it make to describe that it scales constantly with input size?

Setting n=1 to say your O(n) is actually O(1) makes no sense because big O notation tells us how the time/space grow as function of the input size. If n=1, input size is fixed.

> Well when people say "Ada" they usually mean SPARK not old or feature limited version of Ada.

Having worked on several Ada projects professionally I can tell you that this is definitely not true.

DO-178C applies to the process and does not make assumptions about programming languages.

That feature really helps when you use integers for indexing, e.g., like an enum. Say you are parsing a file format with a type field which can have values 5, 6, 7, you can easily check if that's valid with a single call and lookup something, like a corresponding length in an array without having to translate those field values to array indices first.

This? From almost 20 years ago. https://www.safetyresearch.net/Library/BarrSlides_FINAL_SCRU...

DMC DeLorean had stainless steel body panels. Guess they wanted to imitate that look.

I guess they changed a phone number in the Active Directory to which the TFA-SMS was sent?

I guess that proposing symbol names could be an apt use case for AI. Some papers are referenced here: https://github.com/nforest/awesome-decompilation#ai-based-de...

How about this? https://github.com/darktable-org/rawspeed/blob/develop/data/...

Author has a blog post here, https://ansel.photos/en/news/darktable-dans-le-mur-au-ralent..., which exhibits some example code, for example, this: https://github.com/darktable-org/darktable/blob/darktable-4....

That's a far cry from what I'd find acceptable in any project.

I guess it means keeping improvements/changes to yourself instead of contributing them to the project.

Call me naive but I think that some amount of fearmongering results in attention and publicity. Fits with the "fake it before you make it" approach.

I noticed that AMD/Xilinx Vivado synthesis runs 20% faster on WSL2 than on Windows. After seeing such differences using it on plain Windows becomes unpleasant.

Maybe this tool can help you disable some of those things: https://www.oo-software.com/en/shutup10

For C code you can use link-time substitution and a mock generator like CMock (http://www.throwtheswitch.org/cmock).

Link-time substitution means that you swap out certain objects with others when you build your test binaries.

For example, let's say your production software binary consists of a main function and objects A, B and C. For a unit test you could use a different main (the test), object B and a mock for object C - leaving out A.