Here you can find the source of repeat(n)
String.prototype.repeat = function (n) { var s = ''; for (var i = 0; i < n; i++) s+= this; return s;/*from w w w. ja v a 2 s .c o m*/ }
String.prototype.repeat = function(count) { return (count === 1) ? this : this + this.repeat(count-1); }; console.log('x'.repeat(8) + 'Sub-node');
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, "+"));
String.prototype.repeat = function(count) { var result = "", str = this.toString(); for (var i = 0; i < count; i++) { result += str; return result; };
String.prototype.$repeat = function (count, max = 5, zero = '---') { if (count > max) { return `${this} x ${count}`; } else if (count > 0) { return this.repeat(count); } else { return zero; }; ...
String.prototype.repeat = function(length) { var that = this; for (var i = 0; i < length-1; i++) { that += this; return that;
String.prototype.repeat = function(n) { return new Array(1 + n).join(this); console.log("ha".repeat(5));
String.prototype.repeat = function(n) { return new Array(1 + (n || 0)).join(this); console.log("ha".repeat(5));
String.prototype.repeat = function(n) { return new Array(isNaN(n) ? 1 : ++n).join(this);
String.prototype.repeat = function(n) return new Array(n+1).join(this); function christmasTree(height) { var tree = []; for(var i = 1; i <= height; i++) { tree.push(" ".repeat(height - i) + "*".repeat((i - 1) * 2 + 1) + " ".repeat(height - i)); return tree.join("\n");