Refactor comment-style

Author: wooorm

lib/attribute.js

@@ -32,17 +32,17 @@ function match(query, node) {
   return true
 }
 
-/* [attr] */
+// [attr]
 function exists(query, node) {
   return has(node, query.name)
 }
 
-/* [attr=value] */
+// [attr=value]
 function exact(query, node) {
   return has(node, query.name) && String(node[query.name]) === query.value
 }
 
-/* [attr~=value] */
+// [attr~=value]
 function containsArray(query, node) {
   var value
 
@@ -65,7 +65,7 @@ function containsArray(query, node) {
   return false
 }
 
-/* [attr^=value] */
+// [attr^=value]
 function begins(query, node) {
   var value = node[query.name]
 
@@ -75,7 +75,7 @@ function begins(query, node) {
   )
 }
 
-/* [attr$=value] */
+// [attr$=value]
 function ends(query, node) {
   var value = node[query.name]
 
@@ -85,7 +85,7 @@ function ends(query, node) {
   )
 }
 
-/* [attr*=value] */
+// [attr*=value]
 function containsString(query, node) {
   var value = node[query.name]
   return typeof value === 'string' && value.indexOf(query.value) !== -1

lib/nest.js

@@ -11,8 +11,8 @@ var handle = zwitch('nestingOperator')
 var handlers = handle.handlers
 
 handle.unknown = unknownNesting
-handle.invalid = topScan /* `undefined` is the top query selector. */
-handlers.null = descendant /* `null` is the descendant combinator. */
+handle.invalid = topScan // `undefined` is the top query selector.
+handlers.null = descendant // `null` is the descendant combinator.
 handlers['>'] = child
 handlers['+'] = adjacentSibling
 handlers['~'] = generalSibling
@@ -94,7 +94,7 @@ function generalSibling(query, node, index, parent, state) {
     .done()
 }
 
-/* Handles typeIndex and typeCount properties for every walker. */
+// Handles typeIndex and typeCount properties for every walker.
 function walkIterator(query, parent, state) {
   var nodes = parent.children
   var typeIndex = state.index ? createTypeIndex() : null
@@ -149,7 +149,7 @@ function walkIterator(query, parent, state) {
       pushNode()
     }
 
-    /* Stop if we’re looking for one node and it’s already found. */
+    // Stop if we’re looking for one node and it’s already found.
     if (state.one && state.found) {
       return this
     }
@@ -203,7 +203,7 @@ function createTypeIndex() {
       counts[type] = 0
     }
 
-    /* Note: ++ is intended to be postfixed! */
+    // Note: ++ is intended to be postfixed!
     return counts[type]++
   }