summaryrefslogtreecommitdiff
path: root/src/ctx.rs
diff options
context:
space:
mode:
authorIsaac Clayton2022-01-22 14:22:08 +0100
committerIsaac Clayton2022-01-22 14:22:08 +0100
commit7add9d30bd06be1988cbe1dd206a6ae247c1b953 (patch)
treeacc48712b4455344ccf25ce54b8c439323b3db41 /src/ctx.rs
parent0628e1bc68fd077ef76100b494638a7327e8410e (diff)
Quadtrees are up and running! Let's render them!
Diffstat (limited to 'src/ctx.rs')
-rw-r--r--src/ctx.rs76
1 files changed, 59 insertions, 17 deletions
diff --git a/src/ctx.rs b/src/ctx.rs
index 90d6c15..29161f2 100644
--- a/src/ctx.rs
+++ b/src/ctx.rs
@@ -1,32 +1,74 @@
use std::marker::PhantomData;
use crate::quad::{Quad, Node, Embed};
+pub trait Approx<A: Embed, B: Embed, S>: Default {
+ fn color_base(state: &mut S, base: A) -> [u8; 4];
+
+ fn compress_node(state: &mut S, compr: [B; 4]) -> B;
+ fn expand_node(state: &mut S, compr: B) -> [B; 4];
+
+ fn compress_base(state: &mut S, embed: A) -> B;
+ fn expand_base(state: &mut S, compr: B) -> A;
+}
+
+#[derive(Default)]
+pub struct Basic;
+
+impl Approx<u8, u8, ()> for Basic {
+ fn color_base(state: &mut (), base: u8) -> [u8; 4] {
+ [base;4]
+ }
+
+ fn compress_node(state: &mut (), c: [u8; 4]) -> u8 {
+ c[0]/4 + c[1]/4 + c[2]/4 + c[3]/4
+ }
+
+ fn expand_node(state: &mut (), compr: u8) -> [u8; 4] {
+ [compr;4]
+ }
+
+ fn compress_base(state: &mut (), embed: u8) -> u8 {
+ embed
+ }
+
+ fn expand_base(state: &mut (), compr: u8) -> u8 {
+ compr
+ }
+}
+
/// Represents a context with shared state.
-#[derive(Default, Debug)]
-pub struct Ctx<A: Embed, B: Embed> {
+#[derive(Debug)]
+pub struct Ctx<A: Embed, B: Embed, S, N: Approx<A, B, S>> {
_phantom_a: PhantomData<A>,
_phantom_b: PhantomData<B>,
+ state: S,
+ networks: N,
}
-impl<A: Embed, B: Embed> Ctx<A, B> {
+impl<A: Embed, B: Embed, S, N: Approx<A, B, S>> Ctx<A, B, S, N> {
/// Creates a new uninitialized context.
- pub fn new_empty() -> Self {
- Default::default()
+ pub fn new(state: S, networks: N) -> Self {
+ Ctx {
+ _phantom_a: PhantomData,
+ _phantom_b: PhantomData,
+ state,
+ networks,
+ }
}
- /// Combines 4 child node representations into a single representation
- /// Using a neural network.
- pub fn combine(&mut self, compr: [B; 4]) -> B {
- todo!("Build new B from 4 child B");
+ pub fn color_base(&mut self, base: A) -> [u8; 4] {
+ N::color_base(&mut self.state, base)
}
/// Compresses a base-level cell into a vector.
pub fn compress_base(&mut self, base: A) -> B {
- todo!("Turn Base Cell into a vector B");
+ N::compress_base(&mut self.state, base)
}
- pub fn color_base(&mut self, base: &A) -> [u8; 4] {
- todo!();
+ /// Combines 4 child node representations into a single representation
+ /// Using a neural network.
+ pub fn compress_node(&mut self, compr: [B; 4]) -> B {
+ N::compress_node(&mut self.state, compr)
}
/// Compresses a single node into a vector representation.
@@ -36,7 +78,7 @@ impl<A: Embed, B: Embed> Ctx<A, B> {
match quad {
Quad::Base(b) => Some(self.compress_base(*b)),
Quad::Node(n) => Some(
- self.combine([
+ self.compress_node([
n[0].compr,
n[1].compr,
n[2].compr,
@@ -48,12 +90,12 @@ impl<A: Embed, B: Embed> Ctx<A, B> {
}
/// Compresses a base-level cell into a vector.
- fn expand_base(&mut self, compr: B) -> A {
- todo!("Turn compressed B into the A that made it");
+ pub fn expand_base(&mut self, compr: B) -> A {
+ N::expand_base(&mut self.state, compr)
}
- fn expand_node(&mut self, compr: B) -> [B; 4] {
- todo!("Turn compressed B into 4 child B that made it");
+ pub fn expand_node(&mut self, compr: B) -> [B; 4] {
+ N::expand_node(&mut self.state, compr)
}
/// Expands the compressed representation of a node into a node with 4 children.