···

       
642
       
642
       
 
       
       unique [ 3 2 3 4 ]

     

       
643
       
643
       
 
       
       => [ 3 2 4 ]

     

       
644
       
644
       
 
       
   */

     

       
645
       
645
       
-
       
 unique = foldl' (acc: e: if elem e acc then acc else acc ++ [ e ]) [];

     

       
645
       
645
       
+
       
  unique = foldl' (acc: e: if elem e acc then acc else acc ++ [ e ]) [];

     

       
646
       
646
       
 
       


     

       
647
       
647
       
 
       
  /* Intersects list 'e' and another list. O(nm) complexity.

     

       
648
       
648
       
 
       


     
···

       
663
       
663
       
 
       
  /* Test if two lists have no common element.

     

       
664
       
664
       
 
       
     It should be slightly more efficient than (intersectLists a b == [])

     

       
665
       
665
       
 
       
  */

     

       
666
       
666
       
-
       
  mutuallyExclusive = a: b:

     

       
667
       
667
       
-
       
    (builtins.length a) == 0 ||

     

       
668
       
668
       
-
       
    (!(builtins.elem (builtins.head a) b) &&

     

       
669
       
669
       
-
       
     mutuallyExclusive (builtins.tail a) b);

     

       
666
       
666
       
+
       
  mutuallyExclusive = a: b: length a == 0 || !(any (x: elem x a) b);

     

       
670
       
667
       
 
       


     

       
671
       
668
       
 
       
}