diff --git a/README.markdown b/README.markdown index 823bc41..41d412e 100644 --- a/README.markdown +++ b/README.markdown @@ -1,4 +1,4 @@ -nut 0.3.0 +nut 0.3.1 ========= Nut is a concise query selector engine that just allows you to do extremely simple queries. diff --git a/bower.json b/bower.json index 53208c6..d81cd56 100644 --- a/bower.json +++ b/bower.json @@ -1,6 +1,6 @@ { "name": "pyrsmk/nut", - "version": "0.3.0", + "version": "0.3.1", "main": "src/nut.js", "description": "The concise CSS selector engine", "license": "MIT", diff --git a/nut-0.3.0.min.js b/nut-0.3.0.min.js deleted file mode 100644 index 04fb297..0000000 --- a/nut-0.3.0.min.js +++ /dev/null @@ -1 +0,0 @@ -(function(def){if(typeof module!="undefined"){module.exports=def}else{this.nut=def}})(function(){var doc=document,firstChild="firstChild",nextSibling="nextSibling",getElementsByClassName="getElementsByClassName",length="length",getNodesFromIdSelector=function(selector,context){var node=doc.getElementById(selector);if(!node){return[]}else{return[node]}},getNodesByClassName=function(name,context){var node=context[firstChild],nodes=[],elements;if(node){do{if(node.nodeType==1){if(node.className&&node.className.match("\\b"+name+"\\b")){nodes.push(node)}if((elements=getNodesByClassName(name,node))[length]){nodes=nodes.concat(elements)}}}while(node=node[nextSibling])}return nodes},getNodesFromClassSelector=function(selector,context){if(context[getElementsByClassName]){return context[getElementsByClassName](selector)}else{return getNodesByClassName(selector,context)}},getNodesFromTagSelector=function(selector,context){return context.getElementsByTagName(selector)};return function(selectors,context){if(!context){context=doc}if(typeof context=="object"&&context.pop){context=context[0]}var local_contexts,future_local_contexts,selector,elements,nodes=[],j,k,l,m,n,o,getNodesFromSelector;selectors=selectors.split(",");n=-1;while(selector=selectors[++n]){selectors[n]=selector.split(/\s+/)}j=selectors[length];while(j){local_contexts=[context];k=-1;l=selectors[--j][length];while(++k