- Reverted r15866, since it broke some testcases.

git-svn-id: https://openmodelica.org/svn/OpenModelica/trunk@15867 f25d12d1-65f4-0310-ae8a-bbce733d8d8e

Compiler/FrontEnd/Inst.mo

@@ -5034,7 +5034,6 @@ algorithm
           SCode.DERIVED(Absyn.TPATH(path = cn, arrayDim = ad),modifications = mod),
           re,partialPrefix,vis,inst_dims,className,_)
       equation
-        false = boolOr(valueEq(ad, NONE()), valueEq(ad, SOME({})));
         (cache,(c as SCode.CLASS(name=cn2,encapsulatedPrefix=enc2,restriction=r)),cenv) = Lookup.lookupClass(cache, env, cn, true);
 
         // if is not a basic type
@@ -5771,8 +5770,7 @@ algorithm
         // Try and delete the element with the given name from the list of all
         // elements. If this succeeds, add it to the list of elements. This
         // ensures that we don't add any dependency more than once.
-        (all_el, SOME(e as (SCode.COMPONENT(name = _), _))) =
-          List.deleteMemberOnTrue(id, all_el, isElementNamed);
+        (all_el, SOME(e)) = List.deleteMemberOnTrue(id, all_el, isElementNamed);
       then
         ((exp, (all_el, e :: accum_el)));
 
@@ -5789,7 +5787,7 @@ algorithm
       then
         ((exp, (all_el, e :: accum_el)));*/
 
-    else inTuple;
+    else then inTuple;
   end matchcontinue;
 end getElementDependenciesTraverserEnter;