freemaker的标记语法

于 2012-12-18 14:17:46 发布
阅读量1.5k 收藏
点赞数
分类专栏： # Java
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/avenccssddnn/article/details/8314128
版权

借Struts2核心jar包下的Filter包的error.ftl文件来学习一下freemaker的标记语法

该ftl模板（error.ftl）用于指示开发者Struts页面请求出错后，指定转向该模板所生成的html静态页面

<#--

/*
 * $Id: error.ftl 720258 2008-11-24 19:05:16Z musachy $
 *
 * 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.
 */
-->
<html>
<head>
    <title>Struts Problem Report</title>
    <style>
        pre {
            margin: 0;
            padding: 0;
        }    
    </style>
</head>
<body>
    <h2>Struts Problem Report</h2>
    <p>
    Struts has detected an unhandled exception:
    </p>

<#assign msgs = [] />
<#list chain as ex>
    <#if ex.message??>
        <#assign msgs = [ex.message] + msgs/>
    </#if>    
</#list>
<#assign rootex = exception/>
<#list chain as ex>
    <#if (ex.location?? && (ex.location != unknown))>
        <#assign rootloc = ex.location/>
        <#assign rootex = ex/>
    <#else>
            <#assign tmploc = locator.getLocation(ex) />
            <#if (tmploc != unknown)>
            <#assign rootloc = tmploc/>
                <#assign rootex = ex/>
            </#if>  
    </#if>    
</#list>

<div id="exception-info">
<table>
    <tr>
        <td><strong>Messages</strong>:</td>
        <td>
            <#if (msgs?size > 1)>
            <ol>
                <#list msgs as msg>
                    <#if (msg?is_method)>
                        <li>${msg[0]}</li>
                    <#else>
                        <li>${msg}</li>
                    </#if>
                </#list>
            </ol>
            <#elseif (msgs?size == 1)>
                <#if (msgs[0]?is_method)>
                    <li>${msgs[0][0]}</li>
                <#else>
                    <li>${msgs[0]}</li>
                </#if>
            </#if>
        </td>
    </tr>
    <#if rootloc??>
    <tr>
        <td><strong>File</strong>:</td>
        <td>${rootloc.URI}</td>
    </tr>
    <tr>
        <td><strong>Line number</strong>:</td>
        <td>${rootloc.lineNumber}</td>
    </tr>
    <#if (rootloc.columnNumber >= 0)>
    <tr>
        <td><strong>Column number</strong>:</td>
        <td>${rootloc.columnNumber}</td>
    </tr>
    </#if>
    </#if>
    
</table>
</div>

<#if rootloc??>
    <#assign snippet = rootloc.getSnippet(2) />
    <#if (snippet?size > 0)>
        <div id="snippet">
        <hr />
            
            <#list snippet as line>
                <#if (line_index == 2)>
                    <#if (rootloc.columnNumber >= 3)>
                        <pre style="background:yellow">${(line[0..(rootloc.columnNumber-3)]?html)}<span style="background:red">${(line[(rootloc.columnNumber-2)]?html)}</span><#if ((rootloc.columnNumber)<line.length())>${(line[(rootloc.columnNumber-1)..]?html)}</#if></pre>
                    <#else>
                           <pre style="background:yellow">${line?html}</pre>
                    </#if>    
                <#else>
                    <pre>${line?html}</pre>
                </#if>    
            </#list>
        </div>
    </#if>    
</#if>

<div id="stacktraces">
<hr />
<h3>Stacktraces</h3>
<#list chain as ex>
<div class="stacktrace" style="padding-left: ${ex_index * 2}em">
    <strong>${ex}</strong>
    <div>
    <pre>
    <#list ex.stackTrace as frame>
    ${frame}
    </#list>
    </pre>
    </div>
</div>
</#list>
</div>

<div class="footer">
<hr />
<p>
You are seeing this page because development mode is enabled.  Development mode, or devMode, enables extra
debugging behaviors and reports to assist developers.  To disable this mode, set:
<pre>
  struts.devMode=false
