11use std:: collections:: HashMap ;
22
3- use valence:: advancement:: bevy_hierarchy:: { BuildChildren , Children , Parent } ;
43use valence:: advancement:: ForceTabUpdate ;
54use valence:: prelude:: * ;
65
@@ -31,7 +30,7 @@ fn main() {
3130 Update ,
3231 (
3332 load_clients,
34- apply_deferred . after ( load_clients) . before ( init_advancements) ,
33+ ApplyDeferred . after ( load_clients) . before ( init_advancements) ,
3534 init_clients,
3635 init_advancements,
3736 sneak,
@@ -112,7 +111,7 @@ fn setup(
112111 y_coord : -0.5 ,
113112 } ,
114113 ) )
115- . set_parent ( root_advancement) ;
114+ . insert ( ChildOf ( root_advancement) ) ;
116115
117116 commands
118117 . spawn ( (
@@ -133,7 +132,7 @@ fn setup(
133132 y_coord : 0.5 ,
134133 } ,
135134 ) )
136- . set_parent ( root_advancement) ;
135+ . insert ( ChildOf ( root_advancement) ) ;
137136
138137 let root2_criteria = commands
139138 . spawn ( (
@@ -176,7 +175,7 @@ fn init_clients(
176175 Added < Client > ,
177176 > ,
178177 layers : Query < Entity , With < ChunkLayer > > ,
179- ) {
178+ ) -> Result {
180179 for (
181180 mut layer_id,
182181 mut visible_chunk_layer,
@@ -185,14 +184,15 @@ fn init_clients(
185184 mut game_mode,
186185 ) in & mut clients
187186 {
188- let layer = layers. single ( ) ;
187+ let layer = layers. single ( ) ? ;
189188
190189 layer_id. 0 = layer;
191190 visible_chunk_layer. 0 = layer;
192191 visible_entity_layers. 0 . insert ( layer) ;
193192 pos. set ( [ 0.5 , 65.0 , 0.5 ] ) ;
194193 * game_mode = GameMode :: Creative ;
195194 }
195+ Ok ( ( ) )
196196}
197197
198198fn load_clients (
@@ -220,14 +220,14 @@ fn init_advancements(
220220 ) ,
221221 Added < AdvancementClientUpdate > ,
222222 > ,
223- root_advancement_query : Query < Entity , ( Without < Parent > , With < Advancement > ) > ,
223+ root_advancement_query : Query < Entity , ( Without < ChildOf > , With < Advancement > ) > ,
224224 children_query : Query < & Children > ,
225225 advancement_check_query : Query < ( ) , With < Advancement > > ,
226226 root2_criteria : Query < Entity , With < Root2Criteria > > ,
227227 root_criteria : Query < Entity , With < RootCriteria > > ,
228- ) {
229- let root_c = root_criteria. single ( ) ;
230- let root2_c = root2_criteria. single ( ) ;
228+ ) -> Result {
229+ let root_c = root_criteria. single ( ) ? ;
230+ let root2_c = root2_criteria. single ( ) ? ;
231231 for ( mut advancement_client_update, root_criteria, tab_change) in & mut clients {
232232 for root_advancement in root_advancement_query. iter ( ) {
233233 advancement_client_update. send_advancements (
@@ -243,6 +243,7 @@ fn init_advancements(
243243 }
244244 }
245245 }
246+ Ok ( ( ) )
246247}
247248
248249fn sneak (
@@ -251,8 +252,8 @@ fn sneak(
251252 root_criteria : Query < Entity , With < RootCriteria > > ,
252253 client_uuid : Query < & UniqueId > ,
253254 mut client_save : ResMut < ClientSave > ,
254- ) {
255- let root_criteria = root_criteria. single ( ) ;
255+ ) -> Result {
256+ let root_criteria = root_criteria. single ( ) ? ;
256257 for sneaking in sneaking. read ( ) {
257258 if sneaking. state == SneakState :: Stop {
258259 continue ;
@@ -278,6 +279,7 @@ fn sneak(
278279 . unwrap ( )
279280 . 0 = root_criteria_done. 0 ;
280281 }
282+ Ok ( ( ) )
281283}
282284
283285fn tab_change (
@@ -287,9 +289,9 @@ fn tab_change(
287289 root : Query < Entity , With < RootAdvancement > > ,
288290 client_uuid : Query < & UniqueId > ,
289291 mut client_save : ResMut < ClientSave > ,
290- ) {
291- let root2_criteria = root2_criteria. single ( ) ;
292- let root = root. single ( ) ;
292+ ) -> Result {
293+ let root2_criteria = root2_criteria. single ( ) ? ;
294+ let root = root. single ( ) ? ;
293295 for tab_change in tab_change. read ( ) {
294296 let Ok ( ( mut advancement_client_update, mut tab_change_count) ) =
295297 client. get_mut ( tab_change. client )
@@ -314,4 +316,5 @@ fn tab_change(
314316 . unwrap ( )
315317 . 1 = tab_change_count. 0 ;
316318 }
319+ Ok ( ( ) )
317320}
0 commit comments