Nodejs String Repeat repeat(count, max = 5, zero = '---')

Method Source Code

String.prototype.$repeat = function (count, max = 5, zero = '---') {
  if (count > max) {
    return `${this} x ${count}`;
  } else if (count > 0) {
    return this.repeat(count);
  } else {/*  w  w w. ja  v  a2 s  .  com*/
    return zero;
  }
};

Related

1. repeat(count)

   String.prototype.repeat = function(count) {
       if (count < 1) return '';
       var result = '', pattern = this.valueOf();
       while (count > 0) {
           if (count & 1) result += pattern;
           count >>= 1, pattern += pattern;
       return result;
   };
   ...
   

2. repeat(count)

   String.prototype.repeat = function(count) {
     if (count === 1) return this;
     return this + this.repeat(count - 1);
   };
   

3. repeat(count)

   String.prototype.repeat = function(count) {
    return (count === 1) ? this : this + this.repeat(count-1);
   };
   console.log('x'.repeat(8) + 'Sub-node');
   

4. repeat(count)

   String.prototype.repeat = function(count) {
     var result = '';
     for (var i = 0; i < count; i++) {
       result += this;
     };
     return result;
   console.log("*".repeat(5).padLeft(10, "-").padRight(15, "+"));
   

5. repeat(count)

   String.prototype.repeat = function(count) {
       var result = "",
           str = this.toString();
       for (var i = 0; i < count; i++) {
           result += str;
       return result;
   };
   

6. repeat(length)

   String.prototype.repeat = function(length) {
       var that = this;
       for (var i = 0; i < length-1; i++) {
           that += this;
       return that;
   

7. repeat(n)

   String.prototype.repeat = function (n) {
     var s = '';
     for (var i = 0; i < n; i++) s+= this;
     return s;
   

8. repeat(n)

   String.prototype.repeat = function(n) {
       return new Array(1 + n).join(this);
   console.log("ha".repeat(5));  
   

9. repeat(n)

   String.prototype.repeat = function(n) {
       return new Array(1 + (n || 0)).join(this);
   console.log("ha".repeat(5));