···

       
218
       
 
       
       partition (x: x > 2) [ 5 1 2 3 4 ]

     

       
219
       
 
       
       => { right = [ 5 3 4 ]; wrong = [ 1 2 ]; }

     

       
220
       
 
       
  */

     

       
221
       
-
       
  partition = pred:

     

       
222
       
 
       
    fold (h: t:

     

       
223
       
 
       
      if pred h

     

       
224
       
 
       
      then { right = [h] ++ t.right; wrong = t.wrong; }

     

       
225
       
 
       
      else { right = t.right; wrong = [h] ++ t.wrong; }

     

       
226
       
-
       
    ) { right = []; wrong = []; };

     

       
227
       
 
       


     

       
228
       
 
       
  /* Merges two lists of the same size together. If the sizes aren't the same

     

       
229
       
 
       
     the merging stops at the shortest. How both lists are merged is defined

     

···

       
218
       
 
       
       partition (x: x > 2) [ 5 1 2 3 4 ]

     

       
219
       
 
       
       => { right = [ 5 3 4 ]; wrong = [ 1 2 ]; }

     

       
220
       
 
       
  */

     

       
221
       
+
       
  partition = builtins.partition or (pred:

     

       
222
       
 
       
    fold (h: t:

     

       
223
       
 
       
      if pred h

     

       
224
       
 
       
      then { right = [h] ++ t.right; wrong = t.wrong; }

     

       
225
       
 
       
      else { right = t.right; wrong = [h] ++ t.wrong; }

     

       
226
       
+
       
    ) { right = []; wrong = []; });

     

       
227
       
 
       


     

       
228
       
 
       
  /* Merges two lists of the same size together. If the sizes aren't the same

     

       
229
       
 
       
     the merging stops at the shortest. How both lists are merged is defined