LlLinksetDataFindKeys - Revision history

Wulfie Reanimator: Added speculative limits.

2026-03-01T02:10:17Z

Added speculative limits.

← Older revision		Revision as of 19:10, 28 February 2026
Line 14:		Line 14:
	{{LSLP\|pattern}} is a [https://en.wikipedia.org/wiki/Regular_expression Regular expression].		{{LSLP\|pattern}} is a [https://en.wikipedia.org/wiki/Regular_expression Regular expression].

	\|caveats		\|caveats=
			*The maximum length for {{LSLP\|pattern}} seems to be 800 characters.
			*There seems to be a timing restriction. If the time limit is exceeded, the function fails silently.
			**Returns an empty list and the script continues execution.
	\|helpers		\|helpers
	\|also_functions=		\|also_functions=

Panterapolnocy Resident: typo

2025-10-25T11:47:17Z

typo

← Older revision		Revision as of 04:47, 25 October 2025
Line 64:		Line 64:
	list keysFound = llLinksetDataFindKeys("(?i)^[0-9a-f]{8}(-[0-9a-f]{4}){3}-[0-9a-f]{12}$", 0, 0);		list keysFound = llLinksetDataFindKeys("(?i)^[0-9a-f]{8}(-[0-9a-f]{4}){3}-[0-9a-f]{12}$", 0, 0);
	</source>		</source>
	The following code can also be used to find UUID ~~kyes~~ in LinksetData memory.		The following code can also be used to find UUID keys in LinksetData memory.
	<source lang="lsl2">		<source lang="lsl2">
	list keysFound = llLinksetDataFindKeys("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$", 0, 0);		list keysFound = llLinksetDataFindKeys("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{4}-[0-9a-fA-F]{12}$", 0, 0);

Madi Melodious: added examples for finding UUID keys with approparte warning about memory

2025-08-12T20:04:43Z

added examples for finding UUID keys with approparte warning about memory

@@ Line 59: / Line 59: @@
+}
 </source>
 The script below uses llLinksetDataFindKeys for blacklist management.

Wulfie Reanimator at 08:42, 16 February 2024

2024-02-16T08:42:50Z

← Older revision		Revision as of 01:42, 16 February 2024
Line 45:		Line 45:
	list keys;		list keys;

	keys = llLinksetDataFindKeys("Thing", 0, 1); ~~// Return 1 key starting from the first match.~~		// Return 1 key starting from the first match.
			keys = llLinksetDataFindKeys("Thing", 0, 1);
	llOwnerSay(llList2CSV(keys)); // ThingA_config		llOwnerSay(llList2CSV(keys)); // ThingA_config

	keys = llLinksetDataFindKeys("Thing", 3, 1); ~~// Start results with an offset of 3 indexes.~~		// Return 1 key after skipping the first 3 matches.
			keys = llLinksetDataFindKeys("Thing", 3, 1);
	llOwnerSay(llList2CSV(keys)); // ThingB_data		llOwnerSay(llList2CSV(keys)); // ThingB_data

	keys = llLinksetDataFindKeys("_data", 1, 10); ~~// Return up to 10 keys containing "_data", skip the first.~~		// Return up to 10 keys after skipping the first match.
			keys = llLinksetDataFindKeys("_data", 1, 10);
	llOwnerSay(llList2CSV(keys)); // ThingB_data, ThingC_data		llOwnerSay(llList2CSV(keys)); // ThingB_data, ThingC_data
	}		}
Line 57:		Line 60:
	</source>		</source>

	<source lang="lsl2">~~// Simple blacklist management.~~		The script below uses llLinksetDataFindKeys for blacklist management.
			<source lang="lsl2">
	integer gDialogChannel;		integer gDialogChannel;
	integer gDialogHandle;		integer gDialogHandle;

Wulfie Reanimator: Added example about parameters.

2024-02-16T07:56:34Z

Added example about parameters.

@@ Line 30: / Line 30: @@
 |also_tests
 |also_articles
-|examples=<source lang="lsl2">// Simple blacklist management.
+|examples=
 integer gDialogChannel;

Panterapolnocy Resident at 14:54, 12 August 2023

2023-08-12T14:54:15Z

@@ Line 30: / Line 30: @@
 |also_tests
 |also_articles
 |notes=
 {{LSL Regular Expressions}}

Lucia Nightfire: Removed caveats about random sort order since sort order was changed to alphabetical as of server version 2023-03-24.579022.

2023-04-23T03:24:55Z

Removed caveats about random sort order since sort order was changed to alphabetical as of server version 2023-03-24.579022.

