anchor.diff:          | Fable.NewArray (values, typ) -> makeArray com ctx values
           //| Fable.NewArrayFrom (size, typ) -> makeAllocatedFrom com ctx size, []
           | Fable.NewTuple vals -> makeArray com ctx vals
  -        // | Fable.NewList (headAndTail, _) when List.contains "FABLE_LIBRARY" com.Options.Define ->
  -        //     makeList com ctx r headAndTail
           // Optimization for bundle size: compile list literals as List.ofArray
           | Fable.NewList (headAndTail, _) ->
               let rec getItems acc = function
  
positive.code:             let cases = groupSwitchCases (Fable.Number Int32) cases (defaultIndex, defaultBoundValues)
              let defaultCase = Fable.DecisionTreeSuccess(defaultIndex, defaultBoundValues, Fable.Number Int32)
              let switch1 = transformSwitch com ctx false (Some targetAssign) evalExpr cases (Some defaultCase)
              [ multiVarDecl; switch1; switch2 ]
          | None ->
              let decisionTree = com.TransformAsStatements(ctx, Some targetAssign, treeExpr)
              [ yield multiVarDecl; yield! decisionTree; yield switch2 ]
  
      let transformDecisionTreeAsStatements (com: IPythonCompiler) (ctx: Context) returnStrategy
                          (targets: (Fable.Ident list * Fable.Expr) list) (treeExpr: Fable.Expr): Statement list =
  
negative.code:         let body =
              if declaredVars.Count = 0 then body
              else
                  let varDeclStatement = multiVarDeclaration ctx [for v in declaredVars -> ident v, None]
                  varDeclStatement @ body
          args |> List.map (ident >> Arg.arg), body
  
      let declareEntryPoint _com _ctx (funcExpr: Expression) =
  