enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Template:Str rep - Wikipedia

    en.wikipedia.org/wiki/Template:Str_rep

    There are three positional (unnamed) parameters, all required: the initial text string subject to search and replacement; the find-string to search for in the text; the replacement string: param 3 replaces param 2's first occurrence in param 1.

  3. Help:Manipulating strings - Wikipedia

    en.wikipedia.org/wiki/Help:Manipulating_strings

    The English Wikipedia has several templates and Lua modules which can format or manipulate strings.In this context a "string" is any piece of text forming part of a page. This help page covers a few useful techniques; look in the navbox below for the full catalogue of templa

  4. Template:Str left - Wikipedia

    en.wikipedia.org/wiki/Template:Str_left

    All the limitations of use for this template and shown below are caused by the current implementation of the {{padleft:}} parser function used in this template, which does not filter its third parameter containing the characters used for padding a string to the specified length (it currently counts incorrectly the characters to extract from the ...

  5. Template:Replace - Wikipedia

    en.wikipedia.org/wiki/Template:Replace

    Returns string with the first n occurrences of target replaced with replacement. Omitting count will replace all occurrences. Space counts as a character if placed in any of the first three parameters.

  6. String-searching algorithm - Wikipedia

    en.wikipedia.org/wiki/String-searching_algorithm

    A string-searching algorithm, sometimes called string-matching algorithm, is an algorithm that searches a body of text for portions that match by pattern. A basic example of string searching is when the pattern and the searched text are arrays of elements of an alphabet ( finite set ) Σ.

  7. Longest common substring - Wikipedia

    en.wikipedia.org/wiki/Longest_common_substring

    The picture shows two strings where the problem has multiple solutions. Although the substring occurrences always overlap, it is impossible to obtain a longer common substring by "uniting" them. The strings "ABABC", "BABCA" and "ABCBA" have only one longest common substring, viz. "ABC" of length 3.

  8. Substring index - Wikipedia

    en.wikipedia.org/wiki/Substring_index

    In computer science, a substring index is a data structure which gives substring search in a text or text collection in sublinear time. Once constructed from a document or set of documents, a substring index can be used to locate all occurrences of a pattern in time linear or near-linear in the pattern size, with no dependence or only logarithmic dependence on the document size.

  9. Template:String-handling templates - Wikipedia

    en.wikipedia.org/wiki/Template:String-handling...

    {{String-handling templates | state = collapsed}} will show the template collapsed, i.e. hidden apart from its title bar. {{ String-handling templates | state = autocollapse }} will show the template autocollapsed, i.e. if there is another collapsible item on the page (a navbox, sidebar , or table with the collapsible attribute ), it is hidden ...