Skip to content

@hakre /jquery.aftertext.js
Created

Embed URL

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
jQuery afterText Plugin
/**
* jQuery afterText Plugin
*
* Copyright (C) 2012 hakre <http://hakre.wordpress.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Also add information on how to contact you by electronic and paper mail.
*
* If your software can interact with users remotely through a computer
* network, you should also make sure that it provides a way for users to
* get its source. For example, if your program is a web application, its
* interface could display a "Source" link that leads users to an archive
* of the code. There are many ways you could offer source, and different
* solutions will be better for different programs; see section 13 for the
* specific requirements.
*
* You should also get your employer (if you work as a programmer) or school,
* if any, to sign a "copyright disclaimer" for the program, if necessary.
* For more information on this, and how to apply and follow the GNU AGPL, see
* <http://www.gnu.org/licenses/>.
*
* @author hakre <http://hakre.wordpress.com>
* @license AGPL-3.0 <http://spdx.org/licenses/AGPL-3.0>
*/
(function() {
var fn = function(n, text) {
if (text) return fn(n).nodeValue = text;
var p = n.parentNode, t = document.createTextNode('');
n = n.nextSibling || p.appendChild(t);
return n.nodeType === 3 ? n : p.insertBefore(t, n);
};
AfterText = function(text) {
this.textString = text;
this.for = function(node) {
this.node = node;
if(this.textString)
fn(node, this.textString)
;
return this;
}
this.text = function(text) {
this.textString = text;
if (this.node)
fn(this.node, text)
;
return this;
}
};
(typeof jQuery === 'undefined') ? 0 : (function( j ) {
j.fn.afterText = function(text) {
var i = 0, n = this, l = n.length;
for (; i < l;)
fn(n[i++]).nodeValue = text
;
};
})( jQuery );
})();
(function(){var c=function(n,a){if(a)return c(n).nodeValue=a;var p=n.parentNode,t=document.createTextNode('');n=n.nextSibling||p.appendChild(t);return n.nodeType===3?n:p.insertBefore(t,n)};AfterText=function(b){this.textString=b;this.for=function(a){this.node=a;if(this.textString)c(a,this.textString);return this}this.text=function(a){this.textString=a;if(this.node)c(this.node,a);return this}};(typeof jQuery==='undefined')?0:(function(j){j.fn.afterText=function(a){var i=0,n=this,l=n.length;for(;i<l;)c(n[i++]).nodeValue=a}})(jQuery)})();
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.