I’m so glad I’m not alone.

Visual voicemail

1. Some Dell that belonged to the school
2. JCreator
3. Java
4. about 5
5. Racket
6. Emacs 7.Haskell & Common Lisp
7. Common Lisp

It is fun to make a cl:loop replacement. It is definitely overdone though. Lately I have been using https://git.sr.ht/~charje/loop to much enjoyment.

For point 7 see: https://github.com/lem-project/async-process/issues/21

I have it ready to be packaged other than that.

I wonder what happens when an elevator panic!s.

Isn’t this (in-package …) form just a namespace feature?

It is not only a namespace feature; it is first class. You can use find-package to fetch a package object and pass it around and manipulate. It looks like this can be done to some extent in C# as well.

For C# namespaces, exports carry over to different uses of the same namespace, but using statements go out of scope at the end of the current namespace use. That signals to me that imports are not related at all to namespaces. It seems that C++ acts similarly. From what I can tell Both C# and C++ allow for fully qualified names without any sort of import.

I have to agree with you about Rust: they goofed it up my trying to make too many rules about which libraries and symbols can be used in which places.

The final strawberry for me was forcing people to have 2fa.

True. They are not near as nicely integrated as lisp macros though.

You R a nerd for the last one.

1. Common Lisp
2. Haskell I guess
3. defmacro. This would probably involve changing the syntax to list form like axel does.

This exact thing happens to me.

JS doesn’t do any type inference. Ocaml Connor l type checker knows all the types and is completely type safe without type annotations.

This version is definitely a bit harder to follow what is going on.

Instead of storing intersect-p as a variable and keeping it until the end of the loop, you can return early as soon as you find the first intersection.

Even though a hash table has better symtotic run time, you might find after benchmarking that the O(n^2) is faster for your use case. If you are set on using a hash table, you might consider setting the initial size to something a bit larger (relative to the input lists) to avoid having to dynamically grow the hash table.

I think also the return value of the inner loop is never used…

I personally like to keep my tests assertions top level so I can interactively run each one by itself.

proprietariable just means the code can be taken and rerelased as proprietary (no freedoms all rights reserved).

You can sell GPL licensed software. You don’t have to publish the source code publicly online.

You still own the code you release under GPL. the restriction you are describing is actually caused by the non-copyleft licences you claim to prefer. If you choose to use MIT, you are limiting which libraries you can use. If you had picked GPL to begin with, you can use any library.

Copyleft licences are the only true free software licences. All other open source licenses are just proprietariable.

I would love to hear your answers too cadar@lemmy.ml.