Programming Forums > Web Development and Design > PHP

ktsirig · Apr 25th, 2006, 6:30 AM

Hi all!
What I want to ask might be rather silly, but I have come across it a couple of days now and don't seem to find any solution.
Consider the following variables :

$var1= "ps :Hello and welcome to greece";
$var2= "ps :Hello and";
$var3= "ps :It was nice to meeting you";

My problem is that, when I check $var2, it matches both $var1 and $var3, because , as you can see, $var3 has "ps" in it.
So, I was wondering if there is a way of matching ENTIRE $var2 and not just portions of it. In this way, it would match only $var1 and not $var3...

Lich · Apr 25th, 2006, 10:16 AM

if($var1 == $var2)
{
do something
} else {
do something else
}

DaWei · Apr 25th, 2006, 10:45 AM

How WERE you checking? Just curious.

Lich · Apr 25th, 2006, 2:03 PM

pregmatch or something i'm assuming

JavaMan · Apr 25th, 2006, 5:02 PM

Either substr or preg_match.

mrynit · Apr 25th, 2006, 6:13 PM

check the length of each var, if they are not the same length then the content is not the same(completely identical). if they are the same do a recursive binary tree search to check the indavidual characters. if they all match then the vars are identical. <- can you do that in PHP? i did that in C++. it's the same idea.

DaWei · Apr 25th, 2006, 8:46 PM

@ mrynit: Your idea is functional, but silly. The OP got his answer, I was just curious as to how he was failing, before.

mrynit · Apr 26th, 2006, 2:00 AM

silly as in it is over kill for the problem?

Jimbo · Apr 26th, 2006, 2:31 AM

Why would you use a binary tree per say, instead of just iterating through the elements and checking them linearly? And even bettery, why not use an optimized library function?

mrynit · Apr 26th, 2006, 4:45 AM

Quote:

Originally Posted by Jimbo

Why would you use a binary tree per say, instead of just iterating through the elements and checking them linearly? And even bettery, why not use an optimized library function?

binary tree is faster than just going from start to finish(the teacher said that). you can make the bin tree sreach better if you want.

recursion > iteration ?

library function would work. if you want to do it your self then do what i said. thats what first came to mind for doing such a check.

Apr 25th, 2006, 6:30 AM	#1
ktsirig Programmer Join Date: Oct 2005 Posts: 54 Rep Power: 4	match entire string in PHP Hi all! What I want to ask might be rather silly, but I have come across it a couple of days now and don't seem to find any solution. Consider the following variables : $var1= "ps :Hello and welcome to greece"; $var2= "ps :Hello and"; $var3= "ps :It was nice to meeting you"; My problem is that, when I check $var2, it matches both $var1 and $var3, because , as you can see, $var3 has "ps" in it. So, I was wondering if there is a way of matching ENTIRE $var2 and not just portions of it. In this way, it would match only $var1 and not $var3...

Apr 25th, 2006, 10:16 AM	#2
Lich Professional Programmer Join Date: May 2005 Location: Detroit Posts: 254 Rep Power: 4	if($var1 == $var2) { do something } else { do something else } __________________ --John Cruz Web Developer www.cruzweb.net

Apr 25th, 2006, 10:45 AM	#3
DaWei Resident Grouch Join Date: Jun 2005 Posts: 6,453 Rep Power: 10	How WERE you checking? Just curious. __________________ Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code. Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

Apr 25th, 2006, 2:03 PM	#4
Lich Professional Programmer Join Date: May 2005 Location: Detroit Posts: 254 Rep Power: 4	pregmatch or something i'm assuming __________________ --John Cruz Web Developer www.cruzweb.net

Apr 25th, 2006, 8:46 PM	#7
DaWei Resident Grouch Join Date: Jun 2005 Posts: 6,453 Rep Power: 10	@ mrynit: Your idea is functional, but silly. The OP got his answer, I was just curious as to how he was failing, before. __________________ Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code. Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

Apr 25th, 2006, 5:02 PM	#5
JavaMan Newbie Join Date: Oct 2005 Posts: 29 Rep Power: 0	Either substr or preg_match.

Apr 25th, 2006, 6:13 PM	#6
mrynit Hobbyist Programmer Join Date: Mar 2006 Location: WA, USA Posts: 343 Rep Power: 3	check the length of each var, if they are not the same length then the content is not the same(completely identical). if they are the same do a recursive binary tree search to check the indavidual characters. if they all match then the vars are identical. <- can you do that in PHP? i did that in C++. it's the same idea.

Apr 26th, 2006, 2:00 AM	#8
mrynit Hobbyist Programmer Join Date: Mar 2006 Location: WA, USA Posts: 343 Rep Power: 3	silly as in it is over kill for the problem?

Apr 26th, 2006, 2:31 AM	#9
Jimbo Battle Programmer Join Date: Feb 2006 Location: Bellevue, WA, USA Posts: 770 Rep Power: 3	Why would you use a binary tree per say, instead of just iterating through the elements and checking them linearly? And even bettery, why not use an optimized library function?

Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)

Thread Tools
Show Printable Version Email this Page
Display Modes
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode

Programming Forums > Web Development and Design > PHP

match entire string in PHP