• [ x0429.COM 电 脑 知 识 学 习 网 ]
  • RSS订阅
  • 网站地图
  • 搜索: 您的位置电脑基础知识网>网站素材>阅读资讯文章

    内部搜索脚本

    2008-05-19 10:16:17 来源:网络其他网站 作者:采集 点击: 评论:0

    脚本说明:

    把如下代码加入%26lt;body%26gt;区域中:



    %26lt;script LANGUAGE=%26quot;JavaScript1.1%26quot;%26gt;



    %26lt;!--





    var tname= new Array ();

    // ------------------------

    // Enter DATA HERE !!

    // ------------------------

    tname[0]=%26quot;Yahoo;www.yahoo.com%26quot;;

    tname[1]=%26quot;Infoseek;www.infoseek.com%26quot;;

    tname[2]=%26quot;Lycos;www.lycos.com%26quot;;

    tname[3]=%26quot;WebCrawler;www.webcrawler.com%26quot;;

    tname[4]=%26quot;Trovator;trovator.combios.es%26quot;;

    tname[5]=%26quot;BIWE;biwe.cesat.es%26quot;;

    tname[6]=%26quot;Ole;www.ole.es%26quot;;

    tname[7]=%26quot;Fantastico;www.fantastico.com%26quot;;

    tname[8]=%26quot;SOL;www.sol.es%26quot;;

    tname[9]=%26quot;donde;donde.uji.es%26quot;;

    tname[10]=%26quot;Telepolis;www.telepolis.com%26quot;;

    tname[11]=%26quot;El Cano;www.elcano.com%26quot;;

    // ------------------------



    function QuickSort (vec) {

    // ----------------------------------------

    // Algoritmo QuickSort 1.0 vs. JavaScript

    // Guillermo BT

    // ----------------------------------------

    orderedVec= Ordenar (vec,0,vec.length-1);

    return orderedVec

    }



    function Order (vec,iz,de) {

    // ------------------------------------------------------------

    // Order (subfuncion de QuickSort)

    // PARAMETERS (IN):

    // *vec* : vector to Order (Array object)

    // *iz* : lower bound (typically 0)

    // *de* : upper bound (typically array.length-1)

    //

    // OUT: returns the ordered vector (lexicographic order)

    // ------------------------------------------------------------

    var i=iz;

    var j=de;

    var x= vec[Math.round((iz+de)/ 2)];

    while (i%26lt;=j) {

    while (vec[i]%26lt;x) {i++};

    while (vec[j]%26gt;x) {j--};

    if (i%26lt;=j) {

    var w= vec[i];

    vec[i]= vec[j];

    vec[j]= w;

    i++;

    j--;

    }

    }

    if (iz%26lt;j) Order(vec,iz,j);

    if (i%26lt;de) Order(vec,i,de);

    return vec;

    }



    function Vector2URL (elem, separation) {

    var cArray= elem.split(separation);

    var url=%26quot;%26lt;a href=http://%26quot;+cArray[1]+%26quot;%26gt;%26quot;;

    //alert (url);

    v.document.write (%26quot;%26lt;li%26gt;%26quot;,cArray[0].fontcolor('red'));

    v.document.write (%26quot; haves %26quot;,url,%26quot;web%26lt;/a%26gt; page%26lt;br%26gt;%26quot;);

    }



    function ShowEntries (vec) {

    v= window.open ('jv_sor2b.html','ventana', 'scrollbars=1,width=400,height=220');

    v.document.write (%26quot;%26lt;b%26gt;Available entries:%26lt;/b%26gt;%26lt;br%26gt;%26lt;ul%26gt;%26quot;);

    var i = 0;

    n=vec.length;

    if (n != 0) {

    while (i%26lt;n) {

    Vector2URL(vec[i], ';');

    i++

    }

    }

    v.document.write (%26quot;%26lt;/ul%26gt;%26quot;);

    v.document.write (%26quot;%26lt;form%26gt;%26lt;input type=button value=Close onClick='self.close()'%26gt;%26lt;/form%26gt;%26quot;);

    }



    function Manage (vector) {

    if (vector.length==0) {

    alert (%26quot;No entries were found!%26quot;);

    }

    else {

    alert (%26quot;Let's do it!%26quot;);

    ShowEntries (vector);

    }

    }



    function Search (strng, vector) {

    // ----------------------------------------

    // Search 1.0-EN vs. JavaScript

    // Guillermo BT

    // ----------------------------------------

    // IN:

    // *strng* : string to search

    // *vector* : Array object whose elements have the format:

    // %26quot;%26lt;name%26gt;;%26lt;web_page_URL%26gt;%26quot;

    //

    // OUT:

    // returns an Array with those elements whose %26lt;name%26gt; field

    // contains the *strng* string (substrings are allowed too)

    //

    // ---------------------------------------------------------------

    var i=0; var j=0;

    var array2= new Array();

    while (i%26lt;(vector.length)) {

    var cArray= vector[i].split(';');

    nStr=new String (cArray[0]);

    idx=nStr.toLowerCase().indexOf(strng);

    if (idx != -1) {

    array2[j]= vector[i];

    j++

    }

    i++

    }

    return array2

    }



    // --%26gt;



    %26lt;/script%26gt;



    %26lt;FORM name=formSearch%26gt;

    %26lt;table border=2 bordercolor=blue cellpadding=3 cellspacing=4%26gt;

    %26lt;!-- FIRST ARROW --%26gt;

    %26lt;tr bgcolor=yellow%26gt;

    %26lt;th colspan=2%26gt;Access to data:



    %26lt;!-- SECOND ARROW --%26gt;

    %26lt;tr align=center%26gt;

    %26lt;td bgcolor=lightgreen%26gt;%26lt;b%26gt;order%26lt;/b%26gt;

    %26lt;td%26gt;

    %26lt;input type=button value=%26quot;Chronological%26quot; name=botMostrar

    onClick=%26quot;ShowEntries(tname)%26quot;%26gt;

    %26lt;input type=button value=%26quot;Alphabetical%26quot; name=botOrder

    onClick=%26quot;tname.sort(); ShowEntries(tname)%26quot;%26gt;



    %26lt;!-- THIRD ARROW --%26gt;

    %26lt;tr align=center%26gt;

    %26lt;td bgcolor=lightgreen%26gt;%26lt;b%26gt;Search%26lt;/b%26gt;

    %26lt;td%26gt;

    %26lt;input type=text size=20 name=who value=%26quot;%26quot;%26gt;%26lt;br%26gt;

    %26lt;input type=button value=%26quot;similar words%26quot; name=botSearch

    onClick=%26quot;

    if (this.form.who.value=='') {

    alert ('You must enter something to search!')

    }

    else {

    valor=Search(this.form.who.value.toLowerCase(), tname);

    Manage (valor)

    }%26quot;%26gt;

    %26lt;/table%26gt;

    %26lt;/FORM%26gt;


    Tags:[标签:标签]  
    责任编辑:
  • 请文明参与讨论,禁止漫骂攻击。 用户名:新注册) 密码: 匿名:
    评论总数:0 [ 查看全部 ] 网友评论