@qooxdoo/framework 7.0.0-beta.1 → 7.0.0-beta.10

package/source/class/qx/module/Traversing.js

@@ -28,14 +28,13 @@
  * @group (Core)
  */
 qx.Bootstrap.define("qx.module.Traversing", {
-  statics :
-  {
+  statics: {
     /**
      * String attributes used to determine if two DOM nodes are equal
      * as defined in <a href="http://www.w3.org/TR/DOM-Level-3-Core/core.html#Node3-isEqualNode">
      * DOM Level 3</a>
      */
-    EQUALITY_ATTRIBUTES : [
+    EQUALITY_ATTRIBUTES: [
       "nodeType",
       "nodeName",
       "localName",
@@ -44,7 +43,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       "nodeValue"
     ],
 
-
     /**
      * Internal helper for getAncestors and getAncestorsUntil
      *
@@ -55,9 +53,9 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @return {qxWeb} Collection containing the ancestor elements
      * @internal
      */
-    __getAncestors : function(selector, filter) {
+    __getAncestors(selector, filter) {
       var ancestors = [];
-      for (var i=0; i < this.length; i++) {
+      for (var i = 0; i < this.length; i++) {
         var parent = qx.dom.Element.getParentElement(this[i]);
         while (parent) {
           var found = [parent];
@@ -74,8 +72,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return qxWeb.$init(ancestors, qxWeb);
     },
 
-
-
     /**
      * Helper which returns the element from the given argument. If it's a collection,
      * it returns it's first child. If it's a string, it tries to use the string
@@ -84,7 +80,7 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @return {Node|var} If a node can be extracted, the node element will be return.
      *   If not, at given argument will be returned.
      */
-    __getElementFromArgument : function(arg) {
+    __getElementFromArgument(arg) {
       if (arg instanceof qxWeb) {
         return arg[0];
       } else if (qx.Bootstrap.isString(arg)) {
@@ -93,14 +89,12 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return arg;
     },
 
-
-
     /**
      * Helper that attempts to convert the given argument into a DOM node
      * @param arg {var} object to convert
      * @return {Node|null} DOM node or null if the conversion failed
      */
-    __getNodeFromArgument : function(arg) {
+    __getNodeFromArgument(arg) {
       if (typeof arg == "string") {
         arg = qxWeb(arg);
       }
@@ -112,7 +106,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return qxWeb.isNode(arg) ? arg : null;
     },
 
-
     /**
      * Returns a map containing the given DOM node's attribute names
      * and values
@@ -120,7 +113,7 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param node {Node} DOM node
      * @return {Map} Map of attribute names/values
      */
-    __getAttributes : function(node) {
+    __getAttributes(node) {
       var attributes = {};
 
       for (var attr in node.attributes) {
@@ -135,7 +128,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return attributes;
     },
 
-
     /**
      * Helper function that iterates over a set of items and applies the given
      * qx.dom.Hierarchy method to each entry, storing the results in a new Array.
@@ -150,12 +142,11 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @return {Array} Result array
      * @internal
      */
-    __hierarchyHelper : function(collection, method, selector)
-    {
+    __hierarchyHelper(collection, method, selector) {
       // Iterate ourself, as we want to directly combine the result
       var all = [];
       var Hierarchy = qx.dom.Hierarchy;
-      for (var i=0, l=collection.length; i<l; i++) {
+      for (var i = 0, l = collection.length; i < l; i++) {
         all.push.apply(all, Hierarchy[method](collection[i]));
       }
 
@@ -170,7 +161,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return ret;
     },
 
-
     /**
      * Checks if the given object is a DOM element
      *
@@ -178,11 +168,12 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {Object|String|qxWeb} Object to check
      * @return {Boolean} <code>true</code> if the object is a DOM element
      */
-    isElement : function(selector) {
-      return qx.dom.Node.isElement(qx.module.Traversing.__getElementFromArgument(selector));
+    isElement(selector) {
+      return qx.dom.Node.isElement(
+        qx.module.Traversing.__getElementFromArgument(selector)
+      );
     },
 
-
     /**
      * Checks if the given object is a DOM node
      *
@@ -190,11 +181,12 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {Node|String|qxWeb} Object to check
      * @return {Boolean} <code>true</code> if the object is a DOM node
      */
-    isNode : function(selector) {
-      return qx.dom.Node.isNode(qx.module.Traversing.__getElementFromArgument(selector));
+    isNode(selector) {
+      return qx.dom.Node.isNode(
+        qx.module.Traversing.__getElementFromArgument(selector)
+      );
     },
 
-
     /**
      * Whether the node has the given node name
      *
@@ -203,11 +195,13 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param  nodeName {String} the node name to check for
      * @return {Boolean} <code>true</code> if the node has the given name
      */
-    isNodeName : function(selector, nodeName) {
-      return qx.dom.Node.isNodeName(qx.module.Traversing.__getElementFromArgument(selector), nodeName);
+    isNodeName(selector, nodeName) {
+      return qx.dom.Node.isNodeName(
+        qx.module.Traversing.__getElementFromArgument(selector),
+        nodeName
+      );
     },
 
-
     /**
      * Checks if the given object is a DOM document object
      *
@@ -216,14 +210,13 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * collection, isDocument will check the first item.
      * @return {Boolean} <code>true</code> if the object is a DOM document
      */
-    isDocument : function(node) {
+    isDocument(node) {
       if (node instanceof qxWeb) {
         node = node[0];
       }
       return qx.dom.Node.isDocument(node);
     },
 
-
     /**
      * Checks if the given object is a DOM document fragment object
      *
@@ -232,14 +225,13 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * collection, isDocumentFragment will check the first item.
      * @return {Boolean} <code>true</code> if the object is a DOM document fragment
      */
-    isDocumentFragment : function(node) {
+    isDocumentFragment(node) {
       if (node instanceof qxWeb) {
         node = node[0];
       }
       return qx.dom.Node.isDocumentFragment(node);
     },
 
-
     /**
      * Returns the DOM2 <code>defaultView</code> (window) for the given node.
      *
@@ -247,8 +239,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {Node|Document|Window|String|qxWeb} Node to inspect
      * @return {Window} the <code>defaultView</code> for the given node
      */
-    getWindow : function(selector) {
-      return qx.dom.Node.getWindow(qx.module.Traversing.__getElementFromArgument(selector));
+    getWindow(selector) {
+      return qx.dom.Node.getWindow(
+        qx.module.Traversing.__getElementFromArgument(selector)
+      );
     },
 
     /**
@@ -258,11 +252,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param obj {Object} the object to be tested
      * @return {Boolean} <code>true</code> if the object is a textNode
      */
-    isTextNode : function(obj) {
+    isTextNode(obj) {
       return qx.dom.Node.isText(obj);
     },
 
-
     /**
      * Check whether the given object is a browser window object.
      *
@@ -271,14 +264,13 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * is a qxWeb collection, isDocument will check the first item.
      * @return {Boolean} <code>true</code> if the object is a window object
      */
-    isWindow : function(obj) {
+    isWindow(obj) {
       if (obj instanceof qxWeb) {
         obj = obj[0];
       }
       return qx.dom.Node.isWindow(obj);
     },
 
-
     /**
      * Returns the owner document of the given node
      *
@@ -286,8 +278,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {Node|String|qxWeb} Node to get the document for
      * @return {Document|null} The document of the given DOM node
      */
-    getDocument : function(selector) {
-      return qx.dom.Node.getDocument(qx.module.Traversing.__getElementFromArgument(selector));
+    getDocument(selector) {
+      return qx.dom.Node.getDocument(
+        qx.module.Traversing.__getElementFromArgument(selector)
+      );
     },
 
     /**
@@ -297,8 +291,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {Node|String|qxWeb} DOM Node
      * @return {String} node name
      */
-    getNodeName : function(selector) {
-      return qx.dom.Node.getName(qx.module.Traversing.__getElementFromArgument(selector));
+    getNodeName(selector) {
+      return qx.dom.Node.getName(
+        qx.module.Traversing.__getElementFromArgument(selector)
+      );
     },
 
     /**
@@ -311,8 +307,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @return {String} the joined text content of the given node or null if not
      * appropriate.
      */
-    getNodeText : function(selector) {
-      return qx.dom.Node.getText(qx.module.Traversing.__getElementFromArgument(selector));
+    getNodeText(selector) {
+      return qx.dom.Node.getText(
+        qx.module.Traversing.__getElementFromArgument(selector)
+      );
     },
 
     /**
@@ -322,11 +320,12 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {Node|String|qxWeb} the node to check
      * @return {Boolean} <code>true</code> if the node is a block node
      */
-    isBlockNode : function(selector) {
-      return qx.dom.Node.isBlockNode(qx.module.Traversing.__getElementFromArgument(selector));
+    isBlockNode(selector) {
+      return qx.dom.Node.isBlockNode(
+        qx.module.Traversing.__getElementFromArgument(selector)
+      );
     },
 
-
     /**
      * Determines if two DOM nodes are equal as defined in the
      * <a href="http://www.w3.org/TR/DOM-Level-3-Core/core.html#Node3-isEqualNode">DOM Level 3 isEqualNode spec</a>.
@@ -337,7 +336,7 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param node2 {String|Element|Element[]|qxWeb} second object to compare
      * @return {Boolean} <code>true</code> if the nodes are equal
      */
-    equalNodes : function(node1, node2) {
+    equalNodes(node1, node2) {
       node1 = qx.module.Traversing.__getNodeFromArgument(node1);
       node2 = qx.module.Traversing.__getNodeFromArgument(node2);
 
@@ -354,21 +353,25 @@ qx.Bootstrap.define("qx.module.Traversing", {
 
         // quick attributes length check
         var hasAttributes = node1.attributes && node2.attributes;
-        if (hasAttributes &&
-            node1.attributes.length !== node2.attributes.length) {
+        if (
+          hasAttributes &&
+          node1.attributes.length !== node2.attributes.length
+        ) {
           return false;
         }
 
         var hasChildNodes = node1.childNodes && node2.childNodes;
         // quick childNodes length check
-        if (hasChildNodes &&
-            node1.childNodes.length !== node2.childNodes.length) {
+        if (
+          hasChildNodes &&
+          node1.childNodes.length !== node2.childNodes.length
+        ) {
           return false;
         }
 
         // string attribute check
         var domAttributes = qx.module.Traversing.EQUALITY_ATTRIBUTES;
-        for (var i=0, l=domAttributes.length; i<l; i++) {
+        for (var i = 0, l = domAttributes.length; i < l; i++) {
           var domAttrib = domAttributes[i];
           if (node1[domAttrib] !== node2[domAttrib]) {
             return false;
@@ -388,7 +391,7 @@ qx.Bootstrap.define("qx.module.Traversing", {
 
         // child nodes
         if (hasChildNodes) {
-          for (var j=0, m=node1.childNodes.length; j<m; j++) {
+          for (var j = 0, m = node1.childNodes.length; j < m; j++) {
             var child1 = node1.childNodes[j];
             var child2 = node2.childNodes[j];
             if (!qx.module.Traversing.equalNodes(child1, child2)) {
@@ -402,11 +405,8 @@ qx.Bootstrap.define("qx.module.Traversing", {
     }
   },
 
-
-  members :
-  {
-
-    __getAncestors : null,
+  members: {
+    __getAncestors: null,
 
     /**
      * Adds an element to the collection
@@ -416,21 +416,21 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * If a collection is given, only the first element will be added
      * @return {qxWeb} The collection for chaining
      */
-    add : function(el) {
+    add(el) {
       if (el instanceof qxWeb) {
         el = el[0];
       }
-      if (qx.module.Traversing.isElement(el) ||
-          qx.module.Traversing.isDocument(el) ||
-          qx.module.Traversing.isWindow(el) ||
-          qx.module.Traversing.isDocumentFragment(el))
-      {
+      if (
+        qx.module.Traversing.isElement(el) ||
+        qx.module.Traversing.isDocument(el) ||
+        qx.module.Traversing.isWindow(el) ||
+        qx.module.Traversing.isDocumentFragment(el)
+      ) {
         this.push(el);
       }
       return this;
     },
 
-
     /**
      * Gets a set of elements containing all of the unique immediate children of
      * each of the matched set of elements.
@@ -441,9 +441,9 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?null} Optional selector to match
      * @return {qxWeb} Collection containing the child elements
      */
-    getChildren : function(selector) {
+    getChildren(selector) {
       var children = [];
-      for (var i=0; i < this.length; i++) {
+      for (var i = 0; i < this.length; i++) {
         var found = qx.dom.Hierarchy.getChildElements(this[i]);
         if (selector) {
           found = qx.bom.Selector.matches(selector, found);
@@ -453,7 +453,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return qxWeb.$init(children, qxWeb);
     },
 
-
     /**
      * Executes the provided callback function once for each item in the
      * collection.
@@ -467,14 +466,13 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param ctx {Object} Context object
      * @return {qxWeb} The collection for chaining
      */
-    forEach : function(fn, ctx) {
-      for (var i=0; i < this.length; i++) {
+    forEach(fn, ctx) {
+      for (var i = 0; i < this.length; i++) {
         fn.call(ctx, this[i], i, this);
       }
       return this;
     },
 
-
     /**
      * Gets a set of elements containing the parent of each element in the
      * collection.
@@ -485,9 +483,9 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?null} Optional selector to match
      * @return {qxWeb} Collection containing the parent elements
      */
-    getParents : function(selector) {
+    getParents(selector) {
       var parents = [];
-      for (var i=0; i < this.length; i++) {
+      for (var i = 0; i < this.length; i++) {
         var found = qx.dom.Element.getParentElement(this[i]);
         if (selector) {
           found = qx.bom.Selector.matches(selector, [found]);
@@ -497,25 +495,26 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return qxWeb.$init(parents, qxWeb);
     },
 
-
     /**
-    * Checks if any element of the current collection is child of any element of a given
-    * parent collection.
-    *
-    * @attach{qxWeb}
-    * @param parent {qxWeb | String} Collection or selector of the parent collection to check.
-    * @return {Boolean} Returns true if at least one element of the current collection is child of the parent collection
-    *
-    */
-    isChildOf : function(parent){
-      if(this.length == 0){
+     * Checks if any element of the current collection is child of any element of a given
+     * parent collection.
+     *
+     * @attach{qxWeb}
+     * @param parent {qxWeb | String} Collection or selector of the parent collection to check.
+     * @return {Boolean} Returns true if at least one element of the current collection is child of the parent collection
+     *
+     */
+    isChildOf(parent) {
+      if (this.length == 0) {
         return false;
       }
-      var ancestors = null, parentCollection = qxWeb(parent), isChildOf = false;
-      for(var i = 0, l = this.length; i < l && !isChildOf; i++){
+      var ancestors = null,
+        parentCollection = qxWeb(parent),
+        isChildOf = false;
+      for (var i = 0, l = this.length; i < l && !isChildOf; i++) {
         ancestors = qxWeb(this[i]).getAncestors();
-        for(var j = 0, len = parentCollection.length; j < len; j++){
-          if(ancestors.indexOf(parentCollection[j]) != -1){
+        for (var j = 0, len = parentCollection.length; j < len; j++) {
+          if (ancestors.indexOf(parentCollection[j]) != -1) {
             isChildOf = true;
             break;
           }
@@ -524,7 +523,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return isChildOf;
     },
 
-
     /**
      * Gets a set of elements containing all ancestors of each element in the
      * collection.
@@ -535,11 +533,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param filter {String?null} Optional selector to match
      * @return {qxWeb} Collection containing the ancestor elements
      */
-    getAncestors : function(filter) {
+    getAncestors(filter) {
       return this.__getAncestors(null, filter);
     },
 
-
     /**
      * Gets a set of elements containing all ancestors of each element in the
      * collection, up to (but not including) the element matched by the provided
@@ -553,11 +550,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param filter {String?null} Optional selector to match
      * @return {qxWeb} Collection containing the ancestor elements
      */
-    getAncestorsUntil : function(selector, filter) {
+    getAncestorsUntil(selector, filter) {
       return this.__getAncestors(selector, filter);
     },
 
-
     /**
      * Gets a set containing the closest matching ancestor for each item in
      * the collection.
@@ -568,29 +564,28 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String} Selector expression to match
      * @return {qxWeb} New collection containing the closest matching ancestors
      */
-    getClosest : function(selector) {
+    getClosest(selector) {
       var closest = [];
 
-      var findClosest = function(current) {
+      var findClosest = function (current) {
         var found = qx.bom.Selector.matches(selector, current);
         if (found.length) {
           closest.push(found[0]);
         } else {
           current = current.getParents(); // One up
-          if(current[0] && current[0].parentNode) {
+          if (current[0] && current[0].parentNode) {
             findClosest(current);
           }
         }
       };
 
-      for (var i=0; i < this.length; i++) {
+      for (var i = 0; i < this.length; i++) {
         findClosest(qxWeb(this[i]));
       }
 
       return qxWeb.$init(closest, qxWeb);
     },
 
-
     /**
      * Searches the child elements of each item in the collection and returns
      * a new collection containing the children that match the provided selector
@@ -600,15 +595,14 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * against
      * @return {qxWeb} New collection containing the matching child elements
      */
-    find : function(selector) {
+    find(selector) {
       var found = [];
-      for (var i=0; i < this.length; i++) {
+      for (var i = 0; i < this.length; i++) {
         found = found.concat(qx.bom.Selector.query(selector, this[i]));
       }
       return qxWeb.$init(found, qxWeb);
     },
 
-
     /**
      * Gets a new set of elements containing the child nodes of each item in the
      * current set.
@@ -616,15 +610,14 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @attach {qxWeb}
      * @return {qxWeb} New collection containing the child nodes
      */
-    getContents : function() {
+    getContents() {
       var found = [];
-      this._forEachElement(function(item) {
+      this._forEachElement(function (item) {
         found = found.concat(qx.lang.Array.fromCollection(item.childNodes));
       });
       return qxWeb.$init(found, qxWeb);
     },
 
-
     /**
      * Checks if at least one element in the collection passes the provided
      * filter. This can be either a selector expression or a filter
@@ -634,14 +627,13 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String|Function} Selector expression or filter function
      * @return {Boolean} <code>true</code> if at least one element matches
      */
-    is : function(selector) {
+    is(selector) {
       if (qx.lang.Type.isFunction(selector)) {
         return this.filter(selector).length > 0;
       }
       return !!selector && qx.bom.Selector.matches(selector, this).length > 0;
     },
 
-
     /**
      * Reduce the set of matched elements to a single element.
      *
@@ -649,33 +641,30 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param index {Number} The position of the element in the collection
      * @return {qxWeb} A new collection containing one element
      */
-    eq : function(index) {
+    eq(index) {
       return this.slice(index, +index + 1);
     },
 
-
     /**
      * Reduces the collection to the first element.
      *
      * @attach {qxWeb}
      * @return {qxWeb} A new collection containing one element
      */
-    getFirst : function() {
+    getFirst() {
       return this.slice(0, 1);
     },
 
-
     /**
      * Reduces the collection to the last element.
      *
      * @attach {qxWeb}
      * @return {qxWeb} A new collection containing one element
      */
-    getLast : function() {
+    getLast() {
       return this.slice(this.length - 1);
     },
 
-
     /**
      * Gets a collection containing only the elements that have descendants
      * matching the given selector
@@ -684,10 +673,14 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String} Selector expression
      * @return {qxWeb} a new collection containing only elements with matching descendants
      */
-    has : function(selector) {
+    has(selector) {
       var found = [];
-      this._forEachElement(function(item, index) {
-        var descendants = qx.bom.Selector.matches(selector, this.eq(index).getContents());
+      this._forEachElement(function (item, index) {
+        var descendants = qx.bom.Selector.matches(
+          selector,
+          this.eq(index).getContents()
+        );
+
         if (descendants.length > 0) {
           found.push(item);
         }
@@ -696,7 +689,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return qxWeb.$init(found, this.constructor);
     },
 
-
     /**
      * Returns a new collection containing only those nodes that
      * contain the given element. Also accepts a qxWeb
@@ -707,7 +699,7 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param element {Element|Window|Element[]|qxWeb} element to check for.
      * @return {qxWeb} Collection with matching items
      */
-    contains : function(element) {
+    contains(element) {
       // qxWeb does not inherit from Array in IE
       if (element instanceof Array || element instanceof qxWeb) {
         element = element[0];
@@ -721,7 +713,7 @@ qx.Bootstrap.define("qx.module.Traversing", {
         element = element.document;
       }
 
-      return this.filter(function(el) {
+      return this.filter(function (el) {
         if (qx.dom.Node.isWindow(el)) {
           el = el.document;
         }
@@ -729,7 +721,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       });
     },
 
-
     /**
      * Gets a collection containing the next sibling element of each item in
      * the current set.
@@ -740,15 +731,18 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?} Optional selector expression
      * @return {qxWeb} New set containing next siblings
      */
-    getNext : function(selector) {
-      var found = this.map(qx.dom.Hierarchy.getNextElementSibling, qx.dom.Hierarchy);
+    getNext(selector) {
+      var found = this.map(
+        qx.dom.Hierarchy.getNextElementSibling,
+        qx.dom.Hierarchy
+      );
+
       if (selector) {
         found = qxWeb.$init(qx.bom.Selector.matches(selector, found), qxWeb);
       }
       return found;
     },
 
-
     /**
      * Gets a collection containing all following sibling elements of each
      * item in the current set.
@@ -759,12 +753,16 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?} Optional selector expression
      * @return {qxWeb} New set containing following siblings
      */
-    getNextAll : function(selector) {
-      var ret = qx.module.Traversing.__hierarchyHelper(this, "getNextSiblings", selector);
+    getNextAll(selector) {
+      var ret = qx.module.Traversing.__hierarchyHelper(
+        this,
+        "getNextSiblings",
+        selector
+      );
+
       return qxWeb.$init(ret, qxWeb);
     },
 
-
     /**
      * Gets a collection containing the following sibling elements of each
      * item in the current set up to but not including any element that matches
@@ -774,11 +772,11 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?} Optional selector expression
      * @return {qxWeb} New set containing following siblings
      */
-    getNextUntil : function(selector) {
+    getNextUntil(selector) {
       var found = [];
-      this.forEach(function(item, index) {
+      this.forEach(function (item, index) {
         var nextSiblings = qx.dom.Hierarchy.getNextSiblings(item);
-        for (var i=0, l=nextSiblings.length; i<l; i++) {
+        for (var i = 0, l = nextSiblings.length; i < l; i++) {
           if (qx.bom.Selector.matches(selector, [nextSiblings[i]]).length > 0) {
             break;
           }
@@ -789,7 +787,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return qxWeb.$init(found, qxWeb);
     },
 
-
     /**
      * Gets a collection containing the previous sibling element of each item in
      * the current set.
@@ -800,15 +797,18 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?} Optional selector expression
      * @return {qxWeb} New set containing previous siblings
      */
-    getPrev : function(selector) {
-      var found = this.map(qx.dom.Hierarchy.getPreviousElementSibling, qx.dom.Hierarchy);
+    getPrev(selector) {
+      var found = this.map(
+        qx.dom.Hierarchy.getPreviousElementSibling,
+        qx.dom.Hierarchy
+      );
+
       if (selector) {
         found = qxWeb.$init(qx.bom.Selector.matches(selector, found), qxWeb);
       }
       return found;
     },
 
-
     /**
      * Gets a collection containing all preceding sibling elements of each
      * item in the current set.
@@ -819,12 +819,16 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?} Optional selector expression
      * @return {qxWeb} New set containing preceding siblings
      */
-    getPrevAll : function(selector) {
-      var ret = qx.module.Traversing.__hierarchyHelper(this, "getPreviousSiblings", selector);
+    getPrevAll(selector) {
+      var ret = qx.module.Traversing.__hierarchyHelper(
+        this,
+        "getPreviousSiblings",
+        selector
+      );
+
       return qxWeb.$init(ret, qxWeb);
     },
 
-
     /**
      * Gets a collection containing the preceding sibling elements of each
      * item in the current set up to but not including any element that matches
@@ -834,12 +838,14 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?} Optional selector expression
      * @return {qxWeb} New set containing preceding siblings
      */
-    getPrevUntil : function(selector) {
+    getPrevUntil(selector) {
       var found = [];
-      this.forEach(function(item, index) {
+      this.forEach(function (item, index) {
         var previousSiblings = qx.dom.Hierarchy.getPreviousSiblings(item);
-        for (var i=0, l=previousSiblings.length; i<l; i++) {
-          if (qx.bom.Selector.matches(selector, [previousSiblings[i]]).length > 0) {
+        for (var i = 0, l = previousSiblings.length; i < l; i++) {
+          if (
+            qx.bom.Selector.matches(selector, [previousSiblings[i]]).length > 0
+          ) {
             break;
           }
           found.push(previousSiblings[i]);
@@ -849,7 +855,6 @@ qx.Bootstrap.define("qx.module.Traversing", {
       return qxWeb.$init(found, qxWeb);
     },
 
-
     /**
      * Gets a collection containing all sibling elements of the items in the
      * current set.
@@ -860,12 +865,16 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String?} Optional selector expression
      * @return {qxWeb} New set containing sibling elements
      */
-    getSiblings : function(selector) {
-      var ret = qx.module.Traversing.__hierarchyHelper(this, "getSiblings", selector);
+    getSiblings(selector) {
+      var ret = qx.module.Traversing.__hierarchyHelper(
+        this,
+        "getSiblings",
+        selector
+      );
+
       return qxWeb.$init(ret, qxWeb);
     },
 
-
     /**
      * Remove elements from the collection that do not pass the given filter.
      * This can be either a selector expression or a filter function
@@ -874,20 +883,19 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @param selector {String|Function} Selector or filter function
      * @return {qxWeb} Reduced collection
      */
-    not : function(selector) {
+    not(selector) {
       if (qx.lang.Type.isFunction(selector)) {
-        return this.filter(function(item, index, obj) {
+        return this.filter(function (item, index, obj) {
           return !selector(item, index, obj);
         });
       }
 
       var res = qx.bom.Selector.matches(selector, this);
-      return this.filter(function(value) {
+      return this.filter(function (value) {
         return res.indexOf(value) === -1;
       });
     },
 
-
     /**
      * Gets a new collection containing the offset parent of each item in the
      * current set.
@@ -895,11 +903,10 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @attach {qxWeb}
      * @return {qxWeb} New collection containing offset parents
      */
-    getOffsetParent : function() {
+    getOffsetParent() {
       return this.map(qx.bom.element.Location.getOffsetParent);
     },
 
-
     /**
      * Whether the first element in the collection is inserted into
      * the document for which it was created.
@@ -908,7 +915,7 @@ qx.Bootstrap.define("qx.module.Traversing", {
      * @return {Boolean} <code>true</code> when the element is inserted
      *    into the document.
      */
-    isRendered : function() {
+    isRendered() {
       if (!this[0]) {
         return false;
       }
@@ -916,12 +923,11 @@ qx.Bootstrap.define("qx.module.Traversing", {
     }
   },
 
-
-  defer : function(statics) {
+  defer(statics) {
     qxWeb.$attachAll(this);
     // manually attach private method which is ignored by attachAll
     qxWeb.$attach({
-      "__getAncestors" : statics.__getAncestors
+      __getAncestors: statics.__getAncestors
     });
   }
 });