From 395fdaef6c9efb7141ddd87ac1be02e6650e3a10 Mon Sep 17 00:00:00 2001
From: Eelco Dolstra <eelco.dolstra@logicblox.com>
Date: Tue, 28 Jul 2015 18:42:04 +0200
Subject: [PATCH] Use builtins.sort

---
 lib/lists.nix | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/lib/lists.nix b/lib/lists.nix
index 76e03ce46db5..3bcf366f0c27 100644
--- a/lib/lists.nix
+++ b/lib/lists.nix
@@ -176,7 +176,8 @@ rec {
   # elements and returns true if the first argument is strictly below
   # the second argument.  The returned list is sorted in an increasing
   # order.  The implementation does a quick-sort.
-  sort = strictLess: list:
+  sort = builtins.sort or (
+    strictLess: list:
     let
       len = length list;
       first = head list;
@@ -190,7 +191,7 @@ rec {
       pivot = pivot' 1 { left = []; right = []; };
     in
       if len < 2 then list
-      else (sort strictLess pivot.left) ++  [ first ] ++  (sort strictLess pivot.right);
+      else (sort strictLess pivot.left) ++  [ first ] ++  (sort strictLess pivot.right));
 
 
   # Return the first (at most) N elements of a list.