brood 0.9.1

A fast and flexible entity component system library.
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
use crate::{
    archetype,
    hlist::define_null,
    query::{
        filter::{
            And,
            Or,
        },
        view::Claims,
    },
    registry::{
        ContainsFilter,
        ContainsQuery,
        ContainsViews,
        Registry,
    },
    resource,
    system::schedule::{
        sendable::SendableWorld,
        Task,
    },
};
use fnv::FnvBuildHasher;
use hashbrown::{
    hash_map,
    HashMap,
};

use super::Stages;

define_null!();

/// A stage within a schedule.
///
/// A single stage contains only tasks that can always be run in parallel.
pub trait Stage<
    'a,
    R,
    Resources,
    QueryIndicesList,
    ResourceViewsIndicesList,
    DisjointIndicesList,
    EntryIndicesList,
    EntryViewsFilterIndicesList,
>: Send where
    R: Registry,
    Resources: resource::Resources,
{
    /// A list of booleans indicating whether each task within the stage has already been run.
    type HasRun: Send;

    /// Run all of the tasks within this stage in parallel.
    ///
    /// After the tasks have been scheduled to run, tasks within the following stage will also
    /// be attempted to be scheduled. Any tasks that are dynamically found to be able to run in
    /// parallel with the current tasks will be executed as well.
    fn run<
        'b,
        N,
        NextQueryIndicesLists,
        NextResourceViewsIndicesLists,
        NextDisjointIndicesList,
        NextEntryIndicesList,
        NextEntryViewsFilterIndicesList,
    >(
        &mut self,
        world: SendableWorld<R, Resources>,
        borrowed_archetypes: HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
        resource_claims: Resources::Claims,
        has_run: Self::HasRun,
        next_stage: &mut N,
    ) -> N::HasRun
    where
        N: Stages<
            'b,
            R,
            Resources,
            NextQueryIndicesLists,
            NextResourceViewsIndicesLists,
            NextDisjointIndicesList,
            NextEntryIndicesList,
            NextEntryViewsFilterIndicesList,
        >;

    /// Attempt to run as many tasks within this stage as possible as add-ons to the previous
    /// stage.
    ///
    /// `borrowed_archetypes` contains a set of dynamic claims that are already borrowed by the
    /// previous stage. This method respects those claims when evaluating whether new tasks can be
    /// executed.
    ///
    /// # Safety
    /// `borrowed_archetypes` must accurately represent the dynamic claims already made on the
    /// component columns within `world`.
    unsafe fn run_add_ons(
        &mut self,
        world: SendableWorld<R, Resources>,
        borrowed_archetypes: HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
        resource_claims: Resources::Claims,
    ) -> Self::HasRun;

    /// Creates a new default set of booleans to indicate that each task within the stage has not
    /// been run.
    fn new_has_run() -> Self::HasRun;
}

impl<R, Resources> Stage<'_, R, Resources, Null, Null, Null, Null, Null> for Null
where
    R: Registry,
    Resources: resource::Resources,
{
    type HasRun = Null;

    fn run<
        'b,
        N,
        NextQueryIndicesLists,
        NextResourceViewsIndicesLists,
        NextDisjointIndicesList,
        NextEntryIndicesList,
        NextEntryViewsFilterIndicesList,
    >(
        &mut self,
        world: SendableWorld<R, Resources>,
        borrowed_archetypes: HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
        resource_claims: Resources::Claims,
        _has_run: Self::HasRun,
        next_stage: &mut N,
    ) -> N::HasRun
    where
        N: Stages<
            'b,
            R,
            Resources,
            NextQueryIndicesLists,
            NextResourceViewsIndicesLists,
            NextDisjointIndicesList,
            NextEntryIndicesList,
            NextEntryViewsFilterIndicesList,
        >,
    {
        // Check if borrowed_archetypes is empty.
        // If so, it is better to just run the next stage directly.
        if borrowed_archetypes.is_empty() {
            N::new_has_run()
        } else {
            // Run tasks from next stage that can be parallelized dynamically.
            // SAFETY: The safety contract of this method call is upheld by the safety contract of
            // this method.
            unsafe { next_stage.run_add_ons(world, borrowed_archetypes, resource_claims) }
        }
    }

    unsafe fn run_add_ons(
        &mut self,
        _world: SendableWorld<R, Resources>,
        _borrowed_archetypes: HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
        _resource_claims: Resources::Claims,
    ) -> Self::HasRun {
        Null
    }

    fn new_has_run() -> Self::HasRun {
        Null
    }
}

