/tg/ Station 13 - Modules - TypesDefine Details

code/__HELPERS/_lists.dm

LAZYINITLISTInitialize the lazylist
UNSETEMPTYIf the provided list is empty, set it to null
LAZYLISTDUPLICATELike LAZYCOPY - copies an input list if the list has entries, If it doesn't the assigned list is nulled
LAZYREMOVERemove an item from the list, set the list to null if empty
LAZYADDAdd an item to the list, if the list is null it will initialize it
LAZYORAdd an item to the list if not already present, if the list is null it will initialize it
LAZYFINDReturns the key of the submitted item in the list
LAZYACCESSreturns L[I] if L exists and I is a valid index of L, runtimes if L is not a list
LAZYSETSets the item K to the value V, if the list is null it will initialize it
LAZYSETLENSets the length of a lazylist
LAZYLENReturns the lenght of the list
LAZYNULLSets a list to null
LAZYADDASSOCAdds to the item K the value V, if the list is null it will initialize it
LAZYADDASSOCLISTThis is used to add onto lazy assoc list when the value you're adding is a /list/. This one has extra safety over lazyaddassoc because the value could be null (and thus cant be used to += objects)
LAZYREMOVEASSOCRemoves the value V from the item K, if the item K is empty will remove it from the list, if the list is empty will set the list to null
LAZYACCESSASSOCAccesses an associative list, returns null if nothing is found
QDEL_LAZYLISTQdel every item in the list before setting the list to null
LAZYCOPYUse LAZYLISTDUPLICATE instead if you want it to null with no entries
LAZYCLEARLISTConsider LAZYNULL instead
SANITIZE_LISTReturns the list if it's actually a valid list, otherwise will initialize it
LAZYORASSOCLISTPerforms an insertion on the given lazy list with the given key and value. If the value already exists, a new one will not be made.
COMPARE_KEYPassed into BINARY_INSERT to compare keys
COMPARE_VALUEPassed into BINARY_INSERT to compare values
BINARY_INSERTBinary search sorted insert INPUT: Object to be inserted LIST: List to insert object into TYPECONT: The typepath of the contents of the list COMPARE: The object to compare against, usualy the same as INPUT COMPARISON: The variable on the objects to compare COMPTYPE: How should the values be compared? Either COMPARE_KEY or COMPARE_VALUE.
BINARY_INSERT_PROC_COMPARECustom binary search sorted insert utilising comparison procs instead of vars. INPUT: Object to be inserted LIST: List to insert object into TYPECONT: The typepath of the contents of the list COMPARE: The object to compare against, usualy the same as INPUT COMPARISON: The plaintext name of a proc on INPUT that takes a single argument to accept a single element from LIST and returns a positive, negative or zero number to perform a comparison. COMPTYPE: How should the values be compared? Either COMPARE_KEY or COMPARE_VALUE.
/proc/english_list Returns a list in plain english as a string
/proc/is_type_in_list Checks for specific types in a list
is_type_in_typecacheChecks for specific types in specifically structured (Assoc "type" = TRUE) lists ('typecaches')
/proc/typecache_filter_list returns a new list with only atoms that are in the typecache list
/proc/typecache_filter_list_reverse return a new list with atoms that are not in the typecache list
/proc/typecache_filter_multi_list_exclusion similar to typecache_filter_list and typecache_filter_list_reverse but it supports an inclusion list and and exclusion list
/proc/typecacheof Like typesof() or subtypesof(), but returns a typecache instead of a list
/proc/list_clear_nulls Removes any null entries from the list Returns TRUE if the list had nulls, FALSE otherwise
/proc/pick_weight Picks a random element from a list based on a weighting system. For example, given the following list: A = 6, B = 3, C = 1, D = 0 A would have a 60% chance of being picked, B would have a 30% chance of being picked, C would have a 10% chance of being picked, and D would have a 0% chance of being picked. You should only pass integers in.
/proc/pick_n_take Pick a random element from the list and remove it from the list.
/proc/pop Returns the top(last) element from the list and removes it from the list (typical stack function)
/proc/peek Returns the top (last) element from the list, does not remove it from the list. Stack functionality.
/proc/next_list_item Returns the next item in a list
/proc/previous_list_item Returns the previous item in a list
/proc/shuffle Randomize: Return the list in a random order
/proc/shuffle_inplace same as shuffle, but returns nothing and acts on list in place
/proc/unique_list Return a list with no duplicate entries
/proc/unique_list_in_place same as unique_list, but returns nothing and acts on list in place (also handles associated values properly)
/proc/sort_key for sorting clients or mobs by ckey
/proc/sort_record Specifically for record datums in a list.
/proc/sort_list sort any value in a list
/proc/sort_names uses sort_list() but uses the var's name specifically. This should probably be using mergeAtom() instead
/proc/bitfield_to_list Converts a bitfield to a list of numbers (or words if a wordlist is provided)
KEYBYINDEXReturns the key based on the index
/proc/count_by_type return the amount of items of the same type inside a list
/proc/find_record Returns datum/data/record
/proc/move_element Move a single element from position from_index within a list, to position to_index All elements in the range [1,to_index) before the move will be before the pivot afterwards All elements in the range [to_index, L.len+1) before the move will be after the pivot afterwards In other words, it's as if the range [from_index,to_index) have been rotated using a <<< operation common to other languages. from_index and to_index must be in the range [1,L.len+1] This will preserve associations ~Carnie
/proc/move_range Move elements [from_index,from_index+len) to [to_index-len, to_index) Same as moveElement but for ranges of elements This will preserve associations ~Carnie
/proc/swap_range Move elements from [from_index, from_index+len) to [to_index, to_index+len) Move any elements being overwritten by the move to the now-empty elements, preserving order Note: if the two ranges overlap, only the destination order will be preserved fully, since some elements will be within both ranges ~Carnie
/proc/reverse_range replaces reverseList ~Carnie
/proc/get_element_by_var return first thing in L which has var/varname == value this is typecaste as list/L, but you could actually feed it an atom instead. completely safe to use
/proc/remove_nulls_from_list remove all nulls from a list
/proc/deep_copy_list Copies a list, and all lists inside it recusively Does not copy any other reference type
/proc/avoid_assoc_duplicate_keys takes an input_key, as text, and the list of keys already used, outputting a replacement key in the format of "[input_key] ([number_of_duplicates])" if it finds a duplicate use this for lists of things that might have the same name, like mobs or objects, that you plan on giving to a player as input
/proc/flatten_list Flattens a keyed list into a list of it's contents
/proc/make_associative Make a normal list an associative one
DEFAULTPICKPicks from the list, with some safeties, and returns the "default" arg if it fails
/proc/assoc_to_keys Turns an associative list into a flat list of keys
/proc/compare_list compare two lists, returns TRUE if they are the same
/proc/special_list_filter Returns a list with items filtered from a list that can call callback
/proc/recursive_list_resolve Returns a list with all weakrefs resolved
/proc/recursive_list_resolve_element Helper for /proc/recursive_list_resolve

