bevy_impulse 0.2.0

Reactive programming and workflow execution for bevy
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
/*
 * Copyright (C) 2024 Open Source Robotics Foundation
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
*/

use bevy_ecs::{
    prelude::{Commands, Component, Entity, Event, EventReader, In, Local, Query, World},
    schedule::IntoSystemConfigs,
    system::{IntoSystem, SystemParam},
    world::{EntityWorldMut, Command},
};
use bevy_hierarchy::prelude::{BuildWorldChildren, DespawnRecursiveExt};

use smallvec::SmallVec;

use std::collections::HashMap;

use crate::{
    dispose_for_despawned_service, emit_disposal, insert_new_order, pop_next_delivery, Blocker,
    Broken, ContinuousService, ContinuousServiceInput, DeferredRoster, Deliver, Delivery,
    DeliveryOrder, DeliveryUpdate, Disposal, Input, IntoContinuousService, IntoServiceBuilder,
    ManageInput, OperationCleanup, OperationError, OperationReachability, OperationRequest,
    OperationResult, OperationRoster, OrBroken, ProviderStorage, ReachabilityResult, ScopeStorage,
    ServiceBuilder, ServiceBundle, ServiceRequest, ServiceTrait, SingleTargetStorage, StreamOf,
    StreamPack, StreamTargetMap, UnhandledErrors,
};

pub use bevy_ecs::schedule::SystemConfigs;

pub struct ContinuousServiceKey<Request, Response, Streams> {
    provider: Entity,
    _ignore: std::marker::PhantomData<fn(Request, Response, Streams)>,
}

impl<Request, Response, Streams> ContinuousServiceKey<Request, Response, Streams> {
    fn new(provider: Entity) -> Self {
        Self {
            provider,
            _ignore: Default::default(),
        }
    }
}

impl<Request, Response, Streams> ContinuousServiceKey<Request, Response, Streams> {
    pub fn provider(&self) -> Entity {
        self.provider
    }
}

impl<Request, Response, Streams> Clone for ContinuousServiceKey<Request, Response, Streams> {
    fn clone(&self) -> Self {
        *self
    }
}

impl<Request, Response, Streams> Copy for ContinuousServiceKey<Request, Response, Streams> {}

#[derive(SystemParam)]
pub struct ContinuousQuery<'w, 's, Request, Response, Streams = ()>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    queues: Query<'w, 's, &'static ContinuousQueueStorage<Request>>,
    streams: Query<'w, 's, StreamTargetQuery<Streams>>,
    delivered: Local<'s, HashMap<Entity, DeliveredQueue<Response>>>,
    commands: Commands<'w, 's>,
}

impl<'w, 's, Request, Response, Streams> ContinuousQuery<'w, 's, Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    pub fn view<'a>(
        &'a self,
        key: &ContinuousServiceKey<Request, Response, Streams>,
    ) -> Option<ContinuousQueueView<'a, Request, Response>> {
        self.queues
            .get(key.provider())
            .ok()
            .map(|queue| ContinuousQueueView {
                queue,
                delivered: self.delivered.get(&key.provider()),
            })
    }

    pub fn get_mut<'a>(
        &'a mut self,
        key: &ContinuousServiceKey<Request, Response, Streams>,
    ) -> Option<ContinuousQueueMut<'w, 's, 'a, Request, Response, Streams>> {
        self.queues
            .get(key.provider())
            .ok()
            .map(|queue| ContinuousQueueMut {
                queue,
                provider: key.provider(),
                streams: &self.streams,
                delivered: self.delivered.entry(key.provider()).or_default(),
                commands: &mut self.commands,
            })
    }
}

/// We use this custom container whose interface resembles a HashMap but the
/// underlying implementation is a SmallVec because:
/// 1. The number of responses delivered in one cycle is likely to be small,
///    making SmallVec a more efficient container
/// 2. Using SmallVec and pushing items in will ensure stable delivery. If we
///    used HashMap then the order of deliveries gets scrambled and that can
///    lead to unexpected arrival orders.
struct DeliveredQueue<Response> {
    queue: SmallVec<[Delivered<Response>; 16]>,
}

