Package pal.treesearch

Class BranchAccess.Utils

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

  • Constructor Details

    • Utils

      public Utils()

  • Method Details

    • isContained

      public static final boolean isContained(String[] larger, String[] smaller)

    • isIntersection

      public static final boolean isIntersection(String[] one, String[] two)

    • isMatching

      public static final boolean isMatching(BranchAccess branch, String[] queryLeftLeaves, String[] queryRightLeaves)

    • getMatching

      public static final BranchAccess getMatching(BranchAccess[] base, BranchAccess query)

    • getMatching

      public static final BranchAccess getMatching(BranchAccess[] base, String[] queryLeftLeaves, String[] queryRightLeaves)

    • transferAnnotation

      public static final void transferAnnotation(BranchAccess source, BranchAccess[] desination)

    • transferAnnotation

      public static final void transferAnnotation(String[] sourceLeftLeaves, String[] sourceRightLeaves, 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