⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 prototype.js

📁 ajax窗体技术,有许多漂亮的窗体,实现漂亮的客户端
💻 JS
📖 第 1 页 / 共 5 页
字号:
  if (arguments.length == 2) {    var tagName = methods;    methods = arguments[1];  }  if (!tagName) Object.extend(Element.Methods, methods || {});  else {    if (tagName.constructor == Array) tagName.each(extend);    else extend(tagName);  }  function extend(tagName) {    tagName = tagName.toUpperCase();    if (!Element.Methods.ByTag[tagName])      Element.Methods.ByTag[tagName] = {};    Object.extend(Element.Methods.ByTag[tagName], methods);  }  function copy(methods, destination, onlyIfAbsent) {    onlyIfAbsent = onlyIfAbsent || false;    var cache = Element.extend.cache;    for (var property in methods) {      var value = methods[property];      if (!onlyIfAbsent || !(property in destination))        destination[property] = cache.findOrStore(value);    }  }  function findDOMClass(tagName) {    var klass;    var trans = {      "OPTGROUP": "OptGroup", "TEXTAREA": "TextArea", "P": "Paragraph",      "FIELDSET": "FieldSet", "UL": "UList", "OL": "OList", "DL": "DList",      "DIR": "Directory", "H1": "Heading", "H2": "Heading", "H3": "Heading",      "H4": "Heading", "H5": "Heading", "H6": "Heading", "Q": "Quote",      "INS": "Mod", "DEL": "Mod", "A": "Anchor", "IMG": "Image", "CAPTION":      "TableCaption", "COL": "TableCol", "COLGROUP": "TableCol", "THEAD":      "TableSection", "TFOOT": "TableSection", "TBODY": "TableSection", "TR":      "TableRow", "TH": "TableCell", "TD": "TableCell", "FRAMESET":      "FrameSet", "IFRAME": "IFrame"    };    if (trans[tagName]) klass = 'HTML' + trans[tagName] + 'Element';    if (window[klass]) return window[klass];    klass = 'HTML' + tagName + 'Element';    if (window[klass]) return window[klass];    klass = 'HTML' + tagName.capitalize() + 'Element';    if (window[klass]) return window[klass];    window[klass] = {};    window[klass].prototype = document.createElement(tagName).__proto__;    return window[klass];  }  if (F.ElementExtensions) {    copy(Element.Methods, HTMLElement.prototype);    copy(Element.Methods.Simulated, HTMLElement.prototype, true);  }  if (F.SpecificElementExtensions) {    for (var tag in Element.Methods.ByTag) {      var klass = findDOMClass(tag);      if (typeof klass == "undefined") continue;      copy(T[tag], klass.prototype);    }  }  Object.extend(Element, Element.Methods);  delete Element.ByTag;};var Toggle = { display: Element.toggle };/*--------------------------------------------------------------------------*/Abstract.Insertion = function(adjacency) {  this.adjacency = adjacency;}Abstract.Insertion.prototype = {  initialize: function(element, content) {    this.element = $(element);    this.content = content.stripScripts();    if (this.adjacency && this.element.insertAdjacentHTML) {      try {        this.element.insertAdjacentHTML(this.adjacency, this.content);      } catch (e) {        var tagName = this.element.tagName.toUpperCase();        if (['TBODY', 'TR'].include(tagName)) {          this.insertContent(this.contentFromAnonymousTable());        } else {          throw e;        }      }    } else {      this.range = this.element.ownerDocument.createRange();      if (this.initializeRange) this.initializeRange();      this.insertContent([this.range.createContextualFragment(this.content)]);    }    setTimeout(function() {content.evalScripts()}, 10);  },  contentFromAnonymousTable: function() {    var div = document.createElement('div');    div.innerHTML = '<table><tbody>' + this.content + '</tbody></table>';    return $A(div.childNodes[0].childNodes[0].childNodes);  }}var Insertion = new Object();Insertion.Before = Class.create();Insertion.Before.prototype = Object.extend(new Abstract.Insertion('beforeBegin'), {  initializeRange: function() {    this.range.setStartBefore(this.element);  },  insertContent: function(fragments) {    fragments.each((function(fragment) {      this.element.parentNode.insertBefore(fragment, this.element);    }).bind(this));  }});Insertion.Top = Class.create();Insertion.Top.prototype = Object.extend(new Abstract.Insertion('afterBegin'), {  initializeRange: function() {    this.range.selectNodeContents(this.element);    this.range.collapse(true);  },  insertContent: function(fragments) {    fragments.reverse(false).each((function(fragment) {      this.element.insertBefore(fragment, this.element.firstChild);    }).bind(this));  }});Insertion.Bottom = Class.create();Insertion.Bottom.prototype = Object.extend(new Abstract.Insertion('beforeEnd'), {  initializeRange: function() {    this.range.selectNodeContents(this.element);    this.range.collapse(this.element);  },  insertContent: function(fragments) {    fragments.each((function(fragment) {      this.element.appendChild(fragment);    }).bind(this));  }});Insertion.After = Class.create();Insertion.After.prototype = Object.extend(new Abstract.Insertion('afterEnd'), {  initializeRange: function() {    this.range.setStartAfter(this.element);  },  insertContent: function(fragments) {    fragments.each((function(fragment) {      this.element.parentNode.insertBefore(fragment,        this.element.nextSibling);    }).bind(this));  }});/*--------------------------------------------------------------------------*/Element.ClassNames = Class.create();Element.ClassNames.prototype = {  initialize: function(element) {    this.element = $(element);  },  _each: function(iterator) {    this.element.className.split(/\s+/).select(function(name) {      return name.length > 0;    })._each(iterator);  },  set: function(className) {    this.element.className = className;  },  add: function(classNameToAdd) {    if (this.include(classNameToAdd)) return;    this.set($A(this).concat(classNameToAdd).join(' '));  },  remove: function(classNameToRemove) {    if (!this.include(classNameToRemove)) return;    this.set($A(this).without(classNameToRemove).join(' '));  },  toString: function() {    return $A(this).join(' ');  }};Object.extend(Element.ClassNames.prototype, Enumerable);/* Portions of the Selector class are derived from Jack Slocum’s DomQuery, * part of YUI-Ext version 0.40, distributed under the terms of an MIT-style * license.  Please see http://www.yui-ext.com/ for more information. */var Selector = Class.create();Selector.prototype = {  initialize: function(expression) {    this.expression = expression.strip();    this.compileMatcher();  },  compileMatcher: function() {    // Selectors with namespaced attributes can't use the XPath version    if (Prototype.BrowserFeatures.XPath && !(/\[[\w-]*?:/).test(this.expression))      return this.compileXPathMatcher();    var e = this.expression, ps = Selector.patterns, h = Selector.handlers,        c = Selector.criteria, le, p, m;    if (Selector._cache[e]) {      this.matcher = Selector._cache[e]; return;    }    this.matcher = ["this.matcher = function(root) {",                    "var r = root, h = Selector.handlers, c = false, n;"];    while (e && le != e && (/\S/).test(e)) {      le = e;      for (var i in ps) {        p = ps[i];        if (m = e.match(p)) {          this.matcher.push(typeof c[i] == 'function' ? c[i](m) :    	      new Template(c[i]).evaluate(m));          e = e.replace(m[0], '');          break;        }      }    }    this.matcher.push("return h.unique(n);\n}");    eval(this.matcher.join('\n'));    Selector._cache[this.expression] = this.matcher;  },  compileXPathMatcher: function() {    var e = this.expression, ps = Selector.patterns,        x = Selector.xpath, le,  m;    if (Selector._cache[e]) {      this.xpath = Selector._cache[e]; return;    }    this.matcher = ['.//*'];    while (e && le != e && (/\S/).test(e)) {      le = e;      for (var i in ps) {        if (m = e.match(ps[i])) {          this.matcher.push(typeof x[i] == 'function' ? x[i](m) :            new Template(x[i]).evaluate(m));          e = e.replace(m[0], '');          break;        }      }    }    this.xpath = this.matcher.join('');    Selector._cache[this.expression] = this.xpath;  },  findElements: function(root) {    root = root || document;    if (this.xpath) return document._getElementsByXPath(this.xpath, root);    return this.matcher(root);  },  match: function(element) {    return this.findElements(document).include(element);  },  toString: function() {    return this.expression;  },  inspect: function() {    return "#<Selector:" + this.expression.inspect() + ">";  }};Object.extend(Selector, {  _cache: {},  xpath: {    descendant:   "//*",    child:        "/*",    adjacent:     "/following-sibling::*[1]",    laterSibling: '/following-sibling::*',    tagName:      function(m) {      if (m[1] == '*') return '';      return "[local-name()='" + m[1].toLowerCase() +             "' or local-name()='" + m[1].toUpperCase() + "']";    },    className:    "[contains(concat(' ', @class, ' '), ' #{1} ')]",    id:           "[@id='#{1}']",    attrPresence: "[@#{1}]",    attr: function(m) {      m[3] = m[5] || m[6];      return new Template(Selector.xpath.operators[m[2]]).evaluate(m);    },    pseudo: function(m) {      var h = Selector.xpath.pseudos[m[1]];      if (!h) return '';      if (typeof h === 'function') return h(m);      return new Template(Selector.xpath.pseudos[m[1]]).evaluate(m);    },    operators: {      '=':  "[@#{1}='#{3}']",      '!=': "[@#{1}!='#{3}']",      '^=': "[starts-with(@#{1}, '#{3}')]",      '$=': "[substring(@#{1}, (string-length(@#{1}) - string-length('#{3}') + 1))='#{3}']",      '*=': "[contains(@#{1}, '#{3}')]",      '~=': "[contains(concat(' ', @#{1}, ' '), ' #{3} ')]",      '|=': "[contains(concat('-', @#{1}, '-'), '-#{3}-')]"    },    pseudos: {      'first-child': '[not(preceding-sibling::*)]',      'last-child':  '[not(following-sibling::*)]',      'only-child':  '[not(preceding-sibling::* or following-sibling::*)]',      'empty':       "[count(*) = 0 and (count(text()) = 0 or translate(text(), ' \t\r\n', '') = '')]",      'checked':     "[@checked]",      'disabled':    "[@disabled]",      'enabled':     "[not(@disabled)]",      'not': function(m) {        var e = m[6], p = Selector.patterns,            x = Selector.xpath, le, m, v;        var exclusion = [];        while (e && le != e && (/\S/).test(e)) {          le = e;          for (var i in p) {            if (m = e.match(p[i])) {              v = typeof x[i] == 'function' ? x[i](m) : new Template(x[i]).evaluate(m);              exclusion.push("(" + v.substring(1, v.length - 1) + ")");              e = e.replace(m[0], '');              break;            }          }        }        return "[not(" + exclusion.join(" and ") + ")]";      },      'nth-child':      function(m) {        return Selector.xpath.pseudos.nth("(count(./preceding-sibling::*) + 1) ", m);      },      'nth-last-child': function(m) {        return Selector.xpath.pseudos.nth("(count(./following-sibling::*) + 1) ", m);      },      'nth-of-type':    function(m) {        return Selector.xpath.pseudos.nth("position() ", m);      },      'nth-last-of-type': function(m) {        return Selector.xpath.pseudos.nth("(last() + 1 - position()) ", m);      },      'first-of-type':  function(m) {        m[6] = "1"; return Selector.xpath.pseudos['nth-of-type'](m);      },      'last-of-type':   function(m) {        m[6] = "1"; return Selector.xpath.pseudos['nth-last-of-type'](m);      },      'only-of-type':   function(m) {        var p = Selector.xpath.pseudos; return p['first-of-type'](m) + p['last-of-type'](m);      },      nth: function(fragment, m) {        var mm, formula = m[6], predicate;        if (formula == 'even') formula = '2n+0';        if (formula == 'odd')  formula = '2n+1';        if (mm = formula.match(/^(\d+)$/)) // digit only          return '[' + fragment + "= " + mm[1] + ']';        if (mm = formula.match(/^(-?\d*)?n(([+-])(\d+))?/)) { // an+b          if (mm[1] == "-") mm[1] = -1;          var a = mm[1] ? Number(mm[1]) : 1;          var b = mm[2] ? Number(mm[2]) : 0;          predicate = "[((#{fragment} - #{b}) mod #{a} = 0) and " +          "((#{fragment} - #{b}) div #{a} >= 0)]";          return new Template(predicate).evaluate({            fragment: fragment, a: a, b: b });        }      }    }  },  criteria: {    tagName:      'n = h.tagName(n, r, "#{1}", c);   c = false;',    className:    'n = h.className(n, r, "#{1}", c); c = false;',    id:           'n = h.id(n, r, "#{1}", c);        c = false;',    attrPresence: 'n = h.attrPresence(n, r, "#{1}"); c = false;',    attr: function(m) {      m[3] = (m[5] || m[6]);      return new Template('n = h.attr(n, r, "#{1}", "#{3}", "#{2}"); c = false;').evaluate(m);    },    pseudo:       function(m) {      if (m[6]) m[6] = m[6].replace(/"/g, '\\"');      return new Template('n = h.pseudo(n, "#{1}", "#{6}", r, c); c = false;').evaluate(m);    },    descendant:   'c = "descendant";',    child:        'c = "child";',    adjacent:     'c = "adjacent";',    laterSibling: 'c = "laterSibling";'  },  patterns: {    // combinators must be listed first    // (and descendant needs to be last combinator)    laterSibling: /^\s*~\s*/,    child:        /^\s*>\s*/,    adjacent:     /^\s*\+\s*/,    descendant:   /^\s/,    // selectors follow    tagName:      /^\s*(\*|[\w\-]+)(\b|$)?/,    id:           /^#([\w\-\*]+)(\b|$)/,    className:    /^\.([\w\-\*]+)(\b|$)/,    pseudo:       /^:((first|last|nth|nth-last|only)(-child|-of-type)|empty|checked|(en|dis)abled|not)(\((.*?)\))?(\b|$|\s)/,    attrPresence: /^\[([\w]+)\]/,    attr:         /\[((?:[\w-]*:)?[\w-]+)\s*(?:([!^$*~|]?=)\s*((['"])([^\]]*?)\4|([^'"][^\]]*?)))?\]/  },  handlers: {    // UTILITY FUNCTIONS    // joins two collections    concat: function(a, b) {      for (var i = 0, node; node = b[i]; i++)        a.push(node);      return a;    },    // marks an array of nodes for counting    mark: function(nodes) {      for (var i = 0, node; node = nodes[i]; i++)        node._counted = true;      return nodes;    },    unmark: function(nodes) {      for (var i = 0, node; node = nodes[i]; i++)        node._counted = undefined;      return nodes;    },    // mark each child node with its position (for nth calls)    // "ofType" flag indicates whether we're indexing for nth-of-type    // rather than nth-child    index: function(parentNode, reverse, ofType) {      parentNode._counted = true;      if (reverse) {        for (var nodes = parentNode.childNodes, i = nodes.length - 1, j = 1; i >= 0; i--) {          node = nodes[i

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -