xuyan5971

jquery validation

     摘要:  1<%@page contentType="text/html; charset=GBK"%>  2<%@taglib uri="http://java.sun.com/jsp/jstl/core" prefix="c"%>  3<%@ taglib uri="http:/...  閱讀全文

[jQuery]animate(滑塊滑動)

html

<p><a href="#" class="run">Run</a></p>
<div id="box">
</div>

<style type="text/css">
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>

 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});

jquery學習筆記

：has 

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>

正則表達式 預搜索

ajax回調函數調用多個參數。 循環調用。

 1    function batchProcessData(data,telArr,index){
 2          if(data==0){    
 3            var option = new Option(telArr[index],telArr[index]);
 4            var counts = $('bindTel').options.length;
 5            $('bindTel').options[counts]=option; 
 6            var restrictionObj = $('bindTel');
 7            var allNum =",";
 8            for(i=0;i<restrictionObj.options.length;i++){
 9                var value = restrictionObj.options[i].value;
10                allNum += value+',';
11            }
12            $('bindTelNo').value=allNum;
13        }    
14        index +=1;
15        if(index==telArr.length){
16            return;
17        }
18        var fieldNameArr = [];
19        var fieldValueArr = [];
20        fieldNameArr[0]='tel_no';
21        fieldValueArr[0]=telArr[index];
22        sysManagerService.isExist('t_user_bind',fieldNameArr[0],fieldValueArr[0],{
23            callback:
24                function(data){
25                    batchProcessData(data,telArr,index);
26                }
27        });
28    }

 1    function batchAddTel(){
 2        var telnum = $('telNo');
 3        var telArr = telnum.value.split(/[^\d-]/g);
 4        var effTelArr = new Array();
 5        for(var i=0;i<telArr.length;i++){
 6            if(""==telArr[i]){
 7                continue;
 8            }
 9            var patrn=/(^[0-9]{3,4}\-[0-9]{7,8}$)|(^[0-9]{7,8}$)|(^[0-9]{11}$)/;
10            if (!patrn.test(telArr[i])){
11                continue;                                               
12            }                                  
13            if($('bindTelNo').value.indexOf(','+telArr[i]+',') !=-1){
14                continue;                                 
15            }      
16            effTelArr.push(telArr[i]);
17        }
18        effTelArr = unique_Array(effTelArr);
19        if(effTelArr.length > 0){
20            var fieldNameArr = [];
21            var fieldValueArr = [];
22            fieldNameArr[0]='tel_no';
23            fieldValueArr[0]=effTelArr[0];
24            sysManagerService.isExist('t_user_bind',fieldNameArr[0],fieldValueArr[0],{//回調函數調用多個參數
25                callback:
26                    function(data){
27                        batchProcessData(data,effTelArr,0);
28                    }
29            });
30        }    
31    }     

lucene_根據索引搜索文件

package org.apache.lucene.demo;

/**
 * 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 指定的路徑 訪問索引，掃描索引。
    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);// 根據指定的單個field查詢
    parser.setDefaultOperator(parser.OR_OPERATOR.OR);
    //多個字符串以空格份格時，OR  : a b  含有a或b均可。
    //AND   a b 必須含有 a和b。
    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查詢時。should,should查詢字段在 name或是contents任何一個中，均做為一條記錄返回。
    //must,must .必須 即在 name 中，又在contents 中。
    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);//最多結果集個數。
    searcher.search(query, collector);
    ScoreDoc[] hits = collector.topDocs().scoreDocs;
    int numTotalHits = collector.getTotalHits();//搜索到的符合條件的記錄總條數。
    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"));
    }
  }
}

lucence_對文件建立索引

package org.apache.lucene.demo;

/**
 * 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 org.apache.lucene.analysis.standard.StandardAnalyzer;
import org.apache.lucene.index.IndexWriter;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Date;

/** Index all text files under a directory. */
public class IndexFiles {
 
  private IndexFiles() {}

  static final File INDEX_DIR = new File("index");//索引止錄。建在當前目錄的/index下
 
  /** Index all text files under a directory. */
  public static void main(String[] args) {//args[0] 文件路徑.  main 方法：對args[0]指定的文件路徑下的所有文件建立索引。
  final File docDir = new File(args[0]);
  if (!docDir.exists() || !docDir.canRead()) {
   System.out .println("Document directory '" + docDir.getAbsolutePath() + "' does not exist or is not readable, please check the path");
   System.exit(1);
  }
   
    Date start = new Date();
    try {
   IndexWriter writer = new IndexWriter(INDEX_DIR, new StandardAnalyzer(), true, IndexWriter.MaxFieldLength.LIMITED);
   //IndexWriter負責創建和維護索引
   //IndexWriter(String path, Analyzer a, boolean create, IndexWriter.MaxFieldLength mfl)
   //path:路徑 Analyzer:文本分析器  create:是否創建新索引  mfl 最大field數量
   System.out.println("Indexing to directory '" + INDEX_DIR + "'...");
   indexDocs(writer, docDir);
   System.out.println("Optimizing...");
   writer.optimize();//優化索引
   writer.close();//關閉
   Date end = new Date();
   System.out.println(end.getTime() - start.getTime() + " total milliseconds");
  } catch (IOException e) {
   System.out.println(" caught a " + e.getClass()
     + "\n with message: " + e.getMessage());
  }
  }

  static void indexDocs(IndexWriter writer, File file) throws IOException {
  // do not try to index files that cannot be read
  if (file.canRead()) {
   if (file.isDirectory()) {
    String[] files = file.list();
    // an IO error could occur
    if (files != null) {
     for (int i = 0; i < files.length; i++) {
      indexDocs(writer, new File(file, files[i]));
     }
    }
   } else {
    System.out.println("adding " + file);
    try {
     writer.addDocument(FileDocument.Document(file));
    }
    // at least on windows, some temporary files raise this
    // exception with an "access denied" message
    // checking if the file can be read doesn't help
    catch (FileNotFoundException fnfe) {
     ;
    }
   }
  }
 }
}

數組_sort firstChild

<html>
<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>

js_正則表達式

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="GBK" xml:lang="GBK">
<head>
<meta http-equiv="Pragma" content="no-cache" />
<meta http-equiv="Cache-Control" content="no-cache" />
<meta http-equiv="Expires" content="0" />
<title></title>

<input type="button" value="testTest" onclick="testTest()"></input>
</form> 
</body>
</html>

js eval

前幾天看書的時侯看到eval 這個  函數，今天試了一下。。很好很強大。

感覺有點類似于 c:out 里的escapeXml 

許多操作需要跳到一個 message.jsp 的頁面， 這個頁面很簡單，就是一個信息和一個返回按紐。但返回的時侯，
有的操作 直接 history.back() 就可以了，有的要跳到指定的頁面。


function goBack(backUrl){
    eval(backUrl);
} 

goBack('window.history.back()');
goBack('document.location.href=" "');