From 50d6dd8b50958271bf1ff13f99dc21d4cd8431f7 Mon Sep 17 00:00:00 2001 From: Peter Mikkelsen Date: Thu, 13 Jan 2022 19:45:22 +0000 Subject: Implement basic reference counting for arrays, which so they get freed when not in use anymore. --- print.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'print.c') diff --git a/print.c b/print.c index 409de45..8deac3e 100644 --- a/print.c +++ b/print.c @@ -12,7 +12,7 @@ ppdatum(Datum d) case ArrayTag: result = pparray(d.array); break; case FunctionTag: if(d.func.type == FunctypePrim) - result = runesmprint("%C", primdyadopnames[d.func.code]); + result = runesmprint("%C", primfuncnames[d.func.code]); else result = runesmprint("{%S}", d.func.dfn); break; @@ -21,7 +21,7 @@ ppdatum(Datum d) case DyadicOpTag: result = runesmprint("%C", primdyadopnames[d.func.code]); break; case BoundFunctionTag: if(d.func.type == FunctypePrim) - result = runesmprint("%S∘%C", pparray(d.func.left), primdyadopnames[d.func.code]); + result = runesmprint("%S∘%C", pparray(d.func.left), primfuncnames[d.func.code]); else result = runesmprint("%S∘{%S}", pparray(d.func.left), d.func.dfn); break; -- cgit v1.2.3