-
1 regular expression
"A concise and flexible notation for finding and replacing patterns of text. The notation comprises two basic character types: literal (normal) text characters, which indicate text that must exist in the target string, and metacharacters, which indicate the text that can vary in the target string. You can use regular expressions to quickly parse large amounts of text to find specific character patterns; extract, edit, replace, or delete text substrings; or to add the extracted strings to a collection in order to generate a report." -
2 regex
"A concise and flexible notation for finding and replacing patterns of text. The notation comprises two basic character types: literal (normal) text characters, which indicate text that must exist in the target string, and metacharacters, which indicate the text that can vary in the target string. You can use regular expressions to quickly parse large amounts of text to find specific character patterns; extract, edit, replace, or delete text substrings; or to add the extracted strings to a collection in order to generate a report."
См. также в других словарях:
substrings — n. contiguous portion of a string (Computers) … English contemporary dictionary
Rabin-Karp string search algorithm — The Rabin Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find a substring in a text. It is used for multiple pattern matching rather than single pattern matching. For… … Wikipedia
Longest common substring problem — The longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings. It should not be confused with the longest common subsequence problem. (For an explanation of the… … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
Comparison of programming languages (string functions) — String functions redirects here. For string functions in formal language theory, see String operations. Programming language comparisons General comparison Basic syntax Basic instructions Arrays … Wikipedia
CSS — Vorlage:Infobox Dateiformat/Wartung/magic fehltVorlage:Infobox Dateiformat/Wartung/website fehlt Cascading Style Sheets Dateiendung .css … Deutsch Wikipedia
Cascading Style Sheet — Vorlage:Infobox Dateiformat/Wartung/magic fehltVorlage:Infobox Dateiformat/Wartung/website fehlt Cascading Style Sheets Dateiendung .css … Deutsch Wikipedia
Cascading Stylesheets — Vorlage:Infobox Dateiformat/Wartung/magic fehltVorlage:Infobox Dateiformat/Wartung/website fehlt Cascading Style Sheets Dateiendung .css … Deutsch Wikipedia
Cascading style sheets — Vorlage:Infobox Dateiformat/Wartung/magic fehltVorlage:Infobox Dateiformat/Wartung/website fehlt Cascading Style Sheets Dateiendung .css … Deutsch Wikipedia
String (computer science) — In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set or alphabet. In computer programming, a string is traditionally a sequence of… … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia
