It's a service they sell to eg DuckDuckGo and ecosia. I think the og bing is just there because they still think Google may fall out of favour one day. Oh and they offer a corp version spiced up with internal results from SharePoint.
I think they also make money from people that don't know the difference and use it because, for instance, it's the default in Edge when you search from the URL bar.
I started learning Common Lisp, but ASDF and Quicklisp threw me off. I couldn't tell if you were supposed to choose one or the other or they were used together. This might revive my interest in Common Lisp if I get around to reading it. But in the meantime I drifted off to Racket, which is relatively well documented and has extensive libraries and really unique features.
The packaging story in common lisp is.... Not great.
It's hamstrung by archaic naming conventions that confuse newcomers. What CL calls a system is roughly analogous to what most other languages call a package. What CL calls a package is what other languages call a namespace.
Despite all that it's a pretty good language if you can find libraries for what you need. The de facto standard implementation (sbcl) has a very good compiler and an acceptable GC. The language itself is expressive and it makes for very quick and pleasant DX. I love writing common lisp.
> * What CL calls a system is roughly analogous to what most other languages call a package.*
Or a crate, or an artifact, or a module, or a gem, and there's probably other variations I can't remember off-hand.
> * What CL calls a package is what other languages call a namespace.*
Or a module, or a package, or... actually, I don't know what Perl or Ruby call it. I believe C calls it a header, but that's not quite the same thing as a package.
Turns out naming things is difficult (as well as cache invalidation, off-by-one errors concurrency, and).
Eggs? Goodness. And I believe Chicken is R5RS as well, so I don't know what they call libraries/modules/packages/whatever (in R6RS and R7RS they're called libraries, but R5RS didn't specify anything). I expect Racket to call them libraries considering the Racket/R6RS connections.
Is it archaic? A lisp program is a dynamic image. A collection of symbol is very aptly named a package. And third party module can be named as a system (collection of packages).
Agreed, and I think package as used by Common Lisp and Java is more common than “namespace” which the parent commenter believes is the modern word for that!
For anybody who's still confused, the tl;dr is ASDF is the actual package loading mechanism, Quicklisp doubles as an ASDF wrapper and a package manager.
Let's see if I can state this properly. The atoms of the ship will pass right through the event horizon like nothing. To see the ship, though, photons have to travel from the ship to your eyes. As the ship goes deeper into the black hole's gravity, the photons will "appear to" be getting slowed down by the black hole's gravity well, each photon more than the last. So, an outside observer would have to wait longer and longer to get the next photon. In fact, he'd have to wait an infinitely long time to get all of them. It's like an optical illusion, except that a real physicist would say it's not an optical illusion; it's time dilation, etc.
A single photon can't be seen multiple times, right? So, if photon A goes into Alica's retina, then Bob can't see photon A. If a big, opaque object passes through the event horizon right in front of you, it would absorb or scatter the photons in its path, and you would not see them.
You'll see kind of a "cone" where the light emitted from all the objects just ahead of you can be seen, but as you look further away, you can see only more and more recent objects.
I'm going to guess. From Bob's perspective, Alice's ship would still be able to block light. So he wouldn't be able to see what was ahead of him through the back of Alice's ship; Alice's ship would occlude his view.
> If speed is an issue then you want it near the most commonly accessed data.
Yes. You expect the seek time to dominate performance.
The reason that the swap was faster when placed at the beginning is likely because the filesystem is mostly empty and so the allocated portion is at the beginning of the partition.
If the filesystem was near capacity and the files are distributed throughout, then you would expect the performance of the swap at the end and the swap at the beginning to start to converge.
Filesystem allocation patterns are relevant, one of the components of seek time is how far the heads have to seek. If most of the data is towards the front of the drive and your swap partition is towards the front of the drive, then the head will need to move less to get to the swap partition. If the data is towards the front and the partiton is near the end, then you would need to wait longer for the head to move, generally.
That's an interesting thought but unfortunately I'm travelling.
One thing is that the ocean is hardly blue. Not sure why my eyes register it as such, but it's mostly very close to black with nearly equal parts of red and green, at least the parts I sampled. I think a certain amount of this article's claim is predicated on the reader erroneously believing the ocean should become blurry.
https://www.gnu.org/software/emacs/manual/html_mono/woman.ht...