Avoid too many return statements within this function.

Open

    if (isFunction(obj)) { return thunkToObservable.call(this, obj); }

Avoid too many return statements within this function.

Open

    if (isFunction(obj)) { return thunkToObservable.call(this, obj); }

Avoid too many return statements within this function.

Open

    return obj;

Avoid too many return statements within this function.

Open

    return obj;

Avoid too many return statements within this function.

Open

  return true;

Avoid too many return statements within this function.

Open

    if (isObject(obj)) {return objectToObservable.call(this, obj);}

Avoid too many return statements within this function.

Open

  return result;

Avoid too many return statements within this function.

Open

    if (isArrayLike(obj) || isIterable(obj)) { return arrayToObservable.call(this, obj); }

Avoid too many return statements within this function.

Open

  return true;

Avoid too many return statements within this function.

Open

    if (isObject(obj)) {return objectToObservable.call(this, obj);}

Function toString has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

jasmine.MessageResult.prototype.toString = function() {
  var text = "";
  for (var i = 0; i < this.values.length; i++) {
    if (i > 0) text += " ";
    if (jasmine.isString_(this.values[i])) {

• Read up
  Read up

Function contains_ has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

jasmine.Env.prototype.contains_ = function(haystack, needle) {
  if (jasmine.isArray_(haystack)) {
    for (var i = 0; i < haystack.length; i++) {
      if (this.equals_(haystack[i], needle)) return true;
    }

• Read up
  Read up

Function assertEqual has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

    assertEqual: function (expected, actual, comparer, message) {
        comparer || (comparer = Rx.internals.isEqual);
        var isOk = true, i, len;
 
        if (expected.length !== actual.length) {

• Read up
  Read up

Function cacheChars has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

ut.WebGLRenderer.prototype.cacheChars = function(chars, build) {
    "use strict";
    if (!this.gl) return; // Nothing to do if not using WebGL renderer
    var changed = false;
    for (var i = 0; i < chars.length; ++i) {

• Read up
  Read up

Function updateStyle has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

ut.DOMRenderer.prototype.updateStyle = function(s) {
    "use strict";
    s = window.getComputedStyle(this.spans[0][0], null);
    this.tw = parseInt(s.width, 10);
    if (this.tw === 0 || isNaN(this.tw)) return; // Nothing to do, exit

• Read up
  Read up

Function reportRunnerResults has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

jasmine.TrivialReporter.prototype.reportRunnerResults = function(runner) {
  var results = runner.results();
  var className = (results.failedCount > 0) ? "runner failed" : "runner passed";
  this.runnerDiv.setAttribute("class", className);
  //do it twice for IE

• Read up
  Read up

Function putString has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

    ut.Viewport.prototype.putString = function(str, x, y, r, g, b, br, bg, bb) {
        var len = str.length;
        var tile;
        if (x < 0 || y < 0) return;
        for (var i = 0; i < len; ++i) {

• Read up
  Read up

Function plucker has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

function plucker(args, len) {
  return function mapper(x) {
    var currentProp = x;
    for (var i = 0; i < len; i++) {
      var p = currentProp[args[i]];

• Read up
  Read up

Function next has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

DelayRelativeObserver.prototype.next = function (notification) {
  var shouldRun;
  if (notification.value.kind === 'E') {
    this._s.q = [];
    this._s.q.push(notification);

• Read up
  Read up

Function heapify has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring.

Open

PriorityQueue.prototype.heapify = function (index) {
  +index || (index = 0);
  if (index >= this.length || index < 0) { return; }
  var left = 2 * index + 1,
      right = 2 * index + 2,

• Read up
  Read up