fn query_archetype_identifiers<
    'a,
    R,
    Resources,
    T,
    QueryIndices,
    ResourceViewsIndices,
    DisjointIndices,
    EntryIndices,
    EntryViewsFilterIndices,
>(
    world: SendableWorld<R, Resources>,
    borrowed_archetypes: &mut HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
) -> bool
where
    R: ContainsFilter<
            Or<And<T::Views, T::Filter>, T::EntryViewsFilter>,
            Or<And<R::ViewsFilterIndices, R::FilterIndices>, EntryViewsFilterIndices>,
        > + ContainsQuery<'a, T::Filter, T::Views, QueryIndices>
        + ContainsViews<'a, T::EntryViews, EntryIndices>,
    Resources: 'a,
    T: Task<'a, R, Resources, QueryIndices, ResourceViewsIndices, DisjointIndices, EntryIndices>,
{
    let mut merged_borrowed_archetypes = borrowed_archetypes.clone();

    for (identifier, claims) in
        // SAFETY: The access to the world's archetype identifiers follows Rust's borrowing
        // rules. Additionally, the views within the task are guaranteed to be valid and
        // compatible.
        unsafe {
            (*world.get()).query_archetype_claims::<T::Views, T::Filter, Or<And<T::Views, T::Filter>, T::EntryViewsFilter>, T::EntryViews, QueryIndices, Or<And<R::ViewsFilterIndices, R::FilterIndices>, EntryViewsFilterIndices>, EntryIndices>()
        }
    {
        match merged_borrowed_archetypes.entry(identifier) {
            hash_map::Entry::Occupied(mut entry) => {
                if let Some(merged_claims) = claims.try_merge(entry.get()) {
                    entry.insert(merged_claims);
                } else {
                    return false;
                }
            }
            hash_map::Entry::Vacant(entry) => {
                entry.insert(claims);
            }
        }
    }

    *borrowed_archetypes = merged_borrowed_archetypes;
    true
}

fn query_archetype_identifiers_unchecked<
    'a,
    R,
    Resources,
    T,
    QueryIndices,
    ResourceViewsIndices,
    DisjointIndices,
    EntryIndices,
    EntryViewsFilterIndices,
>(
    world: SendableWorld<R, Resources>,
    borrowed_archetypes: &mut HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
) where
    R: ContainsFilter<
            Or<And<T::Views, T::Filter>, T::EntryViewsFilter>,
            Or<And<R::ViewsFilterIndices, R::FilterIndices>, EntryViewsFilterIndices>,
        > + ContainsQuery<'a, T::Filter, T::Views, QueryIndices>
        + ContainsViews<'a, T::EntryViews, EntryIndices>,
    Resources: 'a,
    T: Task<'a, R, Resources, QueryIndices, ResourceViewsIndices, DisjointIndices, EntryIndices>,
{
    for (identifier, claims) in
        // SAFETY: The access to the world's archetype identifiers follows Rust's borrowing
        // rules. Additionally, the views within the task are guaranteed to be valid and
        // compatible.
        unsafe {
            (*world.get()).query_archetype_claims::<T::Views, T::Filter, Or<And<T::Views, T::Filter>, T::EntryViewsFilter>, T::EntryViews, QueryIndices, Or<And<R::ViewsFilterIndices, R::FilterIndices>, EntryViewsFilterIndices>, EntryIndices>()
        }
    {
        borrowed_archetypes.insert_unique_unchecked(identifier, claims);
    }
}

impl<
        'a,
        R,
        Resources,
        T,
        U,
        QueryIndices,
        QueryIndicesList,
        ResourceViewsIndices,
        ResourceViewsIndicesList,
        DisjointIndices,
        DisjointIndicesList,
        EntryIndices,
        EntryIndicesList,
        EntryViewsFilterIndices,
        EntryViewsFilterIndicesList,
    >
    Stage<
        'a,
        R,
        Resources,
        (QueryIndices, QueryIndicesList),
        (ResourceViewsIndices, ResourceViewsIndicesList),
        (DisjointIndices, DisjointIndicesList),
        (EntryIndices, EntryIndicesList),
        (EntryViewsFilterIndices, EntryViewsFilterIndicesList),
    > for (&mut T, U)
