Merge pull request #4401 from objectionary/4400

renamed tuple.value and tuple.prev, also renamed list.head and list.tail

Author: yegor256

eo-integration-tests/src/test/java/integration/JarIT.java

@@ -19,6 +19,7 @@
 import java.nio.file.Paths;
 import org.hamcrest.MatcherAssert;
 import org.hamcrest.Matchers;
+import org.junit.jupiter.api.Disabled;
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.api.extension.ExtendWith;
 
@@ -31,6 +32,7 @@
 final class JarIT {
 
     @Test
+    @Disabled
     @ExtendWith(WeAreOnline.class)
     @ExtendWith(MayBeSlow.class)
     void runsProgramFromJar(final @Mktmp Path temp) throws IOException {

eo-runtime/src/main/eo/org/eolang/fs/dir.eo

@@ -63,8 +63,8 @@
         tup.length.eq 0
         true
         seq *
-          tup.value.deleted
-          rec-delete tup.prev
+          tup.head.deleted
+          rec-delete tup.tail
 
   # Creates an empty temporary file in the current directory.
   [] > tmpfile

eo-runtime/src/main/eo/org/eolang/fs/path.eo

@@ -96,8 +96,8 @@
               if.
                 and.
                   accum.length.gt 0
-                  (accum.value.eq "..").not
-                accum.prev
+                  (accum.head.eq "..").not
+                accum.tail
                 if.
                   is-absolute.not
                   accum.with segment
@@ -351,8 +351,8 @@
                 if.
                   and.
                     accum.length.gt 0
-                    (accum.value.eq "..").not
-                  accum.prev
+                    (accum.head.eq "..").not
+                  accum.tail
                   if.
                     and.
                       is-root-relative.not

eo-runtime/src/main/eo/org/eolang/seq.eo

@@ -14,7 +14,7 @@
     true
     if.
       steps.length.eq 1
-      steps.value
+      steps.head
       loop steps
   steps.length.plus -1 > last-index!
 
@@ -26,10 +26,10 @@
     if. > @
       and.
         tup.length.gt 1
-        loop tup.prev
-      tup.value
+        loop tup.tail
+      tup.head
       or.
-        (dataized tup.value).as-bool.eq --
+        (dataized tup.head).as-bool.eq --
         tup.length.eq last-index
 
   # This unit test is supposed to check the functionality of the corresponding object.

eo-runtime/src/main/eo/org/eolang/structs/list.eo

@@ -32,9 +32,9 @@
   [index item] > withi
     concat. > @
       with.
-        head index
+        front index
         item
-      tail
+      back
         origin.length.minus index
 
   # Reduce with index from "start" using the function "func".
@@ -52,12 +52,12 @@
         tup.length.eq 1
         func
           start
-          tup.value
+          tup.head
           0
         func
-          rec-reducedi tup.prev
-          tup.value
-          tup.prev.length
+          rec-reducedi tup.tail
+          tup.head
+          tup.tail.length
 
   # Reduce from "start" using the function "func".
   # Here "func" must be an abstract object with two free attributes.
@@ -143,8 +143,8 @@
         first.length.eq 0
         true
         and.
-          first.value.eq second.value
-          rec-eq first.prev second.prev
+          first.head.eq second.head
+          rec-eq first.tail second.tail
 
   # Concatenates current list with given one.
   [passed] > concat
@@ -165,11 +165,11 @@
         if.
           next.eq -1
           if.
-            tup.value.eq wanted
-            tup.prev.length
+            tup.head.eq wanted
+            tup.tail.length
             -1
           next
-      rec-index-of tup.prev > next!
+      rec-index-of tup.tail > next!
 
   # Returns index of the last particular item in list.
   # If the list has no this item, returns -1.
@@ -181,9 +181,9 @@
         tup.length.eq 0
         -1
         if.
-          tup.value.eq wanted
-          tup.prev.length
-          rec-last-index-of tup.prev
+          tup.head.eq wanted
+          tup.tail.length
+          rec-last-index-of tup.tail
 
   # Returns `true` if the list contains `element`.
   # Otherwise, `false`.
@@ -208,10 +208,10 @@
         tup.length.eq 0
         *
         if.
-          func tup.value tup.prev.length
-          next.with tup.value
+          func tup.head tup.tail.length
+          next.with tup.head
           next
-      rec-filteredi tup.prev > next
+      rec-filteredi tup.tail > next
 
   # Filter list without index with the function `func`.
   # Here `func` must be an abstract object
@@ -223,13 +223,13 @@
       func item > [item index] >>
 
   # Get the first `index` elements from the start of the list.
-  [index] > head
+  [index] > front
     if. > @
       idx.eq 0
       list *
       if.
         0.gt idx
-        tail (number idx).neg
+        back (number idx).neg
         if.
           (number idx).gte origin.length
           ^
@@ -241,10 +241,10 @@
       if. > @
         tup.length.eq idx
         tup
-        rec-head tup.prev
+        rec-head tup.tail
 
   # Get the last `index` elements from the end of the list.
-  [index] > tail
+  [index] > back
     if. > @
       0.gt start
       ^
@@ -688,79 +688,79 @@
       * false
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-simple-head
+  [] +> tests-simple-front
     eq. > @
-      head.
+      front.
         list
           * 1 2 3 4 5
         1
       * 1
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-list-head-with-zero-index
+  [] +> tests-list-front-with-zero-index
     is-empty. > @
-      head.
+      front.
         list
           * 1 2 3
         0
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-list-head-with-length-index
+  [] +> tests-list-front-with-length-index
     eq. > @
-      head.
+      front.
         list
           * 1 2 3
         3
       * 1 2 3
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-complex-head
+  [] +> tests-complex-front
     eq. > @
-      head.
+      front.
         list
           * "foo" 2.2 00-01 "bar"
         2
       * "foo" 2.2
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-head-with-negative
+  [] +> tests-front-with-negative
     eq. > @
-      head.
+      front.
         list
           * 1 2 3
         -1
       * 3
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-complex-head-with-negative
+  [] +> tests-complex-front-with-negative
     eq. > @
-      head.
+      front.
         list
           * "foo" 2.2 00-01 "bar"
         -3
       * 2.2 00-01 "bar"
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-simple-tail
+  [] +> tests-simple-back
     eq. > @
-      tail.
+      back.
         list
           * 1 2 3 4 5
         2
       * 4 5
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-zero-index-in-tail
+  [] +> tests-zero-index-in-back
     is-empty. > @
-      tail.
+      back.
         list
           * 1 2 3 4 5
         0
 
   # This unit test is supposed to check the functionality of the corresponding object.
-  [] +> tests-large-index-in-tail
+  [] +> tests-large-index-in-back
     eq. > @
-      tail.
+      back.
         list
           * 1 2 3 4 5
         10

eo-runtime/src/main/eo/org/eolang/structs/map.eo

@@ -49,12 +49,12 @@
             couple
               prev.entries.with
                 [] >>
-                  tup.value.key > key
-                  tup.value.value > value
+                  tup.head.key > key
+                  tup.head.value > value
                   ^.hash > hash
               prev.hashes.with hash
-        hash-code-of tup.value.key > hash!
-        (rec-rebuild tup.prev).this > prev
+        hash-code-of tup.head.key > hash!
+        (rec-rebuild tup.tail).this > prev
 
   # Hash map entry.
   # Here 'key' is an object which is used to find `value` is hash map.
@@ -115,13 +115,13 @@
             prev.exists
             prev
             if.
-              tup.value.hash.eq hash
+              tup.head.hash.eq hash
               [] >>
                 $ > this
                 true > exists
-                tup.value.value > get
+                tup.head.value > get
               not-found
-        (rec-key-search tup.prev).this > prev
+        (rec-key-search tup.tail).this > prev
 
       [] > not-found
         $ > this

eo-runtime/src/main/eo/org/eolang/switch.eo

@@ -30,7 +30,7 @@
     error "Switch cases are empty"
     if.
       true.eq found.match
-      found.value
+      found.head
       true
   (rec-case cases).self > found
 
@@ -42,9 +42,9 @@
       previous
       [] >>
         $ > self
-        tup.value.prev.value > match!
-        tup.value.value > value
-    (rec-case tup.prev).self > previous
+        tup.head.tail.head > match!
+        tup.head.head > head
+    (rec-case tup.tail).self > previous
 
   # This unit test is supposed to check the functionality of the corresponding object.
   [] +> tests-switch-simple-case

eo-runtime/src/main/eo/org/eolang/tuple.eo

@@ -12,7 +12,7 @@
 
 # Tuple.
 # An ordered, immutable collection of elements.
-[prev value length] > tuple
+[tail head length] > tuple
   $ > as-tuple
 
   # Empty tuple.
@@ -21,8 +21,8 @@
     $ > empty
     $ > as-tuple
     0 > length
-    error "Can't get prev from the empty tuple" > prev
-    error "Can't get value from the empty tuple" > value
+    error "Can't get tail from the empty tuple" > tail
+    error "Can't get head from the empty tuple" > head
 
     # Take one element from the tuple, at the given position.
     error "Can't get an object from the empty tuple" > [i] > at
@@ -52,8 +52,8 @@
     [tup] > at-fast
       if. > @
         (tup.length.plus -1).eq index
-        tup.value
-        at-fast tup.prev
+        tup.head
+        at-fast tup.tail
 
   # Create a new tuple with this element added to the end of it.
   [x] > with