regecs 2.0.0-alpha-1

Rust Extended Generic ECS (REGECS)
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

// Copyright (c) 2021, BlockProject 3D
//
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
//     * Redistributions of source code must retain the above copyright notice,
//       this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright notice,
//       this list of conditions and the following disclaimer in the documentation
//       and/or other materials provided with the distribution.
//     * Neither the name of BlockProject 3D nor the names of its contributors
//       may be used to endorse or promote products derived from this software
//       without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

use std::collections::{HashMap, HashSet};

use crate::object::ObjectRef;
use crate::component::{Component, ComponentRef};

pub struct AttachmentsManager<T: Component>
{
    map: HashMap<ObjectRef, HashSet<ComponentRef<T>>>,
    inv_map: HashMap<ComponentRef<T>, ObjectRef>
}

impl<T: Component> AttachmentsManager<T>
{
    pub fn new() -> AttachmentsManager<T>
    {
        return AttachmentsManager {
            map: HashMap::new(),
            inv_map: HashMap::new()
        };
    }

    pub fn remove(&mut self, r: ComponentRef<T>)
    {
        if let Some(entity) = self.inv_map.get(&r) {
            if let Some(set) = self.map.get_mut(entity) {
                set.remove(&r);
                self.inv_map.remove(&r);
            }
        }
    }

    pub fn attach(&mut self, entity: ObjectRef, r: ComponentRef<T>)
    {
        if let Some(set) = self.map.get_mut(&entity) {
            set.insert(r);
        } else {
            let mut set = HashSet::new();
            set.insert(r);
            self.map.insert(entity, set);
        }
        self.inv_map.insert(r, entity);
    }

    pub fn list(&self, entity: ObjectRef) -> Option<Vec<ComponentRef<T>>>
    {
        if let Some(set) = self.map.get(&entity) {
            let mut vec = Vec::with_capacity(set.len());
            for v in set {
                vec.push(*v);
            }
            return Some(vec);
        }
        return None;
    }

    pub fn clear(&mut self, entity: ObjectRef)
    {
        self.map.remove(&entity);
    }

    pub fn get_first(&self, entity: ObjectRef) -> Option<ComponentRef<T>>
    {
        if let Some(set) = self.map.get(&entity) {
            Some(*set.iter().nth(0).unwrap())
        } else {
            None
        }
    }
}