pub enum MethodsErrors {
Show 32 variants
AnnSearchRsError(AnnSearchErrors),
Core(CoreErrors),
GraphDirectedError,
GraphIndexOutOfRange {
name: &'static str,
index: usize,
n_nodes: usize,
},
GraphLengthMismatch {
name: &'static str,
expected: usize,
got: usize,
},
KnnGraphNeedsDistances,
MissingNodeTypeWeight(String),
CommunityAssignmentMismatch,
PartitionLabelOutOfRange {
label: usize,
n_partitions: usize,
},
TooManyPartitions {
n_partitions: usize,
max: usize,
},
NmfRankTooLarge {
requested: usize,
available: usize,
},
NmfNonFinite,
NmfNonNegativeViolated,
NmfConsensusInvalidK {
k: usize,
},
NmfConsensusTooFewRuns {
n_runs: usize,
},
NmfConsensusTooFewComponents {
k: usize,
n_surviving: usize,
},
NmfConsensusEmptyCluster {
cluster: usize,
k: usize,
},
NmfKSweepEmptyRange,
NmfConsensusKMismatch {
requested: usize,
restarts: usize,
},
NmfDimensionMismatch {
expected: usize,
found: usize,
},
LdaInvalidTopicCount {
requested: usize,
max_available: usize,
},
LdaInvalidHyperparameter {
name: String,
value: f64,
},
LdaEmptyMatrix,
LdaNonFinite,
LdaTopNTooLarge {
requested: usize,
vocab_size: usize,
},
LdaDimensionMismatch {
expected: usize,
got: usize,
},
FeatureSetIndexOutOfRange {
set: usize,
index: usize,
n_features: usize,
},
FeatureSetInvalid {
set: usize,
reason: &'static str,
},
LmActivityShapeMismatch {
expected: usize,
got: usize,
},
LmActivityDegreesOfFreedom {
n_features: usize,
n_params: usize,
},
LmActivityRankDeficient {
ratio: f64,
},
LmActivityNonFinite {
observation: usize,
},
}Expand description
Error variants raised by bixverse-methods.
Grouped by subsystem.
Variants§
AnnSearchRsError(AnnSearchErrors)
Propagates an error from ann-search-rs.
Core(CoreErrors)
Propagates an error from bixverse-core.
GraphDirectedError
Error for algorithms that expect undirected graphs
For methods that expect an undirected graph, but received a directed one.
GraphIndexOutOfRange
A node index in an edge list points outside the graph
Fields
GraphLengthMismatch
A per-node or per-edge input does not line up with the graph
Fields
KnnGraphNeedsDistances
The UMAP kNN graph was asked for without kNN distances
MissingNodeTypeWeight(String)
A node type present in the graph has no type weight
CommunityAssignmentMismatch
Error for community membership/graph node number mismatch
In cases where the graph and the community membership do not agree.
PartitionLabelOutOfRange
Error if a partition label sits outside the declared partition count
TooManyPartitions
Error if the partition count exceeds what the dense coarsening accepts
NmfRankTooLarge
NMF Rank is too large for the NNDSVD initialisation
NmfNonFinite
Error if NMF values are not finite
NmfNonNegativeViolated
Error if NMF values are negative
NmfConsensusInvalidK
Consensus NMF received a rank that cannot support a silhouette.
NmfConsensusTooFewRuns
Consensus NMF received too few restarts to pool over.
NmfConsensusTooFewComponents
The outlier filter removed so many components that k-means cannot run.
NmfConsensusEmptyCluster
k-means returned an empty cluster, so the consensus factor would carry a zero row and the refit would be degenerate.
NmfKSweepEmptyRange
The k sweep was handed nothing to sweep over.
NmfConsensusKMismatch
A consensus step was applied to restarts run at a different rank.
Fields
NmfDimensionMismatch
A frozen factor handed to a refit does not line up with V.
LdaInvalidTopicCount
The requested topic count cannot be supported by the corpus.
A topic needs somewhere to put its mass, so k above the vocabulary
size leaves topics that no document can ever distinguish.
Fields
LdaInvalidHyperparameter
A Dirichlet hyperparameter is not strictly positive.
LdaEmptyMatrix
The document-term matrix carries no counts at all.
LdaNonFinite
A non-finite value reached the variational parameters.
LdaTopNTooLarge
Coherence was asked for more top terms than the vocabulary holds.
Fields
LdaDimensionMismatch
Metric inputs disagree on the number of documents or topics.
FeatureSetIndexOutOfRange
A feature set points at a feature outside the feature universe.
Fields
FeatureSetInvalid
A feature set is empty, repeats a feature, carries a non-finite weight or has a weight vector of the wrong length.
LmActivityShapeMismatch
The data and the feature sets disagree on the number of features.
LmActivityDegreesOfFreedom
The model leaves no residual degrees of freedom.
Fields
LmActivityRankDeficient
The MLM design is (numerically) rank deficient.
Two sets with identical or proportional weights, or a set covering every
feature with one weight (collinear with the intercept), make XᵀX
singular.
LmActivityNonFinite
An observation holds a NaN or infinite value.
Trait Implementations§
Source§impl Debug for MethodsErrors
impl Debug for MethodsErrors
Source§impl Display for MethodsErrors
impl Display for MethodsErrors
Source§impl Error for MethodsErrors
impl Error for MethodsErrors
Source§fn source(&self) -> Option<&(dyn Error + 'static)>
fn source(&self) -> Option<&(dyn Error + 'static)>
1.0.0 · Source§fn description(&self) -> &str
fn description(&self) -> &str
use the Display impl or to_string()
Source§impl From<AnnSearchErrors> for MethodsErrors
impl From<AnnSearchErrors> for MethodsErrors
Source§fn from(source: AnnSearchErrors) -> Self
fn from(source: AnnSearchErrors) -> Self
Source§impl From<CoreErrors> for MethodsErrors
impl From<CoreErrors> for MethodsErrors
Source§fn from(source: CoreErrors) -> Self
fn from(source: CoreErrors) -> Self
Source§impl From<SparseErrors> for MethodsErrors
Sparse structure errors surface through the core variant, as before the
sparse structures moved to bixverse-sparse.
impl From<SparseErrors> for MethodsErrors
Sparse structure errors surface through the core variant, as before the
sparse structures moved to bixverse-sparse.
Source§fn from(err: SparseErrors) -> Self
fn from(err: SparseErrors) -> Self
Auto Trait Implementations§
impl !RefUnwindSafe for MethodsErrors
impl !UnwindSafe for MethodsErrors
impl Freeze for MethodsErrors
impl Send for MethodsErrors
impl Sync for MethodsErrors
impl Unpin for MethodsErrors
impl UnsafeUnpin for MethodsErrors
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<T> Separable for Twhere
T: Display,
impl<T> Separable for Twhere
T: Display,
Source§fn separate_by_policy(&self, policy: SeparatorPolicy<'_>) -> String
fn separate_by_policy(&self, policy: SeparatorPolicy<'_>) -> String
SeparatorPolicy. Read moreSource§fn separate_with_commas(&self) -> String
fn separate_with_commas(&self) -> String
Source§fn separate_with_spaces(&self) -> String
fn separate_with_spaces(&self) -> String
Source§fn separate_with_dots(&self) -> String
fn separate_with_dots(&self) -> String
Source§fn separate_with_underscores(&self) -> String
fn separate_with_underscores(&self) -> String
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.