impl<Response> Default for DeliveredQueue<Response> {
    fn default() -> Self {
        Self {
            queue: Default::default(),
        }
    }
}

struct Delivered<Response> {
    index: usize,
    response: DeliverResponse<Response>,
}

impl<Response> DeliveredQueue<Response> {
    fn contains_key(&self, key: &usize) -> bool {
        self.queue.iter().any(|d| d.index == *key)
    }

    fn len(&self) -> usize {
        self.queue.len()
    }

    fn insert(&mut self, index: usize, response: DeliverResponse<Response>) {
        self.queue.push(Delivered { index, response });
    }
}

pub struct ContinuousQueueView<'a, Request, Response>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
{
    queue: &'a ContinuousQueueStorage<Request>,
    delivered: Option<&'a DeliveredQueue<Response>>,
}

impl<'a, Request, Response> ContinuousQueueView<'a, Request, Response>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
{
    pub fn iter(&self) -> impl Iterator<Item = OrderView<'_, Request>> {
        self.queue
            .inner
            .iter()
            .enumerate()
            .filter(|(i, _)| !self.delivered.is_some_and(|d| d.contains_key(i)))
            .map(|(index, item)| OrderView { index, order: item })
    }

    pub fn get(&self, index: usize) -> Option<OrderView<'_, Request>> {
        if self.delivered.is_some_and(|d| d.contains_key(&index)) {
            return None;
        }

        self.queue
            .inner
            .get(index)
            .map(|item| OrderView { index, order: item })
    }

    pub fn len(&self) -> usize {
        self.queue.inner.len() - self.delivered.map(|d| d.len()).unwrap_or(0)
    }

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }
}

pub struct OrderView<'a, Request> {
    order: &'a ContinuousOrder<Request>,
    index: usize,
}

impl<'a, Request> OrderView<'a, Request> {
    pub fn request(&self) -> &Request {
        &self.order.data
    }

    pub fn session(&self) -> Entity {
        self.order.session
    }

    pub fn source(&self) -> Entity {
        self.order.source
    }

    pub fn index(&self) -> usize {
        self.index
    }

    pub fn id(&self) -> Entity {
        self.order.task_id
    }
}

pub struct ContinuousQueueMut<'w, 's, 'a, Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    provider: Entity,
    queue: &'a ContinuousQueueStorage<Request>,
    streams: &'a Query<'w, 's, StreamTargetQuery<Streams>>,
    delivered: &'a mut DeliveredQueue<Response>,
    commands: &'a mut Commands<'w, 's>,
}