</pre>
in your <code>WEB-INF/classes/struts.properties</code> file.
</p>
</div>
</body>
</html>

IT•轩辕
关注
专栏目录
博客
LeetCode 常见题型汇总
07-21 251
前30剪枝二分查找字典树位运算动态规划并查集LRU缓存布隆过滤器。
博客
除了做分页,Mybatis插件机制还能这么玩
03-13 1305
【代码】除了做分页,Mybatis插件机制还能这么玩。
博客
通用化递归建树与裁剪树
03-13 1018
通用化递归建树与裁剪树
博客
【LeetCode 0006】【字符/几何】Z字形变换
07-29 144
The string is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)And then read line by line: Write the code that will take a string and make this conversion given a
博客
【LeetCode 0005】【动态规划】最长回文子串
07-28 179
Given a string , return the longest palindromic substring in .Example 1:Example 2:Constraints:
博客
【LeetCode 0004】【数组/分治】寻找两个正序数组的中位数
07-25 176
Given two sorted arrays and of size and respectively, return the median of the two sorted arrays.The overall run time complexity should be .Example 1:Example 2:Constraints:
博客
【LeetCode 0003】【滑动窗口】无重复字符的最长子串
07-24 416
Given a string `s`, find the length of the **longest** **substring** without repeating characters.
博客
【LeetCode 0002】【链表】两数相加
07-24 354
You are given two **non-empty** linked lists representing two non-negative integers. The digits are stored in **reverse order**, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
博客
【LeetCode 0037】【回溯/剪枝】解数独
07-22 309
Write a program to solve a Sudoku puzzle by filling the empty cells.A sudoku solution must satisfy all of the following rules:The character indicates empty cells.Example 1:Constraints:
博客
【LeetCode 0338】【位运算/递归式】求比特位
07-21 647
Given an integer , return *an array of length such that for each (), is the number of ’s in the binary representation of *.Example 1:Example 2:Constraints:Follow up:
博客
【LeetCode 0231】【位运算】2的N次方
07-20 368
Given an integer , return if it is a power of two. Otherwise, return .An integer is a power of two, if there exists an integer such that .Example 1:Example 2:Example 3:Constraints:Follow up: Could you solve it without loops/recursion?
博客
【LeetCode 0191】【位运算】求1的个数
07-19 375
Write a function that takes the binary representation of a positive integer and returns the number of set bits it has (also known as the Hamming weight).Example 1:Output: 3Explanation:The input binary string 1011 has a total of three set bits.Example 2:Out
博客
【LeetCode 0069】【二分查找】求平方根
07-17 314
Given a non-negative integer , return the square root of rounded down to the nearest integer. The returned integer should be non-negative as well.You must not use any built-in exponent function or operator.Example 1:Example 2:Constraints:
博客
【LeetCode 0051】【剪枝】N皇后
07-15 681
The n-queens puzzle is the problem of placing queens on an chessboard such that no two queens attack each other.Given an integer , return all distinct solutions to the n-queens puzzle. You may return the answer in any order.Each solution contains a disti
博客
【LeetCode 0022】【DSF】生成括号
07-14 160
Given `n` pairs of parentheses, write a function to *generate all combinations of well-formed parentheses*.
博客
【LeetCode 0111】【递归/分治】二叉树的最小深度
07-13 311
0, 10^5]
博客
【LeetCode 0104】【递归/分治】二叉树的最大深度
07-13 366
Given the of a binary tree, return its maximum depth.A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Example 1:Example 2:Constraints:
博客
【LeetCode 0102】【BSF/DSF】二叉树的层级遍历
07-12 239
Given the of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level).Example 1:Example 2:Example 3:Constraints:
博客
【LeetCode 0122】【DSF/DP/Greedy】买卖股票的最佳时机2
07-11 301
You are given an integer array where is the price of a given stock on the day.On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the
博客
【LeetCode 0169】【摩尔投票算法】主元素
07-11 649
Given an array of size , return the majority element.The majority element is the element that appears more than times. You may assume that the majority element always exists in the array.Example 1:Example 2:Constraints:Follow-up: Could you solve the pr
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值