From fe70af6e2840d945863f773aaa1ab2695bc3196b Mon Sep 17 00:00:00 2001 From: Rowan Torbitzky-Lane Date: Thu, 30 Jan 2025 02:44:34 -0600 Subject: [PATCH] comments --- src/Instructions/CodeInstructions.hs | 4 ---- src/Instructions/GenericInstructions.hs | 1 + 2 files changed, 1 insertion(+), 4 deletions(-) diff --git a/src/Instructions/CodeInstructions.hs b/src/Instructions/CodeInstructions.hs index 54cc8de..b61c661 100644 --- a/src/Instructions/CodeInstructions.hs +++ b/src/Instructions/CodeInstructions.hs @@ -76,10 +76,6 @@ codeRecursiveSize _ = 1 instructionCodePop :: State -> State instructionCodePop state = instructionPop state code --- instructionCodeFromExec :: State -> State --- instructionCodeFromExec state@(State {_exec = (e1 : es), _code = cs}) = state {_exec = es, _code = e1 : cs} --- instructionCodeFromExec state = state - instructionCodeIsCodeBlock :: State -> State instructionCodeIsCodeBlock state@(State {_code = (c : cs), _bool = bs}) = state {_code = cs, _bool = isBlock c : bs} instructionCodeIsCodeBlock state = state diff --git a/src/Instructions/GenericInstructions.hs b/src/Instructions/GenericInstructions.hs index 546e6e3..e20a68d 100644 --- a/src/Instructions/GenericInstructions.hs +++ b/src/Instructions/GenericInstructions.hs @@ -29,6 +29,7 @@ subList idx0 idx1 xs = in take adjEnd (drop adjStart xs) +-- Maybe could've used Data.List.isSubsequenceOf :shrug: findSubA :: forall a. Eq a => [a] -> [a] -> Int findSubA fullA subA | length fullA < length subA = -1