freenode/#lisp - IRC Chatlog
Search
6:22:16
Zhivago
ljharb: I that by definition it cannot be incorrect -- but it may be something you find abhorrent, which is fine.
11:34:18
LdBeth
Is control string in FORMAT compiled or stay interpreted if determined at compile time?
11:35:21
loginoob
I'm learning CL from the book cl: a gentle introduction to symbolic computation. I have heard so much about SICP, as everyone says you must read the book. So i want to know at what stage should i pick up the book.
11:37:55
shrdlu68
Is there a way to know the number of projects in quicklisp that depend on a certain other project? I'm curious how widely used stmx is.
11:39:52
jmercouris
there is a twist though, sometimes, I have the same definition for a term, multiple times
11:40:18
jmercouris
I would like to also capture, how many times a specific definition appears for a given term
11:40:56
loginoob
so when do you think would be appropriate time for me to pick up SICP? after completing basics of CL? I'm not good at math, i tried to read sicp and understood things but couldn't able to complete exercise because I'm not familir with most of the maths there
11:43:54
shrdlu68
jmercouris: Do you mean that a list of definitions may have identical definitions?
11:44:38
loginoob
shrdlu68 after completing CL book SICP would be my top priority if you guys think that it would be appropriate next step
11:45:15
shrdlu68
loginoob: There is no objective appropriateness, I'd simply advise you to learn as your curiousity dictates, and have fun while at it.
11:47:14
shrdlu68
jmercouris: Hmm, then you could have '(definition . count) as the members of the lists.
11:47:54
shrdlu68
loginoob: Nope. Also, jmersouris was going through it the other day, if I'm not mistaken. Perhaps he could tell you about it.
11:48:03
jmercouris
Maybe I should do the counting in real time as it is needed insted of storing it in the data strucure
12:32:06
Xach
Let us together check on the status of the pdf, because it is easy to get from https://github.com/norvig/paip-lisp
12:44:37
ldb
ah, I got the traced PDF from https://github.com/clojurians-org/lisp-ebook/blob/master/Paradigms-of-Artificial-Intelligence-Programming.pdf
14:27:09
jmercouris
I'm getting "Heap exhausted during garbage collection: 0 bytes available, 16 requested."
14:29:27
jmercouris
beach: It's perfectly normal in this case, I'm loading a massive data structure into memory for distribution with my application
14:29:48
jmercouris
It is just an alpha so I don't want to go through the hassle of bundling the database with the application
14:30:04
jmercouris
Well, probably because my hash table is growing all the time, and I did not set a default size
14:31:02
shrdlu68
beach: I've gotten that as well before, didn't realize that heap exhaustion during garbage collection ought not to happen.
14:32:04
jmercouris
if I limit the size of my initial query for populating the hash table, I don't have this error
14:35:23
jmercouris
well, now my application is 300MB, and I need a --dynamic-spzie-size of 5000, but oh well
14:41:54
shrdlu68
I'm wondering whether I can use stmx in a multi-threaded program and not worry about race conditions and data corruption. Is it really that simpe?
14:42:54
shrdlu68
"Note that concurrency related bugs are still possible in programs that use a large number of transactions, especially in software implementations where the library provided by the language is unable to enforce correct use." -- from the Wiki page on transactional memory.
15:05:57
beach
I think I have memory allocator similar to that of Doug Lea, but written in Common Lisp. It has contains than 400 lines of source code. It uses a few functions for reading and writing memory that I am currently simulating. Next, I'll clean up the code, remove some magic literal numbers, add comments, etc. Later, I'll add meters to collect statistics and figure out how to write a test suite.
15:19:31
beach
I think I have a memory allocator similar to that of Doug Lea, but written in Common Lisp. It contains less than 400 lines of source code. It uses a few functions for reading and writing memory that I am currently simulating. Next, I'll clean up the code, remove some magic literal numbers, add comments, etc. Later, I'll add meters to collect statistics and I'll figure out how to write a test suite.
15:23:47
beach
Josh_2: The SICL global garbage collector will use a heap similar to that of malloc()/free() for C. One of the best memory allocators is the one written by Doug Lea. I adapted it to my needs and wrote it in Common Lisp for ultimate inclusion in SICL.
16:08:49
oni-on-ion
i wonder if i shared that quote with you that ive seen the other day, that really turned my mind from C to Lisp ?
16:11:22
dim
the recent quote I read that really took a different meaning thanks to having done Common Lisp before was from Alan Kay, and I can't find it again, so paraphrasing: “The operating system is there to provide anything that is missing in your programming language”
16:12:42
oni-on-ion
hey beach ! some info. the word 'chunk' is used 109 times in allocator.lisp, the next most-used word is 20 times. =P
16:13:28
oni-on-ion
dim: nice! also adding to that, someone said once "the unix/posix system is the C runtime" -- which is quite large eh!
16:13:36
beach
I think it is normal that "chunk" appear that often, since it is basically the only data structure it manipulates.
16:14:33
oni-on-ion
beach: im just being dyslexic or ocd , having to type and read 'chunk' each time, rather than c + M-/ or abbrevs ? however i think repetition is important in some cases. idk =)
16:15:38
oni-on-ion
beach: i cant find the quote at the moment, it was something about how you were saying that C does quite a bit of "extra" stuff and undefined behaviors, optimizations, and shortcuts and whatnot, that it is not really low level at all.
16:21:46
oni-on-ion
cant find it, it was at the top of some visited web page, no way the browser can find that by search. should have saved the quote, i may come across it some day. oh well the idea is there, and if anything C has *more* undefined behavior.