Documentation

InvalidDistanceMatrixException extends InvalidArgumentException

Class InvalidDistanceMatrixException

Tags
author

Amélie DUVERNET aka Amelaye amelieonline@gmail.com

Table of Contents

Methods

asymmetricEntry()  : InvalidDistanceMatrixException
Builds the exception raised when D[i][j] and D[j][i] disagree, which breaks the symmetry a distance matrix requires.
duplicateLabel()  : InvalidDistanceMatrixException
Builds the exception raised when the same label is given twice, which would make it impossible to tell the corresponding taxa apart in the resulting tree.
emptyLabel()  : InvalidDistanceMatrixException
Builds the exception raised when a label is empty or not a string.
mismatchedDimensions()  : InvalidDistanceMatrixException
Builds the exception raised when the distance matrix is not exactly N x N for N labels.
negativeDistance()  : InvalidDistanceMatrixException
Builds the exception raised when an off-diagonal distance is negative, which is not a valid input measurement regardless of the tree it might imply.
nonFiniteDistance()  : InvalidDistanceMatrixException
Builds the exception raised when a distance is infinite or not a number : the tree built from it would carry branch lengths no Newick string can hold.
nonNumericDistance()  : InvalidDistanceMatrixException
Builds the exception raised when a distance is not a number at all (a null, an empty string, "n/a") : cast to a float it would read as 0, and two distinct taxa would be taken for identical.
nonZeroDiagonal()  : InvalidDistanceMatrixException
Builds the exception raised when a taxon's distance to itself is not exactly zero.
noTaxa()  : InvalidDistanceMatrixException
Builds the exception raised when no taxon at all is given.

Methods

On this page

Search results