| defmodule PLF do | |
| @doc """ | |
| Given a list of `{x, y}` nodes that the function must pass through, return | |
| a function any input `x`. | |
| For inputs less than the minimum `x` values among the nodes, extrapolate | |
| with a constant equal to the `y` value of the min-`x` node. Similar | |
| extrapolation occurs for `x` larger than the max-`x` node. | |
| Note: When the number of nodes is large, this can be made more efficient |
| defmodule Exp do | |
| def draw() do | |
| x = :rand.uniform() | |
| draw(x, x, 1, 0) | |
| end | |
| defp draw(x, u, n, k) do | |
| u_next = :rand.uniform() | |
| if u > u_next do |
| # Discussed in https://www.ericpfahl.com/from-pattern-matching-to-unification/ | |
| defmodule Var do | |
| alias Var | |
| @type t :: %Var{id: any} | |
| defstruct [:id] | |
| @spec new(any) :: Var.t() | |
| def new(id), do: %Var{id: id} |
This is inspired by https://fasterthanli.me/blog/2020/a-half-hour-to-learn-rust/
the command zig run my_code.zig will compile and immediately run your Zig
program. Each of these cells contains a zig program that you can try to run
(some of them contain compile-time errors that you can comment out to play
with)
