10 Boolean comparison functions

8.12

These functions are used for comparison between scalar?s.

procedure
(=-0-0 a b) → boolean?
  a : scalar?
  b : scalar?
procedure
(= a b) → boolean?
  a : scalar?
  b : scalar?

Returns #t if (ρ a) is equal to (ρ b). When a no-override entry point is used, = is not redefined to =-0-0.

procedure
(<-0-0 a b) → boolean?
  a : scalar?
  b : scalar?
procedure
(< a b) → boolean?
  a : scalar?
  b : scalar?

Returns #t if (ρ a) is less than (ρ b). When a no-override entry point is used, < is not redefined to <-0-0.

procedure
(>-0-0 a b) → boolean?
  a : scalar?
  b : scalar?
procedure
(> a b) → boolean?
  a : scalar?
  b : scalar?

Returns #t if (ρ a) is greater than (ρ b). When a no-override entry point is used, > is not redefined to >-0-0.

procedure
(<=-0-0 a b) → boolean?
  a : scalar?
  b : scalar?
procedure
(<= a b) → boolean?
  a : scalar?
  b : scalar?

Returns #t if (ρ a) is less than or equal to (ρ b). When a no-override entry point is used, <= is not redefined to <=-0-0.

procedure
(>=-0-0 a b) → boolean?
  a : scalar?
  b : scalar?
procedure
(>= a b) → boolean?
  a : scalar?
  b : scalar?

Returns #t if (ρ a) is greater than or equal to (ρ b). When a no-override entry point is used, >= is not redefined to >=-0-0.

1	Overview
2	Entry points
3	List functions
4	Tensor functions
5	Extended Functions
6	Automatic Differentiation
7	Differentiable extended numerical functions
8	Non-differentiable extended numerical functions
9	Base-rank (non-extended) differentiable functions
10	Boolean comparison functions
11	Tensorized comparison functions
12	Hyperparameters
13	Gradient Descent Functions and Hyperparameters
14	Layer functions
15	Loss Functions
16	Building blocks for neural networks
17	He Initialization
18	Random number functions
19	Models and Accuracy
20	Logging
21	Utilities
22	Setting tensor implementations