There are 2 options to find matching text; `string.match` or `string.find`.

Both of these perform a regex search on the string to find matches.

---

## [`string.find()`][1]

    string.find(subject string, pattern string, optional start position, optional plain flag)

Returns the `startIndex` &amp; `endIndex` of the substring found.

The `plain` flag allows for the pattern to be ignored and intead be interpreted as a literal. Rather than `(tiger)` being interpreted as a regex capture group matching for `tiger`, it instead looks for `(tiger)` within a string.

Going the other way, if you want to regex match but still want literal special characters (such as `.()[]+-` etc.), you can escape them with a percentage; `%(tiger%)`.

*You will likely use this in combination with `string.sub`*

### Example

    str = &quot;This is some text containing the word tiger.&quot;
    if string.find(str, &quot;tiger&quot;) then
      print (&quot;The word tiger was found.&quot;)
    else
      print (&quot;The word tiger was not found.&quot;)
    end

---

## [`string.match()`][2]

    string.match(s, pattern, optional index)

Returns the capture groups found.

### Example

    str = &quot;This is some text containing the word tiger.&quot;
    if string.match(str, &quot;tiger&quot;) then
      print (&quot;The word tiger was found.&quot;)
    else
      print (&quot;The word tiger was not found.&quot;)
    end

  [1]: http://lua-users.org/wiki/StringLibraryTutorial#search_query1:~:text=string.find(s%2C%20pattern%20%5B%2C%20index%20%5B%2C%20plain%5D%5D)
  [2]: http://lua-users.org/wiki/StringLibraryTutorial#search_query1:~:text=string.match%20(s%2C%20pattern%20%5B%2C%20index%5D)

In a ViewController, there is `ViewDidLoad` to know when the VC has loaded.

For a UIView, what method do i have to use when the view loaded?

Would this method be called with any init?

edit:
No XIB, just programmatically.

iOS viewDidLoad for UIView

I have two DLL files which I&#39;d like to include in my EXE file to make it easier to distribute it. I&#39;ve read a bit here and there how to do this, even found a good thread [here][1], and [here][2], but it&#39;s far too complicated for me and I need real basic instructions on how to do this.

I&#39;m using Microsoft Visual C# Express 2010, and please excuse my &quot;low standard&quot; question, but I feel like I&#39;m one or two level below everyone else&#39;s expercise :-/ If someone could point out how to merge these DDL files into my EXE in a step-by-step guide, this would be **really** awesome!


  [1]: https://stackoverflow.com/questions/4631567/possible-to-merge-a-dll-into-a-net-exe
  [2]: https://stackoverflow.com/questions/7056486/how-to-use-ilmerge-to-merge-dlls-into-an-exe-file

Merge DLL into EXE?

I need to make a conditional that is true if a particular matching text is found at least once in a string of text, e.g.:

    str = &quot;This is some text containing the word tiger.&quot;
    if string.match(str, &quot;tiger&quot;) then
        print (&quot;The word tiger was found.&quot;)
    else
        print (&quot;The word tiger was not found.&quot;)

How can I check if the text is found somewhere in the string?

How to check if matching text is found in a string in Lua?

I need to make a conditional that is true if a particular matching text is found at least once in a string of text, e.g.:
<pre><code class="hljs language-lua">str = "This is some text containing the word tiger."
if string.match(str, "tiger") then
 print ("The word tiger was found.")
else
 print ("The word tiger was not found.")
</code></pre>
How can I check if the text is found somewhere in the string?

Surprisingly simple/stupid/basic question, but I have no idea: Suppose I want to return the user of my function a C-string, whose length I do not know at the beginning of the function.  I can place only an upper bound on the length at the outset, and, depending on processing, the size may shrink.  

The question is, is there anything wrong with allocating enough heap space (the upper bound) and then terminating the string well short of that during processing?  i.e. If I stick a &#39;\0&#39; into the middle of the allocated memory, does (a.) `free()` still work properly, and (b.) does the space after the &#39;\0&#39; become inconsequential?  Once &#39;\0&#39; is added, does the memory just get returned, or is it sitting there hogging space until `free()` is called?  Is it generally bad programming style to leave this hanging space there, in order to save some upfront programming time computing the necessary space before calling malloc?