impl<'w, 's, 'a, Request, Response, Streams>
    ContinuousQueueMut<'w, 's, 'a, Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    pub fn iter(&self) -> impl Iterator<Item = OrderView<'_, Request>> {
        self.queue
            .inner
            .iter()
            .enumerate()
            .filter(|(i, _)| !self.delivered.contains_key(i))
            .map(|(index, item)| OrderView { order: item, index })
    }

    pub fn get(&self, index: usize) -> Option<OrderView<'_, Request>> {
        if self.delivered.contains_key(&index) {
            return None;
        }

        self.queue
            .inner
            .get(index)
            .map(|item| OrderView { index, order: item })
    }

    pub fn len(&self) -> usize {
        self.queue.inner.len() - self.delivered.len()
    }

    pub fn is_empty(&self) -> bool {
        self.len() == 0
    }

    pub fn get_mut<'b>(
        &'b mut self,
        index: usize,
    ) -> Option<OrderMut<'w, 's, 'b, Request, Response, Streams>> {
        if index >= self.queue.inner.len() {
            return None;
        }

        if self.delivered.contains_key(&index) {
            return None;
        }

        // INVARIANT: We have already confirmed that the index is smaller than
        // the length of the SmallVec, so it should be a valid index.
        let item = self.queue.inner.get(index).unwrap();
        let streams = self.make_stream_buffer(item.source);
        Some(OrderMut {
            index,
            streams: Some(streams),
            provider: self.provider,
            request: item,
            delivered: self.delivered,
            commands: self.commands,
        })
    }

    /// Rust iterators cannot support mutable borrows inside the items that
    /// they return, so you can use this as an alternative to doing a for-loop.
    ///
    /// If you need your operation to produce an output, use [`Self::for_each_out`].
    pub fn for_each(&mut self, mut f: impl FnMut(OrderMut<Request, Response, Streams>)) {
        for (index, item) in self.queue.inner.iter().enumerate() {
            if self.delivered.contains_key(&index) {
                continue;
            }

            let streams = self.make_stream_buffer(item.source);
            f(OrderMut {
                index,
                streams: Some(streams),
                provider: self.provider,
                request: item,
                delivered: self.delivered,
                commands: self.commands,
            });
        }
    }

    /// Alternative to [`Self::for_each`] that allows the operations to produce
    /// outputs which will be collected into a [`SmallVec`]. The only downside
    /// here is that a heap allocation will happen if the number of items
    /// iterated over exceed the limit of the [`SmallVec`].
    ///
    /// The collection that comes out will contain both an index and the function
    /// output value where the index indicates the index of the item in the queue
    /// that was being looked at for the output. Some indices may be skipped
    /// while running this function if one of the orders was already delivered
    /// earlier in the current run of the system.
    pub fn for_each_out<U>(
        &mut self,
        mut f: impl FnMut(OrderMut<Request, Response, Streams>) -> U,
    ) -> SmallVec<[(usize, U); 16]> {
        let mut output = SmallVec::new();
        for (index, item) in self.queue.inner.iter().enumerate() {
            if self.delivered.contains_key(&index) {
                continue;
            }

            let streams = self.make_stream_buffer(item.source);
            let u = f(OrderMut {
                index,
                streams: Some(streams),
                provider: self.provider,
                request: item,
                delivered: self.delivered,
                commands: self.commands,
            });

            output.push((index, u));
        }

        output
    }

    fn make_stream_buffer(&self, source: Entity) -> Streams::Buffer {
        // INVARIANT: The query can't fail because all of its components are optional
        let (target_indices, target_map) = self.streams.get(source).unwrap();
        Streams::make_buffer(target_indices, target_map)
    }
}

pub struct OrderMut<'w, 's, 'a, Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    request: &'a ContinuousOrder<Request>,
    provider: Entity,
    index: usize,
    // We use Option here so that the buffer can be taken inside the destructor.
    // We need to take the buffer so that the data can be sent into commands and
    // flushed later.
    streams: Option<Streams::Buffer>,
    delivered: &'a mut DeliveredQueue<Response>,
    commands: &'a mut Commands<'w, 's>,
}

impl<'w, 's, 'a, Request, Response, Streams> OrderMut<'w, 's, 'a, Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    /// Look at the request of this order.
    // TODO(@mxgrey): Consider offering a take_request that allows the user to
    // fully take ownership of the request data. That would force us to change
    // this function to return an Option<&Request>.
    pub fn request(&self) -> &Request {
        &self.request.data
    }

    /// Check the session that this order is associated with.
    pub fn session(&self) -> Entity {
        self.request.session
    }

    /// Check the ID of the node that this order is associated with
    pub fn source(&self) -> Entity {
        self.request.source
    }

    /// Provide a response for this order. After calling this you will not be
    /// able to stream or give any more responses for this particular order.
    pub fn respond(self, response: Response) {
        self.delivered.insert(
            self.index,
            DeliverResponse {
                provider: self.provider,
                source: self.request.source,
                session: self.request.session,
                task_id: self.request.task_id,
                data: response,
                index: self.index,
            },
        );
    }

    /// Access the stream buffer so you can send streams from your service.
    pub fn streams(&self) -> &Streams::Buffer {
        // INVARIANT: This is always initialized with Some(_) and never gets
        // taken until OrderMut is dropped, so this will always contain a valid
        // buffer for as long as the OrderMut is not being dropped.
        self.streams.as_ref().unwrap()
    }

    /// The current index in the queue of this order. This will change between
    /// cycles of the continuous service.
    pub fn index(&self) -> usize {
        self.index
    }

    /// An ID that uniquely identifies this order. Every order will have a unique
    /// ID even if they belong to the same session.
    pub fn id(&self) -> Entity {
        self.request.task_id
    }
}

impl<'w, 's, 'a, Request, Response, Streams> Drop
    for OrderMut<'w, 's, 'a, Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    fn drop(&mut self) {
        Streams::defer_buffer(
            // INVARIANT: This is the only place where streams are taken
            self.streams.take().unwrap(),
            self.request.source,
            self.request.session,
            self.commands,
        );
    }
}

impl<'w, 's, Request, Response, Streams> Drop
    for ContinuousQuery<'w, 's, Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    fn drop(&mut self) {
        let mut responses = SmallVec::new();
        for (_, delivered) in self.delivered.drain() {
            for deliver in delivered.queue {
                responses.push(deliver.response);
            }
        }

        if !responses.is_empty() {
            self.commands
                .add(DeliverResponses::<Request, Response, Streams> {
                    responses,
                    _ignore: Default::default(),
                });
        }
    }
}

#[derive(Component)]
struct ContinuousQueueStorage<Request> {
    inner: SmallVec<[ContinuousOrder<Request>; 16]>,
}

impl<Request> std::fmt::Debug for ContinuousQueueStorage<Request> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_list().entries(self.inner.iter()).finish()
    }
}

impl<Request> ContinuousQueueStorage<Request> {
    fn new() -> Self {
        Self {
            inner: Default::default(),
        }
    }

    fn contains_session(provider: Entity, session: Entity, world: &World) -> ReachabilityResult
    where
        Request: 'static + Send + Sync,
    {
        let Some(queue) = world.get_entity(provider).or_broken()?.get::<Self>() else {
            return Ok(false);
        };

        Ok(queue.inner.iter().any(|order| order.session == session))
    }

    fn cleanup(provider: Entity, session: Entity, world: &mut World) -> OperationResult
    where
        Request: 'static + Send + Sync,
    {
        let mut provider_mut = world.get_entity_mut(provider).or_broken()?;
        let Some(mut queue) = provider_mut.get_mut::<Self>() else {
            return Ok(());
        };

        queue.inner.retain(|order| order.session != session);
        Ok(())
    }
}

#[derive(Component)]
pub(crate) struct ActiveContinuousSessions {
    reachability: fn(Entity, Entity, &World) -> ReachabilityResult,
    cleanup: fn(Entity, Entity, &mut World) -> OperationResult,
}

impl ActiveContinuousSessions {
    fn new<T: 'static + Send + Sync>() -> Self {
        Self {
            reachability: ContinuousQueueStorage::<T>::contains_session,
            cleanup: ContinuousQueueStorage::<T>::cleanup,
        }
    }

    pub(crate) fn contains_session(r: &OperationReachability) -> ReachabilityResult {
        let provider = r
            .world()
            .get::<ProviderStorage>(r.source())
            .or_broken()?
            .get();
        let Some(active) = r.world().get::<ActiveContinuousSessions>(provider) else {
            return Ok(false);
        };
        let f = active.reachability;
        f(provider, r.session(), r.world())
    }

    pub(crate) fn cleanup(clean: &mut OperationCleanup) -> OperationResult {
        let source = clean.source;
        let provider = clean
            .world
            .get::<ProviderStorage>(source)
            .or_broken()?
            .get();
        let Some(active) = clean.world.get::<ActiveContinuousSessions>(provider) else {
            return Ok(());
        };
        let f = active.cleanup;
        f(provider, clean.cleanup.session, clean.world)
    }
}

