double [ ] function ( ) { double [ ] loc0 = new double [ scorers . size ( ) ] ; int loc1 = 0 ; for ( PairwiseSequenceScorer < S , C > loc2 : scorers ) { loc0 [ loc1 ++ ] = loc2 . getScore ( ) ; } return loc0 ; }
returns a sequence pair score for all sequence pairs in the given list . concode_field_sep BasicSymmetricalDistanceMatrix distances concode_elem_sep GuideTreeNode<S,C> parent concode_elem_sep boolean isVisited concode_elem_sep double distance concode_elem_sep Profile<S,C> profile concode_elem_sep List<S> sequences concode_elem_sep GuideTreeNode<S,C> child2 concode_elem_sep String newick concode_elem_sep boolean isLeaf concode_elem_sep GuideTreeNode<S,C> child1 concode_elem_sep Stack<Node> nodes concode_elem_sep Node root concode_elem_sep Future<ProfilePair<S,C>> profileFuture concode_elem_sep String name concode_elem_sep List<PairwiseSequenceScorer<S,C>> scorers concode_field_sep GuideTreeNode<S,C> next concode_elem_sep double getDistanceToParent concode_elem_sep String getName concode_elem_sep int getIndex concode_elem_sep boolean isLeaf concode_elem_sep double[][] getScoreMatrix concode_elem_sep void remove concode_elem_sep Iterator<GuideTreeNode<S,C>> iterator concode_elem_sep Enumeration<GuideTreeNode<S,C>> children concode_elem_sep List<S> getSequences concode_elem_sep void setProfileFuture concode_elem_sep Node getRoot concode_elem_sep GuideTreeNode<S,C> getParent concode_elem_sep boolean isVisited concode_elem_sep Profile<S,C> getProfile concode_elem_sep void setProfile concode_elem_sep boolean hasNext concode_elem_sep Future<ProfilePair<S,C>> getProfileFuture concode_elem_sep int getChildCount concode_elem_sep GuideTreeNode<S,C> getChildAt concode_elem_sep double[][] getDistanceMatrix concode_elem_sep boolean getAllowsChildren concode_elem_sep String toString concode_elem_sep GuideTreeNode<S,C> getChild1 concode_elem_sep void clearVisited concode_elem_sep void visit concode_elem_sep GuideTreeNode<S,C> getChild2