2009-02-09 16:51:03 +00:00
|
|
|
rec {
|
|
|
|
|
|
|
|
# Identity function.
|
|
|
|
id = x: x;
|
|
|
|
|
|
|
|
# Constant function.
|
|
|
|
const = x: y: x;
|
|
|
|
|
|
|
|
# Named versions corresponding to some builtin operators.
|
|
|
|
concat = x: y: x ++ y;
|
|
|
|
or = x: y: x || y;
|
|
|
|
and = x: y: x && y;
|
2009-07-02 08:58:30 +00:00
|
|
|
mergeAttrs = x: y: x // y;
|
2013-11-12 12:48:19 +00:00
|
|
|
|
2015-11-24 11:48:03 +00:00
|
|
|
# Compute the fixed point of the given function `f`, which is usually an
|
2015-11-24 11:59:08 +00:00
|
|
|
# attribute set that expects its final, non-recursive representation as an
|
2015-11-24 11:48:03 +00:00
|
|
|
# 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
|
2015-11-24 11:59:08 +00:00
|
|
|
# result. This is useful in combination with the `extends` function to
|
2015-11-24 11:48:03 +00:00
|
|
|
# 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
|
2015-11-24 11:59:08 +00:00
|
|
|
# non-recursive representation of the attribute set (`self`). `extends`
|
2015-11-24 11:48:03 +00:00
|
|
|
# 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.
|
2015-11-24 11:59:08 +00:00
|
|
|
# think of it as an infix operator `g extends f` that mimics the syntax from
|
2015-11-24 11:48:03 +00:00
|
|
|
# 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;
|
2009-02-09 16:51:03 +00:00
|
|
|
|
2009-10-23 07:34:56 +00:00
|
|
|
# Flip the order of the arguments of a binary function.
|
|
|
|
flip = f: a: b: f b a;
|
|
|
|
|
2013-11-12 12:48:19 +00:00
|
|
|
# Pull in some builtins not included elsewhere.
|
|
|
|
inherit (builtins)
|
|
|
|
pathExists readFile isBool isFunction
|
2015-03-20 14:53:25 +00:00
|
|
|
isInt add sub lessThan
|
2015-07-23 15:41:35 +00:00
|
|
|
seq deepSeq genericClosure;
|
2013-11-12 12:48:19 +00:00
|
|
|
|
2014-02-19 17:47:48 +00:00
|
|
|
# Return the Nixpkgs version number.
|
|
|
|
nixpkgsVersion =
|
|
|
|
let suffixFile = ../.version-suffix; in
|
|
|
|
readFile ../.version
|
|
|
|
+ (if pathExists suffixFile then readFile suffixFile else "pre-git");
|
|
|
|
|
2015-02-16 10:57:36 +00:00
|
|
|
# Whether we're being called by nix-shell.
|
2014-02-19 18:00:51 +00:00
|
|
|
inNixShell = builtins.getEnv "IN_NIX_SHELL" == "1";
|
|
|
|
|
2015-02-16 10:57:36 +00:00
|
|
|
# Return minimum/maximum of two numbers.
|
|
|
|
min = x: y: if x < y then x else y;
|
|
|
|
max = x: y: if x > y then x else y;
|
|
|
|
|
2009-02-09 16:51:03 +00:00
|
|
|
}
|