Define Details

BINARY_INSERT

Binary search sorted insert INPUT: Object to be inserted LIST: List to insert object into TYPECONT: The typepath of the contents of the list COMPARE: The object to compare against, usualy the same as INPUT COMPARISON: The variable on the objects to compare COMPTYPE: How should the values be compared? Either COMPARE_KEY or COMPARE_VALUE.

BINARY_INSERT_PROC_COMPARE

Custom binary search sorted insert utilising comparison procs instead of vars. INPUT: Object to be inserted LIST: List to insert object into TYPECONT: The typepath of the contents of the list COMPARE: The object to compare against, usualy the same as INPUT COMPARISON: The plaintext name of a proc on INPUT that takes a single argument to accept a single element from LIST and returns a positive, negative or zero number to perform a comparison. COMPTYPE: How should the values be compared? Either COMPARE_KEY or COMPARE_VALUE.

COMPARE_KEY

Passed into BINARY_INSERT to compare keys

COMPARE_VALUE

Passed into BINARY_INSERT to compare values

DEFAULTPICK

Picks from the list, with some safeties, and returns the "default" arg if it fails

KEYBYINDEX

Returns the key based on the index

LAZYACCESS

returns L[I] if L exists and I is a valid index of L, runtimes if L is not a list

LAZYACCESSASSOC

Accesses an associative list, returns null if nothing is found

LAZYADD

Add an item to the list, if the list is null it will initialize it

LAZYADDASSOC

Adds to the item K the value V, if the list is null it will initialize it

LAZYADDASSOCLIST

This is used to add onto lazy assoc list when the value you're adding is a /list/. This one has extra safety over lazyaddassoc because the value could be null (and thus cant be used to += objects)

LAZYCLEARLIST

Consider LAZYNULL instead

LAZYCOPY

Use LAZYLISTDUPLICATE instead if you want it to null with no entries

LAZYFIND

Returns the key of the submitted item in the list

LAZYINITLIST

Initialize the lazylist

LAZYLEN

Returns the lenght of the list

LAZYLISTDUPLICATE

Like LAZYCOPY - copies an input list if the list has entries, If it doesn't the assigned list is nulled

LAZYNULL

Sets a list to null

LAZYOR

Add an item to the list if not already present, if the list is null it will initialize it

LAZYORASSOCLIST

Performs an insertion on the given lazy list with the given key and value. If the value already exists, a new one will not be made.

LAZYREMOVE

Remove an item from the list, set the list to null if empty

LAZYREMOVEASSOC

Removes the value V from the item K, if the item K is empty will remove it from the list, if the list is empty will set the list to null

LAZYSET

Sets the item K to the value V, if the list is null it will initialize it

LAZYSETLEN

Sets the length of a lazylist

QDEL_LAZYLIST

Qdel every item in the list before setting the list to null

SANITIZE_LIST

Returns the list if it's actually a valid list, otherwise will initialize it

UNSETEMPTY

If the provided list is empty, set it to null

is_type_in_typecache

Checks for specific types in specifically structured (Assoc "type" = TRUE) lists ('typecaches')