where
    R: ContainsFilter<
            Or<And<T::Views, T::Filter>, T::EntryViewsFilter>,
            Or<And<R::ViewsFilterIndices, R::FilterIndices>, EntryViewsFilterIndices>,
        > + ContainsQuery<'a, T::Filter, T::Views, QueryIndices>
        + ContainsViews<'a, T::EntryViews, EntryIndices>,
    Resources: resource::Resources
        + resource::ContainsViews<'a, T::ResourceViews, ResourceViewsIndices>
        + 'a,
    T: Task<'a, R, Resources, QueryIndices, ResourceViewsIndices, DisjointIndices, EntryIndices>
        + Send,
    U: Stage<
        'a,
        R,
        Resources,
        QueryIndicesList,
        ResourceViewsIndicesList,
        DisjointIndicesList,
        EntryIndicesList,
        EntryViewsFilterIndicesList,
    >,
{
    type HasRun = (bool, U::HasRun);

    fn run<
        'b,
        N,
        NextQueryIndicesLists,
        NextResourceViewsIndicesLists,
        NextDisjointIndicesList,
        NextEntryIndices,
        NextEntryViewsFilterIndicesList,
    >(
        &mut self,
        world: SendableWorld<R, Resources>,
        mut borrowed_archetypes: HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
        resource_claims: Resources::Claims,
        has_run: Self::HasRun,
        next_stage: &mut N,
    ) -> N::HasRun
    where
        N: Stages<
            'b,
            R,
            Resources,
            NextQueryIndicesLists,
            NextResourceViewsIndicesLists,
            NextDisjointIndicesList,
            NextEntryIndices,
            NextEntryViewsFilterIndicesList,
        >,
    {
        // Determine whether this task still needs to run, or if it has been run as part of a
        // previous stage.
        if has_run.0 {
            self.1.run(
                world,
                borrowed_archetypes,
                resource_claims,
                has_run.1,
                next_stage,
            )
        } else {
            rayon::join(
                // Continue scheduling tasks. Note that the first task is executed on the
                // current thread.
                || {
                    // Track all archetypes that are being directly borrowed by this task.
                    query_archetype_identifiers_unchecked::<
                        R,
                        Resources,
                        T,
                        QueryIndices,
                        ResourceViewsIndices,
                        DisjointIndices,
                        EntryIndices,
                        EntryViewsFilterIndices,
                    >(world, &mut borrowed_archetypes);

                    let resource_claims =
                        // SAFETY: The resource claims are compatible because they are in the same
                        // stage.
                        unsafe { resource_claims.merge_unchecked(&Resources::claims()) };

                    self.1.run(
                        world,
                        borrowed_archetypes,
                        resource_claims,
                        has_run.1,
                        next_stage,
                    )
                },
                // Execute the current task.
                || self.0.run(world),
            )
            .0
        }
    }

    unsafe fn run_add_ons(
        &mut self,
        world: SendableWorld<R, Resources>,
        mut borrowed_archetypes: HashMap<archetype::IdentifierRef<R>, R::Claims, FnvBuildHasher>,
        resource_claims: Resources::Claims,
    ) -> Self::HasRun {
        if let Some(resource_claims) = Resources::claims().try_merge(&resource_claims) {
            if query_archetype_identifiers::<
                R,
                Resources,
                T,
                QueryIndices,
                ResourceViewsIndices,
                DisjointIndices,
                EntryIndices,
                EntryViewsFilterIndices,
            >(world, &mut borrowed_archetypes)
            {
                rayon::join(
                    || {
                        (
                            true,
                            // SAFETY: The safety contract of this method call is upheld by the
                            // safety contract of this method.
                            unsafe {
                                self.1
                                    .run_add_ons(world, borrowed_archetypes, resource_claims)
                            },
                        )
                    },
                    || self.0.run(world),
                )
                .0
            } else {
                (
                    false,
                    // SAFETY: The safety contract of this method call is upheld by the safety
                    // contract of this method.
                    unsafe {
                        self.1
                            .run_add_ons(world, borrowed_archetypes, resource_claims)
                    },
                )
            }
        } else {
            (
                false,
                // SAFETY: The safety contract of this method call is upheld by the safety contract
                // of this method.
                unsafe {
                    self.1
                        .run_add_ons(world, borrowed_archetypes, resource_claims)
                },
            )
        }
    }

    fn new_has_run() -> Self::HasRun {
        (false, U::new_has_run())
    }
}