bevy_gpu_compute 0.1.2

Empowering anyone to leverage GPU-acceleration with as little barrier-to-entry as possible
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

use std::collections::HashMap;
use std::collections::hash_map::DefaultHasher;
use std::hash::{Hash, Hasher};

#[derive(Debug, Clone, Default)]
pub struct InputArrayDataLengths {
    lengths_by_input_array_type_name: HashMap<String, usize>,
    hash: u64,
}

impl InputArrayDataLengths {
    pub fn new(lengths_by_input_array_type_name: HashMap<String, usize>) -> Self {
        let hash = Self::hash_map(&lengths_by_input_array_type_name);

        InputArrayDataLengths {
            lengths_by_input_array_type_name,
            hash,
        }
    }
    pub fn hash_map(map: &HashMap<String, usize>) -> u64 {
        let mut hasher = DefaultHasher::new();
        for (key, value) in map {
            key.hash(&mut hasher);
            value.hash(&mut hasher);
        }

        hasher.finish()
    }
    pub fn get(&self, input_array_type_name: &str) -> Option<&usize> {
        self.lengths_by_input_array_type_name
            .get(input_array_type_name)
    }
    pub fn update_and_return_new_hash_if_changed(&mut self, other: Self) -> Option<u64> {
        let new_hash = Self::hash_map(&other.lengths_by_input_array_type_name);
        if new_hash == self.hash {
            None
        } else {
            self.lengths_by_input_array_type_name = other.lengths_by_input_array_type_name;
            self.hash = new_hash;
            Some(new_hash)
        }
    }

    pub fn hash(&self) -> u64 {
        self.hash
    }
}