8:51:24phoe"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:10Guest2239so it either supposed to return the other number independently of the argument order or nan
8:55:34phoea 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:54phoebut then again, it's up to the implementations to say whether they support ieee754-2008 float comparison
8:59:09phoeso if you're e.g. using SBCL, you should ask on #sbcl mayhaps
11:46:54jmercourisLooking for reccomendations for a simple matrix library or method
11:47:04jmercourisI could use 2D array, but maybe there is something better?
11:47:19jmercourisI've looked at a few online, I'm more interested in opinions
11:51:22ShinmeraMy 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.
11:51:54jmercourisA good point, I will think more about my required application
11:51:58jmercouristhere is no single truth after all
17:24:52phoeI am aware only of these two you listed
17:27:49Bikeit'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.
17:31:27rogersmYes, it's pretty implementation specific