a4c333474c
nix lists are not like haskell lists, and tail is an O(n) operation. This makes recursion using tail less efficient than recursion using length + elemAt. Signed-off-by: Shea Levy <shea@shealevy.com> |
||
---|---|---|
doc | ||
maintainers | ||
pkgs | ||
.gitignore | ||
COPYING | ||
default.nix | ||
VERSION |