use rev in llist(); update comment

Technologicat · Technologicat · commit 199fe41beb1b · 2018-09-25T00:14:51.000+03:00
diff --git a/unpythonic/llist.py b/unpythonic/llist.py
@@ -10,6 +10,7 @@
 
 from unpythonic.fun import composer1i
 from unpythonic.fold import foldr, foldl
+from unpythonic.it import rev
 
 # explicit list better for tooling support
 _exports = ["cons", "nil",
@@ -284,17 +285,13 @@ def llist(iterable):
 
       - Sequences, since they can be walked backwards; a linear walk is enough.
 
-    For a general iterable input, this costs a linear walk (forwards), plus an
-    ``lreverse`` once the list has been fully consed.
+    For a general iterable input, this costs a linear walk (forwards),
+    plus an ``lreverse``.
     """
     if isinstance(iterable, LinkedListReverseIterator):
         # avoid two extra reverses by reusing the internal data.
         return iterable._data
-    try:  # maybe a sequence?
-        return lreverse(reversed(iterable))
-    except TypeError:
-        reversed_as_ll = lreverse(iterable)
-        return lreverse(reversed_as_ll)
+    return lreverse(rev(iterable))
 
 def lreverse(iterable):
     """Reverse an iterable, loading the result into a linked list.
@@ -438,8 +435,7 @@ def test():
     r = reversed(ll(1, 2, 3))   # an iterator that internally builds the reversed list...
     assert llist(r) is r._data  # ...which llist should just grab
 
-    # With the real recursive-process foldr, this no longer requires reversed(),
-    # but is prone to call stack overflow.
+    # foldr implicitly reverses the input
     assert foldr(cons, nil, ll(1, 2, 3)) == ll(1, 2, 3)
 
     print("All tests PASSED")