To give this some context, let&#39;s say I want to remove consecutive duplicates, like this: 

input &quot;Hello oOOOo  !!&quot; --&gt; output &quot;Helo oOo !&quot;

... and some code below showing how I&#39;m pre-computing the size resulting from my operation, effectively performing processing twice to get the heap size right.

    char* RemoveChains(const char* str)
    {
    	if (str == NULL) {
	    	return NULL;
	    }
	    if (strlen(str) == 0) {
	    	char* outstr = (char*)malloc(1);
	    	*outstr = &#39;\0&#39;;
	    	return outstr;
	    }
	    const char* original = str; // for reuse
	    char prev = *str++;       // [prev][str][str+1]...
	    unsigned int outlen = 1;  // first char auto-counted

	    // Determine length necessary by mimicking processing
	    while (*str) {
	    	if (*str != prev) { // new char encountered
		    	++outlen;
	    		prev = *str; // restart chain
		    }
		    ++str; // step pointer along input
	    }

	    // Declare new string to be perfect size
	    char* outstr = (char*)malloc(outlen + 1);
	    outstr[outlen] = &#39;\0&#39;;
	    outstr[0] = original[0];
	    outlen = 1;

	    // Construct output
	    prev = *original++;
	    while (*original) {
		    if (*original != prev) {
		    	outstr[outlen++] = *original;
		    	prev = *original;
		    }
		    ++original;
	    }
    	return outstr;
    }


What happens to memory after &#39;\0&#39; in a C string?

I have an array of Strings that represent Binary numbers (without leading zeroes) that I want to convert to their corresponding base 10 numbers. Consider:

    binary 1011 becomes integer 11
    binary 1001 becomes integer 9
    binary   11 becomes integer 3   etc. 

What&#39;s the best way to proceed? I&#39;ve been exploring java.lang.number.* without finding a direct conversion method. `Integer.parseInt(b)` yields an integer EQUAL to the String...e.g., 1001 becomes 1,001 instead of 9...and does not seem to include a parameter for an output base. `toBinaryString` does the conversion the wrong direction. I suspect I&#39;ll need to do a multistep conversion, but can&#39;t seem to find the right combination of methods or subclasses. I&#39;m also not sure the extent to which leading zeros or lack thereof will be an issue. Anyone have any good directions to point me?



How to convert a Binary String to a base 10 integer in Java

I am building a String and the code looks like


    String status = &quot;The status of my combobox is &quot; + comboBoxTest.SelectedText

I am using WinForm in VS2010

The result looks like

&gt;&quot;The status of my combobox is &quot;

ComboBox.SelectedText doesn&#39;t give me the SelectedText

I have one String variable, `str` with possible values, `val1`, `val2` and `val3`.

I want to compare (with equal case) `str` to all of these values using an if statement, for example:

    if(&quot;val1&quot;.equalsIgnoreCase(str)||&quot;val2&quot;.equalsIgnoreCase(str)||&quot;val3&quot;.equalsIgnoreCase(str))
  	{
          //remaining code
    }

