FTS does not support LIKE The previously accepted answer was incorrect. Full Text Search with its full text indexes is not for the LIKE operator at all, it has its own operators and doesn’t work for arbitrary strings. It operates on words based on dictionaries and stemming. It does support prefix matching for words, but … Read more
Ant-style path patterns matching in spring-framework: The mapping matches URLs using the following rules: ? matches one character * matches zero or more characters ** matches zero or more ‘directories’ in a path {spring:[a-z]+} matches the regexp [a-z]+ as a path variable named “spring” Some examples: com/t?st.jsp – matches com/test.jsp but also com/tast.jsp or com/txst.jsp … Read more
Update: The Roslyn compiler has been updated to make the behavior of the two operators the same when there is no overloaded equality operator. Please see the code in the current compiler results (M1 and M2 in the code) that shows what happens when there is no overloaded equality comparer. They both now have the … Read more
Understanding pattern matching requires explaining three parts: Algebraic data types. What pattern matching is Why its awesome. Algebraic data types in a nutshell ML-like functional languages allow you define simple data types called “disjoint unions” or “algebraic data types”. These data structures are simple containers, and can be recursively defined. For example: type ‘a list … Read more
Use awk with a flag to trigger the print when necessary: $ awk ‘/abc/{flag=1;next}/mno/{flag=0}flag’ file def1 ghi1 jkl1 def2 ghi2 jkl2 How does this work? /abc/ matches lines having this text, as well as /mno/ does. /abc/{flag=1;next} sets the flag when the text abc is found. Then, it skips the line. /mno/{flag=0} unsets the flag … Read more
I tried using existing fuzzy libraries like fuse.js and also found them to be terrible, so I wrote one which behaves basically like sublime’s search. https://github.com/farzher/fuzzysort The only typo it allows is a transpose. It’s pretty solid (1k stars, 0 issues), very fast, and handles your case easily: fuzzysort.go(‘int’, [‘international’, ‘splint’, ‘tinder’]) // [{highlighted: ‘*int*ernational’, … Read more
You can add a guard, i.e. an if and a boolean expression after the pattern: a match { case 10 => println(“ten”) case x if x > 10 => println(“greater than ten”) case _ => println(“less than ten”) } Edit: Note that this is more than superficially different to putting an if after the =>, … Read more
It “splats”1 the sequence. Look at the constructor signature new Elem(prefix: String, label: String, attributes: MetaData, scope: NamespaceBinding, child: Node*) which is called as new Elem(prefix, label, attributes, scope, child1, child2, … childN) but here there is only a sequence, not child1, child2, etc. so this allows the result sequence to be used as the … Read more
#include <algorithm> std::string s = “a_b_c”; std::string::difference_type n = std::count(s.begin(), s.end(), ‘_’);
Here’s a concise solution which avoids regular expressions and slow in-Python loops: def principal_period(s): i = (s+s).find(s, 1, -1) return None if i == -1 else s[:i] See the Community Wiki answer started by @davidism for benchmark results. In summary, David Zhang’s solution is the clear winner, outperforming all others by at least 5x for … Read more