freenode/#lisp - IRC Chatlog
Search
16:37:28
shka_
this does not require reading everything to memory at once, works with my aggregation functions, can be chained into multithreaded processing and so one
16:43:16
shka_
nixfreak: anyway, i really prefer to write in lisp so if there is simply no tool that cuts it for me it is natural choice
16:47:45
nixfreak
shka I'm still a big noob in CL but I'm going to focus my attention to it instead of other languages
17:41:54
adlai
"little scripts to mimic unix tools" might not be the right approach for learning CL, as these tend to be rather orthogonal to CL's strengths
17:52:40
shka_
well, yes, but i have issues with unix pipes and string typing and you know the rest of my story
17:59:45
durn
How do I load Slynk in a package? An error is thrown when (slynk-loader:init) is called despite there being (require :slynk) above it.
18:03:59
p_l
https://www.ebay.com/itm/Symbolics-MacIvory-model-3-8-MW-in-an-Apple-Quadra-650-80-MB-9-GB-Genera-8-3-/113295545913?_ul=PL
18:05:08
durn
Has anyone ever considered emulating the Lisp Machine instruction set by defining it as a set of Forth words?
18:38:48
shka_
durn: so locate slynk.asd, get the directory part, substitute #p"~/dir/to/sly", the rest is the same from my understanding
18:59:11
PuercoPop
What I do on my .stumprc is (push #P"/home/puercopop/.emacs.d/site-lisp/sly/slynk/" asdf:*central-registry*)
21:49:23
aeth
You can still define a deep copy by renaming the copy function to %copy-foo and defining an inline copy-foo that does a deep copy
21:50:27
aeth
didi: The standard-object (not CLOS object) way to do it would be to define a copy generic
21:50:34
didi
aeth: But shallow copies can be useful. I'm using it right now. I want a struct just like the original, but with only one slot changed.
21:51:13
aeth
I'm not sure why there isn't a copy method that defaults to a shallow copy for defclass
21:52:13
aeth
jasom: Well, the main point in modern CL is that structs can be optimized for storage and access if :type is provided for a slot
21:55:51
aeth
Except for multiple-value-list and multiple-value-call, if you request the nth value and it doesn't exist, you get NIL as the default value
22:00:12
jasom
the thing I like about the random version is that it is only probabalistically defined to terminate from the standard, but most (all?) real-world implementations it is guaranteed to terminate.
22:02:02
jasom
Bike: if a non-cyclic rng is used, then the probability approaches 1 of it terminating over time, but never reaches it. Real prngs tend to be cyclic though, so there is bounded time for it to terminate (even if it's absurdly large).
22:03:24
Bike
"A cyclic number is an integer in which cyclic permutations of the digits are successive multiples of the number." uh
22:04:11
Bike
most-positive-fixnum is finite, and since it's an integer the distribution is discrete
22:05:20
jasom
Bike: consider flipping a fair coin. Let's say I flip the coin until I get 5 heads in a row. That is not guaranteed to terminate, though it is very likely to for any large number of iterations.
22:06:20
jasom
similarly an implementation with less than (integer-length most-positive-fixnum) state in its prng might never terminate on that.
22:07:02
jasom
and it's guaranteed that there are some values it will never return from (random most-positive-fixnum) if there are that few bits of state in the prng.
22:07:55
Shinmera
jasom: Though the spec does say: If limit is an integer, each of the possible results occurs with (approximate) probability 1/limit.
22:08:44
jasom
Shinmera: no finite state prng can do this when you consider bignums, unless you think the spec implies the state must be larger than the largest allowed bignum.
22:09:28
jasom
Shinmera: if it required each possible result to occure with identical probability, then it would explicitly not allow holes.
22:10:37
jasom
Shinmera: there are lots of imperfect prng with 100% even distribution of values (a simple LCG does this, for example).
22:28:20
adlai
re: "most interesting way to get the value NIL" ... how about "as return value of #'type-of"
0:04:31
aeth
Has anyone seen pillton? I just did a `tail -n 100000 '#lisp.log' | grep '\(pillton\)\|\(Day\)'` and it looks like he was last here 21 August
0:10:44
aeth
I'm recompiling with my cache clear to verify it but I think I get problems with specialization-store and ECL and I always try to verify things like that over IRC first.
0:12:16
Colleen
Bike: drmeister said 36 minutes, 42 seconds ago: (ql:quickload something :verbose t) provides lots of info - thank you.
0:18:04
aeth
Hmm, yeah, in ECL I get "* The macro form (VEC--INTO! TEMP-VECTOR-1 VEC2 VEC1) was not expanded successfully."
0:22:42
Jachy
minion: memo for nixfreak: https://github.com/t-sin/one (example of using CL with bash one liners)