Doom
It seems to be working fine except if there is more than one character between
the sets, it one return the proper count. ie. it won't find the sets.
ex sdrsd will reutrn true or 1
but sdthrsd will return false or 0.
any thoughts
and thanks for all of your help.
Sure. It follows
You might look into one of the free regular expression tools to make jobs
like this easier. One is
http://www.ultrapico.com/Expresso.htm
On 9/25/07, Kenny Kinds [EMAIL PROTECTED] wrote:
Doom
It seems to be working fine except if there is more than one character
between the sets, it one
Sorry, should have been
([a-z0-9]{2}).*\1
? means 0 or 1, * means 0 or more.
--Ben Doom
Kenny Kinds wrote:
Doom
It seems to be working fine except if there is more than one character
between the sets, it one return the proper count. ie. it won't find the sets.
ex sdrsd will reutrn true
You might look into one of the free regular expression tools to make jobs
like this easier. One is
Another one, made in CF for CF is here:
http://www.contentbox.com/claude/REwizard/index.cfm
--
___
REUSE CODE! Use custom tags;
See
You guys are awesome!
Thanks alot.
Doom, you're not as bad as the comics make you out to be.
~|
Get the answers you are looking for on the ColdFusion Labs
Forum direct from active programmers and developers.
Little do you know, that code lets me exploit holes in your server's
ozone with my nuclear bit bucket. Bwah, hahahahahah!
--Ben Doom
Kenny Kinds wrote:
You guys are awesome!
Thanks alot.
Doom, you're not as bad as the comics make you out to be.
One more question for you. Initially I stated that I was looking for double
characters when i actually i need to search for 3 characters in a row.
Everything i've tried doesn't give me the correct results.
Any ideas.
Little do you know, that code lets me exploit holes in your server's
ozone
Being the RegEx Ninja, my first thought is to use a regex:
How can *you* be the regex ninja when Bobby thinks *he* is. :)
~|
ColdFusion 8 - Build next generation apps
today, with easy PDF and Ajax features - download now
You're obviously more delusional than I am...
..:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.
Bobby Hartsfield
http://acoderslife.com
-Original Message-
From: Will Tomlinson [mailto:[EMAIL PROTECTED]
Sent: Tuesday, September 25, 2007 4:17 PM
To: CF-Talk
Subject: Re: String validation HELP
This guy's Kung Fu is strong.
or is that the proper martial art for this problem. ;)
Being the RegEx Ninja, my first thought is to use a regex:
How can *you* be the regex ninja when Bobby thinks *he* is. :)
~|
ColdFusion is
You seem to be very interested in regular expressions and text
processing. CF-RegEx is a low-volume list with a bunch of guys with
heads full of expertise and nothing to do. Operators are standing by!
In the meantime, if you need to match the same char 3 times:
([a-z0-9])\1\1
Or the same 3
r/(.*)Bobby(.*)/$1Ben$2/ig
--Ben Shadow RegEx Doom
Will Tomlinson wrote:
Being the RegEx Ninja, my first thought is to use a regex:
How can *you* be the regex ninja when Bobby thinks *he* is. :)
~|
Get the answers
Is that your suggestion?
r/(.*)Bobby(.*)/$1Ben$2/ig
--Ben Shadow RegEx Doom
Will Tomlinson wrote:
Being the RegEx Ninja, my first thought is to use a regex:
How can *you* be the regex ninja when Bobby thinks *he* is. :)
Kung Fu is an idiom. Literally, it means more or less hard work.
I learned the ancient Perl forms.
I studied under Dinowitz, O'Reilly, Jochem.
I faced the dreaded CF5 POSIX forms and was victorious.
Yeah. I worked hard for it.
--Ben Doom
Kenny Kinds wrote:
This guy's Kung Fu is strong.
or
:-)
..:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.
Bobby Hartsfield
http://acoderslife.com
-Original Message-
From: Ben Doom [mailto:[EMAIL PROTECTED]
Sent: Tuesday, September 25, 2007 3:52 PM
To: CF-Talk
Subject: Re: String validation HELP
r/(.*)Bobby(.*)/$1Ben$2/ig
--Ben Shadow RegEx
nvmd.
just got it.
Thanks for your help.
:-)
.:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.:.
Bobby Hartsfield
http://acoderslife.com
r/(.*)Bobby(.*)/$1Ben$2/ig
--Ben Shadow RegEx Doom
Will Tomlinson wrote:
Being the RegEx Ninja, my first thought is to use a regex:
How can *you* be the regex ninja
nvmd.
just got it.
Thanks for your help.
Don't mean to hijack the thread or anything, but you wouldn't happen to be the
same Kenny Kinds I worked with several years ago at CWC in St Louis, would you.
Just curious, as I tried to look him(you?) up at your other site a couple of
years ago, but
WOW!
Small world. Where are you at now. How are things?
As you've probably guessed, i'm not at CWC anymore. left there about 2 1/2
years ago.
nvmd.
just got it.
Thanks for your help.
Don't mean to hijack the thread or anything, but you wouldn't happen
to be the same Kenny Kinds I
My solution is not workinig in all cases.
Tried using ([a-z0-9]).\1, but doesn't check for three consecutive characters
in a row.
any suggestions?
Thanks
r/(.*)Bobby(.*)/$1Ben$2/ig
--Ben Shadow RegEx Doom
Will Tomlinson wrote:
Being the RegEx Ninja, my first thought is to use a regex:
Kenny,
I replied off-list, so as not to clutter things around here with a personal
conversation.
-morgan
On 9/25/07, Kenny Kinds wrote:
WOW!
Small world. Where are you at now. How are things?
As you've probably guessed, i'm not at CWC anymore. left there about 2 1/2
years ago.
nvmd.
throw a {3} in there somewhere
On 9/25/07, Kenny Kinds [EMAIL PROTECTED] wrote:
My solution is not workinig in all cases.
Tried using ([a-z0-9]).\1, but doesn't check for three consecutive characters
in a row.
any suggestions?
Thanks
r/(.*)Bobby(.*)/$1Ben$2/ig
--Ben Shadow RegEx
That's Perlish for replacing Bobby with Ben. :-)
--Ben Not Bobby Doom
Kenny Kinds wrote:
Is that your suggestion?
r/(.*)Bobby(.*)/$1Ben$2/ig
--Ben Shadow RegEx Doom
Will Tomlinson wrote:
Being the RegEx Ninja, my first thought is to use a regex:
How can *you* be the regex ninja when
Being the RegEx Ninja, my first thought is to use a regex:
([a-z0-9])\1
will find any instance of a character next to itself, so if you refind()
for it across your string, you can find the repeating chars.
--Ben Doom
Kenny Kinds wrote:
I'm writing code to verify if a string that is entered
Being the RegEx Ninja, my first thought is to use a regex:
([a-z0-9])\1
will find any instance of a character next to itself, so if you refind()
for it across your string, you can find the repeating chars.
--Ben Doom
Kenny Kinds wrote:
Thanks.
I have one more question as, in the string I
Sure. It follows basically the same principle.
([a-z0-9]{2}).?\1
This is, btw, a fairly inefficient regex, so I wouldn't run it against,
say, a K of data at a time, but for 8 chars, I expect the regex engine
overhead will be larger. In other words, for your purposes, it's fine.
(Not tested,
I'm writing code to verify if a string that is entered complies with certain
criteria.
The criteria are
the first four characters must have at least one alphanumeric character and one
numeric character and the last 4 digits must have the same.
Also, the string cannot have two repeating
26 matches
Mail list logo
