Difference between revisions of "LlSubStringIndex"
Jump to navigation
Jump to search
m |
|||
| Line 18: | Line 18: | ||
//This works because ~(-1) == 0 | //This works because ~(-1) == 0 | ||
//It saves bytecode and is faster then doing == -1 | //It saves bytecode and is faster then doing == -1 | ||
//(It's also significantly less readable (unless you include the comments) | |||
// and most developers I know will advice against these kind of practices. -OddesE Oh) | |||
} | } | ||
</pre> | </pre> | ||
Revision as of 10:50, 1 June 2007
| LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Summary
Function: integer llSubStringIndex( string source, string pattern );| 0.0 | Forced Delay |
| 10.0 | Energy |
Returns an integer that is the index of source in pattern.
| • string | source | |||
| • string | pattern |
If pattern is not found in source, -1 is returned.
Caveats
- Performs a literal match.
- Wildcards and RegEx are not supported.
Examples
Useful Snippets
An easy way to see if a string exists in another string...
if(~llSubStringIndex(myString, str))
{//it exists
//This works because ~(-1) == 0
//It saves bytecode and is faster then doing == -1
//(It's also significantly less readable (unless you include the comments)
// and most developers I know will advice against these kind of practices. -OddesE Oh)
}
See Also
Functions
| • | llListFindList | – | Find a list in another list |
Deep Notes
Signature |
|---|
function integer llSubStringIndex( string source, string pattern ); |