Search
Thursday, 14th of December 2017, 23:26:08 UTC
23:44:02
Fare
stylewarning, all good now?
0:06:34
stylewarning
Fare: I was trying to find in the SBCL docs how to enable the feature.
0:18:28
pillton
jasom: Specialization-store can inline calls to "methods" if there is sufficient type information available.
0:19:59
pillton
jasom: https://github.com/markcox80/specialization-store/wiki/Tutorial-3:-Compile-Time-Support
1:27:57
jasom
anyone know if cl-sqlite is still being developed, and if so, where to report bugs? The mailing-list link on the webpage is broken...
2:12:54
Fare
stylewarning, see the mysbcl function in fare-scripts/languages
2:13:41
Fare
basically, when you invoke sh make.sh, pass the argument --with-sb-linkable-runtime
2:35:01
asarch
One very very very stupid question: Is Mr. Peter Seibel around here? (I hope not)
2:36:31
antonv
Wow, http://weitz.de/hunchentoot/ doesn't provide hunchentoot documentation anymore
2:36:50
Zhivago
Did he touch you somewhere inappropriate?
2:53:06
myrkraverk
My very first asdf system has a name conflict whenever I re-compile it, when I load it with (ql:quickload) however, on subsequent loads, it succeeds.
2:53:11
myrkraverk
Is there a way to fix this?
2:54:23
myrkraverk
That is, I have a name conflict in :common-lisp-user and :my-package when I load it with (ql:quickload :my-package) and it needs to compile source file again.
2:57:30
myrkraverk
I'll try to make a simple example later.
2:59:15
Xach
myrkraverk: name conflicts are pretty straightforward to work out up front.
3:28:15
Xach
common-lisp-user is a red flag.
3:28:32
Xach
it should generally be avoided in source files and user packages
3:33:39
Fare
it should probably be avoided everywhere.
3:34:11
Fare
except maybe format ~/methods/ ?
3:34:56
Fare
asarch, he hasn't been in #lisp in many years. Not sure he uses it much if at all these days.
4:06:25
asarch
Thank you very much :-)
4:06:55
aeth
Not many years, iirc he was here a few years ago and asked a bunch of questions.
4:07:05
aeth
I think mostly about what the interesting libraries are these days
4:08:03
asarch
What book is for Common Lisp like the "The C++ Programming Language" is for C++?
4:08:29
asarch
A book that you can use as a reference manual (how to open files, how to list directories, etc)
4:09:35
aeth
PCL is more of an introduction. Common Lisp Recipes (same publisher, different author) is more of a reference. I don't think it's online. The ebook was on sale for $10 on Black Friday. So... you'd have to wait almost a year
4:12:29
aeth
$54.99 on the publisher's site (DRM-free)
4:12:34
aeth
https://www.apress.com/us/book/9781484211779
4:12:39
aeth
so... you have to wait for a sale.
4:13:02
aeth
80% off is quite a bit of a difference
4:13:08
Fare
asarch, PCL is out-of-date regarding things like "opening files". :-/
4:15:51
asarch
Then what book should I use?
4:16:50
aeth
The core language features of Common Lisp haven't been changed in over two decades. The language extensions are a mix between just as old as the language (things that didn't get in the standard, but could have) and fairly new things. They still move fairly slowly. But everything else is just like any other programming language, and it changes over time.
4:17:35
aeth
PCL, noting where it is out of date, is still probably your best option
4:17:47
aeth
There are other books but they're mostly older
4:20:13
asarch
I found this yesterday: https://www.youtube.com/watch?v=pQy22qPH7i4
4:50:09
pierpa
The best reference manual for CL is CLTLII + checking CLHS to be sure particular things haven't changed.
4:53:31
asarch
Thank you very much :-)
4:53:41
asarch
ACTION takes notes...
5:20:40
Fare
asarch, you should know which libraries to use and read their documentation online.
5:20:54
Fare
quickref.common-lisp.net is a good starting point.
5:21:20
Fare
However, it doesn't properly handle UIOP, at this time.
6:04:52
asarch
One stupid question: I start sblc and then type a few expressions, is it possible to save them into a file?
6:05:04
asarch
(Save the sbcl history into a file)
6:17:42
myrkraverk
asarch: linedit can do that for you.
6:19:12
myrkraverk
For example I have it configured with :history #p"~/.sbcl.history" ; in my .sbclrc
6:19:26
asarch
Thank you myrkraverk
6:19:31
asarch
Thank you very much :-)
6:25:14
beach
Good morning everyone!
6:26:23
asarch
Bonjour monsieur, comment allez-vous?
6:26:47
beach
asarch: Good French, but how I am is off topic. :)
6:29:59
asarch
Ok. À votre santé! o/
6:52:05
loke
asarYou should have asked (feeling-good-p bech)
6:52:16
loke
I mean (feeling-good-p 'beach)
6:55:30
Zhivago
Beach reduced to a mere symbol ...
6:57:17
loke
Zhivago: oops. I never thought abou tit that way
6:57:31
loke
But it _is_ interned! Constant. Always there for us.
7:05:42
neoncont_
** NICK neoncontrails
7:17:17
smokeink
Is there any easy/idiomatic way to find all symbols that are fbound to some function ?
7:20:50
specbot
http://www.lispworks.com/reference/HyperSpec/Body/m_do_sym.htm
7:20:56
specbot
http://www.lispworks.com/reference/HyperSpec/Body/f_fbound.htm
7:25:44
smokeink
yeah that worked http://pastecode.ru/e866d9/ , thanks
7:29:19
loke
Does anyone know of a nice library that can parse infix expressions as strings and evaluate them?
7:29:37
loke
Basically, something like "3+5*2" ⇒ 13
7:32:12
myrkraverk
It's basically the tutorial in most compiler books, but I don't know about a library for it.
7:32:55
myrkraverk
What I want right now is to test if more than one flag is true.
7:33:28
myrkraverk
As in, flag1 flag2 flag3 are meant to be mutually exclusive and so far, each is a simple parameter.
7:33:33
loke
Oh, I've done it in the past. And I could easily do it again (and I might).
7:33:48
myrkraverk
For two, I can just use (and flag1 flag2) but it gets harder when there are 3 or more.
7:34:49
loke
myrkraverk: (> (count-if-not #'identity THE-LIST) 1)
7:35:19
myrkraverk
Of course there's something simple to do it. I was thinking about rolling my own with LOOP.
7:35:56
loke
If you have lots of flags, LOOP witll be more efficient as it will allow you to exit early.
7:42:09
myrkraverk
Right now, only 3
7:42:21
specbot
http://www.lispworks.com/reference/HyperSpec/Body/f_countc.htm
8:14:53
Lord_Nightmare2
** NICK Lord_Nightmare
10:18:04
jmercouris
How can I have a macro which defines multiple top level forms?
10:18:47
jmercouris
like this: `(progn (topform1) (topform2)?
10:19:18
specbot
Processing of Top Level Forms: http://www.lispworks.com/reference/HyperSpec/Body/03_bca.htm
10:19:39
beach
jmercouris: Item 3 of that ↑ page.
10:19:47
jmercouris
Ok, I will take a look, thank you
10:20:03
jmercouris
I didn't know that about progn
11:13:44
loke
ACTION wrote a Sexp parser in Eliir.
11:14:10
myrkraverk
I read that as "sex parser" and was intrigued for a little bit.
11:16:10
jackdaniel
elixir? sex parser? hm
11:16:17
jackdaniel
let's spread the word ;-)
11:18:01
jack_rabbit
sex parser. spread.
11:18:09
jack_rabbit
There's a joke there, I just know it.
11:18:21
pjb
myrkraverk: you understand the attrackion of lisp.
11:19:12
jmercouris
What's the origin of the term S-exp?
11:20:01
beach
https://en.wikipedia.org/wiki/S-expression
11:21:39
jmercouris
Again though, what is the origin of "sybmolic expression"
11:21:44
jmercouris
aren't all expressions symbolic expressions?
11:21:56
jmercouris
Isnt 1+1 a symbolic expression, 1, and + are symbols are they not?
11:22:03
jmercouris
Isn't this sentence a symbolic expression?
11:22:22
jmercouris
every letter is a symbol, and together they compose words which are also symbols which ultimately express something
11:23:38
jmercouris
not sure what I am getting at here, but the term S-exp has always bothered me
11:23:44
jmercouris
Didn't feel like a good name
11:24:00
jmercouris
I would call them N-lists or something instead
Friday, 15th of December 2017, 11:26:08 UTC