freenode/lisp - IRC Chatlog
Search
8:51:24
phoe
"IEEE however, treats NaN as a missing value for the purpose of the minNum and maxNum functions. They will suppress a single NaN operand and return the number instead."
8:53:10
Guest2239
so it either supposed to return the other number independently of the argument order or nan
8:55:34
phoe
a naïve implementation of the algorithm there is (defun float< (x y) (cond ((> x y) x) ((< x y) x) ((= x y) x) ((float-features:float-nan-p x) y) ((float-features:float-nan-p y) x) (t x)))
8:58:54
phoe
but then again, it's up to the implementations to say whether they support ieee754-2008 float comparison
11:51:22
Shinmera
My opinion is it depends on what you need. If you just need matrix multiplication for small sizes you can write that triple loop yourself in like five lines. If you need large sizes and high performance you'll have to go for blas bindings. If it's in the middle, take your pick.
14:59:36
rpg
Anyone know anything about the SBCL images on Dockerhub? There are a lot of them, and it seems hard to figure out which one to use.
15:00:20
phoe
and they seem sorta maintained if the last commit there is from 12 days ago and merges something from Stas
17:23:41
rogersm
folks, maybe you're able to help. I'm trying to locate 'easy to plug' Garbage Collectors.
17:27:49
Bike
it's difficult to do garbage collection as a library since it needs to know object layouts and probably should do some things inline. So I also only know those two.
20:48:14
t-m3n
Define an array of integers of size 3 x 3, which will be initialized with increasing numbers from 1 to 9
20:48:14
t-m3n
2) Define a function that returns the element from position (i, j) in the array defined in point 1)
20:48:14
t-m3n
3) Define a function that returns a new array of size 2 x 2 starting from the array defined in point 1)