freenode/lisp - IRC Chatlog
Search
4:47:10
ludston
Looks like I'd need proof of a functional level of Spanish to get a working visa for Spain anyway
4:48:38
beach
Spain is not the only place in the EU of course. I just mentioned Spain because: 1. It's a great place. 2. ELS will be held there in 2018. 3. I know Ravenpack is hiring Lispers.
4:57:42
beach
ludston: And if you get a visa for the Schengen area, you can then move freely within the 26 members.
9:21:07
beach
[sigh] Another library to extract, improve, document, and test. But that's a good thing I think. This time, it's from Gsharp. It splits a sequence into optimal subsequences. And it can do it incrementally as the original sequence is modified.
9:43:07
malice
More precisely, my objective is to change one of the object's slots, but I don't really know what the interface is.
9:48:55
beach
malice: This one ↑ gives you a list of the methods that have a particular specializer.
9:49:57
beach
Because a method might be applicable to a subclass that does not appear explicitly as a specializer.
9:54:41
malice
beach: Yes, I always forget about the nomenclature. I learned OOP first in C++, so I often call it methods (since there are no generic functions in C++).
10:06:49
malice
beach: I am sorry, but I am unable to find this information. How do I provide specializer?
10:17:03
beach
Also, this is MOP stuff, not Common Lisp HyperSpec stuff, so you will either need to :USE the MOP package, or provide an explicit package prefix.
10:27:12
beach
malice: Also, "it does not work" is not very helpful. It is best to provide the error message, or the incorrect output that you observe.
10:31:26
malice
beach: but I didn't really know what arguments to use. find-class was exactly what I needed. Thank you.
10:32:06
malice
If I want all the methods, should I also map the #'specializer-direct-generic-functions over all superclasses and their superclasses?
11:01:11
rk[ghost]
aye.. and it also has, a reasonable hyperlink schema.. so i can likely find what i want by mangling the url with the right fucntion name
11:02:05
rk[ghost]
i do not know any PHP (nor have any interest), but if you want any help with your project i could set aside some cycles..
11:03:44
phoe
rk[ghost]: I will, thanks! I need to fix my real life up a bit more and then I'll probably get back to working on CLUS.
11:08:36
rk[ghost]
i am also at the point of fixing up my `real life`, but i should be migrating within a couple weeks and stablized within a month likely
15:08:55
phoe
Lisp is an interactive programming language and SLIME is a toolkit that allows the programmer to leverage this.
15:16:37
pjb
slime contains a nice debugger that works the same with all the implementations, so you don't have to learn the debugger of each implementation.
16:16:23
beach
Ah, the one on CLOS programming. More than one year. The first one to come out is called "Concrete and Abstract Data Types with Algorithms".
16:17:16
beach
I use self publishing. It gives better margins and I don't have to listen to the crap of a publisher.
16:20:29
beach
I use a self-publishing company that uses print-on-demand technology, so there is no bulk cost associated with a book. Just a per-unit cost.
16:26:59
beach
The interesting part about the book on data types is that I implemented and tested all my data types and all my algorithms in Common Lisp and wrote a translator that converts the Common Lisp code to something that looks more like a traditional algorithmic language.
16:27:37
beach
The advantage is that 1. the algorithms can be tested. 2. People who are allergic to parentheses can still buy the book.
16:30:52
beach
Either they were written by people who don't know that pointers exist, so they use integers and tables in their algorithmic language.
16:31:14
beach
Or they are written by people who have not followed the evolution of computer architectures for the past decades.
16:32:18
beach
Apparently, the majority of books on the subject get something simple like binary search wrong.
16:34:00
beach
One question is what happens if there is no object corresponding to the one being searched for.
16:34:20
beach
The other is that the published algorithms make many more key comparisons than are needed.
16:35:29
beach
And the book makes things more realistic. Existing books assume that all objects are integers.
16:36:15
beach
So readers of traditional books don't see the difference in cost between a key comparison and an index comparison in terms of cost. Both are integers after all, right?
16:38:17
beach
For "stack" they either suggest a list, so if you have a stack of DNA letters, you waste 64 bits for each bit represented.
16:38:46
beach
Or else they suggest an array, which blows real-time properties because you have to re-allocate when it is full and there is no bounded size for that.
16:40:18
beach
I refer to whether I can realistically suggest such a data structure in a library without being ridiculed, and I don't think so.