Support pseudo pattern literal

[zero-plusplus]

Usually, InStr is used to search for text, and RegExMatch is used to search for regular expressions.

Pattern Literal provides a way for the user to control these types of text matching. This allows we to combine the above functions into one.

The following is a function to search for strings using pattern literal.

TextSearch(str, pattern) {
  pattern := bee.PatternLiteral(pattern)
  if (pattern.type == "text") {
    return InStr(str, pattern.text)
  }
  return RegExMatch(str, pattern.text)
}

Pattern Literal is a simple object that has two types: text and type. This object can also be represented by an array of two lengths, followed by text and type.

The following three types are available.

• "text" - Plain text
• "ignorecase" - Plain text, not case-sensitive
• "regex" - regular expression
  Other than that, I plan to implement "wildcard" if there is demand.

The following is an example of use.

TextSearch("example text", { text: "E", type: "text" }) => 0
TextSearch("example text", [ "E", "text" ]) => 0

TextSearch("example text", { text: "E", type: "ignorecase" }) => 1
TextSearch("example text", [ "E", "ignorecase" ]) => 1

TextSearch("example text", { text: "/E(?=\s)/i", type: "regex" }) => 7
TextSearch("example text", [ "/E(?=\s)/i", "regex" ]) => 7

There is a special format for "regex", which can be specified as "/REGEX/FLAGS".

TextSearch("example text", "/E(?=\s)/i") => 7