Repeat a string: Difference between revisions

 

In Flex, there is the method [http://help.adobe.com/en_US/FlashPlatform/reference/actionscript/3/mx/utils/StringUtil.html#repeat%28%29 mx.utils.StringUtil.repeat()].

===Iterative version===

<lang ActionScript>function repeatString(string:String, numTimes:uint):String

return output;

}</lang>

===Recursive version===

The following double-and-add method is much faster when repeating a string many times.

return tmp + tmp;

}</lang>

===Flex===

<lang ActionScript>import mx.utils.StringUtil;

 

=={{header|Burlesque}}==

<lang burlesque>

blsq ) 'h5?*

writeln(chars);

}</lang>

=={{header|DCL}}==

Not exactly what the task asks for but at least it is something;

 

=={{header|Déjà Vu}}==

<lang dejavu>!. concat( rep 5 "ha" )</lang>

{{out}}

*****

</pre>

 

=={{header|Frink}}==

<lang javascript>

console.log("ha".repeat(5)); // hahahahaha</lang>

====Repetition by Egyptian multiplication====

For larger numbers of repetitions, however, it proves significantly faster to progressively double a copy of the original string (concatenating it with itself). Intermediate stages of doubling are appended to an accumulator wherever required for binary composition of the target number.

}

}</lang>

 

=={{header|NetRexx}}==

 

=={{header|Oforth}}==

<lang Oforth>StringBuffer new "abcd" <<n(5)</lang>

 

 

=={{header|PARI/GP}}==

===Version #1. Based on recursion.===

This solution is recursive and unimaginably bad. Slightly less bad versions can be designed, but that's not the point: don't use GP for text processing if you can avoid it. If you really need to, it's easy to create an efficient function in PARI (see [[#C|C]]) and pass that to GP.

 

=={{header|Pascal}}==

 

=={{header|Perl}}==

 

=={{header|Racket}}==

<lang racket>

#lang racket

 

=={{header|Scratch}}==

This example requires making variables named "String", "Count", and "Repeated" first.

 

defer allocator.free(ex);

}</lang>

=={{header|zkl}}==

<lang zkl>"ha" * 5 # --> "hahahahaha"</lang>