mod curve;
mod cycle;
mod edge;
mod face;
mod region;
mod shell;
mod solid;
mod surface;
mod vertex;
use std::collections::{btree_map, BTreeMap};
use fj_math::{Transform, Vector};
use type_map::TypeMap;
use crate::{
objects::{AnyObject, Stored},
operations::insert::Insert,
storage::{Handle, ObjectId},
Core,
};
use super::derive::DeriveFrom;
pub trait TransformObject: Sized {
fn transform(&self, transform: &Transform, core: &mut Core) -> Self {
let mut cache = TransformCache::default();
self.transform_with_cache(transform, core, &mut cache)
}
fn transform_with_cache(
&self,
transform: &Transform,
core: &mut Core,
cache: &mut TransformCache,
) -> Self;
fn translate(&self, offset: impl Into<Vector<3>>, core: &mut Core) -> Self {
self.transform(&Transform::translation(offset), core)
}
fn rotate(
&self,
axis_angle: impl Into<Vector<3>>,
core: &mut Core,
) -> Self {
self.transform(&Transform::rotation(axis_angle), core)
}
}
impl<T> TransformObject for Handle<T>
where
T: Clone + Insert<Inserted = Handle<T>> + TransformObject + 'static,
Handle<T>: Into<AnyObject<Stored>>,
{
fn transform_with_cache(
&self,
transform: &Transform,
core: &mut Core,
cache: &mut TransformCache,
) -> Self {
if let Some(object) = cache.get(self) {
return object.clone();
}
let transformed = self
.clone_object()
.transform_with_cache(transform, core, cache)
.insert(core)
.derive_from(self, core);
cache.insert(self.clone(), transformed.clone());
transformed
}
}
#[derive(Default)]
pub struct TransformCache(TypeMap);
impl TransformCache {
fn entry<T: 'static>(
&mut self,
key: &Handle<T>,
) -> btree_map::Entry<ObjectId, Handle<T>> {
let map = self
.0
.entry::<BTreeMap<ObjectId, Handle<T>>>()
.or_insert_with(BTreeMap::new);
map.entry(key.id())
}
fn get<T: 'static>(&mut self, key: &Handle<T>) -> Option<&Handle<T>> {
let map = self
.0
.entry::<BTreeMap<ObjectId, Handle<T>>>()
.or_insert_with(BTreeMap::new);
map.get(&key.id())
}
fn insert<T: 'static>(&mut self, key: Handle<T>, value: Handle<T>) {
let map = self
.0
.entry::<BTreeMap<ObjectId, Handle<T>>>()
.or_insert_with(BTreeMap::new);
map.insert(key.id(), value);
}
}