freenode/lisp - IRC Chatlog
Search
9:07:28
beach
ParrotSec_: Like I said, I gave you the tools. I am afraid I don't have the time to implement it for you. But if you have more questions, I'll be happy to answer them if I can.
9:10:21
beach
You would then have to search for the position of the server name, and the position of the first following double newline. Given those positions, you would move all the characters following the last of those two position to the first of those two positions. No?
9:11:38
beach
Or perhaps you want to extract an entry? Same thing. Find those two positions and use SUBSEQ to extract the entry.
9:24:56
beach
For starters, it would be good to know exactly what it is that you want to do, i.e. what you mean by "filter out".
9:25:38
beach
Common Lisp is a general-purpose Turing-complete language, so unless you are trying to solve some undecidable problem, it should be possible.
9:26:49
beach
ParrotSec_: I'll leave that to someone who feels he or she has the time to wade through all that stuff, which is unrelated to Common Lisp on top of that.
9:27:29
phoe
and you are unwilling to explain what it does and instead tell me to read it and guess it myself.
9:27:44
ParrotSec_
the problem lies with the the second read loop "server_port80/stanzas is ACCAPTABLE
9:32:03
phoe
It seems that a person with a nickname candide is an operator of #bash. You can query them in private and ask them the question.
9:57:47
dim
2: (SB-THREAD:CONDITION-WAIT #<SB-THREAD:WAITQUEUE Anonymous condition variable {10044081F3}> #<SB-THREAD:MUTEX "Anonymous lock" (free)> $
10:05:22
dim
sbcl 9477 root 10u IPv4 149607 0t0 TCP localhost.localdomain:52316->localhost.localdomain:mysql (CLOSE_WAIT)
10:12:22
p_l
anyone using AllegroCL on windows and could suggest a way to make it open different browser than IE for everything in docs?
10:15:32
jonssons
I'd like to thank the author of "Practical Common Lisp" for open sourcing his book with monetary value. However, I do not want to pay taxes by purchasing the book. Any way I can send money to the author?
10:15:58
p_l
flip214: yes (Chrome), and there appears to be an option of embedded browser when writing CG GUIs
10:17:32
flip214
I'd suggest to open regedt32, and look in HKLM/Software/Classes/.html/OpenWithProgIDs
10:22:27
flip214
sorry, I thought this to be more of a windows question and not so distinctly for ACL
15:06:34
phoe
main-clause::= unconditional | accumulation | conditional | termination-test | initial-final
15:06:51
phoe
so COLLECT which is an accumulation clause can happen before UNTIL which is a conditional clause.
15:08:36
dim
here's an example in the same vein, albeit with other clauses https://github.com/dimitri/pgloader/commit/7f55b21044047469413ab0e6b905a0e07f26ba9a
15:09:23
drmeister
Yes, I think I want for in the first two lines. Each strand is an instance of a class that has a 'p5-end' slot and a 'p3-end' slot. They describe the first and last (inclusive) nodes in a doubly linked list.
15:09:53
drmeister
The nodes in between are accessed using (forward-node cur) starting from the p5-end and stopping when you hit the p3-end.
15:15:03
drmeister
What I needed to know was the main-clause::= unconditional | accumulation | conditional | termination-test | initial-final
15:22:22
drmeister
Please don't - I was showing a colleague that he can ask questions in #lisp and I'm explaining that you should do your homework first and look things up in the CLHS.
15:22:39
drmeister
I explained that by asking a stupid question that I had kicked a bees nest and now I need to apologize.
16:02:45
didi
Funny thought: I am computing the number of days between 2 dates by subtracting their universal-time and returning the quotient of it divided by 86400. But, with enough leap seconds, it will start to drift away. (as my unit measurement is a day, some leap second won't mess with calculations)
16:39:00
dim
in particular the parts where the history takes an important play into how to best implement the internal time representation
16:41:45
_death
there is also a book on my wishlist, Calendrical Calculations, by Edward Reingold, who also wrote the Emacs calendar package
16:56:19
jasom
didi: unix times to not include leap-seconds, GPS time does. At one point Android's clocks were 25s off for this reason.
16:58:16
pjb
A very interesting subject, notably if you plan to program a time-machine navigation software.
16:58:48
pjb
It's probably the reason why we don't see more time travellers: it's not that they don't exist, it's that they're lost in time!
16:59:17
jasom
pjb: and depending how inertia works when changing time, they could easily be lost in space too
17:00:46
pjb
jasom: yep. Since fundamentally, you will have to get the absolute positions and movement relative to the whole universe (which is hard to determine because of the light cone).
17:16:32
aeth
They try to go back to ancient Rome but wind up going back to that time, but the Earth is in a different place in space.
17:18:36
pjb
Probably it's safer to do it in "empty" space, and travel back to Earth(t=t₁) with your space ship.
17:21:29
aeth
in case anyone is wondering about how Lisp handles time, it has two ways. Something *almost* like a reverse-ordered ISO 8601 but as multiple return values, as well as non-leap-seconds since 1900. http://www.lispworks.com/documentation/HyperSpec/Body/f_get_un.htm
17:22:02
aeth
The distinction is afaik that ISO 8601 doesn't take daylight savings time into account, you move the offset, but in CL the offset is constant but with a boolean DST flag.
18:37:40
_death
it could.. (defun my-concatenate (&rest sequences) (apply #'concatenate (prompt "What result type?") sequences))
18:50:07
pjb
Notice that nothing prevents your implementation to provide a compiler-macro on concatenate (and map, etc), to optimize out the cases where the return type is known at compilation-time.