freemarker.core.SwitchBlock Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of freemarker-gae Show documentation
Show all versions of freemarker-gae Show documentation
Google App Engine compliant variation of FreeMarker.
FreeMarker is a "template engine"; a generic tool to generate text output based on templates.
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package freemarker.core;
import java.io.IOException;
import freemarker.template.TemplateException;
/**
* An instruction representing a switch-case structure.
*/
final class SwitchBlock extends TemplateElement {
private Case defaultCase;
private final Expression searched;
private int firstCaseIndex;
/**
* @param searched the expression to be tested.
*/
SwitchBlock(Expression searched, MixedContent ignoredSectionBeforeFirstCase) {
this.searched = searched;
int ignoredCnt = ignoredSectionBeforeFirstCase != null ? ignoredSectionBeforeFirstCase.getChildCount() : 0;
setChildBufferCapacity(ignoredCnt + 4);
for (int i = 0; i < ignoredCnt; i++) {
addChild(ignoredSectionBeforeFirstCase.getChild(i));
}
firstCaseIndex = ignoredCnt; // Note that normally postParseCleanup will overwrite this
}
/**
* @param cas a Case element.
*/
void addCase(Case cas) {
if (cas.condition == null) {
defaultCase = cas;
}
addChild(cas);
}
@Override
TemplateElement[] accept(Environment env)
throws TemplateException, IOException {
boolean processedCase = false;
int ln = getChildCount();
try {
for (int i = firstCaseIndex; i < ln; i++) {
Case cas = (Case) getChild(i);
boolean processCase = false;
// Fall through if a previous case tested true.
if (processedCase) {
processCase = true;
} else if (cas.condition != null) {
// Otherwise, if this case isn't the default, test it.
processCase = EvalUtil.compare(
searched,
EvalUtil.CMP_OP_EQUALS, "case==", cas.condition, cas.condition, env);
}
if (processCase) {
env.visit(cas);
processedCase = true;
}
}
// If we didn't process any nestedElements, and we have a default,
// process it.
if (!processedCase && defaultCase != null) {
env.visit(defaultCase);
}
} catch (BreakOrContinueException br) {}
return null;
}
@Override
protected String dump(boolean canonical) {
StringBuilder buf = new StringBuilder();
if (canonical) buf.append('<');
buf.append(getNodeTypeSymbol());
buf.append(' ');
buf.append(searched.getCanonicalForm());
if (canonical) {
buf.append('>');
int ln = getChildCount();
for (int i = 0; i < ln; i++) {
buf.append(getChild(i).getCanonicalForm());
}
buf.append("").append(getNodeTypeSymbol()).append('>');
}
return buf.toString();
}
@Override
String getNodeTypeSymbol() {
return "#switch";
}
@Override
int getParameterCount() {
return 1;
}
@Override
Object getParameterValue(int idx) {
if (idx != 0) throw new IndexOutOfBoundsException();
return searched;
}
@Override
ParameterRole getParameterRole(int idx) {
if (idx != 0) throw new IndexOutOfBoundsException();
return ParameterRole.VALUE;
}
@Override
boolean isNestedBlockRepeater() {
return false;
}
@Override
TemplateElement postParseCleanup(boolean stripWhitespace) throws ParseException {
TemplateElement result = super.postParseCleanup(stripWhitespace);
// The first #case might have shifted in the child array, so we have to find it again:
int ln = getChildCount();
int i = 0;
while (i < ln && !(getChild(i) instanceof Case)) {
i++;
}
firstCaseIndex = i;
return result;
}
}