Skip to main content

ReasonCode

Enum ReasonCode 

Source
pub enum ReasonCode {
Show 43 variants ActiveFrames, TooFewNotes, OctaveUncertain, SilentStem, OneChannel, NoNoteList, CyclesInSpan, HardLimited, StereoBlindSpot, BandEdgeDrop, LineProminence, TooFewFrames, NoBandEdge, TempoPeak, BeatPeriodicity, SparsePeriodicity, OnsetSharpness, OnsetsPerBeat, BpmExact, VoicedFrames, PolyphonicLine, MotionSpan, FitResidual, PitchJitter, SineShare, ContourKurtosis, AttackTime, CurveBound, NoteFrames, RelativeSpread, UpperBoundShare, CountAgreement, AttackHidesJoin, NoAttackRead, LevelKeptAtJoin, StemEdgeAtJoin, TailWeight, TailLight, TailResidual, TailSmooth, TailBand, TailWobble, ZeroMedian,
}
Expand description

Why an estimator chose its level, or why it made no estimate.

Each code is a stable snake_case identifier in the report. Each estimator adds the codes of its own signals here.

Variants§

§

ActiveFrames

The number of analysis frames with signal above the noise floor.

§

TooFewNotes

Too few notes to fit the value.

§

OctaveUncertain

The pitch may be an octave off.

§

SilentStem

The stem is digital silence.

§

OneChannel

The file has one channel, so no stereo value exists.

§

NoNoteList

No note list was given, so a value that needs the f0 has none.

§

CyclesInSpan

The number of full cycles of a rate in the span. Below two, no rate is reported.

§

HardLimited

The stem is flat-topped at its peak, so its level and crest are capped by a limiter or by clipping.

§

StereoBlindSpot

The stereo screen cannot see an anti-phase stereo chorus or a light reverb.

§

BandEdgeDrop

The steepest fall of the smoothed spectrum over one semitone above 2 kHz, in dB. Below the steep-drop threshold the band edge comes from the margin rule.

§

LineProminence

The strongest line of a modulation scan over the median magnitude of the scan. Below the prominence threshold no rate is reported.

§

TooFewFrames

Fewer active frames than a statistic over frames needs; the value is the minimum.

§

NoBandEdge

No bin of the spectrum above 1 kHz rises the band-edge margin above its floor, so the band edge is the Nyquist frequency at low confidence.

§

TempoPeak

The best score of the tempo search over its median score. Below the trust threshold the given tempo stays; 0 when the stem has no onsets.

§

BeatPeriodicity

The share of the onset strength that repeats at the refined beat: the best score of the tempo search over its lag count times the zero-lag autocorrelation. Below the trust threshold the given tempo stays.

§

SparsePeriodicity

The share of the onset strength that repeats every 2 or every 4 refined beats, the better of the two, as Self::BeatPeriodicity reads it on those lags alone. Onsets on every other beat or once a bar read near 1. It trusts a sparse part when the beat periodicity does not; 0 when the stem holds too few beats for it. At most 1.

§

OnsetSharpness

The share of the energy of the raw onset strength, before its low-pass, within 25 ms of its peaks. Hits and plucks read near 1; a swell, such as a pad under a slow tremolo, reads low. A refined tempo is trusted only with sharp onsets.

§

OnsetsPerBeat

The peaks of the onset strength per beat of the slowest tempo searched. The sparse periodicity trusts a tempo only for a part this sparse, because a dense grid, such as sixteenth notes, lines up with any spacing that is a whole number of its steps.

§

BpmExact

--bpm-exact was given, so the tempo was not refined.

§

VoicedFrames

The number of voiced frames of the f0 track.

§

PolyphonicLine

The line plays chords, so a method for one voice at a time made no estimate.

§

MotionSpan

How long a pitch motion moved faster than the glide floor, in seconds. A short motion reads a glide’s time less well.

§

FitResidual

The RMS residual of a fit: in cents for a glide, as a share of the drop for a pitch drop.

§

PitchJitter

The RMS deviation of the stable pitches around a glide from their medians, in cents. A unison beats and the track wanders, which skews the glide’s time.

