java.lang.Object
com.atlassian.plugin.webresource.impl.discovery.Found

public class Found extends Object
Represents the result of walking the dependency graph via BundleWalker, where every item is in is in topological sort order. The items captured will vary based on how the graph walk was configured in BundleFinder or BundleWalker.
  • Field Details

    • EMPTY

      public static final Found EMPTY
  • Constructor Details

  • Method Details

    • getFound

      public List<String> getFound()
      Returns:
      a list of Requestable keys whose content should be served to the client.
    • getSkipped

      public List<String> getSkipped()
      Returns:
      a list of Requestable keys that failed a deep filter test while traversing the graph (such as a UrlReadingCondition returning false) and should not be served to the client. Note that these are the exact items that failed a predicate test. Any child items would be ignored by the graph walk. If you need a complete list that includes subtrees of skipped items, configure BundleFinder.onDeepFilterFail(PredicateFailStrategy) to continue when a deep filter fails.
    • getAll

      public List<String> getAll()
      Returns:
      all Requestable keys discovered while performing this graph traversal. The list will include all skipped items, and may include ignored subtrees depending on how BundleFinder.onDeepFilterFail(PredicateFailStrategy) was configured.
    • getReducedInclusions

      public List<String> getReducedInclusions()
      Returns:
      the minimal set of graph entry points required to discover all the getFound() items after omitting subtrees discoverable via getReducedExclusions(). Can be used to minimise encoding cost when expressing the graph query and avoid redundant graph walks.
    • getReducedExclusions

      public Set<String> getReducedExclusions()
      Returns:
      the minimal set of graph entry points required to avoid serving content the client should not be given. Can be used to minimise encoding cost when expressing the graph query and avoid redundant graph walks.