re and permutation

[giampiero mu]

hi

i'm newbie with re.
i have a problem:
given a function f(a,b) that gives true if a is a permutated string of
b.
i have to write a re in which we test if given a string l, a and b (not
overlapping) are present using f. In other words a re that inglobe f.
thanking everyone for help.

giampiero

 

[शंतनॠमहाजन (Shantanoo Mahajan]

You can use hash for this. For each character as key of the hash, and
value equal to the number of occurance. Do this for both strings. And
then compare the values.

 

[William James]

hi

i'm newbie with re.
i have a problem:
given a function f(a,b) that gives true if a is a permutated string of
b.
i have to write a re in which we test if given a string l, a and b (not
overlapping) are present using f. In other words a re that inglobe f.
thanking everyone for help.

giampiero

Using Ruby:
'trap'.split(//).sort == 'part'.split(//).sort
=> true

 

[Mothra]

Using Ruby:
'trap'.split(//).sort == 'part'.split(//).sort
=> true

Why are you posting ruby code in a Perl newsgroup?

Mothra

 

[Paul Lalli]

Why are you posting ruby code in a Perl newsgroup?

Because he's a troll. Check out all the recent postings from him.
He's hoping to start a Perl vs Ruby flamewar. Please don't encourage
the troll by responding to it.

Paul Lalli

 

[xhoster]

hi

i'm newbie with re.
i have a problem:
given a function f(a,b) that gives true if a is a permutated string of
b.
i have to write a re in which we test if given a string l, a and b (not
overlapping) are present using f. In other words a re that inglobe f.
thanking everyone for help.

Either this is stupid homework, or it is just stupid. The function f is
not necessary or even helpful for solving this problem, so why does the
answer require its use?

Xho

 

[borges2003xx]

thanx for your courtesy.
It's only a way to learn by example how put a function f working in re.
thanx for your help