Search Results

I am not sure I correctly understand what you are asking, but I tried the following: fox = "The quick brown fox jumped over the lazy dog. "; longFox[n_] := StringJoin[Table[fox, {n}]] long = longFox[1 …

This is pure string hackery and I don't know how robust it is, but it works on your test case and one other that I tried. helper[l_, d_] := l <> StringJoin @@ ConstantArray["'", ToExpression[d]] SetA …

This seems to be reasonably robust. You can even use wildcard * in the name string, but in that case you will open the file which is 1st match in the list returned by FileNames. openNBorCDF[name_Strin …

This answer only discusses the implied question of why the OP's code fails. I think this should be made clear because it puzzled me until Mr.Wizard and rm -rf enlightened me. I would like keep others …

The documentation example is clearly wrong. Probably was written without proper testing. A second argument giving a spacer element must be added to Row. The quotes delimiting the spacer string must be …

StringReplace["hello, this is silly", x_ ~~ x_ -> x ~~ "X"] "helXo, this is silXy"

You could use StringDelete data = {"abc", "abd", "abx", "abf", "abe", "abg", "abh", "abi", "acb", "acd"}; StringDelete[data, {_ ~~ "bd", _ ~~ "bg"}] // DeleteCases[""] {"abc", "abx", "abf", "abe …

Position has some unusual defaults. As ref/Position says The default level specification for Position is {0,Infinity}, with Heads->True. So it is a little tricky to use StringContainsQ directly …

I ran into this problem in 2009. I submitted it to WRI technical support. This is the reply I received. After going through your notebook, I believe that what you observed is the expected behavi …

Here is a formulation using regular expression groups and POSIX character classes. transformRules = (# -> First @ StringCases[ToString[#], RegularExpression["([[:alpha:]]+)( …

The problem arises from naming the inner sub-patterns in your two pattern definitions with the same identifier. When you combine the patterns with Alternatives, you then have a pattern with two sub-pa …

You can use Shortest if the sub-strings of the form <td, class=test, >...</td> don't contain nested sub-strings of the form <td, class=test, > or </td>. If they do, follow this link. v = "...<td, cl …

There is a reason to use WordBoundary, but your example sentence doesn't bring it out. Consider mystring = "I am a demanding fan of Superman, Spiderman and Batman."; StringCases[mystring, LetterChar …

A brute force but very simple approach (no undocumented functions needed) that I think will work with any version of Mathematica. ordinalRule[n_Integer /; Mod[n, 100] == 11] := generalRule[n] ordinal …

You don't need regular expressions. text = "~ $ arecord -l **** List of CAPTURE Hardware Devices **** card 0: usb device [usb device], device 0: Audio [Audio Input] Subdevices: 0/1 Subdevice #0 …