struct ContinuousOrder<Request> {
    data: Request,
    session: Entity,
    source: Entity,
    task_id: Entity,
    unblock: Option<Blocker>,
}

impl<Request> std::fmt::Debug for ContinuousOrder<Request> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("ContinuousQueueStorage")
            .field("session", &self.session)
            .field("source", &self.source)
            .field("task_id", &self.task_id)
            .finish()
    }
}

struct DeliverResponses<Request, Response, Streams> {
    responses: SmallVec<[DeliverResponse<Response>; 16]>,
    _ignore: std::marker::PhantomData<fn(Request, Streams)>,
}

struct DeliverResponse<Response> {
    provider: Entity,
    source: Entity,
    session: Entity,
    task_id: Entity,
    data: Response,
    index: usize,
}

impl<Request, Response, Streams> Command for DeliverResponses<Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    fn apply(self, world: &mut World) {
        world.get_resource_or_insert_with(DeferredRoster::default);
        world.resource_scope::<DeferredRoster, _>(|world: &mut World, mut deferred| {
            let mut remove: SmallVec<[(usize, Entity); 16]> = SmallVec::new();
            for DeliverResponse {
                provider,
                source,
                session,
                data,
                index,
                task_id,
            } in self.responses
            {
                remove.push((index, provider));
                let r = try_give_response(source, session, data, world, &mut deferred);
                if let Err(OperationError::Broken(backtrace)) = r {
                    world
                        .get_resource_or_insert_with(UnhandledErrors::default)
                        .broken
                        .push(Broken {
                            node: provider,
                            backtrace,
                        });
                }

                if Streams::has_streams() {
                    // When a continuous task with any number of streams >= 1 is
                    // finished, we should always do a disposal notification
                    // to force a reachability check. Normally there are specific
                    // events that prompt us to check reachability, but if a
                    // reachability test occurred while the continuous service
                    // node was running and the reachability depends on a stream
                    // which may or may not have been emitted, then the
                    // reachability test may have concluded with a false
                    // positive, and it needs to be rechecked now that this
                    // node has finished.
                    if let Some(scope) = world.get::<ScopeStorage>(source) {
                        deferred.disposed(scope.get(), source, session);
                    }
                }

                if let Some(task_mut) = world.get_entity_mut(task_id) {
                    task_mut.despawn_recursive();
                }
            }

            // Reverse sort by index so that as we iterate forward through this,
            // we remove the last elements first, so the earliest elements remain
            // valid.
            remove.sort_by(|(index_a, _), (index_b, _)| index_b.cmp(index_a));
            for (index, provider) in remove {
                let r = try_retire_request::<Request>(provider, index, world, &mut deferred);
                if let Err(OperationError::Broken(backtrace)) = r {
                    world
                        .get_resource_or_insert_with(UnhandledErrors::default)
                        .broken
                        .push(Broken {
                            node: provider,
                            backtrace,
                        });
                }
            }
        });
    }
}

fn try_give_response<Response: 'static + Send + Sync>(
    source: Entity,
    session: Entity,
    data: Response,
    world: &mut World,
    roster: &mut OperationRoster,
) -> OperationResult {
    let target = world.get::<SingleTargetStorage>(source).or_broken()?.get();
    world
        .get_entity_mut(target)
        .or_broken()?
        .give_input(session, data, roster)
}

type StreamTargetQuery<Streams> = (
    <Streams as StreamPack>::TargetIndexQuery,
    Option<&'static StreamTargetMap>,
);

