No more "^slots".

3 files changed, 32 insertions, 32 deletions

diff --git a/stdlib/source/library/lux/data/collection/queue.lux b/stdlib/source/library/lux/data/collection/queue.lux
index 5260d808d..650ed17ff 100644
--- a/stdlib/source/library/lux/data/collection/queue.lux
+++ b/stdlib/source/library/lux/data/collection/queue.lux
@@ -28,8 +28,8 @@
 
 (def: .public (list queue)
   (All (_ a) (-> (Queue a) (List a)))
-  (let [(^slots [#front #rear]) queue]
-    (list#composite #front (list.reversed #rear))))
+  (let [(^open "_[0]") queue]
+    (list#composite _#front (list.reversed _#rear))))
 
 (def: .public front
   (All (_ a) (-> (Queue a) (Maybe a)))
@@ -37,9 +37,9 @@
 
 (def: .public (size queue)
   (All (_ a) (-> (Queue a) Nat))
-  (let [(^slots [#front #rear]) queue]
-    (n.+ (list.size #front)
-         (list.size #rear))))
+  (let [(^open "_[0]") queue]
+    (n.+ (list.size _#front)
+         (list.size _#rear))))
 
 (def: .public empty?
   (All (_ a) (-> (Queue a) Bit))
@@ -47,9 +47,9 @@
 
 (def: .public (member? equivalence queue member)
   (All (_ a) (-> (Equivalence a) (Queue a) a Bit))
-  (let [(^slots [#front #rear]) queue]
-    (or (list.member? equivalence #front member)
-        (list.member? equivalence #rear member))))
+  (let [(^open "_[0]") queue]
+    (or (list.member? equivalence _#front member)
+        (list.member? equivalence _#rear member))))
 
 (def: .public (next queue)
   (All (_ a) (-> (Queue a) (Queue a)))
diff --git a/stdlib/source/library/lux/data/collection/row.lux b/stdlib/source/library/lux/data/collection/row.lux
index 2fb288b99..c1b3b6ece 100644
--- a/stdlib/source/library/lux/data/collection/row.lux
+++ b/stdlib/source/library/lux/data/collection/row.lux
@@ -491,9 +491,9 @@
                        {#Hierarchy hierarchy}
                        (<array> (help predicate) hierarchy))))]
        (function (<name> predicate row)
-         (let [(^slots [#root #tail]) row]
-           (<op> (help predicate {#Hierarchy #root})
-                 (help predicate {#Base #tail}))))))]
+         (let [(^open "_[0]") row]
+           (<op> (help predicate {#Hierarchy _#root})
+                 (help predicate {#Base _#tail}))))))]
 
   [every? array.every? #1 and]
   [any?   array.any?   #0 or]
diff --git a/stdlib/source/library/lux/data/collection/tree/zipper.lux b/stdlib/source/library/lux/data/collection/tree/zipper.lux
index 8bf58d308..19581bb40 100644
--- a/stdlib/source/library/lux/data/collection/tree/zipper.lux
+++ b/stdlib/source/library/lux/data/collection/tree/zipper.lux
@@ -102,19 +102,19 @@
   (All (_ a) (-> (Zipper a) (Maybe (Zipper a))))
   (do maybe.monad
     [family (value@ #family zipper)]
-    (in (let [(^slots [#parent #lefts #rights]) family]
+    (in (let [(^open "_[0]") family]
           (for [@.old
                 (revised@ #node (: (-> (Tree (:parameter 0))
                                        (Tree (:parameter 0)))
-                                   (with@ //.#children (list#composite (list.reversed #lefts)
+                                   (with@ //.#children (list#composite (list.reversed _#lefts)
                                                                        {.#Item (value@ #node zipper)
-                                                                               #rights})))
-                          #parent)]
+                                                                               _#rights})))
+                          _#parent)]
                (with@ [#node //.#children]
-                      (list#composite (list.reversed #lefts)
+                      (list#composite (list.reversed _#lefts)
                                       {.#Item (value@ #node zipper)
-                                              #rights})
-                      #parent))))))
+                                              _#rights})
+                      _#parent))))))
 
 (template [<one> <all> <side> <op_side>]
   [(def: .public (<one> zipper)
@@ -292,13 +292,13 @@
 (implementation: .public functor
   (Functor Zipper)
   
-  (def: (each f (^slots [#family #node]))
-    [#family (maybe#each (function (_ (^slots [#parent #lefts #rights]))
-                           [#parent (each f #parent)
-                            #lefts (list#each (//#each f) #lefts)
-                            #rights (list#each (//#each f) #rights)])
-                         #family)
-     #node (//#each f #node)]))
+  (def: (each f (^open "_[0]"))
+    [#family (maybe#each (function (_ (^open "_[0]"))
+                           [#parent (each f _#parent)
+                            #lefts (list#each (//#each f) _#lefts)
+                            #rights (list#each (//#each f) _#rights)])
+                         _#family)
+     #node (//#each f _#node)]))
 
 (implementation: .public comonad
   (CoMonad Zipper)
@@ -309,16 +309,16 @@
   (def: out
     (value@ [#node //.#value]))
 
-  (def: (disjoint (^slots [#family #node]))
+  (def: (disjoint (^open "_[0]"))
     (let [tree_splitter (: (All (_ a) (-> (Tree a) (Tree (Zipper a))))
                            (function (tree_splitter tree)
                              [//.#value (..zipper tree)
                               //.#children (|> tree
                                                (value@ //.#children)
                                                (list#each tree_splitter))]))]
-      [#family (maybe#each (function (_ (^slots [#parent #lefts #rights]))
-                             [..#parent (disjoint #parent)
-                              ..#lefts (list#each tree_splitter #lefts)
-                              ..#rights (list#each tree_splitter #rights)])
-                           #family)
-       #node (tree_splitter #node)])))
+      [#family (maybe#each (function (_ (^open "_[0]"))
+                             [..#parent (disjoint _#parent)
+                              ..#lefts (list#each tree_splitter _#lefts)
+                              ..#rights (list#each tree_splitter _#rights)])
+                           _#family)
+       #node (tree_splitter _#node)])))