Package pal.treesearch

Class BranchAccess.Utils

  • Enclosing interface:
    BranchAccess
    public static final class BranchAccess.Utils
extends java.lang.Object

    • Constructor Detail

      • Utils

        public Utils()

    • Method Detail

      • isContained

        public static final boolean isContained​(java.lang.String[] larger,
                                        java.lang.String[] smaller)

      • isIntersection

        public static final boolean isIntersection​(java.lang.String[] one,
                                           java.lang.String[] two)

      • isMatching

        public static final boolean isMatching​(BranchAccess branch,
                                       java.lang.String[] queryLeftLeaves,
                                       java.lang.String[] queryRightLeaves)

      • getMatching

        public static final BranchAccess getMatching​(BranchAccess[] base,
                                             java.lang.String[] queryLeftLeaves,
                                             java.lang.String[] queryRightLeaves)

      • transferAnnotation

        public static final void transferAnnotation​(java.lang.String[] sourceLeftLeaves,
                                            java.lang.String[] sourceRightLeaves,
                                            java.lang.Object annotation,
                                            BranchAccess[] desination)

      • transferAnnotation

        public static final void transferAnnotation​(BranchAccess[] source,
                                            BranchAccess[] destination)
        Transfers the annotation across two independent sets of BranchAccess objects. It is expected that the leaf sets are relatively common (they don't have to match - if there are no matches in leaf sets this method won't do anything except eat CPU time). This method is time consuming
        Parameters:
        source - The source of the annotation
        destination - The destination of the annotation