fn try_retire_request<Request: 'static + Send + Sync>(
    provider: Entity,
    index: usize,
    world: &mut World,
    roster: &mut OperationRoster,
) -> OperationResult {
    let mut storage = world
        .get_mut::<ContinuousQueueStorage<Request>>(provider)
        .or_broken()?;
    let finished_order = storage.inner.remove(index);
    if let Some(unblock) = finished_order.unblock {
        let f = unblock.serve_next;
        f(unblock, world, roster);
    }

    Ok(())
}

struct ContinuousServiceImpl<Request, Response, Streams> {
    _ignore: std::marker::PhantomData<fn(Request, Response, Streams)>,
}

impl<Request, Response, Streams> ServiceTrait for ContinuousServiceImpl<Request, Response, Streams>
where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    type Request = Request;
    type Response = Response;
    fn serve(
        ServiceRequest {
            provider,
            target,
            instructions,
            operation:
                OperationRequest {
                    source,
                    world,
                    roster,
                },
        }: ServiceRequest,
    ) -> OperationResult {
        let mut source_mut = world.get_entity_mut(source).or_broken()?;
        let Input {
            session,
            data: request,
        } = source_mut.take_input::<Request>()?;
        let task_id = world.spawn(()).set_parent(source).id();

        let Some(mut delivery) = world.get_mut::<Delivery<Request>>(provider) else {
            dispose_for_despawned_service(provider, world, roster);
            return Err(OperationError::NotReady);
        };

        let update = insert_new_order::<Request>(
            delivery.as_mut(),
            DeliveryOrder {
                source,
                session,
                task_id,
                request,
                instructions,
            },
        );

        let (request, blocker) = match update {
            DeliveryUpdate::Immediate { blocking, request } => {
                let serve_next = serve_next_continuous_request::<Request, Response, Streams>;
                let blocker = blocking.map(|label| Blocker {
                    provider,
                    source,
                    session,
                    label,
                    serve_next,
                });
                (request, blocker)
            }
            DeliveryUpdate::Queued {
                cancelled,
                stop,
                label,
            } => {
                for cancelled in cancelled {
                    let disposal = Disposal::supplanted(cancelled.source, source, session);
                    emit_disposal(cancelled.source, cancelled.session, disposal, world, roster);
                    if let Some(task_mut) = world.get_entity_mut(cancelled.task_id) {
                        task_mut.despawn_recursive();
                    }
                }
                if let Some(stop) = stop {
                    // This task is already running so we need to remove it from
                    // the queue
                    let mut queue = world
                        .get_mut::<ContinuousQueueStorage<Request>>(provider)
                        .or_broken()?;
                    let stopped_index = queue
                        .inner
                        .iter()
                        .enumerate()
                        .find(|(_, r)| r.task_id == stop.task_id)
                        .map(|(index, _)| index);

                    // Immediately queue up an unblocking because continuous services
                    // cancel immediately.
                    if let Some(unblock) = stopped_index.and_then(|i| queue.inner.remove(i).unblock)
                    {
                        let f = unblock.serve_next;
                        f(unblock, world, roster);
                    } else {
                        let serve_next =
                            serve_next_continuous_request::<Request, Response, Streams>;
                        roster.unblock(Blocker {
                            provider,
                            source: stop.source,
                            session: stop.session,
                            label,
                            serve_next,
                        });
                    }

                    let disposal = Disposal::supplanted(stop.source, source, session);
                    emit_disposal(stop.source, stop.session, disposal, world, roster);
                    if let Some(task_mut) = world.get_entity_mut(stop.task_id) {
                        task_mut.despawn_recursive();
                    }
                }

                return Ok(());
            }
        };

        serve_continuous_request::<Request>(
            request,
            blocker,
            session,
            task_id,
            ServiceRequest {
                provider,
                target,
                instructions,
                operation: OperationRequest {
                    source,
                    world,
                    roster,
                },
            },
        )
    }
}

