▼Raqit
On this page:
=
<
<=
>=
>
min
max
~
    contents    up   

2 Relations and Operators🔗

procedure

(= [#:key key] v ...) → boolean?

  key : (-> any/c any/c) = #f
  v : any/c
Identical to Racket’s equal? except that it supports an optional key function that is applied to the arguments prior to comparison, if provided.

(= 3 4)
(= #:key string-upcase "abc" "ABC")

procedure

(< [#:key key] v ...) → boolean?

  key : (-> any/c orderable?) = #f
  v : any/c

procedure

(<= [#:key key] v ...) → boolean?

  key : (-> any/c orderable?) = #f
  v : any/c

procedure

(>= [#:key key] v ...) → boolean?

  key : (-> any/c orderable?) = #f
  v : any/c

procedure

(> [#:key key] v ...) → boolean?

  key : (-> any/c orderable?) = #f
  v : any/c

procedure

(min [#:key key] v ...) → boolean?

  key : (-> any/c orderable?) = #f
  v : any/c

procedure

(max [#:key key] v ...) → boolean?

  key : (-> any/c orderable?) = #f
  v : any/c
Generic order relations supporting any orderable type, and extensible via (implements orderable ...). Identical to <, <=, >=, >, min, and max from relation/order.

procedure

(~ v ...) → appendable?

  v : appendable?
Append the provided values together, using the type’s implementation of the appendable protocol. The special value ID serves as the generic identity value when the type of the operands is not known. In particular, this value is the result when no operands are provided.

Identical to ~ from relation/composition.

(~ [1 2 3] [4 5 6] [7 8 9])
(~ "abc" "def" "ghijk")
    contents    up