String Compare - Revision history

ObviousAltIsObvious Resident: tag to

2015-01-22T22:37:36Z

← Older revision		Revision as of 15:37, 22 January 2015
Line 7:		Line 7:
	I have used this script for comparing the [[Key\|Keys]] of two objects in a dynamic set of sensors, to decide which one should be the "Master" in the region to tell me information. I'm sure there can be more uses to this...		I have used this script for comparing the [[Key\|Keys]] of two objects in a dynamic set of sensors, to decide which one should be the "Master" in the region to tell me information. I'm sure there can be more uses to this...

	<~~lsl~~>		<source lang="lsl2">
	integer compare(string s1, string s2)		integer compare(string s1, string s2)
	{		{
Line 31:		Line 31:
	}		}
	}		}
	</~~lsl~~>		</source>

	=== Notes: ===		=== Notes: ===
	I'm not sure why the string length comparison is in above function, it is not needed for string comparison functions where you rely on alphabetical order. The concept is nice though. I've modified this function. Given strings s1 and s2, it'l return 1 if s1>s2, -1 if s1<s2 and 0 if they are equal:		I'm not sure why the string length comparison is in above function, it is not needed for string comparison functions where you rely on alphabetical order. The concept is nice though. I've modified this function. Given strings s1 and s2, it'l return 1 if s1>s2, -1 if s1<s2 and 0 if they are equal:

	<~~lsl~~>		<source lang="lsl2">
	integer compare(string s1, string s2)		integer compare(string s1, string s2)
	{		{
Line 54:		Line 54:
	}		}
	}		}
	</~~lsl~~>		</source>
	Above function not extensively tested, but it seems to suit my purpose (having users enter a set of characters within certain range, filter out anything else since it will be submitted to a webpage).		Above function not extensively tested, but it seems to suit my purpose (having users enter a set of characters within certain range, filter out anything else since it will be submitted to a webpage).
	If only linden would give us 'normal' string comparison functions like any other language, instead of spending expensive cpu cycles to validate user input.		If only linden would give us 'normal' string comparison functions like any other language, instead of spending expensive cpu cycles to validate user input.

	This can be further reduced to the following:		This can be further reduced to the following:
	<~~lsl~~>		<source lang="lsl2">
	integer compare(string s1, string s2)		integer compare(string s1, string s2)
	{		{
Line 70:		Line 70:
	return TRUE;		return TRUE;
	}		}
	</~~lsl~~>		</source>

	{{LSLC\|Library}}		{{LSLC\|Library}}
	{{LSLC\|Examples}}		{{LSLC\|Examples}}
	{{LSLC\|User-Defined_Functions}}		{{LSLC\|User-Defined_Functions}}

Kireji Haiku: some readability improvements (boolean return type, etc.)

2012-09-30T19:35:59Z

some readability improvements (boolean return type, etc.)

