freenode/#lisp - IRC Chatlog
Search
4:29:53
vtomole
Oh i see I was just confused cause the 'Break' instruction is not in x86_64.. i don't think? "(disassemble '(lambda (x) (* x x)))" generates "BREAK 16" as the last instruction.
4:39:48
aeth
They don't feed it into nasm or something. So they might have some syntax differences from what you're used to.
4:44:56
vtomole
If x86 has "brk" but the compiler generates "break", does the compiler really generate x86 code?
4:46:01
aeth
vtomole: Do compilers that use AT&T syntax really generate x86 code? Because they're a lot further than SBCL's disassemble syntax.
4:46:52
aeth
vtomole: It would be interesting to know if the differences were defined somewhere, though
11:56:52
jmercouris
So, I'm trying to write a survey collection programmer, trying to think of how to persist the data
12:06:09
jmercouris
at least not without using a central table called like "survey" and it has some ID then another table related to it which has responsees
12:43:43
jmercouris
schweers: data fits in ram yes, but it is part of a webapp, so I don't want to keep things in memory / connect to a repl
12:46:24
jmercouris
it would be, if I could just email the survey out to people, but I would like a website for them to be able to anonymously respond
12:48:52
schweers
one of the reasons I like lisp and its modern implementations so much: you can program at really high levels, but also muck about with stuff like that :)
12:50:17
pierpal
looks like a good case for a prevalence db. there's at least one implementation in cl, which I never tried, though
12:51:24
schweers
but they are broken in some ways: getting the size of the store is not implemented, for instance
12:55:41
jmercouris
here is what makes neo4j great: https://neo4j.com/developer/cypher-query-language/
13:01:33
jmercouris
you do most of your logic in Cypher rather than handling it piecemeal and processing it in another language
13:02:07
jmercouris
so that reduces the overhead of information flow between the database and the program
13:11:26
schweers
jmercouris: I guess you’re right, if you use that part of it. I was concerned about using it as a plain old key/value store.
13:12:09
schweers
And if the only thing you do is put values in and retrieve them and do that alot, you may run into performance issues. The question is of course: are you using the right tool for the job, if that is all you need?
13:15:04
beach
Great, when I am not on #lisp all the time, this is also when the tunes.org logs seem to be having problems.
13:22:10
beach
Murii: But you can use Flexichain, a library that implements a version of editable sequences.
13:44:07
beach
Well, if it doesn't matter whether it is a sequence, you can do it in constant time, at least amortized. You can copy the last element to the place you want to delete, and then "shorten" the vector by moving the fill pointer.
13:46:24
beach
That's what I meant by it not being a sequence. Something that Murii seemed to suggest by asking about the hash map.
14:49:25
jmercouris
schweers: probably is an abuse of that tool, that's true, but I already use it in a lot of other places, so the barrier to using it is less for me
14:49:28
jmercouris
schweers: probably is an abuse of that tool, that's true, but I already use it in a lot of other places, so the barrier to using it is less for me