fn serve_continuous_request<Request>(
    request: Request,
    blocker: Option<Blocker>,
    session: Entity,
    task_id: Entity,
    ServiceRequest {
        provider,
        operation: OperationRequest { source, world, .. },
        ..
    }: ServiceRequest,
) -> OperationResult
where
    Request: 'static + Send + Sync,
{
    // All we have to do is move the request into the service's active queue
    let mut queue = world
        .get_mut::<ContinuousQueueStorage<Request>>(provider)
        .or_broken()?;
    queue.inner.push(ContinuousOrder {
        data: request,
        session,
        source,
        task_id,
        unblock: blocker,
    });

    Ok(())
}

fn serve_next_continuous_request<Request, Response, Streams>(
    unblock: Blocker,
    world: &mut World,
    roster: &mut OperationRoster,
) where
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    let Blocker {
        provider, label, ..
    } = unblock;
    loop {
        let Some(Deliver {
            request,
            task_id,
            blocker,
        }) = pop_next_delivery::<Request>(
            provider,
            label,
            serve_next_continuous_request::<Request, Response, Streams>,
            world,
        )
        else {
            // No more deliveries to pop, so we should return
            return;
        };

        let session = blocker.session;
        let source = blocker.source;

        let Some(target) = world.get::<SingleTargetStorage>(source) else {
            // This will not be able to run, so we should move onto the next
            // item in the queue.
            continue;
        };
        let target = target.get();

        if serve_continuous_request::<Request>(
            request,
            Some(blocker),
            session,
            task_id,
            ServiceRequest {
                provider,
                target,
                // Instructions are already being handled by the delivery queue
                instructions: None,
                operation: OperationRequest {
                    source,
                    world,
                    roster,
                },
            },
        )
        .is_err()
        {
            // The service did not launch so we should move onto the next item
            // in the queue.
            continue;
        }

        // The next delivery has begun so we can return
        return;
    }
}

impl<Request, Response, Streams, M, Sys> IntoContinuousService<(Request, Response, Streams, M)>
    for Sys
where
    Sys: IntoSystem<ContinuousService<Request, Response, Streams>, (), M>,
    Request: 'static + Send + Sync,
    Response: 'static + Send + Sync,
    Streams: StreamPack,
{
    type Request = Request;
    type Response = Response;
    type Streams = Streams;

    fn into_system_config(self, entity_mut: &mut EntityWorldMut) -> SystemConfigs {
        let provider = entity_mut
            .insert((
                ContinuousQueueStorage::<Request>::new(),
                ActiveContinuousSessions::new::<Request>(),
                ServiceBundle::<ContinuousServiceImpl<Request, Response, Streams>>::new(),
            ))
            .id();
        let continuous_key = move || ContinuousService {
            key: ContinuousServiceKey::new(provider),
        };
        continuous_key.pipe(self).into_configs()
    }
}

pub struct IntoContinuousServiceBuilderMarker<M>(std::marker::PhantomData<fn(M)>);

impl<M, Srv> IntoServiceBuilder<IntoContinuousServiceBuilderMarker<M>> for Srv
where
    Srv: IntoContinuousService<M>,
{
    type Service = Srv;
    type Deliver = ();
    type With = ();
    type Also = ();
    type Configure = ();

    fn into_service_builder(self) -> ServiceBuilder<Self::Service, (), (), (), ()> {
        ServiceBuilder::new(self)
    }
}

/// Implementation for [`crate::AddContinuousServicesExt::spawn_event_streaming_service`]
pub fn event_streaming_service<E>(
    In(ContinuousService { key }): ContinuousServiceInput<(), (), StreamOf<E>>,
    mut requests: ContinuousQuery<(), (), StreamOf<E>>,
    mut events: EventReader<E>,
) where
    E: Event + 'static + Send + Sync + Unpin + Clone,
{
    let Some(mut requests) = requests.get_mut(&key) else {
        return;
    };

    for event in events.read() {
        requests.for_each(|order| {
            order.streams().send(StreamOf(event.clone()));
        });
    }
}