]]>
<p><a href="#" class="run">Run</a></p><div id="box"></div><style type="text/css">
body {}{
body 
}
margin: 20px auto; padding: 0; width: 580px; font: 80%/120% Arial, Helvetica, sans-serif;
}a {}{ font-weight: bold; color: #000000;}#box {}{ background: #6699FF; height: 100px; width: 100px; position: relative;}</style>jquery
1$(document).ready(function(){
2
$(".run").click(function(){
3
4 $("#box").animate({opacity: "0.1", left: "+=400"}, 1200)
5 .animate({opacity: "0.4", top: "+=160", height: "20", width: "20"}, "slow")
6 .animate({opacity: "1", left: "0", height: "100", width: "100"}, "slow")
7 .animate({top: "0"}, "fast")
8 .slideUp()
9 .slideDown("slow")
10 return false;
11
12
});
13});
$(document).ready(function(){2
$(".run").click(function(){
$(3
4
$("#box").animate({opacity: "0.1", left: "+=400"}, 1200)5
.animate({opacity: "0.4", top: "+=160", height: "20", width: "20"}, "slow")6
.animate({opacity: "1", left: "0", height: "100", width: "100"}, "slow")7
.animate({top: "0"}, "fast")8
.slideUp()9
.slideDown("slow")10
return false;11
12
});13
});]]>
1<div style="width:100%;height:100%;border-style:solid;border:2px;">
2 <div style="width:40px;height:30px;border-style:solid;border:2px;">
3 <p>Hello</p>
4 </div>
5
6
7
8</div>
<div style="width:100%;height:100%;border-style:solid;border:2px;">2
<div style="width:40px;height:30px;border-style:solid;border:2px;">3
<p>Hello</p>4
</div>5
6
7
8
</div>$("div:has(p)")
閫変腑鐨勬槸鏈澶栧眰鐨刣iv]]>
/**
* 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.
*/
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Date;
import org.apache.lucene.analysis.Analyzer;
import org.apache.lucene.analysis.standard.StandardAnalyzer;
import org.apache.lucene.document.Document;
import org.apache.lucene.index.FilterIndexReader;
import org.apache.lucene.index.IndexReader;
import org.apache.lucene.queryParser.MultiFieldQueryParser;
import org.apache.lucene.queryParser.QueryParser;
import org.apache.lucene.search.BooleanClause;
import org.apache.lucene.search.HitCollector;
import org.apache.lucene.search.IndexSearcher;
import org.apache.lucene.search.Query;
import org.apache.lucene.search.ScoreDoc;
import org.apache.lucene.search.Searcher;
import org.apache.lucene.search.TopDocCollector;
/** Simple command-line based search demo. */
public class SearchFiles {
/** Use the norms from one field for all fields. Norms are read into memory,
* using a byte of memory per document per searched field. This can cause
* search of large collections with a large number of fields to run out of
* memory. If all of the fields contain only a single token, then the norms
* are all identical, then single norm vector may be shared. */
private static class OneNormsReader extends FilterIndexReader {
private String field;
public OneNormsReader(IndexReader in, String field) {
super(in);
this.field = field;
}
public byte[] norms(String field) throws IOException {
return in.norms(this.field);
}
}
private SearchFiles() {}
/** Simple command-line based search demo. */
public static void main(String[] args) throws Exception {
String index = "index";
String field = "content";
boolean multipleFields = true;
IndexReader reader = IndexReader.open(index);//IndexReader 鏍規嵁 index 鎸囧畾鐨勮礬寰?璁塊棶绱㈠紩錛屾壂鎻忕儲寮曘?br />
Searcher searcher = new IndexSearcher(reader);
Analyzer analyzer = new StandardAnalyzer();
BufferedReader in =new BufferedReader(new InputStreamReader(System.in, "UTF-8"));
while (true) {
System.out.println("Enter query: ");
String line = in.readLine();
if (line == null || line.length() == -1)
break;
line = line.trim();
if (line.length() == 0)
break;
if (!multipleFields) {
QueryParser parser = new QueryParser(field, analyzer);
Query query = parser.parse(field);// 鏍規嵁鎸囧畾鐨勫崟涓猣ield鏌ヨ
parser.setDefaultOperator(parser.OR_OPERATOR.OR);
//澶氫釜瀛楃涓蹭互絀烘牸浠芥牸鏃訛紝OR : a b 鍚湁a鎴朾鍧囧彲銆?br />
//AND a b 蹇呴』鍚湁 a鍜宐銆?br />
doPagingSearch(searcher, query);
} else {
String[] fields = new String[2];
fields[0] = "contents";
fields[1] = "name";
BooleanClause.Occur[] flags = new BooleanClause.Occur[] {
BooleanClause.Occur.SHOULD, BooleanClause.Occur.SHOULD };
//鏍規嵁澶氫釜field鏌ヨ鏃躲俿hould,should鏌ヨ瀛楁鍦?name鎴栨槸contents浠諱綍涓涓腑錛屽潎鍋氫負涓鏉¤褰曡繑鍥炪?br />
//must,must .蹇呴』 鍗沖湪 name 涓紝鍙堝湪contents 涓?br />
Query query = MultiFieldQueryParser.parse(line, fields, flags,
analyzer);
doPagingSearch(searcher, query);
}
}
reader.close();
}
/**
* This method uses a custom HitCollector implementation which simply prints out
* the docId and score of every matching document.
*
* This simulates the streaming search use case, where all hits are supposed to
* be processed, regardless of their relevance.
*/
public static void doPagingSearch( Searcher searcher, Query query) throws IOException {
// Collect enough docs to show 5 pages
TopDocCollector collector = new TopDocCollector(20);//鏈澶氱粨鏋滈泦涓暟銆?br />
searcher.search(query, collector);
ScoreDoc[] hits = collector.topDocs().scoreDocs;
int numTotalHits = collector.getTotalHits();//鎼滅儲鍒扮殑絎﹀悎鏉′歡鐨勮褰曟繪潯鏁般?br />
System.out.println(numTotalHits + " total matching documents");
for(int i=0;i<numTotalHits;i++){
Document doc = searcher.doc(hits[i].doc);
System.out.println("path.."+doc.get("path"));
System.out.println("modified.."+doc.get("modified"));
System.out.println("name.."+doc.get("name"));
System.out.println("parent"+doc.get("parent"));
System.out.println("content..."+doc.get("content"));
}
}
}
]]>
<body>
<script type="text/javascript">
function sortkids(e) {
// This is the element whose children we are going to sort
if (typeof e == "string") e = document.getElementById(e);
// Transfer the element (but not text node) children of e to a real array
var kids = [];
for(var x = e.firstChild; x != null; x = x.nextSibling)
if (x.nodeType == 1 /* Node.ELEMENT_NODE */) kids.push(x);
// Now sort the array based on the text content of each kid.
// Assume that each kid has only a single child and it is a Text node
kids.sort(function(n, m) { // This is the comparator function for sorting
var s = n.firstChild.data; // text of node n
var t = m.firstChild.data; // text of node m
if (s < t) return -1; // n comes before m
else if (s > t) return 1; // n comes after m
else return 0; // n and m are equal
});
// Now append the kids back into the parent in their sorted order.
// When we insert a node that is already part of the document, it is
// automatically removed from its current position, so reinserting
// these nodes automatically moves them from their old position
// Note that any text nodes we skipped get left behind, however.
for(var i = 0; i < kids.length; i++) e.appendChild(kids[i]);
}
</script>
<ul id="list"> <!-- This is the list we'll sort -->
<li>one<li>two<li>three<li>four <!-- items are not in alphabetical order -->
</ul>
<!-- this is the button that sorts the list -->
<button onclick="sortkids('list')">Sort list</button>
</body>
</html>
]]>
鎰熻鏈夌偣綾諱技浜?c:out 閲岀殑escapeXml
璁稿鎿嶄綔闇瑕佽煩鍒頒竴涓?message.jsp 鐨勯〉闈紝 榪欎釜欏甸潰寰堢畝鍗曪紝灝辨槸涓涓俊鎭拰涓涓繑鍥炴寜綰姐備絾榪斿洖鐨勬椂渚紝
鏈夌殑鎿嶄綔 鐩存帴 history.back() 灝卞彲浠ヤ簡錛屾湁鐨勮璺沖埌鎸囧畾鐨勯〉闈€?br />
function goBack(backUrl){
eval(backUrl);
}
goBack('window.history.back()');
goBack('document.location.href=" "');
]]>