summaryrefslogtreecommitdiffstats
path: root/lib/trivial.nix
diff options
context:
space:
mode:
authorPeter Simons <simons@cryp.to>2015-11-24 12:48:03 +0100
committerPeter Simons <simons@cryp.to>2015-11-24 12:48:03 +0100
commit405fda497ae1943c6ca3dab783687a01ff63c04f (patch)
tree61b325a413d775fafd3ae803a6a7927513211f7c /lib/trivial.nix
parent8bdc73caabe878bbf953b1c5c0f3e5259c02076e (diff)
lib: document fix and add fix', extends functions
These functions used to live in pkgs/development/haskell-modules/default.nix, but they are generic, really, and should be easily accessible to everyone.
Diffstat (limited to 'lib/trivial.nix')
-rw-r--r--lib/trivial.nix42
1 files changed, 40 insertions, 2 deletions
diff --git a/lib/trivial.nix b/lib/trivial.nix
index 9fd5a7e1c57c..1683d91dd233 100644
--- a/lib/trivial.nix
+++ b/lib/trivial.nix
@@ -12,8 +12,46 @@ rec {
and = x: y: x && y;
mergeAttrs = x: y: x // y;
- # Take a function and evaluate it with its own returned value.
- fix = f: let result = f result; in result;
+ # Compute the fixed point of the given function `f`, which is usually an
+ # attribute set that expects its final, non-recursive repsentation as an
+ # argument:
+ #
+ # f = self: { foo = "foo"; bar = "bar"; foobar = self.foo + self.bar; }
+ #
+ # Nix evaluates this recursion until all references to `self` have been
+ # resolved. At that point, the final result is returned and `f x = x` holds:
+ #
+ # nix-repl> fix f
+ # { bar = "bar"; foo = "foo"; foobar = "foobar"; }
+ #
+ # See https://en.wikipedia.org/wiki/Fixed-point_combinator for further
+ # details.
+ fix = f: let x = f x; in x;
+
+ # A variant of `fix` that records the original recursive attribute set in the
+ # result. This is useful in combination with the `extend` function to
+ # implement deep overriding. See pkgs/development/haskell-modules/default.nix
+ # for a concrete example.
+ fix' = f: let x = f x // { __unfix__ = f; }; in x;
+
+ # Modify the contents of an explicitly recursive attribute set in a way that
+ # honors `self`-references. This is accomplished with a function
+ #
+ # g = self: super: { foo = super.foo + " + "; }
+ #
+ # that has access to the unmodified input (`super`) as well as the final
+ # non-recursive representation of the attribute set (`self`). This function
+ # differs from the native `//` operator insofar as that it's applied *before*
+ # references to `self` are resolved:
+ #
+ # nix-repl> fix (extends g f)
+ # { bar = "bar"; foo = "foo + "; foobar = "foo + bar"; }
+ #
+ # The name of the function is inspired by object-oriented inheritance, i.e.
+ # think of it as an infix operator `g extends f` that mimicks the syntax from
+ # Java. It may seem counter-intuitive to have the "base class" as the second
+ # argument, but it's nice this way if several uses of `extends` are cascaded.
+ extends = f: rattrs: self: let super = rattrs self; in super // f self super;
# Flip the order of the arguments of a binary function.
flip = f: a: b: f b a;