Is there a way to avoid using multiple OR (||) operators and compare values in one expression? For example, like this:

     if((&quot;val1&quot; OR &quot;val2&quot; OR &quot;val3&quot;).equalsIgnoreCase(str)   //this is only an idea.

Compare one String with multiple values in one expression

How can I check if a `String` is there in the `List`?

I want to assign `1` to `temp` if there is a result, `2` otherwise.

My current code is:

    Integer temp = 0;
    List&lt;String&gt; bankAccNos = new ArrayList&lt;String&gt;();//assume list contains values
    String bankAccNo = &quot;abc&quot;;
    for(String no : bankAccNos)
        if(no.equals(bankAccNo))
            temp = 1;

Check if a String is in an ArrayList of Strings

How can I convert a string to an integer in Lua?

I have a string like this:

    a = &quot;10&quot;

I would like it to be converted to 10, the number.

Lua string to int

I&#39;ve been trying to use Corona SDK&#39;s Facebook API to post the score on the game I&#39;m developing on facebook. However, I&#39;m having a problem with it. During the first time I try to post to facebook, I get this error after login and user authentication:

&gt; NSURLErrorDomain error code -999

Then, it won&#39;t post on facebook. What are possible causes of this error and how can I address it? I tried searching the web but couldn&#39;t find information about it. Thanks in advance.

By the way, I am not using webview on my app. Just the widget api and a show_dialog listener in my Facebook class.

NSURLErrorDomain error code -999 in iOS

So, I have a table something along these lines:

    arr =
    {
      apples = { &#39;a&#39;, &quot;red&quot;, 5 },
      oranges = { &#39;o&#39;, &quot;orange&quot;, 12 },
      pears = { &#39;p&#39;, &quot;green&quot;, 7 }
    }

It doesn&#39;t seem like it&#39;s possible to access them based on their index, and the values themselves are tables, so I just made the first value of the nested table the index of it, so it now looks like this:

    arr =
    {
      apples = { 0, &#39;a&#39;, &quot;red&quot;, 5 },
      oranges = { 1, &#39;o&#39;, &quot;orange&quot;, 12 },
      pears = { 2, &#39;p&#39;, &quot;green&quot;, 7 }
    }

So, now any time I use one of these tables, I know what the index is, but still can&#39;t get to the table using the index, so I started to write a function that loops through them all, and check the indexes until it finds the right one. Then I realized... how can I loop through them if I can&#39;t already refer to them by their index? So, now I&#39;m stuck. I really want to be able to type arr.apples vs arr[1] most of the time, but of course it&#39;s necessary to do both at times.

How to iterate through table in Lua?

I have seen the hash character &#39;#&#39; being added to the front of variables a lot in Lua.

What does it do? 

EXAMPLE

    -- sort AIs in currentlevel
    table.sort(level.ais, function(a,b) return a.y &lt; b.y end)
    local curAIIndex = 1
    local maxAIIndex = #level.ais
    for i = 1,#currentLevel+maxAIIndex do
        if level.ais[curAIIndex].y+sprites.monster:getHeight() &lt; currentLevel[i].lowerY then
            table.insert(currentLevel, i, level.ais[curAIIndex])
            curAIIndex = curAIIndex + 1
            if curAIIndex &gt; maxAIIndex then
                break
            end
        end
    end

Apologies if this has already been asked, I&#39;ve searched around on the internet a lot but I haven&#39;t seem to have found an answer. Thanks in advance!

What does # mean in Lua?

I&#39;ve some currently some Lua code using the following syntax:

    if (foo == nil or foo == &#39;&#39;) then
        foo = &quot;some default value&quot;
    end
 
The goal of the if condition is to test foo is neither an empty string, neither a nil value.

Can this code be simplified in one if test instead two?

Check if a string isn&#39;t nil or empty in Lua

I have a list of tuples in [Python][1], and I have a conditional where I want to take the branch ONLY if the tuple is not in the list (if it is in the list, then I don&#39;t want to take the if branch)

    if curr_x -1 &gt; 0 and (curr_x-1 , curr_y) not in myList: 

        # Do Something

This is not really working for me though. What have I done wrong?

  [1]: http://en.wikipedia.org/wiki/Python_%28programming_language%29


Check if something is (not) in a list in Python

Is it possible to decorator a function conditionally.  For example, I want to decorate the function `foo()` with a timer function (`timeit`) only doing_performance_analysis is `True` (see the psuedo-code below).

    if doing_performance_analysis:
      @timeit
      def foo():
        &quot;&quot;&quot;
        do something, timeit function will return the time it takes
        &quot;&quot;&quot;
        time.sleep(2)
    else:
      def foo():
        time.sleep(2)  

how to do a conditional decorator in python

    class Foo{
    	public static void main(String args[]){
    		final int x=101;
    				
    		int y;
    		if(x&gt;100){
    			y=-1;
    		}
    		System.out.println(y);
    	}
    }

Java compiler understands the condition of the if statement is always true and therefore y will always be initialized. No compile error, as expected.

    class Bar{
    	public static void main(String args[]){
    		final int x;
            x=101;

    		int y;		
    		if(x&gt;100){
    			y=-1;
    		}
    		System.out.println(y);
    	}
    }

But when I break the declaration and initialization of x into two lines, the compiler does not seem to get that the condition is always true and y will always be initialized.

    final int x;
	x=101;
	byte b;
	b=x;
	System.out.println(b);
Same thing happens here and the compiler gives a loss of precision error.

    final int x=101;
	byte b;
	b=x;
	System.out.println(b);
Again, the compiler can understand that x is inside the range of b.




Why does the Java compiler not understand this variable is always initialized?

In PHP we can check if a key exists in an array by using the function `array_key_exists()`.

In the Twig templating language we can check if an variable or an object&#39;s property exists simply by using an `if` statement, like this:

    {% if app.user %}
    do something here
    {% else %}
    do something else
    {% endif %}

But how do we check if a key of an *array* exists using Twig? I tried `{% if array.key %}`, but it gives me an error:

    Key &quot;key&quot; for array with keys &quot;0, 1, 2, 3...648&quot; does not exist

As one of the primary ways of passing data into a template is using arrays, it seems like there should be some way of doing this. Any thoughts?

In Twig, check if a specific key of an array exists

Sometimes when making conditionals, I need the code to do nothing, e.g., here, I want Bash to do nothing when `$a` is greater than &quot;10&quot;, print &quot;1&quot; if `$a` is less than &quot;5&quot;, otherwise, print &quot;2&quot;:

    if [ &quot;$a&quot; -ge 10 ]
    then
    elif [ &quot;$a&quot; -le 5 ]
    then
        echo &quot;1&quot;
    else
        echo &quot;2&quot;
    fi

This makes an error though. Is there a command which will do nothing and also not slow down my script?

What command means &quot;do nothing&quot; in a conditional in Bash?

How do I check if a string matches this pattern?

Uppercase letter, number(s), uppercase letter, number(s)...


Example, These would match:

    A1B2
    B10L1
    C1N200J1

These wouldn&#39;t (&#39;^&#39; points to problem)

    a1B2
    ^
    A10B
       ^
    AB400
    ^

Check if string matches pattern

I have a data.table with a character column, and want to select only those rows that contain a substring in it.  Equivalent to SQL `WHERE x LIKE &#39;%substring%&#39;`

E.g.

    &gt; Months = data.table(Name = month.name, Number = 1:12)
    &gt; Months[&quot;mb&quot; %in% Name]
    Empty data.table (0 rows) of 2 cols: Name,Number

How would I select only the rows where Name contains &quot;mb&quot;?

How to select R data.table rows based on substring match (a la SQL like)

Consider the following snippet:

    &quot;12-18&quot; -Contains &quot;-&quot;

You’d think this evaluates to `true`, but it doesn&#39;t. This will evaluate to `false` instead. I’m not sure why this happens, but it does.

To avoid this, you can use this instead:

    &quot;12-18&quot;.Contains(&quot;-&quot;)

Now the expression will evaluate to true.

Why does the first code snippet behave like that? Is there something special about `-` that doesn&#39;t play nicely with `-Contains`? [The documentation][1] doesn&#39;t mention anything about it.

  [1]: http://technet.microsoft.com/en-us/library/hh847759.aspx


PowerShell and the -contains operator

I&#39;m looking for a fuzzy search JavaScript library to filter an array. I&#39;ve tried using [fuzzyset.js](http://glench.github.io/fuzzyset.js/) and [fuse.js](https://fusejs.io/), but the results are terrible (there are demos you can try on the linked pages).

After doing some reading on Levenshtein distance, it strikes me as a poor approximation of what users are looking for when they type. For those who don&#39;t know, the system calculates how many **insertions**, **deletions**, and **substitutions** are needed to make two strings match.

One obvious flaw, which is fixed in the Levenshtein-Demerau model, is that both *blub* and *boob* are considered equally similar to *bulb* (each requiring two substitutions). It is clear, however, that *bulb* is more similar to *blub* than *boob* is, and the model I just mentioned recognizes that by allowing for **transpositions**.

I want to use this in the context of text completion, so if I have an array `[&#39;international&#39;, &#39;splint&#39;, &#39;tinder&#39;]`, and my query is *int*, I think *international* ought to rank more highly than *splint*, even though the former has a score (higher=worse) of 10 versus the latter&#39;s 3.

So what I&#39;m looking for (and will create if it doesn&#39;t exist), is a library that does the following:

- Weights the different text manipulations
- Weights each manipulation differently depending on where they appear in a word (early manipulations being more costly than late manipulations)
- Returns a list of results sorted by relevance

Has anyone come across anything like this? I realize that StackOverflow isn&#39;t the place to be asking for software recommendations, but implicit (not anymore!) in the above is: am I thinking about this the right way?

-------------
Edit
----
I found a [good paper (pdf)](https://web.archive.org/web/20160804043501/https://www.cs.cmu.edu/~pradeepr/papers/ijcai03.pdf) on the subject. Some notes and excerpts: 

&gt;Affine edit-distance functions assign a relatively lower cost to a sequence of insertions or deletions

&gt;the Monger-Elkan distance function (Monge &amp; Elkan 1996), which is an affine variant of the Smith-Waterman distance function (Durban et al. 1998) with particular cost parameters

For the [Smith-Waterman distance (wikipedia)](http://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorithm), &quot;Instead of looking at the total sequence, the Smith–Waterman algorithm compares segments of all possible lengths and optimizes the similarity measure.&quot; It&#39;s the n-gram approach.

&gt; A broadly similar metric, which is not based on an edit-distance model, is the
Jaro metric (Jaro 1995; 1989; Winkler
1999). In the record-linkage literature, good results have been obtained using variants of this method, which is based on the number and order of the common characters between two strings.

&gt;A variant of this due to Winkler (1999) also uses the length P of the longest common prefix

&gt;(seem to be intended primarily for short strings)

For text completion purposes, the Monger-Elkan and Jaro-Winkler approaches seem to make the most sense. Winkler&#39;s addition to the Jaro metric effectively weights the beginnings of words more heavily. And the affine aspect of Monger-Elkan means that the necessity to complete a word (which is simply a sequence of additions) won&#39;t disfavor it too heavily. 

Conclusion:
&gt;the TFIDF
ranking performed best among several token-based distance
metrics, and a tuned affine-gap edit-distance metric proposed by Monge and Elkan performed best among several
string edit-distance metrics. A surprisingly good distance
metric is a fast heuristic scheme, proposed by Jaro and later extended by Winkler.
This works almost as well as the Monge-Elkan scheme, but
is an order of magnitude faster.
One simple way of combining the TFIDF method and the
Jaro-Winkler is to replace the exact token matches used in
TFIDF with approximate token matches based on the Jaro-
Winkler scheme. This combination performs slightly better than either Jaro-Winkler or TFIDF on average, and occasionally performs much better. It is also close in performance to a learned combination of several of the best metrics
considered in this paper.

Javascript fuzzy search that makes sense

I have a `data.frame` with character data in one of the columns.
I would like to filter multiple options in the `data.frame` from the same column. Is there an easy way to do this that I&#39;m missing?

**Example:**
`data.frame` name = `dat`

    days      name
    88        Lynn
    11          Tom
    2           Chris
    5           Lisa
    22        Kyla
    1          Tom
    222      Lynn
    2         Lynn


I&#39;d like to filter out `Tom` and `Lynn` for example.   
When I do:

    target &lt;- c(&quot;Tom&quot;, &quot;Lynn&quot;)
    filt &lt;- filter(dat, name == target)

I get  this error:

    longer object length is not a multiple of shorter object length

Content Type	Original Author	Original Content on Stackoverflow
Question	Village	View Question on Stackoverflow
Solution 1 - String	hjpotter92	View Answer on Stackoverflow

How to check if matching text is found in a string in Lua?

String Problem Overview

String Solutions

Solution 1 - String

`string.find()`

Example

`string.match()`

Example

Merge DLL into EXE?

iOS viewDidLoad for UIView

Attributions