Skip to content

Commit

Permalink
- cosmetic changes to Util.mo
Browse files Browse the repository at this point in the history 
  + got rid of some already existing functionality
  + renamed some of the Util.mo functions
  + rewrote some Util.mo functions to make them a bit faster



git-svn-id: https://openmodelica.org/svn/OpenModelica/trunk@2715 f25d12d1-65f4-0310-ae8a-bbce733d8d8e
  • Loading branch information
@adrpo
adrpo committed Feb 19, 2007
1 parent 2c760c1 commit 144bf6c
Show file tree
Hide file tree
Showing 14 changed files with 403 additions and 630 deletions.
2 changes: 1 addition & 1 deletion Compiler/Absyn.mo
View file
Expand Up @@ -1809,7 +1809,7 @@ algorithm
then crefEqual(cr1,cr2);
case(STRING(s1),STRING(s2))
local String s1,s2;
then Util.stringEqual(s1,s2);
then stringEqual(s1,s2);
case (BOOL(b1),BOOL(b2))
local Boolean b1,b2;
then Util.boolEqual(b1,b2);
Expand Down
12 changes: 6 additions & 6 deletions Compiler/Ceval.mo
View file
Expand Up @@ -5260,13 +5260,13 @@ algorithm
Env.Cache cache;
case (cache,path,env,gflist) /* If getmember succeeds, path is in generated functions list, so do nothing */
equation
gfmember = Util.listGetmemberP(path, gflist, ModUtil.pathEqual);
gfmember = Util.listGetMemberOnTrue(path, gflist, ModUtil.pathEqual);
then
(cache,"",gflist);
case (cache,path,env,gflist) /* If getmember fails, path is not in generated functions list, hence
generate it */
equation
failure(_ = Util.listGetmemberP(path, gflist, ModUtil.pathEqual));
failure(_ = Util.listGetMemberOnTrue(path, gflist, ModUtil.pathEqual));
Debug.fprintln("ceval", "/*- ceval_generate_function_str starting*/");
(cache,cls,env_1) = Lookup.lookupClass(cache,env, path, false);
Debug.fprintln("ceval", "/*- ceval_generate_function_str instantiating*/");
Expand Down Expand Up @@ -5428,7 +5428,7 @@ algorithm
correctDim = matrixDimension - 1;
zeroList = Util.listFill(Values.REAL(0.0), correctDim);
correctPlace = row - 1;
listWithElement = Util.listReplaceat(Values.REAL(rv2), correctPlace, zeroList);
listWithElement = Util.listReplaceAt(Values.REAL(rv2), correctPlace, zeroList);
newRow = row + 1;
(cache,retExp) = cevalBuiltinDiagonal2(cache,env, s1, impl, st, matrixDimension, newRow,
{Values.ARRAY(listWithElement)}, msg);
Expand All @@ -5441,7 +5441,7 @@ algorithm
correctDim = matrixDimension - 1;
zeroList = Util.listFill(Values.REAL(0.0), correctDim);
correctPlace = row - 1;
listWithElement = Util.listReplaceat(Values.REAL(rv2), correctPlace, zeroList);
listWithElement = Util.listReplaceAt(Values.REAL(rv2), correctPlace, zeroList);
newRow = row + 1;
appendedList = listAppend(listIN, {Values.ARRAY(listWithElement)});
(cache,retExp)= cevalBuiltinDiagonal2(cache,env, s1, impl, st, matrixDimension, newRow, appendedList,
Expand All @@ -5455,7 +5455,7 @@ algorithm
correctDim = matrixDimension - 1;
zeroList = Util.listFill(Values.INTEGER(0), correctDim);
correctPlace = row - 1;
listWithElement = Util.listReplaceat(Values.INTEGER(rv2), correctPlace, zeroList);
listWithElement = Util.listReplaceAt(Values.INTEGER(rv2), correctPlace, zeroList);
newRow = row + 1;
(cache,retExp) = cevalBuiltinDiagonal2(cache,env, s1, impl, st, matrixDimension, newRow,
{Values.ARRAY(listWithElement)}, msg);
Expand All @@ -5470,7 +5470,7 @@ algorithm
correctDim = matrixDimension - 1;
zeroList = Util.listFill(Values.INTEGER(0), correctDim);
correctPlace = row - 1;
listWithElement = Util.listReplaceat(Values.INTEGER(rv2), correctPlace, zeroList);
listWithElement = Util.listReplaceAt(Values.INTEGER(rv2), correctPlace, zeroList);
newRow = row + 1;
appendedList = listAppend(listIN, {Values.ARRAY(listWithElement)});
(cache,retExp) = cevalBuiltinDiagonal2(cache,env, s1, impl, st, matrixDimension, newRow, appendedList,
Expand Down
12 changes: 6 additions & 6 deletions Compiler/Codegen.mo
View file
Expand Up @@ -943,7 +943,7 @@ algorithm
Debug.fprintln("cgtr", "generate_functions_elist");
Debug.fprintln("cgtrdumpdae", "Dumping DAE:");
Debug.fcall("cgtrdumpdae", DAE.dump2, DAE.DAE(els));
fns := Util.listMatching(els, DAE.isFunction);
fns := Util.listFilter(els, DAE.isFunction);
cfns := generateFunctionsElist2(fns);
end generateFunctionsElist;

Expand Down Expand Up @@ -2157,7 +2157,7 @@ algorithm
equation
is_a = isArray(var);
typ_str = daeTypeStr(typ, is_a);
emptypre = Util.stringEqual(prefix, "");
emptypre = stringEqual(prefix, "");
(cref_str1,_) = compRefCstr(id);
iStr = intString(i);
cref_str2 = Util.stringAppendList({prefix,".","targ",iStr});
Expand Down Expand Up @@ -2284,7 +2284,7 @@ algorithm
Context context;
case (els,tnr,context)
equation
algs = Util.listMatching(els, DAE.isAlgorithm);
algs = Util.listFilter(els, DAE.isAlgorithm);
(cfn,tnr_1) = generateAlgorithms2(algs, tnr, context);
then
(cfn,tnr_1);
Expand Down Expand Up @@ -3090,7 +3090,7 @@ algorithm
equation
is_a = isArray(var);
// pre can be "" or "out", the later for output variables.
emptyprep = Util.stringEqual(pre, "");
emptyprep = stringEqual(pre, "");
iStr = intString(i);
id_1_str = Util.stringAppendList({"out.","targ",iStr});
idstr = Util.if_(emptyprep, id, Exp.CREF_IDENT(id_1_str,{}));
Expand Down Expand Up @@ -4163,7 +4163,7 @@ algorithm
ndims_str = intString(ndims);
// Assumes that all dimensions are known, i.e. no NONE in dims.
dims_strs = Util.listMap(Util.listMap1(dims,Util.applyOption, int_string),Util.stringOption);
dims_str = Util.stringDelimitListNoEmpty(dims_strs, ", ");
dims_str = Util.stringDelimitListNonEmptyElts(dims_strs, ", ");
(cref_str,_) = compRefCstr(cref);
stmt = Util.stringAppendList(
{e_sh_tp_str,"_array_create(&",vstr,", ","&",cref_str,", ",
Expand Down Expand Up @@ -5288,7 +5288,7 @@ algorithm
Debug.fprintln("cgtrdumpdaeextcall", extdeclstr);
(argdecls,arglist_1,tnr_1) = generateExtcallVardecls(vars, arglist, retarg, lang, 1,tnr);
fcall = generateExtCallFcall(n, arglist_1, retarg, lang);
outbiarglist = Util.listMatching(arglist_1, isExtargOutputOrBidir);
outbiarglist = Util.listFilter(arglist_1, isExtargOutputOrBidir);
(argcopies,tnr_2) = generateExtcallVarcopy(outbiarglist, retarg, lang, 1,tnr_1);
extcall = cMergeFns({argdecls,fcall,argcopies});
then
Expand Down
22 changes: 11 additions & 11 deletions Compiler/DAE.mo
View file
Expand Up @@ -924,15 +924,15 @@ algorithm
s3 := dumpEquationsStr(l);
s4 := dumpInitialalgorithmsStr(l);
s5 := dumpAlgorithmsStr(l);
noiniteq := Util.stringEqual(s2, "");
noinitalg := Util.stringEqual(s4, "");
noeq := Util.stringEqual(s3, "");
noalg := Util.stringEqual(s5, "");
noiniteq := stringEqual(s2, "");
noinitalg := stringEqual(s4, "");
noeq := stringEqual(s3, "");
noalg := stringEqual(s5, "");
initeqstr := Dump.selectString(noiniteq, "", "initial equation\n");
initalgstr := Dump.selectString(noinitalg, "", "initial algorithm\n");
eqstr := Dump.selectString(noeq, "", "equation\n");
algstr := Dump.selectString(noalg, "", "algorithm\n");
s0 := Util.stringDelimitListNoEmpty(Util.listMap(l,dumpExtObjClassStr),"\n");
s0 := Util.stringDelimitListNonEmptyElts(Util.listMap(l,dumpExtObjClassStr),"\n");
str := Util.stringAppendList({s0,s1,initeqstr,s2,initalgstr,s4,eqstr,s3,algstr,s5});
end dumpElementsStr;

Expand Down Expand Up @@ -1374,7 +1374,7 @@ algorithm
nominal_str = Dump.getOptionWithConcatStr(nominal, real_string, "nominal = ");
Initial_str = Dump.getOptionWithConcatStr(Initial, real_string, "start = ");
fixed_str = Dump.getOptionWithConcatStr(fixed, Dump.printBoolStr, "fixed = ");
res_1 = Util.stringDelimitListNoEmpty(
res_1 = Util.stringDelimitListNonEmptyElts(
{quantity,unit_str,displayUnit_str,min_str,max_str,
Initial_str,fixed_str,nominal_str,stateSel_str}, ", ");
res1 = Util.stringAppendList({"(",res_1,")"});
Expand All @@ -1390,7 +1390,7 @@ algorithm
max_str = Dump.getOptionWithConcatStr(max, int_string, "max = ");
Initial_str = Dump.getOptionWithConcatStr(Initial, int_string, "start = ");
fixed_str = Dump.getOptionWithConcatStr(fixed, Dump.printBoolStr, "fixed = ");
res_1 = Util.stringDelimitListNoEmpty({quantity,min_str,max_str,Initial_str,fixed_str}, ", ");
res_1 = Util.stringDelimitListNonEmptyElts({quantity,min_str,max_str,Initial_str,fixed_str}, ", ");
res1 = Util.stringAppendList({"(",res_1,")"});
is_empty = Util.isEmptyString(res_1);
res = Util.if_(is_empty, "", res1);
Expand All @@ -1402,7 +1402,7 @@ algorithm
quantity = Dump.getOptionWithConcatStr(quant, stringToString, "quantity = ");
Initial_str = Dump.getOptionWithConcatStr(Initial, Dump.printBoolStr, "start = ");
fixed_str = Dump.getOptionWithConcatStr(fixed, Dump.printBoolStr, "fixed = ");
res_1 = Util.stringDelimitListNoEmpty({quantity,Initial_str,fixed_str}, ", ");
res_1 = Util.stringDelimitListNonEmptyElts({quantity,Initial_str,fixed_str}, ", ");
res1 = Util.stringAppendList({"(",res_1,")"});
is_empty = Util.isEmptyString(res_1);
res = Util.if_(is_empty, "", res1);
Expand All @@ -1413,7 +1413,7 @@ algorithm
equation
quantity = Dump.getOptionWithConcatStr(quant, stringToString, "quantity = ");
Initial_str = Dump.getOptionWithConcatStr(Initial, stringToString, "start = ");
res_1 = Util.stringDelimitListNoEmpty({quantity,Initial_str}, ", ");
res_1 = Util.stringDelimitListNonEmptyElts({quantity,Initial_str}, ", ");
res1 = Util.stringAppendList({"(",res_1,")"});
is_empty = Util.isEmptyString(res_1);
res = Util.if_(is_empty, "", res1);
Expand All @@ -1427,7 +1427,7 @@ algorithm
max_str = Dump.getOptionWithConcatStr(max, Exp.printExpStr, "max = ");
Initial_str = Dump.getOptionWithConcatStr(Initial, Exp.printExpStr, "start = ");
fixed_str = Dump.getOptionWithConcatStr(fixed, Dump.printBoolStr, "fixed = ");
res_1 = Util.stringDelimitListNoEmpty({quantity,min_str,max_str,Initial_str,fixed_str}, ", ");
res_1 = Util.stringDelimitListNonEmptyElts({quantity,min_str,max_str,Initial_str,fixed_str}, ", ");
res1 = Util.stringAppendList({"(",res_1,")"});
is_empty = Util.isEmptyString(res_1);
res = Util.if_(is_empty, "", res1);
Expand Down Expand Up @@ -2456,7 +2456,7 @@ public function getMatchingElements "function getMatchingElements
input Element inElement;
end FuncTypeElementTo;
algorithm
elist := Util.listMatching(elist, cond);
elist := Util.listFilter(elist, cond);
end getMatchingElements;

public function getAllMatchingElements "function getAllMatchingElements
Expand Down
52 changes: 26 additions & 26 deletions Compiler/DAELow.mo
View file
Expand Up @@ -4194,8 +4194,8 @@ algorithm
equation
(inputs1,outputs1) = lowerStatementInputsOutputs(vars, s);
(inputs2,outputs2) = lowerAlgorithmInputsOutputs(vars, Algorithm.ALGORITHM(ss));
inputs = Util.listUnionP(inputs1, inputs2, Exp.expEqual);
outputs = Util.listUnionP(outputs1, outputs2, Exp.expEqual);
inputs = Util.listUnionOnTrue(inputs1, inputs2, Exp.expEqual);
outputs = Util.listUnionOnTrue(outputs1, outputs2, Exp.expEqual);
then
(inputs,outputs);
end matchcontinue;
Expand Down Expand Up @@ -4255,8 +4255,8 @@ algorithm
(inputs1,outputs1) = lowerAlgorithmInputsOutputs(vars,Algorithm.ALGORITHM(stmts));
(inputs2,outputs2) = lowerElseAlgorithmInputsOutputs(vars,elsebranch);
inputs3 = statesAndVarsExp(e,vars);
inputs = Util.listListUnionP({inputs1, inputs2,inputs3}, Exp.expEqual);
outputs = Util.listUnionP(outputs1, outputs2, Exp.expEqual);
inputs = Util.listListUnionOnTrue({inputs1, inputs2,inputs3}, Exp.expEqual);
outputs = Util.listUnionOnTrue(outputs1, outputs2, Exp.expEqual);
then (inputs,outputs);

// Features not yet supported.
Expand Down Expand Up @@ -4298,8 +4298,8 @@ algorithm
(inputs1, outputs1) = lowerElseAlgorithmInputsOutputs(vars,elseBranch);
(inputs2, outputs2) = lowerAlgorithmInputsOutputs(vars,Algorithm.ALGORITHM(stmts));
inputs3 = statesAndVarsExp(e,vars);
inputs = Util.listListUnionP({inputs1, inputs2, inputs3}, Exp.expEqual);
outputs = Util.listUnionP(outputs1, outputs2, Exp.expEqual);
inputs = Util.listListUnionOnTrue({inputs1, inputs2, inputs3}, Exp.expEqual);
outputs = Util.listUnionOnTrue(outputs1, outputs2, Exp.expEqual);
then (inputs,outputs);

case(vars,Algorithm.ELSE(stmts))
Expand Down Expand Up @@ -4341,7 +4341,7 @@ algorithm
equation
s1 = statesAndVarsExp(e1, vars);
s2 = statesAndVarsExp(e2, vars);
res = Util.listUnionP(s1, s2, Exp.expEqual);
res = Util.listUnionOnTrue(s1, s2, Exp.expEqual);
then
res;
case (Exp.UNARY(exp = e),vars)
Expand All @@ -4353,7 +4353,7 @@ algorithm
equation
s1 = statesAndVarsExp(e1, vars);
s2 = statesAndVarsExp(e2, vars);
res = Util.listUnionP(s1, s2, Exp.expEqual);
res = Util.listUnionOnTrue(s1, s2, Exp.expEqual);
then
res;
case (Exp.LUNARY(exp = e),vars)
Expand All @@ -4373,7 +4373,7 @@ algorithm
s1 = statesAndVarsExp(e1, vars);
s2 = statesAndVarsExp(e2, vars);
s3 = statesAndVarsExp(e3, vars);
res = Util.listListUnionP({s1,s2,s3}, Exp.expEqual);
res = Util.listListUnionOnTrue({s1,s2,s3}, Exp.expEqual);
then
res;
case ((e as Exp.CALL(path = Absyn.IDENT(name = "der"),expLst = {Exp.CREF(componentRef = cr)})),vars)
Expand All @@ -4389,13 +4389,13 @@ algorithm
case (Exp.CALL(expLst = expl),vars)
equation
lst = Util.listMap1(expl, statesAndVarsExp, vars);
res = Util.listListUnionP(lst, Exp.expEqual);
res = Util.listListUnionOnTrue(lst, Exp.expEqual);
then
res;
case (Exp.ARRAY(array = expl),vars)
equation
lst = Util.listMap1(expl, statesAndVarsExp, vars);
res = Util.listListUnionP(lst, Exp.expEqual);
res = Util.listListUnionOnTrue(lst, Exp.expEqual);
then
res;
case (Exp.MATRIX(scalar = mexp),vars)
Expand All @@ -4406,7 +4406,7 @@ algorithm
case (Exp.TUPLE(PR = expl),vars)
equation
lst = Util.listMap1(expl, statesAndVarsExp, vars);
res = Util.listListUnionP(lst, Exp.expEqual);
res = Util.listListUnionOnTrue(lst, Exp.expEqual);
then
res;
case (Exp.CAST(exp = e),vars)
Expand All @@ -4423,7 +4423,7 @@ algorithm
equation
s1 = statesAndVarsExp(e1, vars);
s2 = statesAndVarsExp(e2, vars);
res = Util.listUnionP(s1, s2, Exp.expEqual);
res = Util.listUnionOnTrue(s1, s2, Exp.expEqual);
then
res;
case (_,_) then {};
Expand Down Expand Up @@ -4451,7 +4451,7 @@ algorithm
expl_1 = Util.listMap(expl, Util.tuple21);
lst = Util.listMap1(expl_1, statesAndVarsExp, vars);
ms_1 = statesAndVarsMatrixExp(ms, vars);
res = Util.listListUnionP((ms_1 :: lst), Exp.expEqual);
res = Util.listListUnionOnTrue((ms_1 :: lst), Exp.expEqual);
then
res;
end matchcontinue;
Expand Down Expand Up @@ -6943,7 +6943,7 @@ algorithm
//print("marked equations:");print(Util.stringDelimitList(Util.listMap(eqns,intString),","));
//print("\n");
diff_eqns = DAEEXT.getDifferentiatedEqns();
eqns_1 = Util.listSetdifferenceP(eqns, diff_eqns, int_eq);
eqns_1 = Util.listSetDifferenceOnTrue(eqns, diff_eqns, intEq);
//print("differentiating equations:");print(Util.stringDelimitList(Util.listMap(eqns_1,intString),","));
//print("\n");

Expand All @@ -6958,7 +6958,7 @@ algorithm
(dummy_der,dae) = newDummyVar(state, dae) ;
//print("Chosen dummy: ");print(Exp.printComponentRefStr(dummy_der));print("\n");
reqns = eqnsForVarWithStates(mt, stateno);
changedeqns = Util.listUnionP(deqns, reqns, int_eq);
changedeqns = Util.listUnionOnTrue(deqns, reqns, int_eq);
(dae,m,mt) = replaceDummyDer(state, dummy_der, dae, m, mt, changedeqns) "We need to change variables in the differentiated equations and in the
equations having the dummy derivative" ;
dae = makeAlgebraic(dae, state);
Expand All @@ -6973,7 +6973,7 @@ algorithm
equation
eqns = DAEEXT.getMarkedEqns();
diff_eqns = DAEEXT.getDifferentiatedEqns();
eqns_1 = Util.listSetdifferenceP(eqns, diff_eqns, int_eq);
eqns_1 = Util.listSetDifferenceOnTrue(eqns, diff_eqns, intEq);
es = Util.listMap(eqns_1, int_string);
es_1 = Util.stringDelimitList(es, ", ");
print("eqns =");print(es_1);print("\n");
Expand Down Expand Up @@ -7041,7 +7041,7 @@ algorithm
eqns_1 = Util.listMap1(eqns, int_sub, 1);
eqns_lst = Util.listMap1r(eqns_1, equationNth, e);
crefs = equationsCrefs(eqns_lst);
crefs = Util.listDeletememberP(crefs, dummy, Exp.crefEqual);
crefs = Util.listDeleteMemberOnTrue(crefs, dummy, Exp.crefEqual);
state = findState(vars, crefs);
({v},{indx}) = getVar(dummy, vars);
(dummy_fixed as false) = varFixed(v);
Expand All @@ -7056,7 +7056,7 @@ algorithm
eqns_1 = Util.listMap1(eqns, int_sub, 1);
eqns_lst = Util.listMap1r(eqns_1, equationNth, e);
crefs = equationsCrefs(eqns_lst);
crefs = Util.listDeletememberP(crefs, dummy, Exp.crefEqual);
crefs = Util.listDeleteMemberOnTrue(crefs, dummy, Exp.crefEqual);
state = findState(vars, crefs);
({v},{indx}) = getVar(dummy, vars);
true = varFixed(v);
Expand Down Expand Up @@ -7249,7 +7249,7 @@ algorithm
e_1 = e - 1;
eqn = equationNth(daeeqns, e_1);
row = incidenceRow(vars, eqn);
m_1 = Util.arrayReplaceatWithFill(row, e_1, m, {});
m_1 = Util.arrayReplaceAtWithFill(row, e_1, m, {});
changedvars1 = varsInEqn(m_1, e);
(m_2,changedvars2) = updateIncidenceMatrix2(dae, m_1, eqns);
then
Expand Down Expand Up @@ -7291,7 +7291,7 @@ algorithm
mlst = arrayList(m);
row_1 = transposeRow(mlst, v, 1);
v_1 = v - 1;
mt_1 = Util.arrayReplaceatWithFill(row_1, v_1, mt, {});
mt_1 = Util.arrayReplaceAtWithFill(row_1, v_1, mt, {});
mt_2 = updateTransposedMatrix(vars, m, mt_1);
then
mt_2;
Expand Down Expand Up @@ -9118,7 +9118,7 @@ algorithm
case (m,mt,i,ass1,ass2)
equation
vars = varsInEqn(m, i);
vars_1 = Util.listMatching(vars, isNotVMarked);
vars_1 = Util.listFilter(vars, isNotVMarked);
(ass1_1,ass2_1) = forallUnmarkedVarsInEqnBody(m, mt, i, vars_1, ass1, ass2);
then
(ass1_1,ass2_1);
Expand Down Expand Up @@ -10731,7 +10731,7 @@ algorithm
case (RESIDUAL_EQUATION(exp = e),vars,ae,m,mt,eqn_indx)
equation
var_indxs = varsInEqn(m, eqn_indx) "residual equations" ;
var_indxs_1 = Util.listUnionP(var_indxs, {}, int_eq) "Remove duplicates and get in correct order: acsending index" ;
var_indxs_1 = Util.listUnionOnTrue(var_indxs, {}, int_eq) "Remove duplicates and get in correct order: acsending index" ;
var_indxs_2 = listReverse(var_indxs_1);
SOME(eqns) = calculateJacobianRow2(e, vars, eqn_indx, var_indxs_2);
then
Expand All @@ -10742,7 +10742,7 @@ algorithm
MULTIDIM_EQUATION(ds,e1,e2) = ae[indx + 1];
new_exp = Exp.BINARY(e1,Exp.SUB(Exp.REAL()),e2);
var_indxs = varsInEqn(m, eqn_indx);
var_indxs_1 = Util.listUnionP(var_indxs, {}, int_eq) "Remove duplicates and get in correct order: acsending index" ;
var_indxs_1 = Util.listUnionOnTrue(var_indxs, {}, int_eq) "Remove duplicates and get in correct order: acsending index" ;
var_indxs_2 = listReverse(var_indxs_1);
SOME(eqns) = calculateJacobianRow2(new_exp, vars, eqn_indx, var_indxs_2);
then
Expand Down Expand Up @@ -13020,14 +13020,14 @@ algorithm
case ({},_,_) then {};
case ((ZERO_CROSSING(occurWhenLst = whenClauseList) :: rest),count,when_index)
equation
_ = Util.listGetmember(when_index, whenClauseList);
_ = Util.listGetMember(when_index, whenClauseList);
count_1 = count + 1;
resx = getZeroCrossingIndicesFromWhenClause2(rest, count_1, when_index);
then
(count :: resx);
case ((ZERO_CROSSING(occurWhenLst = whenClauseList) :: rest),count,when_index)
equation
failure(_ = Util.listGetmember(when_index, whenClauseList));
failure(_ = Util.listGetMember(when_index, whenClauseList));
count_1 = count + 1;
resx = getZeroCrossingIndicesFromWhenClause2(rest, count_1, when_index);
then
Expand Down

0 comments on commit 144bf6c

Please sign in to comment.