From ea81a8087bcd7953b083a2be9db447f75e7ebf56 Mon Sep 17 00:00:00 2001
From: Joel Martin <github@martintribe.org>
Date: Wed, 2 Apr 2014 22:23:37 -0500
Subject: All: split types into types, env, printer, core.

- types: low-level mapping to the implementation language.
- core: functions on types that are exposed directly to mal.
- printer: implementation called by pr-str, str, prn, println.
- env: the environment implementation

- Also, unindent all TCO while loops so that the diff of step4 and
  step5 are minimized.
---
 python/step5_tco.py | 40 ++++++++++++++++++++--------------------
 1 file changed, 20 insertions(+), 20 deletions(-)

(limited to 'python/step5_tco.py')

diff --git a/python/step5_tco.py b/python/step5_tco.py
index ffde863..4335a96 100644
--- a/python/step5_tco.py
+++ b/python/step5_tco.py
@@ -1,41 +1,41 @@
 import sys, traceback
 import mal_readline
-from mal_types import (pr_str, sequential_Q, symbol_Q, coll_Q, list_Q,
-                       vector_Q, hash_map_Q, new_symbol, new_function,
-                       new_list, new_vector, new_hash_map, Env, types_ns)
-from reader import (read_str, Blank)
+import mal_types as types
+import reader, printer
+from env import Env
+import core
 
 # read
 def READ(str):
-    return read_str(str)
+    return reader.read_str(str)
 
 # eval
 def eval_ast(ast, env):
-    if symbol_Q(ast):
+    if types._symbol_Q(ast):
         return env.get(ast)
-    elif list_Q(ast):
-        return new_list(*map(lambda a: EVAL(a, env), ast))
-    elif vector_Q(ast):
-        return new_vector(*map(lambda a: EVAL(a, env), ast))
-    elif hash_map_Q(ast):
+    elif types._list_Q(ast):
+        return types._list(*map(lambda a: EVAL(a, env), ast))
+    elif types._vector_Q(ast):
+        return types._vector(*map(lambda a: EVAL(a, env), ast))
+    elif types._hash_map_Q(ast):
         keyvals = []
         for k in ast.keys():
             keyvals.append(EVAL(k, env))
             keyvals.append(EVAL(ast[k], env))
-        return new_hash_map(*keyvals)
+        return types._hash_map(*keyvals)
     else:
         return ast  # primitive value, return unchanged
 
 def EVAL(ast, env):
     while True:
         #print("EVAL %s" % ast)
-        if not list_Q(ast):
+        if not types._list_Q(ast):
             return eval_ast(ast, env)
-    
+
         # apply list
         if len(ast) == 0: return ast
-        a0 = ast[0] 
-    
+        a0 = ast[0]
+
         if "def!" == a0:
             a1, a2 = ast[1], ast[2]
             res = EVAL(a2, env)
@@ -61,7 +61,7 @@ def EVAL(ast, env):
             # Continue loop (TCO)
         elif "fn*" == a0:
             a1, a2 = ast[1], ast[2]
-            return new_function(EVAL, a2, env, a1)
+            return types._function(EVAL, Env, a2, env, a1)
         else:
             el = eval_ast(ast, env)
             f = el[0]
@@ -74,7 +74,7 @@ def EVAL(ast, env):
 
 # print
 def PRINT(exp):
-    return pr_str(exp)
+    return printer._pr_str(exp)
 
 # repl
 repl_env = Env()
@@ -83,7 +83,7 @@ def REP(str):
 def _ref(k,v): repl_env.set(k, v)
 
 # Import types functions
-for name, val in types_ns.items(): _ref(name, val)
+for name, val in core.ns.items(): _ref(name, val)
 
 # Defined using the language itself
 REP("(def! not (fn* (a) (if a false true)))")
@@ -94,6 +94,6 @@ while True:
         if line == None: break
         if line == "": continue
         print(REP(line))
-    except Blank: continue
+    except reader.Blank: continue
     except Exception as e:
         print "".join(traceback.format_exception(*sys.exc_info()))
-- 
cgit v1.2.3