The Crystal programming language | http://crystal-lang.org | Fund Crystal's development: http://is.gd/X7PRtI | Docs: http://crystal-lang.org/docs/ | API: http://crystal-lang.org/api/
module Origin
private DEFAULT_TOLERANCE = 1e-7
def self.=~(x : Float64, y : Float64, rel_tol : Float64 = DEFAULT_TOLERANCE, abs_tol : Float64 = rel_tol)
(x - y).abs <= Math.max(abs_tol, rel_tol * Math.max(x.abs, y.abs))
end
endOrigin.=~(a, b, rel_tol: c, abs_tol: d), or a binary operator without qualification if the defaults are sufficient: a =~ b. I'm not sure why the former requires qualification.
I think mayhbe my code is wrong and it is calling the wrong overload
No it is calling the same method in both cases.
I think everything is fine actually. If anyone has any suggestions for improvements on this snippet, I'd appreciate it: https://play.crystal-lang.org/#/r/bky9
save you 2 lines :p
I just found what I think is a very minor compiler bug
I tried to see if I could overload
== instead of =~, and the error message says I'm trying to define a setter with more than 1 parameter. I know why this is the case, but maybe a special-cased error for arity-overloading == should exist
related crystal-lang/crystal#10397
I would expect <, > to be symmetrical with <=, <=.
err <=, >=
which would be more likely to make the others only 1 arg as well
Stropping lets the user re-use reserved keywords in a different context, usually by escaping the symbol in some way. In Nim for example, you can define an
== function by wrapping it in backticks
I suppose I would have to manually define my property methods if I were to use a static array as storage and I wanted to map those x, y names to indices?
I'm using a class, and for different vector lengths, and especially matrices, it'd allow me to write iteration macros to define a lot of routines for all shapes simultaneously
mean*
be easier than knowing what index is what
I want to implement "swizzling", with a macro. That means, for a 2-dimensional vector that has an X and Y property, a macro would generate permutations of the accessors: x, y, xx, yy, yx
I have done such in Nim before. Just trying to figure out the best way with Crystal
mfiano: well if your question can be more generally rephrased as "generate GLSL at compile time", here you go: https://gist.github.com/ba18db84e5e55ddc6d07a661062ae186
This is not for generating GLSL in any way. It is for CPU computations. I was just pointing at the feature in GLSL
i would suggest to still use a struct as storage, not a static array
I would like to use classes, containing an array, in order to support chained methods (mutations that return
self)
pass by value would prevent that
you can use classes but they're too heavy if you want to store many vectors
methods on structs can be chained but they're always by-copy, that is true
Yeah, I want the user-facing type to be a class for this reason. The storage is up for debate
internal storage*