# Code coverage report for cheerio/lib/api/traversing.js

## Statements: 100% (218 / 218) Branches: 98.28% (171 / 174) Functions: 100% (47 / 47) Lines: 100% (206 / 206) Ignored: none

All files » cheerio/lib/api/ » traversing.js

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    62
    63
    64
    65
    66
    67
    68
    69
    70
    71
    72
    73
    74
    75
    76
    77
    78
    79
    80
    81
    82
    83
    84
    85
    86
    87
    88
    89
    90
    91
    92
    93
    94
    95
    96
    97
    98
    99
    100
    101
    102
    103
    104
    105
    106
    107
    108
    109
    110
    111
    112
    113
    114
    115
    116
    117
    118
    119
    120
    121
    122
    123
    124
    125
    126
    127
    128
    129
    130
    131
    132
    133
    134
    135
    136
    137
    138
    139
    140
    141
    142
    143
    144
    145
    146
    147
    148
    149
    150
    151
    152
    153
    154
    155
    156
    157
    158
    159
    160
    161
    162
    163
    164
    165
    166
    167
    168
    169
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186
    187
    188
    189
    190
    191
    192
    193
    194
    195
    196
    197
    198
    199
    200
    201
    202
    203
    204
    205
    206
    207
    208
    209
    210
    211
    212
    213
    214
    215
    216
    217
    218
    219
    220
    221
    222
    223
    224
    225
    226
    227
    228
    229
    230
    231
    232
    233
    234
    235
    236
    237
    238
    239
    240
    241
    242
    243
    244
    245
    246
    247
    248
    249
    250
    251
    252
    253
    254
    255
    256
    257
    258
    259
    260
    261
    262
    263
    264
    265
    266
    267
    268
    269
    270
    271
    272
    273
    274
    275
    276
    277
    278
    279
    280
    281
    282
    283
    284
    285
    286
    287
    288
    289
    290
    291
    292
    293
    294
    295
    296
    297
    298
    299
    300
    301
    302
    303
    304
    305
    306
    307
    308
    309
    310
    311
    312
    313
    314
    315
    316
    317
    318
    319
    320
    321
    322
    323
    324
    325
    326
    327
    328
    329
    330
    331
    332
    333
    334
    335
    336
    337
    338
    339
    340
    341
    342
    343
    344
    345
    346
    347
    348
    349
    350
    351
    352
    353
    354
    355
    356
    357
    358
    359
    360
    361
    362
    363
    364
    365
    366
    367
    368
    369
    370
    371
    372
    373
    374
    375
    376
    377
    378
    379
    380
    381
    382
    383
    384
    385
    386
    387
    388
    389
    390
    391
    392
    393
    394
    395
    396
    397
    398
    399
    400
    401
    402
    403
    404
    405
    406
    407
    408
    409
    410
    411
    412
    413
    414
    415
    416
    4171

    1
    723
    727

    723
    723

    723
    5
    2

    3

    5
    13
    13
    19
    7

    718

    1
    32

    32
    49
    49
    28

    32
    1

    32

    1
    18

    18
    31

    31
    21

    18

    1
    10

    10
    4
    6
    1
    5
    1

    10
    11
    19

    15

    4

    10

    1
    13

    13
    1

    12
    24

    24
    6

    12

    1
    24
    23

    23
    26
    18
    18
    18

    23

    1
    11
    10

    10
    14
    22
    20

    10

    1
    12
    11

    11
    3
    8
    1
    7
    1

    11
    13
    24

    20
    17

    4

    11

    1
    20
    19

    19
    22
    16
    16
    16

    19

    1
    11
    10

    10
    14
    20
    18

    10

    1
    12
    11

    11
    3
    8
    1
    7
    1

    11
    13
    23

    19
    16

    4

    11

    1
    9

    9

    25

    9
    4

    5

    1

    135
    137

    135
    25

    3

    1
    40
    45
    45

    1
    5
    13
    5

    1
    6
    18
    18

    1
    2
    125
    125

    125
    78
    47
    4
    10

    43
    4

    39
    59

    124

    1
    1

    1
    5

    1
    12

    1
    72

    72

    69
    69

    1
    198
    183

    15

    1
    12

    12
    2
    2
    10
    3
    3

    7
    7

    12

    1
    4

    1
    55
    55
    68
    42

    68

    55

    1
    24

    1
    34
    34

    34
    85

    34

    34

    1
    5

     var _ = require('lodash'),
        select = require('CSSselect'),
        utils = require('../utils'),
        domEach = utils.domEach,
        uniqueSort = require('htmlparser2').DomUtils.uniqueSort,
        isTag = utils.isTag;

    exports.find = function(selectorOrHaystack) {
      var elems = _.reduce(this, function(memo, elem) {
        return memo.concat(_.filter(elem.children, isTag));
      }, []);
      var contains = this.constructor.contains;
      var haystack;

      if (selectorOrHaystack && typeof selectorOrHaystack !== 'string') {
        if (selectorOrHaystack.cheerio) {
          haystack = selectorOrHaystack.get();
        } else {
          haystack = [selectorOrHaystack];
        }

        return this._make(haystack.filter(function(elem) {
          var idx, len;
          for (idx = 0, len = this.length; idx < len; ++idx) {
            if (contains(this[idx], elem)) {
              return true;
            }
          }
        }, this));
      }

      return this._make(select(selectorOrHaystack, elems, this.options));
    };

    // Get the parent of each element in the current set of matched elements,
    // optionally filtered by a selector.
    exports.parent = function(selector) {
      var set = [];

      domEach(this, function(idx, elem) {
        var parentElem = elem.parent;
        if (parentElem && set.indexOf(parentElem) < 0) {
          set.push(parentElem);
        }
      });

      if (arguments.length) {
        set = exports.filter.call(set, selector, this);
      }

      return this._make(set);
    };

    exports.parents = function(selector) {
      var parentNodes = [];

      // When multiple DOM elements are in the original set, the resulting set will
      // be in *reverse* order of the original elements as well, with duplicates
      // removed.
      this.get().reverse().forEach(function(elem) {
        traverseParents(this, elem.parent, selector, Infinity)
          .forEach(function(node) {
            if (parentNodes.indexOf(node) === -1) {
              parentNodes.push(node);
            }
          }
        );
      }, this);

      return this._make(parentNodes);
    };

    exports.parentsUntil = function(selector, filter) {
      var parentNodes = [], untilNode, untilNodes;

      if (typeof selector === 'string') {
        untilNode = select(selector, this.parents().toArray(), this.options)[0];
      } else if (selector && selector.cheerio) {
        untilNodes = selector.toArray();
      } else if (selector) {
        untilNode = selector;
      }

      // When multiple DOM elements are in the original set, the resulting set will
      // be in *reverse* order of the original elements as well, with duplicates
      // removed.

      this.toArray().reverse().forEach(function(elem) {
        while ((elem = elem.parent)) {
          if ((untilNode && elem !== untilNode) ||
            (untilNodes && untilNodes.indexOf(elem) === -1) ||
            (!untilNode && !untilNodes)) {
            if (isTag(elem) && parentNodes.indexOf(elem) === -1) { parentNodes.push(elem); }
          } else {
            break;
          }
        }
      }, this);

      return this._make(filter ? select(filter, parentNodes, this.options) : parentNodes);
    };

    // For each element in the set, get the first element that matches the selector
    // by testing the element itself and traversing up through its ancestors in the
    // DOM tree.
    exports.closest = function(selector) {
      var set = [];

      if (!selector) {
        return this._make(set);
      }

      domEach(this, function(idx, elem) {
        var closestElem = traverseParents(this, elem, selector, 1)[0];

        // Do not add duplicate elements to the set
        if (closestElem && set.indexOf(closestElem) < 0) {
          set.push(closestElem);
        }
      }.bind(this));

      return this._make(set);
    };

    exports.next = function(selector) {
      if (!this[0]) { return this; }
      var elems = [];

      _.forEach(this, function(elem) {
        while ((elem = elem.next)) {
          Eif (isTag(elem)) {
            elems.push(elem);
            return;
          }
        }
      });

      return selector ?
        exports.filter.call(elems, selector, this) :
        this._make(elems);
    };

    exports.nextAll = function(selector) {
      if (!this[0]) { return this; }
      var elems = [];

      _.forEach(this, function(elem) {
        while ((elem = elem.next)) {
          if (isTag(elem) && elems.indexOf(elem) === -1) {
            elems.push(elem);
          }
        }
      });

      return selector ?
        exports.filter.call(elems, selector, this) :
        this._make(elems);
    };

    exports.nextUntil = function(selector, filterSelector) {
      if (!this[0]) { return this; }
      var elems = [], untilNode, untilNodes;

      if (typeof selector === 'string') {
        untilNode = select(selector, this.nextAll().get(), this.options)[0];
      } else if (selector && selector.cheerio) {
        untilNodes = selector.get();
      } else if (selector) {
        untilNode = selector;
      }

      _.forEach(this, function(elem) {
        while ((elem = elem.next)) {
          if ((untilNode && elem !== untilNode) ||
            (untilNodes && untilNodes.indexOf(elem) === -1) ||
            (!untilNode && !untilNodes)) {
            if (isTag(elem) && elems.indexOf(elem) === -1) {
              elems.push(elem);
            }
          } else {
            break;
          }
        }
      });

      return filterSelector ?
        exports.filter.call(elems, filterSelector, this) :
        this._make(elems);
    };

    exports.prev = function(selector) {
      if (!this[0]) { return this; }
      var elems = [];

      _.forEach(this, function(elem) {
        while ((elem = elem.prev)) {
          Eif (isTag(elem)) {
            elems.push(elem);
            return;
          }
        }
      });

      return selector ?
        exports.filter.call(elems, selector, this) :
        this._make(elems);
    };

    exports.prevAll = function(selector) {
      if (!this[0]) { return this; }
      var elems = [];

      _.forEach(this, function(elem) {
        while ((elem = elem.prev)) {
          if (isTag(elem) && elems.indexOf(elem) === -1) {
            elems.push(elem);
          }
        }
      });

      return selector ?
        exports.filter.call(elems, selector, this) :
        this._make(elems);
    };

    exports.prevUntil = function(selector, filterSelector) {
      if (!this[0]) { return this; }
      var elems = [], untilNode, untilNodes;

      if (typeof selector === 'string') {
        untilNode = select(selector, this.prevAll().get(), this.options)[0];
      } else if (selector && selector.cheerio) {
        untilNodes = selector.get();
      } else if (selector) {
        untilNode = selector;
      }

      _.forEach(this, function(elem) {
        while ((elem = elem.prev)) {
          if ((untilNode && elem !== untilNode) ||
            (untilNodes && untilNodes.indexOf(elem) === -1) ||
            (!untilNode && !untilNodes)) {
            if (isTag(elem) && elems.indexOf(elem) === -1) {
              elems.push(elem);
            }
          } else {
            break;
          }
        }
      });

      return filterSelector ?
        exports.filter.call(elems, filterSelector, this) :
        this._make(elems);
    };

    exports.siblings = function(selector) {
      var parent = this.parent();

      var elems = _.filter(
        parent ? parent.children() : this.siblingsAndMe(),
        function(elem) { return isTag(elem) && !this.is(elem); },
        this
      );

      if (selector !== undefined) {
        return exports.filter.call(elems, selector, this);
      } else {
        return this._make(elems);
      }
    };

    exports.children = function(selector) {

      var elems = _.reduce(this, function(memo, elem) {
        return memo.concat(_.filter(elem.children, isTag));
      }, []);

      if (selector === undefined) return this._make(elems);
      else if (typeof selector === 'number') return this._make(elems[selector]);

      return exports.filter.call(elems, selector, this);
    };

    exports.contents = function() {
      return this._make(_.reduce(this, function(all, elem) {
        all.push.apply(all, elem.children);
        return all;
      }, []));
    };

    exports.each = function(fn) {
      var i = 0, len = this.length;
      while (i < len && fn.call(this[i], i, this[i]) !== false) ++i;
      return this;
    };

    exports.map = function(fn) {
      return this._make(_.reduce(this, function(memo, el, i) {
        var val = fn.call(el, i, el);
        return val == null ? memo : memo.concat(val);
      }, []));
    };

    var makeFilterMethod = function(filterFn) {
      return function(match, container) {
        var testFn;
        container = container || this;

        if (typeof match === 'string') {
          testFn = select.compile(match, container.options);
        } else if (typeof match === 'function') {
          testFn = function(el, i) {
            return match.call(el, i, el);
          };
        } else if (match.cheerio) {
          testFn = match.is.bind(match);
        } else {
          testFn = function(el) {
            return match === el;
          };
        }

        return container._make(filterFn(this, testFn));
      };
    };

    exports.filter = makeFilterMethod(_.filter);
    exports.not = makeFilterMethod(_.reject);

    exports.first = function() {
      return this.length > 1 ? this._make(this[0]) : this;
    };

    exports.last = function() {
      return this.length > 1 ? this._make(this[this.length - 1]) : this;
    };

    // Reduce the set of matched elements to the one at the specified index.
    exports.eq = function(i) {
      i = +i;

      // Use the first identity optimization if possible
      if (i === 0 && this.length <= 1) return this;

      if (i < 0) i = this.length + i;
      return this[i] ? this._make(this[i]) : this._make([]);
    };

    // Retrieve the DOM elements matched by the jQuery object.
    exports.get = function(i) {
      if (i == null) {
        return Array.prototype.slice.call(this);
      } else {
        return this[i < 0 ? (this.length + i) : i];
      }
    };

    // Search for a given element from among the matched elements.
    exports.index = function(selectorOrNeedle) {
      var $haystack, needle;

      if (arguments.length === 0) {
        $haystack = this.parent().children();
        needle = this[0];
      } else if (typeof selectorOrNeedle === 'string') {
        $haystack = this._make(selectorOrNeedle);
        needle = this[0];
      } else {
        $haystack = this;
        needle = selectorOrNeedle.cheerio ? selectorOrNeedle[0] : selectorOrNeedle;
      }

      return $haystack.get().indexOf(needle);
    };

    exports.slice = function() {
      return this._make([].slice.apply(this, arguments));
    };

    function traverseParents(self, elem, selector, limit) {
      var elems = [];
      while (elem && elems.length < limit) {
        if (!selector || exports.filter.call([elem], selector, self).length) {
          elems.push(elem);
        }
        elem = elem.parent;
      }
      return elems;
    }

    // End the most recent filtering operation in the current chain and return the
    // set of matched elements to its previous state.
    exports.end = function() {
      return this.prevObject || this._make([]);
    };

    exports.add = function(other, context) {
      var selection = this._make(other, context);
      var contents = uniqueSort(selection.get().concat(this.get()));

      for (var i = 0; i < contents.length; ++i) {
        selection[i] = contents[i];
      }
      selection.length = contents.length;

      return selection;
    };

    // Add the previous set of elements on the stack to the current set, optionally
    // filtered by a selector.
    exports.addBack = function(selector) {
      return this.add(
        arguments.length ? this.prevObject.filter(selector) : this.prevObject
      );
    };