§

SineShare

The share of a contour’s power that a fitted sine explains.

§

ContourKurtosis

The kurtosis of a vibrato’s contour after its line, the fourth moment over the squared second: 1.5 for a sine, 1.0 for a square wave such as a trill between two notes.

§

AttackTime

The time the band envelope of a strike takes from 10 % to 90 % of its peak, in seconds. A slow attack hides the start of a pitch drop.

§

CurveBound

A glide’s fitted curve power sits on the upper bound of its range: an exponential approach, read with less certainty.

§

NoteFrames

The share of the track frames inside the notes that are voiced within 100 cents of a sounding note. Noise or DC under a note list reads near 0.

§

RelativeSpread

The interquartile range of a value over the notes, divided by the absolute value of its median. Above 0.5 the notes disagree too much for a preset.

§

UpperBoundShare

The share of the pooled notes whose attack is an upper bound: its rise is shorter than 1.5 RMS windows, or for an overlapping note twice the rise of its band filter on an instant step.

§

CountAgreement

The share of the held time whose count of voices agrees with the verdict.

§

AttackHidesJoin

The stem’s attack is long enough to hide a retrigger.

§

NoAttackRead

No attack was read, so a retrigger it hides cannot be ruled out.

§

LevelKeptAtJoin

The level holds through a join, which a retrigger with an instant attack does too.

§

StemEdgeAtJoin

The stem’s edge reaches a level window beside a join, so a level is unread or short.

§

TailWeight

The tail weighs too much at the note-off for a release to be identified.

§

TailLight

The tail weighs too little at the note-off to show an RT60: a dry note often leaves a little weight whose RT60 is noise.

§

TailResidual

The tail model fits too poorly for a release to be identified.

§

TailSmooth

A heavy tail fits too smoothly for a reverb: it reads as the note’s own exponential release, not as a space.

§

TailBand

The tail fades faster than the note’s band filter can show.

§

TailWobble

The level wobbles over the hold and the tail fits poorly, as under a tremolo, so a written release reads low.

§

ZeroMedian

The interquartile range of a value over the notes whose median is 0, so the range has no ratio to the median. The value reads low.

Trait Implementations§

Source§

impl Clone for ReasonCode

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Copy for ReasonCode

Source§

impl Debug for ReasonCode

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for ReasonCode

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Eq for ReasonCode

Source§

impl Hash for ReasonCode

Source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl PartialEq for ReasonCode

Source§

fn eq(&self, other: &Self) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
Source§

impl Serialize for ReasonCode

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl StructuralPartialEq for ReasonCode

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<T> CloneAny for T
where T: Any + Clone,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Converts Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Converts Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Converts &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Converts &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSend for T
where T: Any + Send,

§

fn into_any_send(self: Box<T>) -> Box<dyn Any + Send>

Converts Box<Trait> (where Trait: DowncastSend) to Box<dyn Any + Send>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_sync(self: Box<T>) -> Box<dyn Any + Send + Sync>

Converts Box<Trait> (where Trait: DowncastSync) to Box<dyn Any + Send + Sync>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync> ⓘ

Converts Arc<Trait> (where Trait: DowncastSync) to Arc<Any>, which can then be downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> DynClone for T
where T: Clone,

Source§

fn __clone_box(&self, _: Private) -> *mut ()

§

impl<T> DynEq for T
where T: Eq + 'static,

§

fn as_any(&self) -> &(dyn Any + 'static)

§

fn dyn_eq(&self, other: &(dyn Any + 'static)) -> bool

Source§

impl<T> DynHash for T
where T: Hash + ?Sized,

Source§

fn dyn_hash(&self, state: &mut dyn Hasher)

§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<F, T> IntoSample<T> for F
where T: FromSample<F>,

§

fn into_sample(self) -> T

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Serialize for T
where T: Serialize + ?Sized,

Source§

fn erased_serialize(&self, serializer: &mut dyn Serializer) -> Result<(), Error>

Source§

fn do_erased_serialize( &self, serializer: &mut dyn Serializer, ) -> Result<(), ErrorImpl>

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.