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
//! Basic index-based arena for holding HIR nodes.
//!
//! This is basically just a copy of some of the [`la_arena`](https://docs.rs/la-arena/latest/la_arena/)
//! crate used in `rust-analyzer`.

use std::hash::{Hash, Hasher};
use std::marker::PhantomData;

/// An index into an [`Arena`].
#[derive(Debug)]
pub struct Idx<T> {
    inner: usize,
    _ph: PhantomData<fn() -> T>,
}

impl<T> Clone for Idx<T> {
    fn clone(&self) -> Self {
        Self {
            inner: self.inner,
            _ph: PhantomData,
        }
    }
}

impl<T> Copy for Idx<T> {}

impl<T> PartialEq for Idx<T> {
    fn eq(&self, other: &Idx<T>) -> bool {
        self.inner == other.inner
    }
}

impl<T> Eq for Idx<T> {}

impl<T> Hash for Idx<T> {
    fn hash<H: Hasher>(&self, state: &mut H) {
        self.inner.hash(state);
    }
}

impl<T> Idx<T> {
    pub fn as_inner(&self) -> usize {
        self.inner
    }

    fn new(idx: usize) -> Self {
        Idx {
            inner: idx,
            _ph: PhantomData,
        }
    }
}

/// Basically a `Vec`.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct Arena<T> {
    inner: Vec<T>,
}

impl<T> Default for Arena<T> {
    fn default() -> Self {
        Self { inner: Vec::new() }
    }
}

impl<T> Arena<T> {
    pub fn new() -> Self {
        Self { inner: Vec::new() }
    }

    pub fn reserve(&mut self, n: usize) {
        self.inner.reserve(n)
    }

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

    pub fn alloc(&mut self, val: T) -> Idx<T> {
        self.inner.push(val);
        Idx::new(self.inner.len() - 1)
    }

    pub fn items(&self) -> impl Iterator + '_ {
        self.inner.iter()
    }

    pub fn items_mut(&mut self) -> impl Iterator + '_ {
        self.inner.iter_mut()
    }

    /// This does not return an [`Option`] because we assume the index is valid.
    /// This should be alright, because we don't provide a way to construct
    /// an `Idx` on its own.
    pub fn get(&self, idx: Idx<T>) -> &T {
        self.inner.get(idx.as_inner()).expect("index is valid")
    }

    pub fn get_mut(&mut self, idx: Idx<T>) -> &mut T {
        self.inner.get_mut(idx.as_inner()).expect("index is valid")
    }
}