joyent/node

Function send has 63 lines of code (exceeds 25 allowed). Consider refactoring.

Open

Socket.prototype.send = function(buffer,
                                 offset,
                                 length,
                                 port,
                                 address,

Function makeArchy_ has 63 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function makeArchy_ (data, long, dir, depth, parent, d) {
  if (typeof data === "string") {
    if (depth -1 <= npm.config.get("depth")) {
      // just missing
      var unmet = "UNMET DEPENDENCY"

Function load_ has 63 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function load_(builtin, rc, cli, cb) {
  var defaults = configDefs.defaults
  var conf = new Conf(rc)

  conf.usingBuiltin = !!builtin

Identical blocks of code found in 3 locations. Consider refactoring.

Open

Reader.prototype.flow = function() {
  var dest = this.dest;
  var res = dest.write(chunk, encoding);
  if (!res)
    dest.once('drain', this.flow);

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

Reader.prototype.flow = function() {
  var dest = this.dest;
  var res = dest.write(chunk, encoding);
  if (!res)
    dest.once('drain', this.flow);

• Read up
  Read up

Identical blocks of code found in 3 locations. Consider refactoring.

Open

Reader.prototype.flow = function() {
  var dest = this.dest;
  var res = dest.write(chunk, encoding);
  if (!res)
    dest.once('drain', this.flow);

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

SplayTree.Node.prototype.traverse_ = function(f) {
  var current = this;
  while (current) {
    var left = current.left;
    if (left) left.traverse_(f);

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

            for (var j = 1; j <= height; j++) {
                x[j * rowSize] =  x[1 + j * rowSize];
                x[(width + 1) + j * rowSize] =  x[width + j * rowSize];
            }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

            for (var j = 1; j <= height; j++) {
                x[j * rowSize] =  x[1 + j * rowSize];
                x[(width + 1) + j * rowSize] =  x[width + j * rowSize];
            }

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

SplayTree.Node.prototype.traverse_ = function(f) {
  var current = this;
  while (current) {
    var left = current.left;
    if (left) left.traverse_(f);

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

def Check(output, errors):
  failed = any([s.startswith('/system/bin/sh:') or s.startswith('ANDROID')
                for s in output.split('\n')])
  return 1 if failed else 0

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

def WriteToTemporaryFile(data):
  (fd, fname) = tempfile.mkstemp()
  os.close(fd)
  tmp_file = open(fname, "w")
  tmp_file.write(data)

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

def Check(output, errors):
  failed = any([s.startswith('/system/bin/sh:') or s.startswith('ANDROID')
                for s in output.split('\n')])
  return 1 if failed else 0

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

def WriteToTemporaryFile(data):
  (fd, fname) = tempfile.mkstemp()
  os.close(fd)
  tmp_file = open(fname, "w")
  tmp_file.write(data)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  if match and not Match(r"^''|-?[0-9]+|0x[0-9A-Fa-f]$", match.group(2)):
    error(filename, linenum, 'runtime/memset', 4,
          'Did you mean "memset(%s, 0, %s)"?'
          % (match.group(1), match.group(2)))

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  for t in target_list:
    if t in targets_to_shard:
      for i in range(targets_to_shard[t]):
        new_target_list.append(_ShardName(t, i))
    else:

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

def Match(pattern, s):
  """Matches the string with the pattern, caching the compiled regexp."""
  # The regexp compilation caching is inlined in both Match and Search for
  # performance reasons; factoring it out into a separate function turns out
  # to be noticeably expensive.

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  if match and not Match(r'\s*(<.*>)?(::[a-zA-Z0-9_]+)?\s*\(([^"]|$)',
                         match.group(3)):
    error(filename, linenum, 'runtime/string', 4,
          'For a static/global string constant, use a C style string instead: '
          '"%schar %s[]".' %

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  def _JSArray(self, name, recursion_budget):
    result = self._PlainArray(name, recursion_budget)
    self._AddAccessors(name, result, recursion_budget)
    self._AddProperties(name, result, recursion_budget)
    self._AddElements(name, result, recursion_budget)

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    for d in dependencies:
      if d in targets_to_shard:
        for i in range(targets_to_shard[d]):
          new_dependencies.append(_ShardName(d, i))
      else:

• Read up
  Read up