← Older revision		Revision as of 12:35, 30 September 2012
Line 8:		Line 8:

	<lsl>		<lsl>
	integer compare(string s1, string s2) {		integer compare(string s1, string s2)
	if (s1 == s2) {		{
	return 0;		if (s1 == s2)
	} else if (llStringLength(s1) < llStringLength(s2)) {		return FALSE;
	return 1;
	} else if (llStringLength(s1) > llStringLength(s2)) {		else if (llStringLength(s1) < llStringLength(s2))
			return TRUE;

			else if (llStringLength(s1) > llStringLength(s2))
	return -1;		return -1;
	} else {
	list l = [s1, s2];		else
	l = llListSort(l, 0, 1);		{
	if (s1 == llList2String(l, 0))		list testList = [s1, s2];
	return 1;
			testList = llListSort(testList, 0, TRUE);

			if (s1 == llList2String(testList, 0))
			return TRUE;

	return -1;		return -1;
	}		}
Line 29:		Line 37:

	<lsl>		<lsl>
	integer compare(string s1, string s2) {		integer compare(string s1, string s2)
	if (s1 == s2) {		{
	return 0;		if (s1 == s2)
	} else {		return FALSE;
	list l = [s1, s2];
	l = llListSort(l, 1, ~~FALSE~~);		else
	if (s1 == llList2String(l, 0)) ~~//s1>s2~~		{
	return 1;		list testList = [s1, s2];
			testList = llListSort(testList, 1, 0);

			// s2 < s1
			if (s1 == llList2String(testList, 0))
			return TRUE;

	return -1;		return -1;
	}		}
Line 46:		Line 60:
	This can be further reduced to the following:		This can be further reduced to the following:
	<lsl>		<lsl>
	integer compare(string s1, string s2) {		integer compare(string s1, string s2)
			{
	if (s1 == s2)		if (s1 == s2)
	return 0;		return FALSE;
	if (llList2String(llListSort([s1, s2], 1, TRUE), 0) ~~== s1~~)
			if (s1 == llList2String(llListSort([s1, s2], 1, TRUE), 0))
	return -1;		return -1;
	return 1;
			return TRUE;
	}		}
	</lsl>		</lsl>

Ugleh Ulrik at 21:57, 25 May 2010

2010-05-25T21:57:26Z

← Older revision		Revision as of 14:57, 25 May 2010
Line 57:		Line 57:
	{{LSLC\|Library}}		{{LSLC\|Library}}
	{{LSLC\|Examples}}		{{LSLC\|Examples}}
	{{LSLC\|~~UD Functions~~}}		{{LSLC\|User-Defined_Functions}}

Ugleh Ulrik at 00:08, 25 May 2010

2010-05-25T00:08:27Z

← Older revision		Revision as of 17:08, 24 May 2010
Line 57:		Line 57:
	{{LSLC\|Library}}		{{LSLC\|Library}}
	{{LSLC\|Examples}}		{{LSLC\|Examples}}
			{{LSLC\|UD Functions}}

Kubota Homewood: /* Notes: */

2009-12-29T21:13:52Z

Notes:

← Older revision		Revision as of 14:13, 29 December 2009
Line 43:		Line 43:
	Above function not extensively tested, but it seems to suit my purpose (having users enter a set of characters within certain range, filter out anything else since it will be submitted to a webpage).		Above function not extensively tested, but it seems to suit my purpose (having users enter a set of characters within certain range, filter out anything else since it will be submitted to a webpage).
	If only linden would give us 'normal' string comparison functions like any other language, instead of spending expensive cpu cycles to validate user input.		If only linden would give us 'normal' string comparison functions like any other language, instead of spending expensive cpu cycles to validate user input.

			This can be further reduced to the following:
			<lsl>
			integer compare(string s1, string s2) {
			if (s1 == s2)
			return 0;
			if (llList2String(llListSort([s1, s2], 1, TRUE), 0) == s1)
			return -1;
			return 1;
			}
			</lsl>

	{{LSLC\|Library}}		{{LSLC\|Library}}
	{{LSLC\|Examples}}		{{LSLC\|Examples}}

Tano Toll: /* Notes: */

2009-10-17T11:51:25Z

Notes:

← Older revision		Revision as of 04:51, 17 October 2009
Line 26:		Line 26:

	=== Notes: ===		=== Notes: ===
	I'm not sure why the string length comparison is in above function, it is not needed. The concept is nice though. I've modified this function. Given strings s1 and s2, it'l return 1 if s1>s2, -1 if s1<s2 and 0 if they are equal:		I'm not sure why the string length comparison is in above function, it is not needed for string comparison functions where you rely on alphabetical order. The concept is nice though. I've modified this function. Given strings s1 and s2, it'l return 1 if s1>s2, -1 if s1<s2 and 0 if they are equal:

	<lsl>		<lsl>
	integer compare(string s1, string s2) {		integer compare(string s1, string s2) {
Line 40:		Line 41:
	}		}
	</lsl>		</lsl>
			Above function not extensively tested, but it seems to suit my purpose (having users enter a set of characters within certain range, filter out anything else since it will be submitted to a webpage).
			If only linden would give us 'normal' string comparison functions like any other language, instead of spending expensive cpu cycles to validate user input.

	{{LSLC\|Library}}		{{LSLC\|Library}}
	{{LSLC\|Examples}}		{{LSLC\|Examples}}

Tano Toll: /* String compare */

2009-10-17T11:46:36Z

String compare

@@ Line 25: / Line 25: @@
 </lsl>
 {{LSLC|Library}}
 {{LSLC|Examples}}

Huney Jewell: Brushed up and added to category

2007-12-11T15:13:30Z

Brushed up and added to category

← Older revision		Revision as of 08:13, 11 December 2007
Line 7:		Line 7:
	I have used this script for comparing the [[Key\|Keys]] of two objects in a dynamic set of sensors, to decide which one should be the "Master" in the region to tell me information. I'm sure there can be more uses to this...		I have used this script for comparing the [[Key\|Keys]] of two objects in a dynamic set of sensors, to decide which one should be the "Master" in the region to tell me information. I'm sure there can be more uses to this...

			<lsl>
	<~~pre~~>
	integer compare(string s1, string s2) {		integer compare(string s1, string s2) {
	if (s1 == s2) {		if (s1 == s2) {
Line 24:		Line 23:
	}		}
	}		}
	</~~pre~~>		</lsl>


	~~[[Category:LSL~~ Examples]]		{{LSLC\|Library}}
			{{LSLC\|Examples}}

Huney Jewell: It's just an example, not really a script

2007-09-07T14:59:42Z

It's just an example, not really a script

← Older revision		Revision as of 07:59, 7 September 2007
Line 1:		Line 1:
	{{LSL Header}}		{{LSL Header}}
			=== String compare ===
	Created by [[User:Xaviar Czervik\|Xaviar Czervik]]. Do whatever you wish with this function: Sell it (good luck), use it, or modify it.		Created by [[User:Xaviar Czervik\|Xaviar Czervik]]. Do whatever you wish with this function: Sell it (good luck), use it, or modify it.

Line 27:		Line 27:



	~~[[Category:LSL Library]]~~
	[[Category:LSL Examples]]		[[Category:LSL Examples]]

Xaviar Czervik at 23:24, 26 August 2007

2007-08-26T23:24:12Z

← Older revision		Revision as of 16:24, 26 August 2007
Line 3:		Line 3:
	Created by [[User:Xaviar Czervik\|Xaviar Czervik]]. Do whatever you wish with this function: Sell it (good luck), use it, or modify it.		Created by [[User:Xaviar Czervik\|Xaviar Czervik]]. Do whatever you wish with this function: Sell it (good luck), use it, or modify it.

	The following code returns 1, -1 or 0. The 1 and -1 are essentially random, however it will return the same value every time the script is executed. 0 Is returned when, and only when, the strings are exactly equal.		The following code returns 1, -1 or 0. The 1 and -1 are essentially random, however it will return the same value every time the script is executed. 0 Is returned when, and only when, the strings are exactly equal. Completely re-designed to use a few tricks I learned in the past months. Also much easier to read now.

	I have used this script for comparing the [[Key\|Keys]] of two objects in a dynamic set of sensors, to decide which one should be the "Master" in the region to tell me information. I'm sure there can be more uses to this...		I have used this script for comparing the [[Key\|Keys]] of two objects in a dynamic set of sensors, to decide which one should be the "Master" in the region to tell me information. I'm sure there can be more uses to this...