Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP

Comparing changes

Choose two branches to see what's changed or to start a new pull request. If you need to, you can also compare across forks.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also compare across forks.
base fork: bobbydavid/gist-in-tumblr
base: 29d65431c5
...
head fork: bobbydavid/gist-in-tumblr
compare: a56d2e9a8d
Checking mergeability… Don't worry, you can still create the pull request.
  • 7 commits
  • 6 files changed
  • 0 commit comments
  • 1 contributor
View
4 .gitignore
@@ -0,0 +1,4 @@
+*~
+node_modules/*
+out/*
+tmp/*
View
340 GPL-LICENSE.txt
@@ -0,0 +1,340 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users. This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it. (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.) You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+ To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have. You must make sure that they, too, receive or can get the
+source code. And you must show them these terms so they know their
+rights.
+
+ We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+ Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software. If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+ Finally, any free program is threatened constantly by software
+patents. We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary. To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ GNU GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License. The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language. (Hereinafter, translation is included without limitation in
+the term "modification".) Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+ 1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+ 2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+ a) You must cause the modified files to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ b) You must cause any work that you distribute or publish, that in
+ whole or in part contains or is derived from the Program or any
+ part thereof, to be licensed as a whole at no charge to all third
+ parties under the terms of this License.
+
+ c) If the modified program normally reads commands interactively
+ when run, you must cause it, when started running for such
+ interactive use in the most ordinary way, to print or display an
+ announcement including an appropriate copyright notice and a
+ notice that there is no warranty (or else, saying that you provide
+ a warranty) and that users may redistribute the program under
+ these conditions, and telling the user how to view a copy of this
+ License. (Exception: if the Program itself is interactive but
+ does not normally print such an announcement, your work based on
+ the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+ 3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+ a) Accompany it with the complete corresponding machine-readable
+ source code, which must be distributed under the terms of Sections
+ 1 and 2 above on a medium customarily used for software interchange; or,
+
+ b) Accompany it with a written offer, valid for at least three
+ years, to give any third party, for a charge no more than your
+ cost of physically performing source distribution, a complete
+ machine-readable copy of the corresponding source code, to be
+ distributed under the terms of Sections 1 and 2 above on a medium
+ customarily used for software interchange; or,
+
+ c) Accompany it with the information you received as to the offer
+ to distribute corresponding source code. (This alternative is
+ allowed only for noncommercial distribution and only if you
+ received the program in object code or executable form with such
+ an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it. For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable. However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+ 4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License. Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+ 5. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Program or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+ 6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+ 7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all. For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+ 8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded. In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+ 9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation. If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+ 10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission. For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this. Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+ NO WARRANTY
+
+ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 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 General Public License for more details.
+
+ You should have received a copy of the GNU General Public License along
+ with this program; if not, write to the Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+ Gnomovision version 69, Copyright (C) year name of author
+ Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+ `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs. If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.
+
View
58 Makefile
@@ -0,0 +1,58 @@
+
+VERSION=0.1.1
+UGLIFY_BIN:=./node_modules/uglify-js/bin/uglifyjs
+
+FULL:=gist-in-tumblr-full.v$(VERSION).min.js
+PARTIAL:=gist-in-tumblr-partial.v$(VERSION).min.js
+define BOILERPLATE
+echo "/** \n\
+ * gist-in-tumblr \n\
+ * \n\
+ * Copyright (C) 2012 Robert Martin <rdmartin3@gmail.com> \n\
+ * Version: $(VERSION) \n\
+ */"
+endef
+
+
+
+
+.PHONY: all full partial clean $(UGLIFY_BIN)
+
+all: full partial
+
+full: out/$(FULL)
+partial: out/$(PARTIAL)
+clean:
+ rm -rf tmp out
+
+out/$(FULL): tmp/writeCapture.min.js tmp/gist-in-tumblr.min.js
+ @mkdir -p out
+ @echo " Making $(FULL)"
+ @$(BOILERPLATE) >$@
+ @cat $^ >>$@
+
+out/$(PARTIAL): tmp/gist-in-tumblr.min.js
+ @mkdir -p out
+ @echo " Making $(PARTIAL)"
+ @$(BOILERPLATE) >$@
+ @cat $^ >>$@
+
+tmp/writeCapture.min.js: writeCapture.js
+ @mkdir -p tmp
+ @echo " Compressing $< into $@"
+ @$(UGLIFY_BIN) --no-copyright --output $@ $<
+
+tmp/gist-in-tumblr.min.js: gist-in-tumblr.js
+ @mkdir -p tmp
+ @echo " Compressing $< into $@"
+ @$(UGLIFY_BIN) --no-copyright --output $@ $<
+
+$(UGLIFY_BIN):
+ @if [ ! -x $(UGLIFY_BIN) ]; then \
+ echo; \
+ echo " Could not find 'uglifyjs' at: $(UGLIFY_BIN)"; \
+ echo " You probably want to do 'npm install uglify-js' to put it there."; \
+ echo; \
+ exit 1; \
+ fi
+
View
21 README.md
@@ -26,3 +26,24 @@ into the "Description" field:
If you already have jQuery somewhere, then you do not need the first link.
+
+Download and Build
+------------------
+
+As part of the build process, you must install
+[uglify-js](https://github.com/mishoo/UglifyJS):
+
+ $ git clone git@github.com:bobbydavid/gist-in-tumblr.git
+ $ cd gist-in-tumblr
+ $ npm install uglify-js
+ $ make
+
+The files show up in the `out/` directory.
+
+
+License
+-------
+
+Owing to writeCapture being licensed under GPL, this software is under the
+same.
+
View
16 gist-in-tumblr.js
@@ -1,10 +1,22 @@
+/**
+ * git-in-tumblr-partial.js
+ *
+ * Copyright (C) 2012 Robert Martin <rdmartin3@gmail.com>
+ *
+ */
$(document).ready(function(){
+ var bp='<div class="gist-in-tumblr" style="font-size:10px;text-align:right">'
+ + 'Embedded with '
+ + '<a href="https://github.com/bobbydavid/gist-in-tumblr">'
+ + 'gist-in-tumblr'
+ + '</a>.'
+ +'</div>';
$("p.gist a:only-child").replaceWith(
function(){
- return '<div class="gist">'+this.href+'</div>';
+ return '<div class="gist"><div>'+this.href+'</div>'+bp+'</div>';
}
);
- $("p.gist div.gist").each(function(){
+ $("p.gist div.gist div:first").each(function(){
writeCapture.html(this,
'<scr'+'ipt src="'+$(this).html()+'.js"></scr'+'ipt>'
);
View
854 writeCapture.js
@@ -0,0 +1,854 @@
+/**
+ * writeCapture.js v1.0.5
+ *
+ * @author noah <noah.sloan@gmail.com>
+ *
+ */
+(function($,global) {
+ var doc = global.document;
+ function doEvil(code) {
+ var div = doc.createElement('div');
+ doc.body.insertBefore(div,null);
+ $.replaceWith(div,'<script type="text/javascript">'+code+'</script>');
+ }
+ // ensure we have our support functions
+ $ = $ || (function(jQuery) {
+ /**
+ * @name writeCaptureSupport
+ *
+ * The support functions writeCapture needs.
+ */
+ return {
+ /**
+ * Takes an options parameter that must support the following:
+ * {
+ * url: url,
+ * type: 'GET', // all requests are GET
+ * dataType: "script", // it this is set to script, script tag injection is expected, otherwise, treat as plain text
+ * async: true/false, // local scripts are loaded synchronously by default
+ * success: callback(text,status), // must not pass a truthy 3rd parameter
+ * error: callback(xhr,status,error) // must pass truthy 3rd parameter to indicate error
+ * }
+ */
+ ajax: jQuery.ajax,
+ /**
+ * @param {String Element} selector an Element or selector
+ * @return {Element} the first element matching selector
+ */
+ $: function(s) { return jQuery(s)[0]; },
+ /**
+ * @param {String jQuery Element} selector the element to replace.
+ * writeCapture only needs the first matched element to be replaced.
+ * @param {String} content the content to replace
+ * the matched element with. script tags must be evaluated/loaded
+ * and executed if present.
+ */
+ replaceWith: function(selector,content) {
+ // jQuery 1.4? has a bug in replaceWith so we can't use it directly
+ var el = jQuery(selector)[0];
+ var next = el.nextSibling, parent = el.parentNode;
+
+ jQuery(el).remove();
+
+ if ( next ) {
+ jQuery(next).before( content );
+ } else {
+ jQuery(parent).append( content );
+ }
+ },
+
+ onLoad: function(fn) {
+ jQuery(fn);
+ },
+
+ copyAttrs: function(src,dest) {
+ var el = jQuery(dest), attrs = src.attributes;
+ for (var i = 0, len = attrs.length; i < len; i++) {
+ if(attrs[i] && attrs[i].value) {
+ try {
+ el.attr(attrs[i].name,attrs[i].value);
+ } catch(e) { }
+ }
+ }
+ }
+ };
+ })(global.jQuery);
+
+ $.copyAttrs = $.copyAttrs || function() {};
+ $.onLoad = $.onLoad || function() {
+ throw "error: autoAsync cannot be used without jQuery " +
+ "or defining writeCaptureSupport.onLoad";
+ };
+
+ // utilities
+ function each(array,fn) {
+ for(var i =0, len = array.length; i < len; i++) {
+ if( fn(array[i]) === false) return;
+ }
+ }
+ function isFunction(o) {
+ return Object.prototype.toString.call(o) === "[object Function]";
+ }
+ function isString(o) {
+ return Object.prototype.toString.call(o) === "[object String]";
+ }
+ function slice(array,start,end) {
+ return Array.prototype.slice.call(array,start || 0,end || array && array.length);
+ }
+ function any(array,fn) {
+ var result = false;
+ each(array,check);
+ function check(it) {
+ return !(result = fn(it));
+ }
+ return result;
+ }
+
+ function SubQ(parent) {
+ this._queue = [];
+ this._children = [];
+ this._parent = parent;
+ if(parent) parent._addChild(this);
+ }
+
+ SubQ.prototype = {
+ _addChild: function(q) {
+ this._children.push(q);
+ },
+ push: function (task) {
+ this._queue.push(task);
+ this._bubble('_doRun');
+ },
+ pause: function() {
+ this._bubble('_doPause');
+ },
+ resume: function() {
+ this._bubble('_doResume');
+ },
+ _bubble: function(name) {
+ var root = this;
+ while(!root[name]) {
+ root = root._parent;
+ }
+ return root[name]();
+ },
+ _next: function() {
+ if(any(this._children,runNext)) return true;
+ function runNext(c) {
+ return c._next();
+ }
+ var task = this._queue.shift();
+ if(task) {
+ task();
+ }
+ return !!task;
+ }
+ };
+
+ /**
+ * Provides a task queue for ensuring that scripts are run in order.
+ *
+ * The only public methods are push, pause and resume.
+ */
+ function Q(parent) {
+ if(parent) {
+ return new SubQ(parent);
+ }
+ SubQ.call(this);
+ this.paused = 0;
+ }
+
+ Q.prototype = (function() {
+ function f() {}
+ f.prototype = SubQ.prototype;
+ return new f();
+ })();
+
+ Q.prototype._doRun = function() {
+ if(!this.running) {
+ this.running = true;
+ try {
+ // just in case there is a bug, always resume
+ // if paused is less than 1
+ while(this.paused < 1 && this._next()){}
+ } finally {
+ this.running = false;
+ }
+ }
+ };
+ Q.prototype._doPause= function() {
+ this.paused++;
+ };
+ Q.prototype._doResume = function() {
+ this.paused--;
+ this._doRun();
+ };
+
+ // TODO unit tests...
+ function MockDocument() { }
+ MockDocument.prototype = {
+ _html: '',
+ open: function( ) {
+ this._opened = true;
+ if(this._delegate) {
+ this._delegate.open();
+ }
+ },
+ write: function(s) {
+ if(this._closed) return;
+ this._written = true;
+ if(this._delegate) {
+ this._delegate.write(s);
+ } else {
+ this._html += s;
+ }
+ },
+ writeln: function(s) {
+ this.write(s + '\n');
+ },
+ close: function( ) {
+ this._closed = true;
+ if(this._delegate) {
+ this._delegate.close();
+ }
+ },
+ copyTo: function(d) {
+ this._delegate = d;
+ d.foobar = true;
+ if(this._opened) {
+ d.open();
+ }
+ if(this._written) {
+ d.write(this._html);
+ }
+ if(this._closed) {
+ d.close();
+ }
+ }
+ };
+
+ // test for IE 6/7 issue (issue 6) that prevents us from using call
+ var canCall = (function() {
+ var f = { f: doc.getElementById };
+ try {
+ f.f.call(doc,'abc');
+ return true;
+ } catch(e) {
+ return false;
+ }
+ })();
+
+ function unProxy(elements) {
+ each(elements,function(it) {
+ var real = doc.getElementById(it.id);
+ if(!real) {
+ logError('<proxyGetElementById - finish>',
+ 'no element in writen markup with id ' + it.id);
+ return;
+ }
+
+ each(it.el.childNodes,function(it) {
+ real.appendChild(it);
+ });
+
+ if(real.contentWindow) {
+ // TODO why is the setTimeout necessary?
+ global.setTimeout(function() {
+ it.el.contentWindow.document.
+ copyTo(real.contentWindow.document);
+ },1);
+ }
+ $.copyAttrs(it.el,real);
+ });
+ }
+
+ function getOption(name,options) {
+ if(options && options[name] === false) {
+ return false;
+ }
+ return options && options[name] || self[name];
+ }
+
+ function capture(context,options) {
+ var tempEls = [],
+ proxy = getOption('proxyGetElementById',options),
+ forceLast = getOption('forceLastScriptTag',options),
+ writeOnGet = getOption('writeOnGetElementById',options),
+ immediate = getOption('immediateWrites', options),
+ state = {
+ write: doc.write,
+ writeln: doc.writeln,
+ finish: function() {},
+ out: ''
+ };
+ context.state = state;
+ doc.write = immediate ? immediateWrite : replacementWrite;
+ doc.writeln = immediate ? immediateWriteln : replacementWriteln;
+ if(proxy || writeOnGet) {
+ state.getEl = doc.getElementById;
+ doc.getElementById = getEl;
+ if(writeOnGet) {
+ findEl = writeThenGet;
+ } else {
+ findEl = makeTemp;
+ state.finish = function() {
+ unProxy(tempEls);
+ };
+ }
+ }
+ if(forceLast) {
+ state.getByTag = doc.getElementsByTagName;
+ doc.getElementsByTagName = function(name) {
+ var result = slice(canCall ? state.getByTag.call(doc,name) :
+ state.getByTag(name));
+ if(name === 'script') {
+ result.push( $.$(context.target) );
+ }
+ return result;
+ };
+ var f = state.finish;
+ state.finish = function() {
+ f();
+ doc.getElementsByTagName = state.getByTag;
+ };
+ }
+ function replacementWrite(s) {
+ state.out += s;
+ }
+ function replacementWriteln(s) {
+ state.out += s + '\n';
+ }
+ function immediateWrite(s) {
+ var target = $.$(context.target);
+ var div = doc.createElement('div');
+ target.parentNode.insertBefore(div,target);
+ $.replaceWith(div,sanitize(s));
+ }
+ function immediateWriteln(s) {
+ var target = $.$(context.target);
+ var div = doc.createElement('div');
+ target.parentNode.insertBefore(div,target);
+ $.replaceWith(div,sanitize(s) + '\n');
+ }
+ function makeTemp(id) {
+ var t = doc.createElement('div');
+ tempEls.push({id:id,el:t});
+ // mock contentWindow in case it's supposed to be an iframe
+ t.contentWindow = { document: new MockDocument() };
+ return t;
+ }
+ function writeThenGet(id) {
+ var target = $.$(context.target);
+ var div = doc.createElement('div');
+ target.parentNode.insertBefore(div,target);
+ $.replaceWith(div,state.out);
+ state.out = '';
+ return canCall ? state.getEl.call(doc,id) :
+ state.getEl(id);
+ }
+ function getEl(id) {
+ var result = canCall ? state.getEl.call(doc,id) :
+ state.getEl(id);
+ return result || findEl(id);
+ }
+ return state;
+ }
+ function uncapture(state) {
+ doc.write = state.write;
+ doc.writeln = state.writeln;
+ if(state.getEl) {
+ doc.getElementById = state.getEl;
+ }
+ return state.out;
+ }
+
+ function clean(code) {
+ // IE will execute inline scripts with <!-- (uncommented) on the first
+ // line, but will not eval() them happily
+ return code && code.replace(/^\s*<!(\[CDATA\[|--)/,'').replace(/(\]\]|--)>\s*$/,'');
+ }
+
+ function ignore() {}
+ function doLog(code,error) {
+ console.error("Error",error,"executing code:",code);
+ }
+
+ var logError = isFunction(global.console && console.error) ?
+ doLog : ignore;
+
+ function captureWrite(code,context,options) {
+ var state = capture(context,options);
+ try {
+ doEvil(clean(code));
+ } catch(e) {
+ logError(code,e);
+ } finally {
+ uncapture(state);
+ }
+ return state;
+ }
+
+ // copied from jQuery
+ function isXDomain(src) {
+ var parts = /^(\w+:)?\/\/([^\/?#]+)/.exec(src);
+ return parts && ( parts[1] && parts[1] != location.protocol || parts[2] != location.host );
+ }
+
+ function attrPattern(name) {
+ return new RegExp('[\\s\\r\\n]'+name+'[\\s\\r\\n]*=[\\s\\r\\n]*(?:(["\'])([\\s\\S]*?)\\1|([^\\s>]+))','i');
+ }
+
+ function matchAttr(name) {
+ var regex = attrPattern(name);
+ return function(tag) {
+ var match = regex.exec(tag) || [];
+ return match[2] || match[3];
+ };
+ }
+
+ var SCRIPT_TAGS = /(<script[^>]*>)([\s\S]*?)<\/script>/ig,
+ SCRIPT_2 = /<script[^>]*\/>/ig,
+ SRC_REGEX = attrPattern('src'),
+ SRC_ATTR = matchAttr('src'),
+ TYPE_ATTR = matchAttr('type'),
+ LANG_ATTR = matchAttr('language'),
+ GLOBAL = "__document_write_ajax_callbacks__",
+ DIV_PREFIX = "__document_write_ajax_div-",
+ TEMPLATE = "window['"+GLOBAL+"']['%d']();",
+ callbacks = global[GLOBAL] = {},
+ TEMPLATE_TAG = '<script type="text/javascript">' + TEMPLATE + '</script>',
+ global_id = 0;
+ function nextId() {
+ return (++global_id).toString();
+ }
+
+ function normalizeOptions(options,callback) {
+ var done;
+ if(isFunction(options)) {
+ done = options;
+ options = null;
+ }
+ options = options || {};
+ done = done || options && options.done;
+ options.done = callback ? function() {
+ callback(done);
+ } : done;
+ return options;
+ }
+
+ // The global Q synchronizes all sanitize operations.
+ // The only time this synchronization is really necessary is when two or
+ // more consecutive sanitize operations make async requests. e.g.,
+ // sanitize call A requests foo, then sanitize B is called and bar is
+ // requested. document.write was replaced by B, so if A returns first, the
+ // content will be captured by B, then when B returns, document.write will
+ // be the original document.write, probably messing up the page. At the
+ // very least, A will get nothing and B will get the wrong content.
+ var GLOBAL_Q = new Q();
+
+ var debug = [];
+ var logDebug = window._debugWriteCapture ? function() {} :
+ function (type,src,data) {
+ debug.push({type:type,src:src,data:data});
+ };
+
+ var logString = window._debugWriteCapture ? function() {} :
+ function () {
+ debug.push(arguments);
+ };
+
+ function newCallback(fn) {
+ var id = nextId();
+ callbacks[id] = function() {
+ fn();
+ delete callbacks[id];
+ };
+ return id;
+ }
+
+ function newCallbackTag(fn) {
+ return TEMPLATE_TAG.replace(/%d/,newCallback(fn));
+ }
+
+ /**
+ * Sanitize the given HTML so that the scripts will execute with a modified
+ * document.write that will capture the output and append it in the
+ * appropriate location.
+ *
+ * @param {String} html
+ * @param {Object Function} [options]
+ * @param {Function} [options.done] Called when all the scripts in the
+ * sanitized HTML have run.
+ * @param {boolean} [options.asyncAll] If true, scripts loaded from the
+ * same domain will be loaded asynchronously. This can improve UI
+ * responsiveness, but will delay completion of the scripts and may
+ * cause problems with some scripts, so it defaults to false.
+ */
+ function sanitize(html,options,parentQ,parentContext) {
+ // each HTML fragment has it's own queue
+ var queue = parentQ && new Q(parentQ) || GLOBAL_Q;
+ options = normalizeOptions(options);
+ var done = getOption('done',options);
+ var doneHtml = '';
+
+ var fixUrls = getOption('fixUrls',options);
+ if(!isFunction(fixUrls)) {
+ fixUrls = function(src) { return src; };
+ }
+
+ // if a done callback is passed, append a script to call it
+ if(isFunction(done)) {
+ // no need to proxy the call to done, so we can append this to the
+ // filtered HTML
+ doneHtml = newCallbackTag(function() {
+ queue.push(done);
+ });
+ }
+ // for each tag, generate a function to load and eval the code and queue
+ // themselves
+ return html.replace(SCRIPT_TAGS,proxyTag).replace(SCRIPT_2,proxyBodyless) + doneHtml;
+ function proxyBodyless(tag) {
+ // hack in a bodyless tag...
+ return proxyTag(tag,tag.substring(0,tag.length-2)+'>','');
+ }
+ function proxyTag(element,openTag,code) {
+ var src = SRC_ATTR(openTag),
+ type = TYPE_ATTR(openTag) || '',
+ lang = LANG_ATTR(openTag) || '',
+ isJs = (!type && !lang) || // no type or lang assumes JS
+ type.toLowerCase().indexOf('javascript') !== -1 ||
+ lang.toLowerCase().indexOf('javascript') !== -1;
+
+ logDebug('replace',src,element);
+
+ if(!isJs) {
+ return element;
+ }
+
+ var id = newCallback(queueScript), divId = DIV_PREFIX + id,
+ run, context = { target: '#' + divId, parent: parentContext };
+
+ function queueScript() {
+ queue.push(run);
+ }
+
+ if(src) {
+ // fix for the inline script that writes a script tag with encoded
+ // ampersands hack (more comon than you'd think)
+ src = fixUrls(src);
+
+ openTag = openTag.replace(SRC_REGEX,'');
+ if(isXDomain(src)) {
+ // will load async via script tag injection (eval()'d on
+ // it's own)
+ run = loadXDomain;
+ } else {
+ // can be loaded then eval()d
+ if(getOption('asyncAll',options)) {
+ run = loadAsync();
+ } else {
+ run = loadSync;
+ }
+ }
+ } else {
+ // just eval code and be done
+ run = runInline;
+
+ }
+ function runInline() {
+ captureHtml(code);
+ }
+ function loadSync() {
+ $.ajax({
+ url: src,
+ type: 'GET',
+ dataType: 'text',
+ async: false,
+ success: function(html) {
+ captureHtml(html);
+ }
+ });
+ }
+ function logAjaxError(xhr,status,error) {
+ logError("<XHR for "+src+">",error);
+ queue.resume();
+ }
+ function setupResume() {
+ return newCallbackTag(function() {
+ queue.resume();
+ });
+ }
+ function loadAsync() {
+ var ready, scriptText;
+ function captureAndResume(script,status) {
+ if(!ready) {
+ // loaded before queue run, cache text
+ scriptText = script;
+ return;
+ }
+ try {
+ captureHtml(script, setupResume());
+ } catch(e) {
+ logError(script,e);
+ }
+ }
+ // start loading the text
+ $.ajax({
+ url: src,
+ type: 'GET',
+ dataType: 'text',
+ async: true,
+ success: captureAndResume,
+ error: logAjaxError
+ });
+ return function() {
+ ready = true;
+ if(scriptText) {
+ // already loaded, so don't pause the queue and don't resume!
+ captureHtml(scriptText);
+ } else {
+ queue.pause();
+ }
+ };
+ }
+ function loadXDomain(cb) {
+ var state = capture(context,options);
+ queue.pause(); // pause the queue while the script loads
+ logDebug('pause',src);
+
+ doXDomainLoad(context.target,src,captureAndResume);
+
+ function captureAndResume(xhr,st,error) {
+ logDebug('out', src, state.out);
+ html(uncapture(state),
+ newCallbackTag(state.finish) + setupResume());
+ logDebug('resume',src);
+ }
+ }
+ function captureHtml(script, cb) {
+ var state = captureWrite(script,context,options);
+ cb = newCallbackTag(state.finish) + (cb || '');
+ html(state.out,cb);
+ }
+ function safeOpts(options) {
+ var copy = {};
+ for(var i in options) {
+ if(options.hasOwnProperty(i)) {
+ copy[i] = options[i];
+ }
+ }
+ delete copy.done;
+ return copy;
+ }
+ function html(markup,cb) {
+ $.replaceWith(context.target,sanitize(markup,safeOpts(options),queue,context) + (cb || ''));
+ }
+ return '<div style="display: none" id="'+divId+'"></div>' + openTag +
+ TEMPLATE.replace(/%d/,id) + '</script>';
+ }
+ }
+
+ function doXDomainLoad(target,url,success) {
+ // TODO what about scripts that fail to load? bad url, etc.?
+ var script = document.createElement("script");
+ script.src = url;
+
+ target = $.$(target);
+
+ var done = false, parent = target.parentNode;
+
+ // Attach handlers for all browsers
+ script.onload = script.onreadystatechange = function(){
+ if ( !done && (!this.readyState ||
+ this.readyState == "loaded" || this.readyState == "complete") ) {
+ done = true;
+ success();
+
+ // Handle memory leak in IE
+ script.onload = script.onreadystatechange = null;
+ parent.removeChild( script );
+ }
+ };
+
+ parent.insertBefore(script,target);
+ }
+
+ /**
+ * Sanitizes all the given fragments and calls action with the HTML.
+ * The next fragment is not started until the previous fragment
+ * has executed completely.
+ *
+ * @param {Array} fragments array of objects like this:
+ * {
+ * html: '<p>My html with a <script...',
+ * action: function(safeHtml,frag) { doSomethingToInject(safeHtml); },
+ * options: {} // optional, see #sanitize
+ * }
+ * Where frag is the object.
+ *
+ * @param {Function} [done] Optional. Called when all fragments are done.
+ */
+ function sanitizeSerial(fragments,done) {
+ // create a queue for these fragments and make it the parent of each
+ // sanitize call
+ var queue = GLOBAL_Q;
+ each(fragments, function (f) {
+ queue.push(run);
+ function run() {
+ f.action(sanitize(f.html,f.options,queue),f);
+ }
+ });
+ if(done) {
+ queue.push(done);
+ }
+ }
+
+ function findLastChild(el) {
+ var n = el;
+ while(n && n.nodeType === 1) {
+ el = n;
+ n = n.lastChild;
+ // last child may not be an element
+ while(n && n.nodeType !== 1) {
+ n = n.previousSibling;
+ }
+ }
+ return el;
+ }
+
+ /**
+ * Experimental - automatically captures document.write calls and
+ * defers them untill after page load.
+ * @param {Function} [done] optional callback for when all the
+ * captured content has been loaded.
+ */
+ function autoCapture(done) {
+ var write = doc.write,
+ writeln = doc.writeln,
+ currentScript,
+ autoQ = [];
+ doc.writeln = function(s) {
+ doc.write(s+'\n');
+ };
+ var state;
+ doc.write = function(s) {
+ var scriptEl = findLastChild(doc.body);
+ if(scriptEl !== currentScript) {
+ currentScript = scriptEl;
+ autoQ.push(state = {
+ el: scriptEl,
+ out: []
+ });
+ }
+ state.out.push(s);
+ };
+ $.onLoad(function() {
+ // for each script, append a div immediately after it,
+ // then replace the div with the sanitized output
+ var el, div, out, safe, doneFn;
+ done = normalizeOptions(done);
+ doneFn = done.done;
+ done.done = function() {
+ doc.write = write;
+ doc.writeln = writeln;
+ if(doneFn) doneFn();
+ };
+ for(var i = 0, len = autoQ.length; i < len; i++ ) {
+ el = autoQ[i].el;
+ div = doc.createElement('div');
+ el.parentNode.insertBefore( div, el.nextSibling );
+ out = autoQ[i].out.join('');
+ // only the last snippet gets passed the callback
+ safe = len - i === 1 ? sanitize(out,done) : sanitize(out);
+ $.replaceWith(div,safe);
+ }
+ });
+ }
+
+ function extsrc(cb) {
+ var scripts = document.getElementsByTagName('script'),
+ s,o, html, q, ext, async, doneCount = 0,
+ done = cb ? newCallbackTag(function() {
+ if(++doneCount >= exts.length) {
+ cb();
+ }
+ }) : '',
+ exts = [];
+
+ for(var i = 0, len = scripts.length; i < len; i++) {
+ s = scripts[i];
+ ext = s.getAttribute('extsrc');
+ async = s.getAttribute('asyncsrc');
+ if(ext || async) {
+ exts.push({ext:ext,async:async,s:s});
+ }
+ }
+
+ for(i = 0, len = exts.length; i < len; i++) {
+ o = exts[i];
+ if(o.ext) {
+ html = '<script type="text/javascript" src="'+o.ext+'"> </script>';
+ $.replaceWith(o.s,sanitize(html) + done);
+ } else if(o.async) {
+ html = '<script type="text/javascript" src="'+o.async+'"> </script>';
+ $.replaceWith(o.s,sanitize(html,{asyncAll:true}, new Q()) + done);
+ }
+ }
+ }
+
+ var name = 'writeCapture';
+ var self = global[name] = {
+ _original: global[name],
+ support: $,
+ /**
+ */
+ fixUrls: function(src) {
+ return src.replace(/&amp;/g,'&');
+ },
+ noConflict: function() {
+ global[name] = this._original;
+ return this;
+ },
+ debug: debug,
+ /**
+ * Enables a fun little hack that replaces document.getElementById and
+ * creates temporary elements for the calling code to use.
+ */
+ proxyGetElementById: false,
+ // this is only for testing, please don't use these
+ _forTest: {
+ Q: Q,
+ GLOBAL_Q: GLOBAL_Q,
+ $: $,
+ matchAttr: matchAttr,
+ slice: slice,
+ capture: capture,
+ uncapture: uncapture,
+ captureWrite: captureWrite
+ },
+ replaceWith: function(selector,content,options) {
+ $.replaceWith(selector,sanitize(content,options));
+ },
+ html: function(selector,content,options) {
+ var el = $.$(selector);
+ el.innerHTML ='<span/>';
+ $.replaceWith(el.firstChild,sanitize(content,options));
+ },
+ load: function(selector,url,options) {
+ $.ajax({
+ url: url,
+ dataType: 'text',
+ type: "GET",
+ success: function(content) {
+ self.html(selector,content,options);
+ }
+ });
+ },
+ extsrc: extsrc,
+ autoAsync: autoCapture,
+ sanitize: sanitize,
+ sanitizeSerial: sanitizeSerial
+ };
+
+})(this.writeCaptureSupport,this);
+

No commit comments for this range

Something went wrong with that request. Please try again.