← Older revision		Revision as of 20:24, 22 April 2023
Line 9:		Line 9:
	\|func_footnote		\|func_footnote
	\|func_desc=		\|func_desc=
	The '''llLinksetDataFindKeys''' function returns a list of up to {{LSLP\|count}} keys from the datastore that match {{LSLP\|pattern}}, starting at the one indicated by {{LSLP\|start}}. If {{LSLP\|count}} is less than 1, then all keys between {{LSLP\|start}} and the end which match {{LSLP\|pattern}} are returned. If {{LSLP\|count}} minus {{LSLP\|start}} exceeds the number of matching keys, the returned list will be shorter than {{LSLP\|count}}, down to a zero-length list if {{LSLP\|start}} equals or exceeds the number of matching keys.		The '''llLinksetDataFindKeys''' function returns a list of up to {{LSLP\|count}} keys from the datastore that match {{LSLP\|pattern}}, starting at the one indicated by {{LSLP\|start}}. If {{LSLP\|count}} is less than 1, then all keys between {{LSLP\|start}} and the end which match {{LSLP\|pattern}} are returned. If {{LSLP\|count}} minus {{LSLP\|start}} exceeds the number of matching keys, the returned list will be shorter than {{LSLP\|count}}, down to a zero-length list if {{LSLP\|start}} equals or exceeds the number of matching keys. The list is ordered alphabetically.
	\|func_footnote		\|func_footnote
	\|spec=		\|spec=
	{{LSLP\|pattern}} is a [https://en.wikipedia.org/wiki/Regular_expression Regular expression].		{{LSLP\|pattern}} is a [https://en.wikipedia.org/wiki/Regular_expression Regular expression].

	\|caveats=		\|caveats
	* Unlike [[llLinksetDataListKeys]], the order of the returned list is neither usefully sorted nor predictable.
	** The order of keys returned is the same through successive calls, even if {{LSLP\|pattern}} has changed. However, when a new key-value pair is added, it is added essentially randomly in the order.
	** Writing the same sequence of key-value pairs after successive calls to [[llLinksetDataReset]] or in different linksets occasionally results in the same ordering. However, this behavior is by no means guaranteed and should not be relied upon.
	\|helpers		\|helpers
	\|also_functions=		\|also_functions=

Nelson Jenkins: reformatted caveats

2023-01-15T05:40:31Z

reformatted caveats

← Older revision		Revision as of 22:40, 14 January 2023
Line 16:		Line 16:
	\|caveats=		\|caveats=
	* Unlike [[llLinksetDataListKeys]], the order of the returned list is neither usefully sorted nor predictable.		* Unlike [[llLinksetDataListKeys]], the order of the returned list is neither usefully sorted nor predictable.
	** The order of keys returned is the same through successive calls, even if {{LSLP\|pattern}} has changed. However, when a new key-value pair is added, it is added essentially randomly in the order. ~~Additionally, while writing~~ the same sequence of key-value pairs after successive calls to [[llLinksetDataReset]], or in different linksets, occasionally results in the same ordering, this behavior is by no means guaranteed.		** The order of keys returned is the same through successive calls, even if {{LSLP\|pattern}} has changed. However, when a new key-value pair is added, it is added essentially randomly in the order.
			** Writing the same sequence of key-value pairs after successive calls to [[llLinksetDataReset]] or in different linksets occasionally results in the same ordering. However, this behavior is by no means guaranteed and should not be relied upon.
	\|helpers		\|helpers
	\|also_functions=		\|also_functions=

Nelson Jenkins: added caveat re: ordering

2023-01-15T05:39:37Z

added caveat re: ordering

← Older revision		Revision as of 22:39, 14 January 2023
Line 9:		Line 9:
	\|func_footnote		\|func_footnote
	\|func_desc=		\|func_desc=
	The '''llLinksetDataFindKeys''' function returns a list of up to {{LSLP\|count}} keys from the datastore that match {{LSLP\|pattern}}, starting at the one indicated by {{LSLP\|start}}. If {{LSLP\|count}} is less than 1, then all keys between {{LSLP\|start}} and the end which match {{LSLP\|pattern}} are returned.		The '''llLinksetDataFindKeys''' function returns a list of up to {{LSLP\|count}} keys from the datastore that match {{LSLP\|pattern}}, starting at the one indicated by {{LSLP\|start}}. If {{LSLP\|count}} is less than 1, then all keys between {{LSLP\|start}} and the end which match {{LSLP\|pattern}} are returned. If {{LSLP\|count}} minus {{LSLP\|start}} exceeds the number of matching keys, the returned list will be shorter than {{LSLP\|count}}, down to a zero-length list if {{LSLP\|start}} equals or exceeds the number of matching keys.
	\|func_footnote		\|func_footnote
	\|spec=		\|spec=
	{{LSLP\|pattern}} is a [https://en.wikipedia.org/wiki/Regular_expression Regular expression].		{{LSLP\|pattern}} is a [https://en.wikipedia.org/wiki/Regular_expression Regular expression].

	\|caveats		\|caveats=
			* Unlike [[llLinksetDataListKeys]], the order of the returned list is neither usefully sorted nor predictable.
			** The order of keys returned is the same through successive calls, even if {{LSLP\|pattern}} has changed. However, when a new key-value pair is added, it is added essentially randomly in the order. Additionally, while writing the same sequence of key-value pairs after successive calls to [[llLinksetDataReset]], or in different linksets, occasionally results in the same ordering, this behavior is by no means guaranteed.
	\|helpers		\|helpers
	\|also_functions=		\|also_functions=

Chaser Zaks: Fix copypaste error

2022-11-16T06:53:48Z

Fix copypaste error

← Older revision		Revision as of 23:53, 15 November 2022
Line 9:		Line 9:
	\|func_footnote		\|func_footnote
	\|func_desc=		\|func_desc=
	The '''~~llLinksetDataListKeys~~''' function returns a list of up to {{LSLP\|count}} keys from the datastore that match {{LSLP\|pattern}}, starting at the one indicated by {{LSLP\|start}}. If {{LSLP\|count}} is less than 1, then all keys between {{LSLP\|start}} and the end which match {{LSLP\|pattern}} are returned.		The '''llLinksetDataFindKeys''' function returns a list of up to {{LSLP\|count}} keys from the datastore that match {{LSLP\|pattern}}, starting at the one indicated by {{LSLP\|start}}. If {{LSLP\|count}} is less than 1, then all keys between {{LSLP\|start}} and the end which match {{LSLP\|pattern}} are returned.
	\|func_footnote		\|func_footnote
	\|spec=		\|spec=