API¶

Core Macros¶

The following macros are auto imported into all Hy modules as their base names, such that hy.core.macros.foo can be called as just foo.

(annotate value type)¶

annotate and its shorthand form #^ are used to denote annotations, including type hints, in three different contexts:

Standalone variable annotations (PEP 526)
Variable annotations in a setv call
Function-parameter annotations (PEP 3107)

The difference between annotate and #^ is that annotate requires parentheses and takes the name to be annotated first (like Python), whereas #^ doesn’t require parentheses (it only applies to the next two forms) and takes the type second:

(setv (annotate x int) 1)
(setv #^int x 1)

The order difference is not merely visual: #^ actually evaluates the type first.

Here are examples with #^ for all the places you can use annotations:

; Annotate the variable `x` as an `int` (equivalent to `x: int`).
#^int x
; You can annotate with expressions (equivalent to `y: f(x)`).
#^(f x) y

; Annotations with an assignment: each annotation `(int, str)`
; covers the term that immediately follows.
; Equivalent to `x: int = 1; y = 2; z: str = 3`
(setv  #^int x 1  y 2  #^str z 3)

; Annotate `a` as an `int`, `c` as an `int`, and `b` as a `str`.
; Equivalent to `def func(a: int, b: str = None, c: int = 1): ...`
(defn func [#^int a  #^str  [b None] #^int  [c 1]] ...)

; Function return annotations come before the function name (if
; it exists).
(defn #^int add1 [#^int x] (+ x 1))
(fn #^int [#^int y] (+ y 2))

For annotating items with generic types, the of macro will likely be of use.

An issue with type annotations is that, as of this writing, we know of no Python type-checker that can work with ast objects or bytecode files. They all need Python source text. So you’ll have to translate your Hy with hy2py in order to actually check the types.

.¶

. is used to perform attribute access on objects. It uses a small DSL to allow quick access to attributes and items in a nested data structure.

Examples

(. foo (bar "qux")  baz [(+ 1 2)] frob)

Compiles down to:

foo.bar("qux").baz[1 + 2].frob

. compiles its first argument (in the example, foo) as the object on which to do the attribute dereference. It uses bare symbols as attributes to access (in the example, baz, frob), Expressions as method calls (as in bar), and compiles the contents of lists (in the example, [(+ 1 2)]) for indexation. Other arguments raise a compilation error.

Access to unknown attributes raises an AttributeError. Access to unknown keys raises an IndexError (on lists and tuples) or a KeyError (on dictionaries).

(fn args)¶: As defn, but no name for the new function is required (or allowed), and the newly created function object is returned. Decorators aren’t allowed, either. However, the function body is understood identically to that of defn, without any of the restrictions of Python’s lambda. See fn/a for the asynchronous equivalent.

(fn/a name #* args)¶: As fn, but the created function object will be a coroutine.

(defn name #* args)¶

defn compiles to a function definition (or possibly to an assignment of a lambda expression). It always returns None. It requires two arguments: a name (given as a symbol; see fn for anonymous functions) and a “lambda list”, or list of parameters (also given as symbols). Any further arguments constitute the body of the function:

(defn name [params] bodyform1 bodyform2...)

An empty body is implicitly (return None). If there at least two body forms, and the first of them is a string literal, this string becomes the docstring of the function. The final body form is implicitly returned; thus, (defn f [] 5) is equivalent to (defn f [] (return 5)).

defn accepts two additional, optional arguments: a bracketed list of decorators and an annotation (see ^) for the return value. These are placed before the function name (in that order, if both are present):

(defn [decorator1 decorator2] ^annotation name [params] …)

To define asynchronous functions, see defn/a and fn/a.

defn lambda lists support all the same features as Python parameter lists and hence are complex in their full generality. The simplest case is a (possibly empty) list of symbols, indicating that all parameters are required, and can be set by position, as in (f value), or by name, as in (f :argument value). To set a default value for a parameter, replace the parameter with the bracketed list [pname value], where pname is the parameter name as a symbol and value is an arbitrary form. Beware that, per Python, value is evaluated when the function is defined, not when it’s called, and if the resulting object is mutated, all calls will see the changes.

Further special lambda-list syntax includes:

/: If the symbol / is given in place of a parameter, it means that all the preceding parameters can only be set positionally.
*: If the symbol * is given in place of a parameter, it means that all the following parameters can only be set by name.
#* args: If the parameter list contains #* args or (unpack-iterable args), then args is set to a tuple containing all otherwise unmatched positional arguments. The name args is merely cherished Python tradition; you can use any symbol.
#** kwargs: #** kwargs (a.k.a. (unpack-mapping kwargs)) is like #* args, but collects unmatched keyword arguments into a dictionary.

Each of these special constructs is allowed only once, and has the same restrictions as in Python; e.g., #* args must precede #** kwargs if both are present. Here’s an example with a complex lambda list:

(defn f [a / b [c 3] * d e #** kwargs]
  [a b c d e kwargs])
(print (hy.repr (f 1 2 :d 4 :e 5 :f 6)))
  ; => [1 2 3 4 5 {"f" 6}]

(defn/a name lambda-list #* body)¶: As defn, but defines a coroutine like Python’s async def.

(defmacro name lambda-list #* body)¶

defmacro is used to define macros. The general format is (defmacro name [parameters] expr).

The following example defines a macro that can be used to swap order of elements in code, allowing the user to write code in infix notation, where operator is in between the operands.

Examples

=> (defmacro infix [code]
...  (quasiquote (
...    (unquote (get code 1))
...    (unquote (get code 0))
...    (unquote (get code 2)))))

=> (infix (1 + 1))
2

Note

because all values are passed to macros unevaluated, defmacro cannot use keyword arguments, or kwargs. All arguments are passed in positionally. Parameters can still be given default values however:

=> (defmacro a-macro [a [b 1]]
...  `[~a ~b])
=> (a-macro 2)
[2 1]
=> (a-macro 2 3)
[2 3]
=> (a-macro :b 3)
[:b 3]

(if test then else)¶

if compiles to an if expression (or compound if statement). The form test is evaluated and categorized as true or false according to bool. If the result is true, then is evaluated and returned. Othewise, else is evaluated and returned.

(if (has-money-left account)
  (print "Let's go shopping!")
  (print "Back to work."))

See also:

do, to execute several forms as part of any of if’s three arguments.
when, for shorthand for (if condition (do …) None).
cond, for shorthand for nested if forms.

(await obj)¶

await creates an await expression. It takes exactly one argument: the object to wait for.

Examples

=> (import asyncio)
=> (defn/a main []
...    (print "hello")
...    (await (asyncio.sleep 1))
...    (print "world"))
=> (asyncio.run (main))
hello
world

(break)¶

break compiles to a break statement, which terminates the enclosing loop. The following example has an infinite while loop that ends when the user enters “k”:

(while True
  (if (= (input "> ") "k")
    (break)
    (print "Try again")))

In a loop with multiple iteration clauses, such as (for [x xs y ys] …), break only breaks out of the innermost iteration, not the whole form. To jump out of the whole form, enclose it in a block and use block-ret instead of break, or enclose it in a function and use return.

(chainc #* args)¶

chainc creates a comparison expression. It isn’t required for unchained comparisons, which have only one comparison operator, nor for chains of the same operator. For those cases, you can use the comparison operators directly with Hy’s usual prefix syntax, as in (= x 1) or (< 1 2 3). The use of chainc is to construct chains of heterogeneous operators, such as x <= y < z. It uses an infix syntax with the general form

(chainc ARG OP ARG OP ARG…)

Hence, (chainc x <= y < z) is equivalent to (and (<= x y) (< y z)), including short-circuiting, except that y is only evaluated once.

Each ARG is an arbitrary form, which does not itself use infix syntax. Use py if you want fully Python-style operator syntax. You can also nest chainc forms, although this is rarely useful. Each OP is a literal comparison operator; other forms that resolve to a comparison operator are not allowed.

At least two ARGs and one OP are required, and every OP must be followed by an ARG.

As elsewhere in Hy, the equality operator is spelled =, not == as in Python.

(continue)¶

continue compiles to a continue statement, which returns execution to the start of a loop. In the following example, (.append output x) is executed on each iteration, whereas (.append evens x) is only executed for even numbers.

(setv  output []  evens [])
(for [x (range 10)]
  (.append output x)
  (when (% x 2)
    (continue))
  (.append evens x))

In a loop with multiple iteration clauses, such as (for [x xs y ys] …), continue applies to the innermost iteration, not the whole form. To jump to the next step of an outer iteration, try rewriting your loop as multiple nested loops and interposing a block, as in (for [x xs] (block (for [y ys] …))). You can then use block-ret in place of continue.

(do #* body)¶

do (called progn in some Lisps) takes any number of forms, evaluates them, and returns the value of the last one, or None if no forms were provided.

Examples

=> (+ 1 (do (setv x (+ 1 1)) x))
3

(for #* args)¶

for is used to evaluate some forms for each element in an iterable object, such as a list. The return values of the forms are discarded and the for form returns None.

=> (for [x [1 2 3]]
...  (print "iterating")
...  (print x))
iterating
1
iterating
2
iterating
3

In its square-bracketed first argument, for allows the same types of clauses as lfor.

=> (for [x [1 2 3]  :if (!= x 2)  y [7 8]]
...  (print x y))
1 7
1 8
3 7
3 8

Furthermore, the last argument of for can be an (else …) form. This form is executed after the last iteration of the for's outermost iteration clause, but only if that outermost loop terminates normally. If it’s jumped out of with e.g. break, the else is ignored.

=> (for [element [1 2 3]] (if (< element 3)
...                             (print element)
...                             (break))
...    (else (print "loop finished")))
1
2

=> (for [element [1 2 3]] (if (< element 4)
...                             (print element)
...                             (break))
...    (else (print "loop finished")))
1
2
3
loop finished

(assert condition [label None])¶

assert is used to verify conditions while the program is running. If the condition is not met, an AssertionError is raised. assert may take one or two parameters. The first parameter is the condition to check, and it should evaluate to either True or False. The second parameter, optional, is a label for the assert, and is the string that will be raised with the AssertionError. For example:

Examples

(assert (= variable expected-value))

(assert False)
; AssertionError

(assert (= 1 2) "one should equal two")
; AssertionError: one should equal two

(global sym)¶

global can be used to mark a symbol as global. This allows the programmer to assign a value to a global symbol. Reading a global symbol does not require the global keyword – only assigning it does.

The following example shows how the global symbol a is assigned a value in a function and is later on printed in another function. Without the global keyword, the second function would have raised a NameError.

Examples

(defn set-a [value]
  (global a)
  (setv a value))

(defn print-a []
  (print a))

(set-a 5)
(print-a)

(get coll key1 #* keys)¶

get is used to access single elements in collections. get takes at least two parameters: the data structure and the index or key of the item. It will then return the corresponding value from the collection. If multiple index or key values are provided, they are used to access successive elements in a nested structure. Example usage:

Examples

=> (do
...  (setv animals {"dog" "bark" "cat" "meow"}
...        numbers #("zero" "one" "two" "three")
...        nested [0 1 ["a" "b" "c"] 3 4])
...  (print (get animals "dog"))
...  (print (get numbers 2))
...  (print (get nested 2 1)))

bark
two
b

Note

get raises a KeyError if a dictionary is queried for a non-existing key.

Note

get raises an IndexError if a list or a tuple is queried for an index that is out of bounds.

(import #* forms)¶

import compiles to an import statement, which makes objects in a different module available in the current module. Hy’s syntax for the various kinds of import looks like this:

;; Import each of these modules
;; Python: import sys, os.path
(import sys os.path)

;; Import several names from a single module
;; Python: from os.path import exists, isdir as is_dir, isfile
(import os.path [exists  isdir :as dir?  isfile])

;; Import with an alias
;; Python: import sys as systest
(import sys :as systest)

;; You can list as many imports as you like of different types.
;; Python:
;;     from tests.resources import kwtest, function_with_a_dash
;;     from os.path import exists, isdir as is_dir, isfile as is_file
;;     import sys as systest
(import tests.resources [kwtest function-with-a-dash]
        os.path [exists
                 isdir :as dir?
                 isfile :as file?]
        sys :as systest)

;; Import all module functions into current namespace
;; Python: from sys import *
(import sys *)

__all__ can be set to control what’s imported by import *, as in Python, but beware that all names in __all__ must be mangled. The macro export is a handy way to set __all__ in a Hy program.

(eval-and-compile #* body)¶

eval-and-compile is a special form that takes any number of forms. The input forms are evaluated as soon as the eval-and-compile form is compiled, instead of being deferred until run-time. The input forms are also left in the program so they can be executed at run-time as usual. So, if you compile and immediately execute a program (as calling hy foo.hy does when foo.hy doesn’t have an up-to-date byte-compiled version), eval-and-compile forms will be evaluated twice.

One possible use of eval-and-compile is to make a function available both at compile-time (so a macro can call it while expanding) and run-time (so it can be called like any other function):

(eval-and-compile
  (defn add [x y]
    (+ x y)))

(defmacro m [x]
  (add x 2))

(print (m 3))     ; prints 5
(print (add 3 6)) ; prints 9

Had the defn not been wrapped in eval-and-compile, m wouldn’t be able to call add, because when the compiler was expanding (m 3), add wouldn’t exist yet.

(eval-when-compile #* body)¶

eval-when-compile is like eval-and-compile, but the code isn’t executed at run-time. Hence, eval-when-compile doesn’t directly contribute any code to the final program, although it can still change Hy’s state while compiling (e.g., by defining a function).

Examples

(eval-when-compile
  (defn add [x y]
    (+ x y)))

(defmacro m [x]
  (add x 2))

(print (m 3))     ; prints 5
(print (add 3 6)) ; raises NameError: name 'add' is not defined

(lfor #* args)¶

The comprehension forms lfor, sfor, dfor, gfor, and for are used to produce various kinds of loops, including Python-style comprehensions. lfor in particular creates a list comprehension. A simple use of lfor is:

=> (lfor x (range 5) (* 2 x))
[0 2 4 6 8]

x is the name of a new variable, which is bound to each element of (range 5). Each such element in turn is used to evaluate the value form (* 2 x), and the results are accumulated into a list.

Here’s a more complex example:

=> (lfor
...  x (range 3)
...  y (range 3)
...  :if (!= x y)
...  :setv total (+ x y)
...  [x y total])
[[0 1 1] [0 2 2] [1 0 1] [1 2 3] [2 0 2] [2 1 3]]

When there are several iteration clauses (here, the pairs of forms x (range 3) and y (range 3)), the result works like a nested loop or Cartesian product: all combinations are considered in lexicographic order.

The general form of lfor is:

(lfor CLAUSES VALUE)

where the VALUE is an arbitrary form that is evaluated to produce each element of the result list, and CLAUSES is any number of clauses. There are several types of clauses:

Iteration clauses, which look like LVALUE ITERABLE. The LVALUE is usually just a symbol, but could be something more complicated, like [x y].
:async LVALUE ITERABLE, which is an asynchronous form of iteration clause.
:do FORM, which simply evaluates the FORM. If you use (continue) or (break) here, they will apply to the innermost iteration clause before the :do.
:setv LVALUE RVALUE, which is equivalent to :do (setv LVALUE RVALUE).
:if CONDITION, which is equivalent to :do (when (not CONDITION) (continue)).

For lfor, sfor, gfor, and dfor, variables defined by an iteration clause or :setv are not visible outside the form. However, variables defined within the body, such as via a setx expression, will be visible outside the form. By contrast, iteration and :setv clauses for for share the caller’s scope and are visible outside the form.

(dfor #* args)¶

dfor creates a dictionary comprehension. Its syntax is the same as that of lfor except that it takes two trailing arguments. The first is a form producing the key of each dictionary element, and the second produces the value. Thus:

=> (dfor  x (range 5)  x (* x 10))
{0 0  1 10  2 20  3 30  4 40}

(gfor #* args)¶

gfor creates a generator expression. Its syntax is the same as that of lfor. The difference is that gfor returns an iterator, which evaluates and yields values one at a time.

Examples

=> (import itertools [count take-while])
=> (setv accum [])
=> (list (take-while
...  (fn [x] (< x 5))
...  (gfor x (count) :do (.append accum x) x)))
[0 1 2 3 4]
=> accum
[0 1 2 3 4 5]

(sfor #* args)¶: sfor creates a set comprehension. (sfor CLAUSES VALUE) is equivalent to (set (lfor CLAUSES VALUE)). See lfor.

(setv #* args)¶

setv is used to bind a value, object, or function to a symbol.

Examples

=> (setv names ["Alice" "Bob" "Charlie"])
=> (print names)
['Alice', 'Bob', 'Charlie']

=> (setv counter (fn [collection item] (.count collection item)))
=> (counter [1 2 3 4 5 2 3] 2)
2

You can provide more than one target–value pair, and the assignments will be made in order:

=> (setv  x 1  y x  x 2)
=> (print x y)
2 1

You can perform parallel assignments or unpack the source value with square brackets and unpack-iterable:

=> (setv duo ["tim" "eric"])
=> (setv [guy1 guy2] duo)
=> (print guy1 guy2)
tim eric

=> (setv [letter1 letter2 #* others] "abcdefg")
=> (print letter1 letter2 others)
a b ['c', 'd', 'e', 'f', 'g']

(setx #* args)¶

Whereas setv creates an assignment statement, setx creates an assignment expression (see PEP 572). It requires Python 3.8 or later. Only one target–value pair is allowed, and the target must be a bare symbol, but the setx form returns the assigned value instead of None.

Examples

=> (when (> (setx x (+ 1 2)) 0)
...  (print x "is greater than 0"))
3 is greater than 0

(let bindings #* body)¶

let creates lexically-scoped names for local variables. This form takes a list of binding pairs followed by a body which gets executed. A let-bound name ceases to refer to that local outside the let form, but arguments in nested functions and bindings in nested let forms can shadow these names.

Examples

=> (let [x 5   ; creates new local bound names 'x and 'y
         y 6]
...  (print x y)
...  (let [x 7]  ; new local and name binding that shadows 'x
...    (print x y))
...  (print x y))  ; 'x refers to the first local again
5 6
7 6
5 6

let can also bind names using Python’s extended iterable unpacking syntax to destructure iterables:

=> (let [[head #* tail] #(0 1 2)]
...   [head tail])
[0 [1 2]]

Basic assignments (e.g. setv, +=) will update the local variable named by a let binding when they assign to a let-bound name. But assignments via import are always hoisted to normal Python scope, and likewise, defn or defclass will assign the function or class in the Python scope, even if it shares the name of a let binding. To avoid this hoisting, use importlib.import_module, fn, or type (or whatever metaclass) instead.

If lfor, sfor, dfor, or gfor (but not for) is in the body of a let, assignments in iteration clauses and :setv clauses will create a new variable in the comprehenion form’s own scope, without touching any outer let-bound variable of the same name.

Like the let* of many other Lisps, let executes the variable assignments one-by-one, in the order written:

=> (let [x 5
...       y (+ x 1)]
...   (print x y))
5 6

=> (let [x 1
...      x (fn [] x)]
...   (x))
1

Note that let-bound variables continue to exist in the surrounding Python scope. As such, let-bound objects may not be eligible for garbage collection as soon as the let ends. To ensure there are no references to let-bound objects as soon as possible, use del at the end of the let, or wrap the let in a function.

(match subject #* cases)¶

The match form creates a match statement. It requires Python 3.10 or later. The first argument should be the subject, and any remaining arguments should be pairs of patterns and results. The match form returns the value of the corresponding result, or None if no case matched. For example:

=> (match (+ 1 1)
...  1 "one"
...  2 "two"
...  3 "three")
"two"

You can use do to build a complex result form. Patterns, as in Python match statements, are interpreted specially and can’t be arbitrary forms. Use (| …) for OR patterns, PATTERN :as NAME for AS patterns, and syntax like the usual Hy syntax for literal, capture, value, sequence, mapping, and class patterns. Guards are specified with :if FORM. Here’s a more complex example:

=> (match #(100 200)
...  [100 300]               "Case 1"
...  [100 200] :if flag      "Case 2"
...  [900   y]               f"Case 3, y: {y}"
...  [100 (| 100 200) :as y] f"Case 4, y: {y}"
...  _                       "Case 5, I match anything!")

This will match case 2 if flag is true and case 4 otherwise.

match can also match against class instances by keyword (or positionally if its __match_args__ attribute is defined, see pep 636):

=> (import  dataclasses [dataclass])
=> (defclass [dataclass] Point []
...  #^int x
...  #^int y)
=> (match (Point 1 2)
...  (Point 1 x) :if (= (% x 2) 0) x)
2

(defclass class-name super-classes #* body)¶

New classes are declared with defclass. It can take optional parameters in the following order: a list defining (a) possible super class(es) and a string (docstring). The class name may also be preceded by a list of decorators, as in defn.

Examples

=> (defclass class-name [super-class-1 super-class-2]
...   "docstring"
...
...   (setv attribute1 value1)
...   (setv attribute2 value2)
...
...   (defn method [self] (print "hello!")))

Both values and functions can be bound on the new class as shown by the example below:

=> (defclass Cat []
...  (setv age None)
...  (setv colour "white")
...
...  (defn speak [self] (print "Meow")))

=> (setv spot (Cat))
=> (setv spot.colour "Black")
=> (.speak spot)
Meow

(del object)¶

del removes an object from the current namespace.

Examples

=> (setv foo 42)
=> (del foo)
=> foo
Traceback (most recent call last):
  File "<console>", line 1, in <module>
NameError: name 'foo' is not defined

del can also remove objects from mappings, lists, and more.

=> (setv test (list (range 10)))
=> test
[0 1 2 3 4 5 6 7 8 9]
=> (del (cut test 2 4)) ;; remove items from 2 to 4 excluded
=> test
[0 1 4 5 6 7 8 9]
=> (setv dic {"foo" "bar"})
=> dic
{"foo" "bar"}
=> (del (get dic "foo"))
=> dic
{}

(nonlocal object)¶

nonlocal can be used to mark a symbol as not local to the current scope. The parameters are the names of symbols to mark as nonlocal. This is necessary to modify variables through nested fn scopes:

Examples

(defn some-function []
  (setv x 0)
  (register-some-callback
    (fn [stuff]
      (nonlocal x)
      (setv x stuff))))

Without the call to (nonlocal x), the inner function would redefine x to stuff inside its local scope instead of overwriting the x in the outer function.

See PEP3104 for further information.

(py string)¶

py parses the given Python code at compile-time and inserts the result into the generated abstract syntax tree. Thus, you can mix Python code into a Hy program. Only a Python expression is allowed, not statements; use pys if you want to use Python statements. The value of the expression is returned from the py form.

(print "A result from Python:" (py "'hello' + 'world'"))

The code must be given as a single string literal, but you can still use macros, hy.eval, and related tools to construct the py form. If having to backslash-escape internal double quotes is getting you down, try a bracket string. If you want to evaluate some Python code that’s only defined at run-time, try the standard Python function eval().

Python code need not syntactically round-trip if you use hy2py on a Hy program that uses py or pys. For example, comments will be removed.

(pys string)¶

As py, but the code can consist of zero or more statements, including compound statements such as for and def. pys always returns None. Also, the code string is dedented with textwrap.dedent() before parsing, which allows you to intend the code to match the surrounding Hy code, but significant leading whitespace in embedded string literals will be removed.

(pys "myvar = 5")
(print "myvar is" myvar)

(quasiquote form)¶

quasiquote allows you to quote a form, but also selectively evaluate expressions. Expressions inside a quasiquote can be selectively evaluated using unquote (~). The evaluated form can also be spliced using unquote-splice (~@). Quasiquote can be also written using the backquote (`) symbol.

Examples

;; let `qux' be a variable with value (bar baz)
`(foo ~qux)
; equivalent to '(foo (bar baz))
`(foo ~@qux)
; equivalent to '(foo bar baz)

(quote form)¶

quote returns the form passed to it without evaluating it. quote can alternatively be written using the apostrophe (') symbol.

Examples

=> (setv x '(print "Hello World"))
=> x  ; variable x is set to unevaluated expression
hy.models.Expression([
  hy.models.Symbol('print'),
  hy.models.String('Hello World')])
=> (hy.eval x)
Hello World

(require #* args)¶

require is used to import macros and reader macros from one or more given modules. It allows parameters in all the same formats as import. require imports each named module and then makes each requested macro available in the current module.

The following are all equivalent ways to call a macro named foo in the module mymodule.

Examples

(require mymodule)
(mymodule.foo 1)

(require mymodule :as M)
(M.foo 1)

(require mymodule [foo])
(foo 1)

(require mymodule *)
(foo 1)

(require mymodule [foo :as bar])
(bar 1)

Reader macros are required using :readers [...]. The :macros kwarg can be optionally added for readability:

=> (require mymodule :readers *)
=> (require mymodule :readers [!])
=> (require mymodule [foo] :readers [!])
=> (require mymodule :readers [!] [foo])
=> (require mymodule :macros [foo] :readers [!])

Do note however, that requiring :readers, but not specifying any regular macros, will not bring that module’s macros in under their absolute paths:

=> (require mymodule :readers [!])
=> (mymodule.foo)
Traceback (most recent call last):
  File "stdin-cd49eaaabebc174c87ebe6bf15f2f8a28660feba", line 1, in <module>
    (mymodule.foo)
NameError: name 'mymodule' is not defined

Unlike requiring regular macros, reader macros cannot be renamed with :as, and are not made available under their absolute paths to their source module:

=> (require mymodule :readers [!])
HySyntaxError: ...

=> (require mymodule :readers [! :as &])
HySyntaxError: ...

=> (require mymodule)
=> mymodule.! x
NameError: name 'mymodule' is not defined

To define which macros are collected by (require mymodule *), set the variable _hy_export_macros (analogous to Python’s __all__) to a list of mangled macro names, which is accomplished most conveniently with export. The default behavior is to collect all macros other than those whose mangled names begin with an ASCII underscore (_).

When requiring reader macros, (require mymodule :readers *) will collect all reader macros both defined and required within mymodule.

Macros that call macros

One aspect of require that may be surprising is what happens when one macro’s expansion calls another macro. Suppose mymodule.hy looks like this:

(defmacro repexpr [n expr]
  ; Evaluate the expression n times
  ; and collect the results in a list.
  `(list (map (fn [_] ~expr) (range ~n))))

(defmacro foo [n]
  `(repexpr ~n (input "Gimme some input: ")))

And then, in your main program, you write:

(require mymodule [foo])

(print (mymodule.foo 3))

Running this raises NameError: name 'repexpr' is not defined, even though writing (print (foo 3)) in mymodule works fine. The trouble is that your main program doesn’t have the macro repexpr available, since it wasn’t imported (and imported under exactly that name, as opposed to a qualified name). You could do (require mymodule *) or (require mymodule [foo repexpr]), but a less error-prone approach is to change the definition of foo to require whatever sub-macros it needs:

(defmacro foo [n]
  `(do
    (require mymodule)
    (mymodule.repexpr ~n (input "Gimme some input: "))))

It’s wise to use (require mymodule) here rather than (require mymodule [repexpr]) to avoid accidentally shadowing a function named repexpr in the main program.

Note

Qualified macro names

Note that in the current implementation, there’s a trick in qualified macro names, like mymodule.foo and M.foo in the above example. These names aren’t actually attributes of module objects; they’re just identifiers with periods in them. In fact, mymodule and M aren’t defined by these require forms, even at compile-time. None of this will hurt you unless try to do introspection of the current module’s set of defined macros, which isn’t really supported anyway.

(return object)¶

return compiles to a return statement. It exits the current function, returning its argument if provided with one or None if not.

Examples

=> (defn f [x] (for [n (range 10)] (when (> n x) (return n))))
=> (f 3.9)
4

Note that in Hy, return is necessary much less often than in Python, since the last form of a function is returned automatically. Hence, an explicit return is only necessary to exit a function early.

=> (defn f [x] (setv y 10) (+ x y))
=> (f 4)
14

To get Python’s behavior of returning None when execution reaches the end of a function, put None there yourself.

=> (defn f [x] (setv y 10) (+ x y) None)
=> (print (f 4))
None

(cut coll [start None] [stop None] [step None)¶

cut can be used to take a subset of a list and create a new list from it. The form takes at least one parameter specifying the list to cut. Two optional parameters can be used to give the start and end position of the subset. If only one is given, it is taken as the stop value. The third optional parameter is used to control the step stride between the elements.

cut follows the same rules as its Python counterpart. Negative indices are counted starting from the end of the list. Some example usage:

Examples

=> (setv collection (range 10))
=> (cut collection)
[0 1 2 3 4 5 6 7 8 9]

=> (cut collection 5)
[0 1 2 3 4]

=> (cut collection 2 8)
[2 3 4 5 6 7]

=> (cut collection 2 8 2)
[2 4 6]

=> (cut collection -4 -2)
[6 7]

(raise [exception None])¶

The raise form can be used to raise an Exception at runtime. Example usage:

Examples

(raise)
; re-rase the last exception

(raise IOError)
; raise an IOError

(raise (IOError "foobar"))
; raise an IOError("foobar")

raise can accept a single argument (an Exception class or instance) or no arguments to re-raise the last Exception.

(try #* body)¶

try compiles to a try statement, which can catch exceptions and run cleanup actions. It begins with any number of body forms. Then follows any number of except or except* (PEP 654) forms, which are expressions that begin with the symbol in question, followed by a list of exception types, followed by more body forms. Finally there are an optional else form and an optional finally form, which again are expressions that begin with the symbol in question and then comprise body forms. As in Python, at least one of except, except*, or finally is required; else is only allowed if at least one except or except* is provided; except* requires Python 3.11; and except and except* may not both be used in the same try.

Here’s an example of several of the allowed kinds of child forms:

(try
  (error-prone-function)
  (another-error-prone-function)
  (except [ZeroDivisionError]
    (print "Division by zero"))
  (except [[IndexError KeyboardInterrupt]]
    (print "Index error or Ctrl-C"))
  (except [e ValueError]
    (print "ValueError:" (repr e)))
  (except [e [TabError PermissionError ReferenceError]]
    (print "Some sort of error:" (repr e)))
  (else
    (print "No errors"))
  (finally
    (print "All done")))

Exception lists can be in any of several formats:

[] to catch any subtype of Exception, like Python’s except:
[ETYPE] to catch only the single type ETYPE, like Python’s `except ETYPE:
[[ETYPE1 ETYPE2 …]] to catch any of the named types, like Python’s except ETYPE1, ETYPE2, …:
[VAR ETYPE] to catch ETYPE and bind it to VAR, like Python’s except ETYPE as VAR:
[VAR [ETYPE1 ETYPE2 …]] to catch any of the named types and bind it to VAR, like Python’s except ETYPE1, ETYPE2, … as VAR:

The return value of try is the last form evaluated among the main body, except forms, except* forms, and else.

(unpack-iterable)¶

(unpack-mapping)¶

(Also known as the splat operator, star operator, argument expansion, argument explosion, argument gathering, and varargs, among others…)

unpack-iterable and unpack-mapping allow an iterable or mapping object (respectively) to provide positional or keywords arguments (respectively) to a function.

=> (defn f [a b c d] [a b c d])
=> (f (unpack-iterable [1 2]) (unpack-mapping {"c" 3 "d" 4}))
[1 2 3 4]

unpack-iterable is usually written with the shorthand #*, and unpack-mapping with #**.

=> (f #* [1 2] #** {"c" 3 "d" 4})
[1 2 3 4]

Unpacking is allowed in a variety of contexts, and you can unpack more than once in one expression (PEP 3132, PEP 448).

=> (setv [a #* b c] [1 2 3 4 5])
=> [a b c]
[1 [2 3 4] 5]
=> [#* [1 2] #* [3 4]]
[1 2 3 4]
=> {#** {1 2} #** {3 4}}
{1 2  3 4}
=> (f #* [1] #* [2] #** {"c" 3} #** {"d" 4})
[1 2  3 4]

(unquote symbol)¶

Within a quasiquoted form, unquote forces evaluation of a symbol. unquote is aliased to the tilde (~) symbol.

=> (setv nickname "Cuddles")
=> (quasiquote (= nickname (unquote nickname)))
'(= nickname "Cuddles")
=> `(= nickname ~nickname)
'(= nickname "Cuddles")

(unquote-splice symbol)¶

unquote-splice forces the evaluation of a symbol within a quasiquoted form, much like unquote. unquote-splice can be used when the symbol being unquoted contains an iterable value, as it “splices” that iterable into the quasiquoted form. unquote-splice can also be used when the value evaluates to a false value such as None, False, or 0, in which case the value is treated as an empty list and thus does not splice anything into the form. unquote-splice is aliased to the ~@ syntax.

=> (setv nums [1 2 3 4])
=> (quasiquote (+ (unquote-splice nums)))
'(+ 1 2 3 4)
=> `(+ ~@nums)
'(+ 1 2 3 4)
=> `[1 2 ~@(when (< (get nums 0) 0) nums)]
'[1 2]

Here, the last example evaluates to ('+' 1 2), since the condition (< (nth nums 0) 0) is False, which makes this if expression evaluate to None, because the if expression here does not have an else clause. unquote-splice then evaluates this as an empty value, leaving no effects on the list it is enclosed in, therefore resulting in ('+' 1 2).

(while condition #* body)¶

while compiles to a while statement. It is used to execute a set of forms as long as a condition is met. The first argument to while is the condition, and any remaining forms constitute the body. The following example will output “Hello world!” to the screen indefinitely:

(while True (print "Hello world!"))

The last form of a while loop can be an else clause, which is executed after the loop terminates, unless it exited abnormally (e.g., with break). So,

(setv x 2)
(while x
   (print "In body")
   (-= x 1)
   (else
     (print "In else")))

prints

In body
In body
In else

If you put a break or continue form in the condition of a while loop, it will apply to the very same loop rather than an outer loop, even if execution is yet to ever reach the loop body. (Hy compiles a while loop with statements in its condition by rewriting it so that the condition is actually in the body.) So,

(for [x [1]]
   (print "In outer loop")
   (while
     (do
       (print "In condition")
       (break)
       (print "This won't print.")
       True)
     (print "This won't print, either."))
   (print "At end of outer loop"))

prints

In outer loop
In condition
At end of outer loop

(with #* args)¶

Wrap execution of body within a context manager given as bracket args. with is used to wrap the execution of a block within a context manager. The context manager can then set up the local system and tear it down in a controlled manner. The archetypical example of using with is when processing files. If only a single expression is supplied, or the argument is _, then no variable is bound to the expression, as shown below.

Examples:

=> (with [arg (expr)] block)
=> (with [(expr)] block)
=> (with [arg1 (expr1)  _ (expr2)  arg3 (expr3)] block)

The following example will open the NEWS file and print its content to the screen. The file is automatically closed after it has been processed:

=> (with [f (open \"NEWS\")] (print (.read f)))

with returns the value of its last form, unless it suppresses an exception (because the context manager’s __exit__ method returned true), in which case it returns None. So, the previous example could also be written:

=> (print (with [f (open \"NEWS\")] (.read f)))

(with/a #* args)¶

Wrap execution of body within a context manager given as bracket args. with/a behaves like with, but is used to wrap the execution of a block within an asynchronous context manager. The context manager can then set up the local system and tear it down in a controlled manner asynchronously. Examples:

::
=> (with/a [arg (expr)] block) => (with/a [(expr)] block) => (with/a [_ (expr) arg (expr) _ (expr)] block)

Note

with/a returns the value of its last form, unless it suppresses an exception (because the context manager’s __aexit__ method returned true), in which case it returns None.

(yield object)¶

yield is used to create a generator object that returns one or more values. The generator is iterable and therefore can be used in loops, list comprehensions and other similar constructs.

The function random-numbers shows how generators can be used to generate infinite series without consuming infinite amount of memory.

Examples

=> (defn multiply [bases coefficients]
...  (for [#(base coefficient) (zip bases coefficients)]
...   (yield (* base coefficient))))

=> (multiply (range 5) (range 5))
<generator object multiply at 0x978d8ec>

=> (list (multiply (range 10) (range 10)))
[0 1 4 9 16 25 36 49 64 81]

=> (import random)
=> (defn random-numbers [low high]
...  (while True (yield (.randint random low high))))
=> (list (take 15 (random-numbers 1 50)))
[7 41 6 22 32 17 5 38 18 38 17 14 23 23 19]

(yield-from object)¶: yield-from is used to call a subgenerator. This is useful if you want your coroutine to be able to delegate its processes to another coroutine, say, if using something fancy like asyncio.

macro(hy.core.macros.cond #* args)¶

Shorthand for a nested sequence of if forms, like an if-elif-else ladder in Python. Syntax such as

(cond
  condition1 result1
  condition2 result2)

is equivalent to

(if condition1
  result1
  (if condition2
    result2
    None))

Notice that None is returned when no conditions match; use True as the final condition to change the fallback result. Use do to execute several forms as part of a single condition or result.

With no arguments, cond returns None. With an odd number of arguments, cond raises an error.

macro(hy.core.macros.defreader key #* body)¶

Define a new reader macro.

Reader macros are expanded at read time and allow you to modify the behavior of the Hy reader. Access to the currently instantiated HyReader is available in the body as &reader. See HyReader and its base class Reader for details regarding the available processing methods.

Reader macro names can be any symbol that does not start with a ^ and are callable by prefixing the name with a #. i.e. (defreader upper ...) is called with #upper.

Examples

The following is a primitive example of a reader macro that adds Python’s colon : slice sugar into Hy:

=> (defreader slice
...   (defn parse-node []
...     (let [node (when (!= ":" (.peekc &reader))
...                  (.parse-one-form &reader))]
...       (if (= node '...) 'Ellipse node)))
...
...   (with [(&reader.end-identifier ":")]
...     (let [nodes []]
...       (&reader.slurp-space)
...       (nodes.append (parse-node))
...       (while (&reader.peek-and-getc ":")
...         (nodes.append (parse-node)))
...
...       `(slice ~@nodes))))

=> (setv an-index 42)
=> #slice a:(+ 1 2):"column"
(slice 42 3 column)

See the reader macros docs for more detailed information on how reader macros work and are defined.

macro(hy.core.macros.delmacro #* names)¶

Delete a macro(s) from the current module

=> (require a-module [some-macro])
=> (some-macro)
1

=> (delmacro some-macro)
=> (some-macro)
Traceback (most recent call last):
  File "<string>", line 1, in <module>
    (some-macro)
NameError: name 'some_macro' is not defined

=> (delmacro some-macro)
Traceback (most recent call last):
  File "<string>", line 1, in <module>
    (delmacro some-macro)
NameError: macro 'some-macro' is not defined

macro(hy.core.macros.doc symbol)¶

macro documentation

Gets help for a macro function available in this module. Use require to make other macros available.

Use (help foo) instead for help with runtime objects.

macro(hy.core.macros.export #* args)¶

A convenience macro for defining __all__ and _hy_export_macros, which control which Python objects and macros (respectively) are collected by * imports in import and require (respectively). export allows you to provide the names as symbols instead of strings, and it calls hy.mangle for you on each name.

The syntax is (export objects macros), where objects refers to Python objects and macros to macros. Keyword arguments are allowed. For example,

(export
  :objects [my-fun MyClass]
  :macros [my-macro])

exports the function my-fun, the class MyClass, and the macro my-macro.

macro(hy.core.macros.when test #* body)¶

Shorthand for (if test (do …) None). See if. For a logically negated version, see Hyrule’s unless.

(when panic
  (log.write panic)
  (print "Process returned:" panic.msg)
  (return panic))

Placeholder macros¶

There are a few core macros that are unusual in that all they do, when expanded, is crash, regardless of their arguments:

else
except
except*
finally
unpack-mapping
unquote
unquote-splice

The purpose of these macros is merely to reserve their names. Each symbol is interpreted specially by one or more other core macros (e.g., else in while) and thus, in these contexts, any definition of these names as a function or macro would be ignored. If you really want to, you can override these names like any others, but beware that, for example, trying to call your new else inside while may not work.

Hy¶

The hy module is auto imported into every Hy module and provides convient access to the following methods

(hy.read stream filename reader)¶: Like hy.read-many, but only one form is read, and shebangs are forbidden. The model corresponding to this specific form is returned, or, if there are no forms left in the stream, EOFError is raised. stream.pos is left where it was immediately after the form.

(hy.read-many stream [filename <string>] reader [skip-shebang False])¶

Parse all the Hy source code in stream, which should be a textual file-like object or a string. filename, if provided, is used in error messages. If no reader is provided, a new hy.reader.hy_reader.HyReader object is created. If skip_shebang is true and a shebang line is present, it’s detected and discarded first.

Return a value of type hy.models.Lazy. If you want to evaluate this, be careful to allow evaluating each model before reading the next, as in (hy.eval (hy.read-many o)). By contrast, forcing all the code to be read before evaluating any of it, as in (hy.eval `(do [~@(hy.read-many o)])), will yield the wrong result if one form defines a reader macro that’s later used in the same stream to produce new forms.

Warning

Thanks to reader macros, reading can execute arbitrary code. Don’t read untrusted input.

(hy.eval hytree locals module ast-callback compiler filename source [import-stdlib True])¶

Evaluates a quoted expression and returns the value.

If you’re evaluating hand-crafted AST trees, make sure the line numbers are set properly. Try fix_missing_locations and related functions in the Python ast library.

Examples

=> (hy.eval '(print "Hello World"))
"Hello World"

If you want to evaluate a string, use read-str to convert it to a form first:

=> (hy.eval (hy.read-str "(+ 1 1)"))
2

Parameters

hytree (Object) – The Hy AST object to evaluate.
locals (Optional[dict]) – Local environment in which to evaluate the Hy tree. Defaults to the calling frame.
module (Optional[Union[str, types.ModuleType]]) – Module, or name of the module, to which the Hy tree is assigned and the global values are taken. The module associated with compiler takes priority over this value. When neither module nor compiler is specified, the calling frame’s module is used.
ast_callback (Optional[Callable]) – A callback that is passed the Hy compiled tree and resulting expression object, in that order, after compilation but before evaluation.
compiler (Optional[HyASTCompiler]) – An existing Hy compiler to use for compilation. Also serves as the module value when given.
filename (Optional[str]) – The filename corresponding to the source for tree. This will be overridden by the filename field of tree, if any; otherwise, it defaults to “<string>”. When compiler is given, its filename field value is always used.
source (Optional[str]) – A string containing the source code for tree. This will be overridden by the source field of tree, if any; otherwise, if None, an attempt will be made to obtain it from the module given by module. When compiler is given, its source field value is always used.

Returns

Result of evaluating the Hy compiled tree.

Return type

Any

(hy.repr obj)¶

This function is Hy’s equivalent of Python’s repr(). It returns a string representing the input object in Hy syntax.

=> (hy.repr [1 2 3])
"[1 2 3]"
=> (repr [1 2 3])
"[1, 2, 3]"

Like repr in Python, hy.repr can round-trip many kinds of values. Round-tripping implies that given an object x, (hy.eval (hy.read (hy.repr x))) returns x, or at least a value that’s equal to x. A notable exception to round-tripping is that if a hy.models.Object contains a non-model, the latter will be promoted to a model in the output:

(setv
  x (hy.models.List [5])
  output (hy.repr x)
  y (hy.eval (hy.read output)))
(print output)            ; '[5]
(print (type (get x 0)))  ; <class 'int'>
(print (type (get y 0)))  ; <class 'hy.models.Integer'>

(hy.repr-register types f placeholder)¶

hy.repr-register lets you set the function that hy.repr calls to represent a type.

Examples

 => (hy.repr-register the-type fun)

 => (defclass C)
 => (hy.repr-register C (fn [x] "cuddles"))
 => (hy.repr [1 (C) 2])
 "[1 cuddles 2]"

 If the type of an object passed to ``hy.repr`` doesn't have a registered
 function, ``hy.repr`` falls back on ``repr``.

 Registered functions often call ``hy.repr`` themselves. ``hy.repr`` will
 automatically detect self-references, even deeply nested ones, and
 output ``"..."`` for them instead of calling the usual registered
 function. To use a placeholder other than ``"..."``, pass a string of
 your choice to the keyword argument ``:placeholder`` of
 ``hy.repr-register``.

=> (defclass Container [object]
...   (defn __init__ (fn [self value]
...     (setv self.value value))))
=>    (hy.repr-register Container :placeholder "HY THERE" (fn [x]
...      (+ "(Container " (hy.repr x.value) ")")))
=> (setv container (Container 5))
=> (setv container.value container)
=> (print (hy.repr container))
'(Container HY THERE)'

(hy.mangle s)¶

Stringify the argument and convert it to a valid Python identifier according to Hy’s mangling rules.

If the argument is already both legal as a Python identifier and normalized according to Unicode normalization form KC (NFKC), it will be returned unchanged. Thus, mangle is idempotent.

Examples

=> (hy.mangle 'foo-bar)
"foo_bar"

=> (hy.mangle 'foo-bar?)
"is_foo_bar"

=> (hy.mangle '*)
"hyx_XasteriskX"

=> (hy.mangle '_foo/a?)
"_hyx_is_fooXsolidusXa"

=> (hy.mangle '-->)
"hyx_XhyphenHminusX_XgreaterHthan_signX"

=> (hy.mangle '<--)
"hyx_XlessHthan_signX__"

(hy.unmangle s)¶

Stringify the argument and try to convert it to a pretty unmangled form. See Hy’s mangling rules.

Unmangling may not round-trip, because different Hy symbol names can mangle to the same Python identifier. In particular, Python itself already considers distinct strings that have the same normalized form (according to NFKC), such as hello and 𝔥𝔢𝔩𝔩𝔬, to be the same identifier.

Examples

=> (hy.unmangle 'foo_bar)
"foo-bar"

=> (hy.unmangle 'is_foo_bar)
"foo-bar?"

=> (hy.unmangle 'hyx_XasteriskX)
"*"

=> (hy.unmangle '_hyx_is_fooXsolidusXa)
"_foo/a?"

=> (hy.unmangle 'hyx_XhyphenHminusX_XgreaterHthan_signX)
"-->"

=> (hy.unmangle 'hyx_XlessHthan_signX__)
"<--"

=> (hy.unmangle '__dunder_name__)
"__dunder-name__"

(hy.disassemble tree [codegen False])¶

Return the python AST for a quoted Hy tree as a string.

If the second argument codegen is true, generate python code instead.

Dump the Python AST for given Hy tree to standard output. If codegen is True, the function prints Python code instead.

Examples

=> (hy.disassemble '(print "Hello World!"))
Module(
 body=[
     Expr(value=Call(func=Name(id='print'), args=[Str(s='Hello World!')], keywords=[], starargs=None, kwargs=None))])

=> (hy.disassemble '(print "Hello World!") True)
print('Hello World!')

(hy.macroexpand form [result-ok False])¶

Return the full macro expansion of form.

Examples

=> (require hyrule [->])
=> (hy.macroexpand '(-> (a b) (x y)))
'(x (a b) y)
=> (hy.macroexpand '(-> (a b) (-> (c d) (e f))))
'(e (c (a b) d) f)

(hy.macroexpand-1 form)¶

Return the single step macro expansion of form.

Examples

=> (require hyrule [->])
=> (hy.macroexpand-1 '(-> (a b) (-> (c d) (e f))))
'(-> (a b) (c d) (e f))

(hy.gensym [g G])¶

Generate a symbol with a unique name. The argument will be included in the generated symbol, as an aid to debugging. Typically one calls hy.gensym without an argument.

Reader Macros¶

Like regular macros, reader macros should return a Hy form that will then be passed to the compiler for execution. Reader macros access the Hy reader using the &reader name. It gives access to all of the text- and form-parsing logic that Hy uses to parse itself. See HyReader and its base class Reader for details regarding the available processing methods.

class hy.reader.hy_reader.HyReader[source]¶

A modular reader for Hy source.

fill_pos(model, start)[source]¶

Attach line/col information to a model.

Sets the end location of model to the current cursor position.

Parameters

model (hy.models.Object) – model to set line/col info for.
start (tuple[int, int]) – (line, column) tuple indicating the start location to assign to model.

parse(stream, filename=None)[source]¶

Yields all hy.models.Object’s in source

Additionally exposes self as hy.&reader during read/compile time.

Parameters

source – Hy source to be parsed.
filename (str | None) – Filename to use for error messages. If None then previously set filename is used.

parse_forms_until(closer)[source]¶

Yields hy.models.Object’s until character closer is seen.

Useful for reading a sequence such as s-exprs or lists.

parse_one_form()[source]¶

Read from the stream until a form is parsed.

Guaranteed to return a model (i.e., skips over comments).

Returns: hy.models.Object

read_default(key)[source]¶

Default reader handler when nothing in the table matches.

Try to read an identifier/symbol. If there’s a double-quote immediately following, then parse it as a string with the given prefix (e.g., r”…”). Otherwise, parse it as a symbol-like.

class hy.reader.reader.Reader[source]¶

A reader base class for reading input character-by-character. Only for use as a base class; cannot be instantiated directly.

See class HyReader for an example of creating a reader class.

ends_ident¶

Set of characters that indicate the end of an identifier

Type: set[str]

reader_table¶

A dictionary mapping a reader macro key to its dispatch func

Type: dict[str, Callable]

pos¶

Read-only (line, column) tuple indicating the current cursor position of the source being read.

Type: tuple[int, int]

chars(eof_ok=False)[source]¶

Iterator for the character stream.

Consumes characters as they are produced.

Parameters: eof_ok (bool) – Whether or not it’s okay to hit the end of the file while consuming the iterator. Defaults to False
Yields: str – The next character in source.
Raises: PrematureEndOfInput – if eof_ok is False and the iterator hits the end of source

dispatch(tag)[source]¶

Call the handler for the tag.

Parameters: tag (str) – Reader macro dispatch key.
Returns: Model returned by the reader macro defined for tag.
Return type: hy.models.Object | None

end_identifier(character)[source]¶: Temporarily add a new character to the ends_ident set.

getc()[source]¶

Get one character from the stream, consuming it.

This function does the bookkeeping for position data, so it’s important that any character consumption go through this function.

Returns: The character under the cursor at pos.
Return type: str

getn(n)[source]¶: Returns n characters.

peek_and_getc(target)[source]¶

Peek one character and check if it’s equal to target.

Only consumes the peeked character if it is equal to target

Returns: Whether or not the next character in the stream is equal to target.
Return type: bool

peekc()[source]¶

Peek at a character from the stream without consuming it.

Returns: character at pos
Return type: str

peeking(eof_ok=False)[source]¶

Iterate over character stream without consuming any characters.

Useful for looking multiple characters ahead.

Parameters: eof_ok (bool) – Whether or not it is okay to hit the end of the file while peeking. Defaults to False
Yields: str – The next character in source.
Raises: PrematureEndOfInput – if eof_ok is False and the iterator hits the end of source

read_ident(just_peeking=False)[source]¶

Read characters until we hit something in ends_ident.

Parameters: just_peeking – Whether or not to consume characters while peeking. Defaults to False.
Returns: The identifier read.
Return type: str

saving_chars()[source]¶

Save all the characters read while in this block.

Useful for ‘=’ mode in f-strings.

Returns: list[str]

slurp_space()[source]¶: Returns and consumes 0 or more whitespace characters.

Python Operators¶

(hy.pyops.!= a1 a2 #* a-rest)¶

The inequality operator. Its effect can be defined by the equivalent Python:

(!= x y) → x != y
(!= a1 a2 … an) → a1 != a2 != … != an

(hy.pyops.% x y)¶

The modulus operator. Its effect can be defined by the equivalent Python:

(% x y) → x % y

(hy.pyops.& a1 #* a-rest)¶

The bitwise AND operator. Its effect can be defined by the equivalent Python:

(& x) → x
(& x y) → x & y
(& a1 a2 … an) → a1 & a2 & … & an

(hy.pyops.* #* args)¶

The multiplication operator. Its effect can be defined by the equivalent Python:

(*) → 0
(* x) → x
(* x y) → x * y
(* a1 a2 … an) → a1 * a2 * … * an

(hy.pyops.** a1 a2 #* a-rest)¶

The exponentiation operator. Its effect can be defined by the equivalent Python:

(** x y) → x ** y
(** a1 a2 … an) → a1 ** a2 ** … ** an

(hy.pyops.+ #* args)¶

The addition operator. Its effect can be defined by the equivalent Python:

(+) → 0
(+ x) → +x
(+ x y) → x + y
(+ a1 a2 … an) → a1 + a2 + … + an

(hy.pyops.- a1 #* a-rest)¶

The subtraction operator. Its effect can be defined by the equivalent Python:

(- x) → -x
(- x y) → x - y
(- a1 a2 … an) → a1 - a2 - … - an

(hy.pyops./ a1 #* a-rest)¶

The division operator. Its effect can be defined by the equivalent Python:

(/ x) → 1 / x
(/ x y) → x / y
(/ a1 a2 … an) → a1 / a2 / … / an

(hy.pyops.// a1 a2 #* a-rest)¶

The floor division operator. Its effect can be defined by the equivalent Python:

(// x y) → x // y
(// a1 a2 … an) → a1 // a2 // … // an

(hy.pyops.< a1 #* a-rest)¶

The less-than operator. Its effect can be defined by the equivalent Python:

(< x) → True
(< x y) → x < y
(< a1 a2 … an) → a1 < a2 < … < an

(hy.pyops.<< a1 a2 #* a-rest)¶

The left shift operator. Its effect can be defined by the equivalent Python:

(<< x y) → x << y
(<< a1 a2 … an) → a1 << a2 << … << an

(hy.pyops.<= a1 #* a-rest)¶

The less-than-or-equal-to operator. Its effect can be defined by the equivalent Python:

(<= x) → True
(<= x y) → x <= y
(<= a1 a2 … an) → a1 <= a2 <= … <= an

(hy.pyops.= a1 #* a-rest)¶

The equality operator. Its effect can be defined by the equivalent Python:

(= x) → True
(= x y) → x == y
(= a1 a2 … an) → a1 == a2 == … == an

(hy.pyops.> a1 #* a-rest)¶

The greater-than operator. Its effect can be defined by the equivalent Python:

(> x) → True
(> x y) → x > y
(> a1 a2 … an) → a1 > a2 > … > an

(hy.pyops.>= a1 #* a-rest)¶

The greater-than-or-equal-to operator. Its effect can be defined by the equivalent Python:

(>= x) → True
(>= x y) → x >= y
(>= a1 a2 … an) → a1 >= a2 >= … >= an

(hy.pyops.>> a1 a2 #* a-rest)¶

The right shift operator. Its effect can be defined by the equivalent Python:

(>> x y) → x >> y
(>> a1 a2 … an) → a1 >> a2 >> … >> an

(hy.pyops.@ a1 #* a-rest)¶

The matrix multiplication operator. Its effect can be defined by the equivalent Python:

(@ x y) → x @ y
(@ a1 a2 … an) → a1 @ a2 @ … @ an

(hy.pyops.[x y])¶

The bitwise XOR operator. Its effect can be defined by the equivalent Python:

(^ x y) → x ^ y

(hy.pyops.and #* args)¶

The logical conjuction operator. Its effect can be defined by the equivalent Python:

(and) → True
(and x) → x
(and x y) → x and y
(and a1 a2 … an) → a1 and a2 and … and an

(hy.pyops.comp-op op a1 a-rest)¶: Helper for shadow comparison operators

(hy.pyops.get coll key1 #* keys)¶

Access item in coll indexed by key1, with optional keys nested-access.

get is used to access single elements in collections. get takes at least two parameters: the data structure and the index or key of the item. It will then return the corresponding value from the collection. If multiple index or key values are provided, they are used to access successive elements in a nested structure.

Note

get raises a KeyError if a dictionary is queried for a non-existing key.

Note

get raises an IndexError if a list or a tuple is queried for an index that is out of bounds.

Examples

=> (do
...   (setv animals {"dog" "bark" "cat" "meow"}
...         numbers #("zero" "one" "two" "three")
...         nested [0 1 ["a" "b" "c"] 3 4])
...   (print (get animals "dog"))
...   (print (get numbers 2))
...   (print (get nested 2 1))
bark
two
b

(hy.pyops.in a1 a2 #* a-rest)¶

The membership test operator. Its effect can be defined by the equivalent Python:

(in x y) → x in y
(in a1 a2 … an) → a1 in a2 in … in an

(hy.pyops.is a1 #* a-rest)¶

The identicality test operator. Its effect can be defined by the equivalent Python:

(is x) → True
(is x y) → x is y
(is a1 a2 … an) → a1 is a2 is … is an

(hy.pyops.not-in a1 a2 #* a-rest)¶

The negated membership test operator. Its effect can be defined by the equivalent Python:

(not-in x y) → x not in y
(not-in a1 a2 … an) → a1 not in a2 not in … not in an

(hy.pyops.not? a1 a2 #* a-rest)¶

The negated identicality test operator. Its effect can be defined by the equivalent Python:

(is-not x y) → x is not y
(is-not a1 a2 … an) → a1 is not a2 is not … is not an

(hy.pyops.or #* args)¶

The logical disjunction operator. Its effect can be defined by the equivalent Python:

(or) → None
(or x) → x
(or x y) → x or y
(or a1 a2 … an) → a1 or a2 or … or an

(hy.pyops.reduce)¶

reduce(function, sequence[, initial]) -> value

Apply a function of two arguments cumulatively to the items of a sequence, from left to right, so as to reduce the sequence to a single value. For example, reduce(lambda x, y: x+y, [1, 2, 3, 4, 5]) calculates ((((1+2)+3)+4)+5). If initial is present, it is placed before the items of the sequence in the calculation, and serves as a default when the sequence is empty.

(hy.pyops.| #* args)¶

The bitwise OR operator. Its effect can be defined by the equivalent Python:

(|) → 0
(| x) → x
(| x y) → x | y
(| a1 a2 … an) → a1 | a2 | … | an

(hy.pyops.~ x)¶

The bitwise NOT operator. Its effect can be defined by the equivalent Python:

(~ x) → ~x

Reserved¶

(hy.reserved.macros)¶: Return a frozenset of Hy’s core macro names.

(hy.reserved.names)¶

Return a frozenset of reserved symbol names.

The result of the first call is cached.

The output includes all of Hy’s core functions and macros, plus all Python reserved words. All names are in unmangled form (e.g., not-in rather than not_in).

Examples

=> (import hy.extra.reserved)
=> (in "defclass" (hy.extra.reserved.names))
True