198 lines
8.9 KiB
XML
198 lines
8.9 KiB
XML
<?xml version="1.0" encoding="UTF-8" ?>
|
|
<class name="Dictionary" version="3.6" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="../class.xsd">
|
|
<brief_description>
|
|
Dictionary type.
|
|
</brief_description>
|
|
<description>
|
|
Dictionary type. Associative container which contains values referenced by unique keys. Dictionaries are composed of pairs of keys (which must be unique) and values. Dictionaries will preserve the insertion order when adding elements. In other programming languages, this data structure is sometimes referred to as a hash map or associative array.
|
|
You can define a dictionary by placing a comma-separated list of [code]key: value[/code] pairs in curly braces [code]{}[/code].
|
|
Erasing elements while iterating over them [b]is not supported[/b] and will result in undefined behavior.
|
|
[b]Note:[/b] Dictionaries are always passed by reference. To get a copy of a dictionary which can be modified independently of the original dictionary, use [method duplicate].
|
|
Creating a dictionary:
|
|
[codeblock]
|
|
var my_dict = {} # Creates an empty dictionary.
|
|
|
|
var dict_variable_key = "Another key name"
|
|
var dict_variable_value = "value2"
|
|
var another_dict = {
|
|
"Some key name": "value1",
|
|
dict_variable_key: dict_variable_value,
|
|
}
|
|
|
|
var points_dict = {"White": 50, "Yellow": 75, "Orange": 100}
|
|
|
|
# Alternative Lua-style syntax.
|
|
# Doesn't require quotes around keys, but only string constants can be used as key names.
|
|
# Additionally, key names must start with a letter or an underscore.
|
|
# Here, `some_key` is a string literal, not a variable!
|
|
another_dict = {
|
|
some_key = 42,
|
|
}
|
|
[/codeblock]
|
|
You can access a dictionary's values by referencing the appropriate key. In the above example, [code]points_dict["White"][/code] will return [code]50[/code]. You can also write [code]points_dict.White[/code], which is equivalent. However, you'll have to use the bracket syntax if the key you're accessing the dictionary with isn't a fixed string (such as a number or variable).
|
|
[codeblock]
|
|
export(String, "White", "Yellow", "Orange") var my_color
|
|
var points_dict = {"White": 50, "Yellow": 75, "Orange": 100}
|
|
func _ready():
|
|
# We can't use dot syntax here as `my_color` is a variable.
|
|
var points = points_dict[my_color]
|
|
[/codeblock]
|
|
In the above code, [code]points[/code] will be assigned the value that is paired with the appropriate color selected in [code]my_color[/code].
|
|
Dictionaries can contain more complex data:
|
|
[codeblock]
|
|
my_dict = {"First Array": [1, 2, 3, 4]} # Assigns an Array to a String key.
|
|
[/codeblock]
|
|
To add a key to an existing dictionary, access it like an existing key and assign to it:
|
|
[codeblock]
|
|
var points_dict = {"White": 50, "Yellow": 75, "Orange": 100}
|
|
points_dict["Blue"] = 150 # Add "Blue" as a key and assign 150 as its value.
|
|
[/codeblock]
|
|
Finally, dictionaries can contain different types of keys and values in the same dictionary:
|
|
[codeblock]
|
|
# This is a valid dictionary.
|
|
# To access the string "Nested value" below, use `my_dict.sub_dict.sub_key` or `my_dict["sub_dict"]["sub_key"]`.
|
|
# Indexing styles can be mixed and matched depending on your needs.
|
|
var my_dict = {
|
|
"String Key": 5,
|
|
4: [1, 2, 3],
|
|
7: "Hello",
|
|
"sub_dict": {"sub_key": "Nested value"},
|
|
}
|
|
[/codeblock]
|
|
[b]Note:[/b] Unlike [Array]s, you can't compare dictionaries directly:
|
|
[codeblock]
|
|
array1 = [1, 2, 3]
|
|
array2 = [1, 2, 3]
|
|
|
|
func compare_arrays():
|
|
print(array1 == array2) # Will print true.
|
|
|
|
var dict1 = {"a": 1, "b": 2, "c": 3}
|
|
var dict2 = {"a": 1, "b": 2, "c": 3}
|
|
|
|
func compare_dictionaries():
|
|
print(dict1 == dict2) # Will NOT print true.
|
|
[/codeblock]
|
|
You need to first calculate the dictionary's hash with [method hash] before you can compare them:
|
|
[codeblock]
|
|
var dict1 = {"a": 1, "b": 2, "c": 3}
|
|
var dict2 = {"a": 1, "b": 2, "c": 3}
|
|
|
|
func compare_dictionaries():
|
|
print(dict1.hash() == dict2.hash()) # Will print true.
|
|
[/codeblock]
|
|
[b]Note:[/b] When declaring a dictionary with [code]const[/code], the dictionary itself can still be mutated by defining the values of individual keys. Using [code]const[/code] will only prevent assigning the constant with another value after it was initialized.
|
|
</description>
|
|
<tutorials>
|
|
<link title="GDScript basics: Dictionary">$DOCS_URL/tutorials/scripting/gdscript/gdscript_basics.html#dictionary</link>
|
|
<link title="3D Voxel Demo">https://godotengine.org/asset-library/asset/676</link>
|
|
<link title="OS Test Demo">https://godotengine.org/asset-library/asset/677</link>
|
|
</tutorials>
|
|
<methods>
|
|
<method name="clear">
|
|
<description>
|
|
Clear the dictionary, removing all key/value pairs.
|
|
</description>
|
|
</method>
|
|
<method name="duplicate">
|
|
<return type="Dictionary" />
|
|
<argument index="0" name="deep" type="bool" default="false" />
|
|
<description>
|
|
Creates a copy of the dictionary, and returns it. The [code]deep[/code] parameter causes inner dictionaries and arrays to be copied recursively, but does not apply to objects.
|
|
</description>
|
|
</method>
|
|
<method name="empty">
|
|
<return type="bool" />
|
|
<description>
|
|
Returns [code]true[/code] if the dictionary is empty.
|
|
</description>
|
|
</method>
|
|
<method name="erase">
|
|
<return type="bool" />
|
|
<argument index="0" name="key" type="Variant" />
|
|
<description>
|
|
Erase a dictionary key/value pair by key. Returns [code]true[/code] if the given key was present in the dictionary, [code]false[/code] otherwise.
|
|
[b]Note:[/b] Don't erase elements while iterating over the dictionary. You can iterate over the [method keys] array instead.
|
|
</description>
|
|
</method>
|
|
<method name="find_key">
|
|
<return type="Variant" />
|
|
<argument index="0" name="value" type="Variant" />
|
|
<description>
|
|
Returns the first key whose associated value is equal to [code]value[/code], or [code]null[/code] if no such value is found.
|
|
[b]Node:[/b] [code]null[/code] is also a valid key. I you have it in your [Dictionary], the [method find_key] method can give misleading results.
|
|
</description>
|
|
</method>
|
|
<method name="get">
|
|
<return type="Variant" />
|
|
<argument index="0" name="key" type="Variant" />
|
|
<argument index="1" name="default" type="Variant" default="null" />
|
|
<description>
|
|
Returns the current value for the specified key in the [Dictionary]. If the key does not exist, the method returns the value of the optional default argument, or [code]null[/code] if it is omitted.
|
|
</description>
|
|
</method>
|
|
<method name="has">
|
|
<return type="bool" />
|
|
<argument index="0" name="key" type="Variant" />
|
|
<description>
|
|
Returns [code]true[/code] if the dictionary has a given key.
|
|
[b]Note:[/b] This is equivalent to using the [code]in[/code] operator as follows:
|
|
[codeblock]
|
|
# Will evaluate to `true`.
|
|
if "godot" in {"godot": "engine"}:
|
|
pass
|
|
[/codeblock]
|
|
This method (like the [code]in[/code] operator) will evaluate to [code]true[/code] as long as the key exists, even if the associated value is [code]null[/code].
|
|
</description>
|
|
</method>
|
|
<method name="has_all">
|
|
<return type="bool" />
|
|
<argument index="0" name="keys" type="Array" />
|
|
<description>
|
|
Returns [code]true[/code] if the dictionary has all the keys in the given array.
|
|
</description>
|
|
</method>
|
|
<method name="hash">
|
|
<return type="int" />
|
|
<description>
|
|
Returns a hashed 32-bit integer value representing the dictionary contents. This can be used to compare dictionaries by value:
|
|
[codeblock]
|
|
var dict1 = {0: 10}
|
|
var dict2 = {0: 10}
|
|
# The line below prints `true`, whereas it would have printed `false` if both variables were compared directly.
|
|
print(dict1.hash() == dict2.hash())
|
|
[/codeblock]
|
|
[b]Note:[/b] Dictionaries with the same keys/values but in a different order will have a different hash.
|
|
[b]Note:[/b] Dictionaries with equal content will always produce identical hash values. However, the reverse is not true. Returning identical hash values does [i]not[/i] imply the dictionaries are equal, because different dictionaries can have identical hash values due to hash collisions.
|
|
</description>
|
|
</method>
|
|
<method name="keys">
|
|
<return type="Array" />
|
|
<description>
|
|
Returns the list of keys in the [Dictionary].
|
|
</description>
|
|
</method>
|
|
<method name="merge">
|
|
<argument index="0" name="dictionary" type="Dictionary" />
|
|
<argument index="1" name="overwrite" type="bool" default="false" />
|
|
<description>
|
|
Adds elements from [code]dictionary[/code] to this [Dictionary]. By default, duplicate keys will not be copied over, unless [code]overwrite[/code] is [code]true[/code].
|
|
</description>
|
|
</method>
|
|
<method name="size">
|
|
<return type="int" />
|
|
<description>
|
|
Returns the number of keys in the dictionary.
|
|
</description>
|
|
</method>
|
|
<method name="values">
|
|
<return type="Array" />
|
|
<description>
|
|
Returns the list of values in the [Dictionary].
|
|
</description>
|
|
</method>
|
|
</methods>
|
|
<constants>
|
|
</constants>
|
|
</class>
|