roc-lang/roc
1
1
Fork 0
mirror of https://github.com/roc-lang/roc.git synced 2024-11-11 16:51:53 +03:00
Code Issues Packages Projects Releases Wiki Activity

Implement Pool::reserve

Browse Source
This commit is contained in:
Richard Feldman 2020-12-09 20:34:41 -05:00
parent 53534f5b09
commit d420beb56f
1 changed files with 13 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
editor/src/pool.rs
View File

@ -109,14 +109,22 @@ impl Pool {
// It's only safe to store this if T is the same size as S.
debug_assert_eq!(size_of::<T>(), NODE_BYTES);
let index = self.num_nodes;
if index < self.capacity {
let node_ptr = unsafe { self.nodes.offset(index as isize) } as *mut T;
let node_id = self.reserve(1);
let node_ptr = unsafe { self.nodes.offset(node_id.index as isize) } as *mut T;
unsafe { *node_ptr = node };
self.num_nodes = index + 1;
node_id
}
/// Reserves the given number of contiguous node slots, and returns
/// the NodeId of the first one. We only allow reserving 2^32 in a row.
fn reserve<T>(&mut self, nodes: u32) -> NodeId<T> {
// TODO once we have a free list, look in there for an open slot first!
let index = self.num_nodes;
if index < self.capacity {
self.num_nodes = index + nodes;
NodeId {
index,
@ -127,12 +135,6 @@ impl Pool {
}
}
/// Reserves the given number of contiguous node slots, and returns
/// the NodeId of the first one. We only allow reserving 2^32 in a row.
fn reserve<T>(&mut self, _nodes: u32) -> NodeId<T> {
todo!("Implement Pool::reserve");
}
pub fn get<'a, T>(&'a self, node_id: NodeId<T>) -> &'a T {
unsafe {
let node_ptr = self.nodes.offset(node_id.index as isize) as *mut T;