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 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549
#![deny(missing_docs, missing_debug_implementations)]
//! Core library for `redact_composer`. Lib-level crates should depend on this rather than the
//! application-level `redact_composer`.
extern crate self as redact_composer_core;
/// Error types.
pub mod error;
/// Types and traits used for and during composition rendering.
pub mod render;
/// Timing related structs and elements.
pub mod timing;
/// Re-exports of non-deterministic [`std::collections`], with deterministic defaults.
pub mod util;
#[cfg(test)]
mod test;
use rand::{thread_rng, RngCore, SeedableRng};
use rand_chacha::ChaCha12Rng;
use std::any::TypeId;
use std::collections::{Bound, HashSet};
use std::fmt::Debug;
use std::hash::{Hash, Hasher};
use std::iter::successors;
use std::ops::RangeBounds;
use twox_hash::XxHash64;
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};
use crate::error::ConversionError;
use crate::render::context::CompositionContext;
use crate::render::{tree::Tree, RenderEngine, RenderSegment};
use crate::timing::{Timing, STANDARD_BEAT_LENGTH};
/// Contains the derive macro of [`Element`]. Specifically kept separate in core, so
/// exporting trait vs macro can be done separately
pub mod derive {
pub use redact_composer_derive::ElementCore as Element;
}
use std::any::Any;
const LOG: &str = "redact_composer";
/// Marker trait for any type that will be used as a composition element.
///
/// Can be implemented via its derive macro:
/// ```no_run
/// # use serde::{Deserialize, Serialize};
/// # use redact_composer_core::derive::Element;
/// # #[derive(Debug, Serialize, Deserialize)]
/// #[derive(Element)]
/// pub struct CustomCompositionElement;
/// ```
///
/// If implementing maually, remember to tag the impl block with `#[typetag::serde]` for proper
/// serialization behavior.
///
/// **Advanced**: Overriding the default [`wrapped_element`](crate::Element::wrapped_element) method
/// indicates another element this one wraps. Wrapped elements will render alongside their wrappers,
/// producing a cumulative set of children. Mainly used to provide a common 'tag' type for an
/// unknown set of other elements, enabling context lookups or other operations that depend on
/// element type.
#[cfg_attr(feature = "serde", typetag::serde)]
pub trait Element: Debug + AsAny + 'static {
/// None.
fn wrapped_element(&self) -> Option<&dyn Element> {
None
}
}
/// Convenience trait for converting to [`&dyn Any`].
pub trait AsAny {
/// Converts this to a [`&dyn Any`].
fn as_any(&self) -> &dyn Any;
}
impl<T: Element> AsAny for T {
fn as_any(&self) -> &dyn Any {
self
}
}
/// A (type-erased) [`Element`] spanning a [`Timing`] interval.
#[derive(Debug)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct Segment {
/// The element this segment represents.
pub element: Box<dyn Element>,
/// The timing interval this segment spans.
#[cfg_attr(feature = "serde", serde(flatten))]
pub timing: Timing,
/// An optional name. When being rendered, this segment's Rng are seeded with a combined hash of
/// this name as well as the segment's parent seed.
#[cfg_attr(feature = "serde", serde(skip_serializing_if = "Option::is_none"))]
pub name: Option<String>,
}
impl Segment {
/// Creates a new [`Segment`] from a [`Element`] which starts/ends
/// according to `timing`.
pub fn new(composition_type: impl Element, timing: impl Into<Timing>) -> Segment {
Segment {
element: Box::new(composition_type),
timing: timing.into(),
name: Option::default(),
}
}
/// Creates a new [`Segment`] from a [`Element`] which starts/ends
/// according to `timing`, and seeded by its `name`. Useful if you want certain
/// segments to be repeated/reproduced (i.e. be rendered with the same Rng)
pub fn named(
name: String,
composition_type: impl Element,
timing: impl Into<Timing>,
) -> Segment {
Segment {
element: Box::new(composition_type),
timing: timing.into(),
name: Some(name),
}
}
/// Gets the contained element if its type matches type `Element`, otherwise, `None` is
/// returned.
pub fn element_as<Element: crate::Element>(&self) -> Option<&Element> {
successors(Some(&*self.element), |s| s.wrapped_element())
.find_map(|s| s.as_any().downcast_ref::<Element>())
}
}
impl RangeBounds<i32> for Segment {
fn start_bound(&self) -> Bound<&i32> {
self.timing.start_bound()
}
fn end_bound(&self) -> Bound<&i32> {
self.timing.end_bound()
}
}
impl RangeBounds<i32> for &Segment {
fn start_bound(&self) -> Bound<&i32> {
self.timing.start_bound()
}
fn end_bound(&self) -> Bound<&i32> {
self.timing.end_bound()
}
}
/// A typed view of a [`Segment`] (references to its fields).
#[derive(Debug)]
pub struct SegmentRef<'a, T: Element> {
/// The element reference.
pub element: &'a T,
/// The segment's timing reference.
pub timing: &'a Timing,
/// The segment's name reference.
pub name: &'a Option<String>,
}
impl<'a, T: Element> Clone for SegmentRef<'a, T> {
fn clone(&self) -> Self {
*self
}
}
impl<'a, T: Element> Copy for SegmentRef<'a, T> {}
impl<'a, T: Element> TryFrom<&'a Segment> for SegmentRef<'a, T> {
type Error = ConversionError;
fn try_from(value: &'a Segment) -> std::result::Result<Self, Self::Error> {
if let Some(casted_ref) = value.element_as::<T>() {
Ok(SegmentRef {
element: casted_ref,
timing: &value.timing,
name: &value.name,
})
} else {
Err(ConversionError::TypeMismatch)
}
}
}
impl<'a, T> IntoCompositionSegment for SegmentRef<'a, T>
where
T: Element + Clone,
{
/// Turns this [`SegmentRef`] into a new [`Segment`] with a given
/// `timing`.
///
/// Note: This also copies the `name` if it exists. If this is not desired, use:
/// ```
/// # use redact_composer_core::elements::PlayNote;
/// # use redact_composer_core::SegmentRef;
/// # use redact_composer_core::timing::Timing;
/// # use redact_composer_core::IntoCompositionSegment;
/// # let timing = Timing::from(0..1);
/// # let s = (PlayNote { note: 0, velocity: 0}, Timing::from(0..1), None);
/// # let segment_ref = SegmentRef { element: &s.0,timing: &s.1, name: &s.2 };
/// let segment = segment_ref.element.clone().into_segment(timing);
/// ```
fn into_segment(self, timing: impl Into<Timing>) -> Segment {
if let Some(name) = self.name {
self.into_named_segment(name.clone(), timing)
} else {
self.element.clone().into_segment(timing)
}
}
/// Turns this [`SegmentRef`] into a new [`Segment`] with a given `name` and `timing`.
/// Naming segments ensures that any sibling segments with the same name will be seeded
/// identically.
fn into_named_segment(self, name: String, timing: impl Into<Timing>) -> Segment {
self.element.clone().into_named_segment(name, timing)
}
}
impl<'a, T: Element> RangeBounds<i32> for SegmentRef<'a, T> {
fn start_bound(&self) -> Bound<&i32> {
self.timing.start_bound()
}
fn end_bound(&self) -> Bound<&i32> {
self.timing.end_bound()
}
}
/// Conversion methods to create a [`Segment`] from a [`Element`].
pub trait IntoCompositionSegment: private::Sealed {
/// Conversion method into a [`Segment`] spanning a given time range.
fn into_segment(self, timing: impl Into<Timing>) -> Segment;
/// Conversion method into a named (fixed Rng) [`Segment`] spanning a given
/// time range.
fn into_named_segment(self, name: String, timing: impl Into<Timing>) -> Segment;
}
impl<T: Element> IntoCompositionSegment for T {
/// Converts this element into a [`Segment`] spanning the given time range.
fn into_segment(self, timing: impl Into<Timing>) -> Segment {
Segment::new(self, timing)
}
/// Converts this element into a named (fixed Rng) [`Segment`] spanning the given
/// time range.
/// Naming segments ensures that any other sibling segments with the same name will be seeded
/// identically.
fn into_named_segment(self, name: String, timing: impl Into<Timing>) -> Segment {
Segment::named(name, self, timing)
}
}
/// Core types implementing [`Element`].
pub mod elements {
use super::PartType;
use crate::derive::Element;
use crate::Element;
#[cfg(feature = "serde")]
use serde::{Deserialize, Serialize};
/// Play a note with a velocity.
#[derive(Element, Clone, Copy, Debug)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct PlayNote {
/// Note represented as u8, with `note % 12 == 0` representing 'C'.
pub note: u8,
/// The strength of attack of the note.
pub velocity: u8,
}
/// Wraps another element, indicating that notes rendered from the wrapped element are to be
/// played by a single instrument at a time.
#[derive(Element, Debug)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
#[element(wrapped_element = self.wrapped_element())]
pub struct Part(pub(super) Box<dyn Element>, pub(super) PartType);
}
use elements::Part;
use log::{debug, info, log_enabled, trace, warn, Level};
/// Indicates whether a part is an instrument, or percussion.
#[derive(Debug, Clone, Copy)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub enum PartType {
/// Instrument part.
Instrument,
/// Percussion part.
Percussion,
}
impl Part {
/// Creates a new instrument part from the given element.
pub fn instrument(wrapped_element: impl Element) -> crate::elements::Part {
Part(Box::new(wrapped_element), PartType::Instrument)
}
/// Creates a new percussion part from the given element.
pub fn percussion(wrapped_element: impl Element) -> crate::elements::Part {
Part(Box::new(wrapped_element), PartType::Percussion)
}
/// Returns the wrapped element.
pub fn wrapped_element(&self) -> Option<&dyn Element> {
Some(&*self.0)
}
/// Returns the type of this part.
pub fn part_type(&self) -> &PartType {
&self.1
}
}
/// Options used by a [`Composer`].
#[derive(Debug, Copy, Clone, Eq, PartialEq)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct ComposerOptions {
/// The number of ticks per beat.
pub ticks_per_beat: i32,
}
impl Default for ComposerOptions {
fn default() -> Self {
Self {
ticks_per_beat: STANDARD_BEAT_LENGTH,
}
}
}
/// Provides methods to create compositions using a [`RenderEngine`] and its
/// [`Renderer`](render::Renderer)s.
#[derive(Debug, Default)]
pub struct Composer {
/// The render engine used when rendering compositions.
pub engine: RenderEngine,
/// The composer's options.
pub options: ComposerOptions,
}
impl From<RenderEngine> for Composer {
fn from(value: RenderEngine) -> Self {
Composer {
engine: value,
..Default::default()
}
}
}
/// Options used during the rendering of a [`Composition`].
#[derive(Debug, Copy, Clone, Eq, PartialEq)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
pub struct CompositionOptions {
/// The number of ticks per beat.
pub ticks_per_beat: i32,
}
impl Default for CompositionOptions {
fn default() -> Self {
Self {
ticks_per_beat: STANDARD_BEAT_LENGTH,
}
}
}
impl From<ComposerOptions> for CompositionOptions {
fn from(value: ComposerOptions) -> Self {
Self {
ticks_per_beat: value.ticks_per_beat,
}
}
}
#[derive(Debug)]
#[cfg_attr(feature = "serde", derive(Serialize, Deserialize))]
/// A composition output, including the tree of rendered segments, produced from
/// [`Composer::compose`].
pub struct Composition {
/// The options used during this composition.
pub options: CompositionOptions,
/// The tree of rendered [`Segment`]s produced during composition.
pub tree: Tree<RenderSegment>,
}
impl Composer {
/// Generates a [`Composition`] from a starting [Segment].
pub fn compose(&self, seg: Segment) -> Composition {
let mut hasher = XxHash64::with_seed(0);
thread_rng().next_u64().hash(&mut hasher);
self.compose_with_seed(seg, hasher.finish())
}
/// Generates a [`Composition`] from a starting [Segment], using a seed to to
/// create a reproducible output.
pub fn compose_with_seed(&self, seg: Segment, seed: u64) -> Composition {
info!(target: LOG, "Composing {:?} with seed {:?}.", seg, seed);
debug!(target: LOG, "{:?}", self.options);
let options: CompositionOptions = self.options.into();
let mut render_tree = Tree::new();
let mut type_cache: Vec<HashSet<TypeId>> = Vec::new();
let node_id = render_tree.insert(
RenderSegment {
rendered: false,
seed,
segment: seg,
error: None,
},
None,
);
type_cache.insert(node_id, HashSet::default());
let mut render_pass = 1;
let mut rendered_node_count: usize;
let mut added_node_count: usize;
let mut first_unrendered: usize = 0;
loop {
// The high level loop flow is as follows:
// 1. Search the tree (render_nodes) for all unrendered Segment nodes
// 2. For each unrendered node, call its renderer
// 3. Add any rendered Segments to the tree as children of the rendered node.
// Note: New nodes are inserted as unrendered unless they do not have a Renderer
// 4. Repeat until no additional nodes are rendered.
rendered_node_count = 0;
added_node_count = 0;
let unrendered: Vec<usize> = render_tree[first_unrendered..]
.iter()
.filter(|n| !n.value.rendered)
.map(|n| n.idx)
.collect();
for idx in unrendered {
let composition_context = CompositionContext::new(
&options,
&render_tree,
&render_tree[idx],
Some(&type_cache),
);
trace!(target: LOG, "Rendering: {:?}", &render_tree[idx]);
let result = self
.engine
.render(&render_tree[idx].value.segment, composition_context);
let mut hasher = XxHash64::default();
render_tree[idx].value.seed.hash(&mut hasher);
// This rng is used to generate seeds for rendered children
let mut rng = ChaCha12Rng::seed_from_u64(hasher.finish());
if let Some(render_res) = result {
match render_res {
crate::render::Result::Err(err) => {
trace!(target: LOG, "Rendering (Node idx: {:?}) was unsuccessful: {:?}",
&render_tree[idx].idx, err);
render_tree[idx].value.error = Some(err);
}
crate::render::Result::Ok(segments) => {
trace!(target: LOG, "Rendering (Node idx: {:?}) succeeded, producing \
{:?} children.", &render_tree[idx].idx, segments.len());
let inserts: Vec<RenderSegment> = segments
.into_iter()
.map(|s| RenderSegment {
rendered: !self.engine.can_render(&*s.element),
seed: match &s.name {
None => {
let mut hasher = XxHash64::default();
rng.next_u64().hash(&mut hasher);
hasher.finish()
}
Some(name) => {
let mut hasher = XxHash64::default();
render_tree[idx].value.seed.hash(&mut hasher);
name.hash(&mut hasher);
hasher.finish()
}
},
segment: s,
error: None,
})
.collect();
added_node_count += inserts.len();
for new_render in inserts {
let type_ids =
successors(Some(&*new_render.segment.element), |s| {
s.wrapped_element()
})
.map(|s| s.as_any().type_id())
.collect::<HashSet<_>>();
for ancestor_idx in
successors(Some(idx), |p_idx| render_tree[*p_idx].parent)
.collect::<Vec<_>>()
{
type_cache[ancestor_idx].extend(type_ids.iter().copied());
}
let node_id = render_tree.insert(new_render, Some(idx));
type_cache.insert(node_id, HashSet::default());
}
if idx == first_unrendered {
first_unrendered += 1;
};
render_tree[idx].value.rendered = true;
render_tree[idx].value.error = None;
rendered_node_count += 1;
}
}
}
}
debug!(target: LOG, "Render pass {:?} rendered {:?} segments, generating {:?} more.",
render_pass, rendered_node_count, added_node_count);
render_pass += 1;
if added_node_count == 0 {
break;
}
}
info!(target: LOG, "Finished composing.");
if log_enabled!(target: LOG, Level::Warn) {
render_tree
.iter()
.filter(|n| !n.value.rendered)
.for_each(|n| warn!(target: LOG, "Unrendered: {:?}", n));
}
Composition {
options: self.options.into(),
tree: render_tree,
}
}
}
mod private {
use crate::SegmentRef;
pub trait Sealed {}
impl<T: super::Element> Sealed for T {}
impl<T: super::Element> Sealed for SegmentRef<'_, T> {}
}