Say I have the sample text:
--------------------------------
This is a test - test 1
This is another test - test 23
a;sdlkfjas;dfklj -dadfas
afsdkwoiu;u;k - Test 4
--------------------------------
I want to find: -\s+([a-z])
There will be three matches with case sensitivity turned on.
I want to replace back reference $1 with its upper case version. Is this possible?
Cheers,
Troy
Convert Lower case to Upper case
-
Tony
Sorry Troy,
Looks like this isn't part of TextCrawler' regular expression engine. However, you can do this in VIM using:
:1,$s/\(\l\)/\u\1/g
but you can only do this one file at at time (even though there is a way to us it on multiple files, it doesn't seem to be working for me.).
With that said I think TextCrawler is GREAT! I was going to make a .NET regular expression program but TextCrawler does what I want and more! The problem is, I can't see using it more than once.
Looks like this isn't part of TextCrawler' regular expression engine. However, you can do this in VIM using:
:1,$s/\(\l\)/\u\1/g
but you can only do this one file at at time (even though there is a way to us it on multiple files, it doesn't seem to be working for me.).
With that said I think TextCrawler is GREAT! I was going to make a .NET regular expression program but TextCrawler does what I want and more! The problem is, I can't see using it more than once.