@@ -69,21 +69,45 @@ impl<Access: ThreadAccess> Dictionary<Access> {
6969 unsafe { ( get_api ( ) . godot_dictionary_has_all ) ( self . sys ( ) , keys. sys ( ) ) }
7070 }
7171
72- /// Returns a copy of the value corresponding to the key.
72+ /// Returns a copy of the value corresponding to the key if it exists .
7373 #[ inline]
74- pub fn get < K > ( & self , key : K ) -> Variant
74+ pub fn get < K > ( & self , key : K ) -> Option < Variant >
7575 where
7676 K : ToVariant + ToVariantEq ,
77+ {
78+ let key = key. to_variant ( ) ;
79+ // This should never return the default Nil, but there isn't a safe way to otherwise check
80+ // if the entry exists in a single API call.
81+ self . contains ( & key) . then ( || self . get_or_nil ( key) )
82+ }
83+
84+ /// Returns a copy of the value corresponding to the key, or `default` if it doesn't exist
85+ #[ inline]
86+ pub fn get_or < K , D > ( & self , key : K , default : D ) -> Variant
87+ where
88+ K : ToVariant + ToVariantEq ,
89+ D : ToVariant ,
7790 {
7891 unsafe {
79- Variant ( ( get_api ( ) . godot_dictionary_get ) (
92+ Variant ( ( get_api ( ) . godot_dictionary_get_with_default ) (
8093 self . sys ( ) ,
8194 key. to_variant ( ) . sys ( ) ,
95+ default. to_variant ( ) . sys ( ) ,
8296 ) )
8397 }
8498 }
8599
86- /// Update an existing element corresponding ot the key.
100+ /// Returns a copy of the element corresponding to the key, or `Nil` if it doesn't exist.
101+ /// Shorthand for `self.get_or(key, Variant::new())`.
102+ #[ inline]
103+ pub fn get_or_nil < K > ( & self , key : K ) -> Variant
104+ where
105+ K : ToVariant + ToVariantEq ,
106+ {
107+ self . get_or ( key, Variant :: new ( ) )
108+ }
109+
110+ /// Update an existing element corresponding to the key.
87111 ///
88112 /// # Panics
89113 ///
@@ -106,12 +130,14 @@ impl<Access: ThreadAccess> Dictionary<Access> {
106130 }
107131 }
108132
109- /// Returns a reference to the value corresponding to the key.
133+ /// Returns a reference to the value corresponding to the key, inserting a `Nil` value first if
134+ /// it does not exist.
110135 ///
111136 /// # Safety
112137 ///
113138 /// The returned reference is invalidated if the same container is mutated through another
114- /// reference.
139+ /// reference, and other references may be invalidated if the entry does not already exist
140+ /// (which causes this function to insert `Nil` and thus possibly re-allocate).
115141 ///
116142 /// `Variant` is reference-counted and thus cheaply cloned. Consider using `get` instead.
117143 #[ inline]
@@ -125,13 +151,16 @@ impl<Access: ThreadAccess> Dictionary<Access> {
125151 ) )
126152 }
127153
128- /// Returns a mutable reference to the value corresponding to the key.
154+ /// Returns a mutable reference to the value corresponding to the key, inserting a `Nil` value
155+ /// first if it does not exist.
129156 ///
130157 /// # Safety
131158 ///
132159 /// The returned reference is invalidated if the same container is mutated through another
133- /// reference. It is possible to create two mutable references to the same memory location
134- /// if the same `key` is provided, causing undefined behavior.
160+ /// reference, and other references may be invalidated if the `key` does not already exist
161+ /// (which causes this function to insert `Nil` and thus possibly re-allocate). It is also
162+ /// possible to create two mutable references to the same memory location if the same `key`
163+ /// is provided, causing undefined behavior.
135164 #[ inline]
136165 #[ allow( clippy:: mut_from_ref) ]
137166 pub unsafe fn get_mut_ref < K > ( & self , key : K ) -> & mut Variant
@@ -425,7 +454,7 @@ unsafe fn iter_next<Access: ThreadAccess>(
425454 None
426455 } else {
427456 let key = Variant :: cast_ref ( next_ptr) . clone ( ) ;
428- let value = dic. get ( & key) ;
457+ let value = dic. get_or_nil ( & key) ;
429458 * last_key = Some ( key. clone ( ) ) ;
430459 Some ( ( key, value) )
431460 }
@@ -591,7 +620,7 @@ godot_test!(test_dictionary {
591620 let mut iter_keys = HashSet :: new( ) ;
592621 let expected_keys = [ "foo" , "bar" ] . iter( ) . map( |& s| s. to_string( ) ) . collect:: <HashSet <_>>( ) ;
593622 for ( key, value) in & dict {
594- assert_eq!( value, dict. get( & key) ) ;
623+ assert_eq!( Some ( value) , dict. get( & key) ) ;
595624 if !iter_keys. insert( key. to_string( ) ) {
596625 panic!( "key is already contained in set: {:?}" , key) ;
597626 }
0 commit comments