terrain-forge 0.7.0

A modular procedural generation engine for terrain, dungeons, and maps
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

use crate::{Algorithm, Grid, Rng, Tile};
use serde::{Deserialize, Serialize};

#[derive(Debug, Clone, Serialize, Deserialize)]
/// Configuration for diffusion-limited aggregation.
pub struct DlaConfig {
    /// Number of particles to release. Default: 500.
    pub num_particles: usize,
    /// Maximum random walk steps per particle. Default: 1000.
    pub max_walk_steps: usize,
}

impl Default for DlaConfig {
    fn default() -> Self {
        Self {
            num_particles: 500,
            max_walk_steps: 1000,
        }
    }
}

#[derive(Debug, Clone, Serialize, Deserialize)]
/// Diffusion-limited aggregation generator.
pub struct Dla {
    config: DlaConfig,
}

impl Dla {
    /// Creates a new DLA generator with the given config.
    pub fn new(config: DlaConfig) -> Self {
        Self { config }
    }
}

impl Default for Dla {
    fn default() -> Self {
        Self::new(DlaConfig::default())
    }
}

impl Algorithm<Tile> for Dla {
    fn generate(&self, grid: &mut Grid<Tile>, seed: u64) {
        let mut rng = Rng::new(seed);
        let (w, h) = (grid.width(), grid.height());
        let dirs: [(i32, i32); 4] = [(0, -1), (1, 0), (0, 1), (-1, 0)];

        // Seed in center
        grid.set(w as i32 / 2, h as i32 / 2, Tile::Floor);

        for _ in 0..self.config.num_particles {
            let mut x = rng.range(1, w as i32 - 1);
            let mut y = rng.range(1, h as i32 - 1);

            for _ in 0..self.config.max_walk_steps {
                let has_neighbor = dirs.iter().any(|&(dx, dy)| {
                    grid.get(x + dx, y + dy)
                        .map(|t| t.is_floor())
                        .unwrap_or(false)
                });

                if has_neighbor {
                    grid.set(x, y, Tile::Floor);
                    break;
                }

                let (dx, dy) = dirs[rng.range_usize(0, 4)];
                let (nx, ny) = (x + dx, y + dy);
                if nx > 0 && nx < w as i32 - 1 && ny > 0 && ny < h as i32 - 1 {
                    x = nx;
                    y = ny;
                }
            }
        }
    }

    fn name(&self) -> &'static str {
        "DLA"
    }
}