- minor cosmetics. bump minor version for 'form' checks

package.json

@@ -1,7 +1,7 @@
 {
     "name": "qwery"
   , "description": "blazing fast CSS3 query selector engine"
-  , "version": "3.2.0"
+  , "version": "3.2.2"
   , "homepage": "https://github.com/ded/qwery"
   , "author": "Dustin Diaz <dustin@dustindiaz.com> (http://dustindiaz.com)"
   , "contributors": [

qwery.js

@@ -221,22 +221,21 @@
     return (cand = crawl(el, tokens.length - 1, el)) && (!root || isAncestor(cand, root))
   }
 
-  function isNode(el) {
-    return el && typeof el === 'object' && el.nodeType && (el.nodeType == 1 || el.nodeType == 9)
+  function isNode(el, t) {
+    return el && typeof el === 'object' && (t = el.nodeType) && (t == 1 || t == 9)
   }
 
   function uniq(ar) {
-    var r = [], i = 0, j = 0, k, item, inIt
-    for (; item = ar[i]; ++i) {
-      inIt = false
-      for (k = 0; k < r.length; ++k) {
-        if (r[k] === item) {
-          inIt = true; break
+    var a = [], i, j
+    o: for (i = 0; i < ar.length; ++i) {
+      for (j = 0; j < a.length; ++j) {
+        if (a[j] == ar[i]) {
+          continue o
         }
       }
-      if (!inIt) r[j++] = item
+      a[a.length] = ar[i]
     }
-    return r
+    return a
   }
 
   function arrayLike(o) {
@@ -246,7 +245,7 @@
   function normalizeRoot(root) {
     if (!root) return doc
     if (typeof root == 'string') return qwery(root)[0]
-    if (arrayLike(root)) return root[0]
+    if (!root.nodeType && arrayLike(root)) return root[0]
     return root
   }
 

src/qwery.js

@@ -214,22 +214,21 @@
     return (cand = crawl(el, tokens.length - 1, el)) && (!root || isAncestor(cand, root))
   }
 
-  function isNode(el) {
-    return el && typeof el === 'object' && el.nodeType && (el.nodeType == 1 || el.nodeType == 9)
+  function isNode(el, t) {
+    return el && typeof el === 'object' && (t = el.nodeType) && (t == 1 || t == 9)
   }
 
   function uniq(ar) {
-    var r = [], i = 0, j = 0, k, item, inIt
-    for (; item = ar[i]; ++i) {
-      inIt = false
-      for (k = 0; k < r.length; ++k) {
-        if (r[k] === item) {
-          inIt = true; break
+    var a = [], i, j
+    o: for (i = 0; i < ar.length; ++i) {
+      for (j = 0; j < a.length; ++j) {
+        if (a[j] == ar[i]) {
+          continue o
         }
       }
-      if (!inIt) r[j++] = item
+      a[a.length] = ar[i]
     }
-    return r
+    return a
   }
 
   function arrayLike(o) {