2.0f },
0f );
private static final double TWO_PI = 2 * Math.PI;
- private final static int WIGGLE = 2;
+ private final static int WIGGLE = 3;
private static final String SHOW_ONLY_THIS_CONF_TYPE = null; //TODO remove me
HashMap<Long, Short> _nodeid_dist_to_leaf = new HashMap<Long, Short>();
final private Arc2D _arc = new Arc2D.Double();
* @param y
* @return pointer to the node at x,y, null if not found
*/
- final PhylogenyNode findNode( final int x, final int y ) {
+ public final PhylogenyNode findNode( final int x, final int y ) {
if ( ( _phylogeny == null ) || _phylogeny.isEmpty() ) {
return null;
}
return _domain_structure_e_value_thr_exp;
}
- final Set<Long> getFoundNodes0() {
+ public final Set<Long> getFoundNodes0() {
return _found_nodes_0;
}
- final Set<Long> getFoundNodes1() {
+ public final Set<Long> getFoundNodes1() {
return _found_nodes_1;
}
- List<PhylogenyNode> getFoundNodesAsListOfPhylogenyNodes() {
+ public List<PhylogenyNode> getFoundNodesAsListOfPhylogenyNodes() {
final List<PhylogenyNode> additional_nodes = new ArrayList<PhylogenyNode>();
if ( getFoundNodes0() != null ) {
for( final Long id : getFoundNodes0() ) {
_current_external_nodes_data_buffer = sb;
}
- final void setFoundNodes0( final Set<Long> found_nodes ) {
+ public final void setFoundNodes0( final Set<Long> found_nodes ) {
_found_nodes_0 = found_nodes;
}
- final void setFoundNodes1( final Set<Long> found_nodes ) {
+ public final void setFoundNodes1( final Set<Long> found_nodes ) {
_found_nodes_1 = found_nodes;
}