*
     * That includes node which access ancestors or children of the location.
     */
    public ImmutableSet<Node> getNodesAccessing(String location) {
        return visitValues(location, new CollectingNodeAccessVisitor());
    }

    /**
     * Visits all nodes which access the location.
     *
     * That includes node which access ancestors or children of the location.
     */

     */
    @CheckReturnValue
    public ValuedVfsHierarchy<T> empty() {
        return emptyHierarchy(caseSensitivity);
    }

    /**
     * Visits the values which are attached to ancestors and children of the given location.
     */
    public void visitValues(String location, ValueVisitor<T> visitor) {
        VfsRelativePath relativePath = VfsRelativePath.of(location);
        if (relativePath.isEmpty()) {

                    #set ( $isAsso = false )
                    #if ( $field.toClass )
                        #set ( $ancestors = $Helper.ancestors( $field.toClass ) )
                        #foreach ( $cl in $ancestors )
                            #if ( $classToFields.containsKey( $cl ) )
                                #set ( $isAsso = true )
                            #end

  func.func @main() {
    tf_executor.graph {
      %control = tf_executor.island wraps "tf.XlaHostCompute"() {_xla_original_oc_node_name = "Add", _xla_token_input_nodes = ["_xla_token_arg_node"], ancestors = [], cost_estimate_ns = 1024 : i64, key = "host_compute_channel_1_retvals", send_key = "", recv_key = "", shapes = [], tpu_core = 0 : i64} : () -> ()
      tf_executor.fetch
    }
    func.return
  }
}

                visitor.onEndHtmlElement(element);
            }
        }

        private void unwindTo(Collection<String> ancestors, TokenVisitor visitor) {
            for (int i = 0; i < elementStack.size(); i++) {
                if (ancestors.contains(elementStack.get(i))) {
                    for (; i > 0; i--) {
                        visitor.onEndHtmlElement(elementStack.removeFirst());

}

// CHECK-LABEL: @RewriteHostComputeMlirOp
func.func @RewriteHostComputeMlirOp(%arg0: tensor<*xf32>, %arg1: tensor<3x?xf64>) -> (tensor<*xf32>) {

  // CHECK: "tf.XlaHostCompute"(%arg0, %arg1)
  // CHECK-SAME: ancestors = []
  // CHECK-SAME: cost_estimate_ns = 1000000 : i64
  // CHECK-SAME: key = ""
  // CHECK-SAME: recv_key = "host_compute_channel_recv"
  // CHECK-SAME: send_key = "host_compute_channel_send"

        return transformer.apply(value);
    }

#foreach ( $class in $model.allClasses )
  #if ( $class.name != "InputSource" && $class.name != "InputLocation" )
    #set ( $ancestors = $Helper.ancestors( $class ) )
    #set ( $allFields = $Helper.xmlFields( $class ) )
    protected ${class.name} transform${class.name}(${class.name} target) {
        if (target == null) {
            return null;
        }

// If `use_external_constant` is true, it will create `tfl.external_const`
// instead of `tfl.const`.
// If `experimental_prune_unreachable_nodes_unconditionally` is true, nodes that
// are not ancestors of the output nodes will be pruned.
mlir::OwningOpRef<mlir::ModuleOp> FlatBufferToMlir(
    absl::string_view buffer, mlir::MLIRContext* context,
    mlir::Location base_loc, bool use_external_constant = false,

package ssa

import (
	"math/bits"
)

// Code to compute lowest common ancestors in the dominator tree.
// https://en.wikipedia.org/wiki/Lowest_common_ancestor
// https://en.wikipedia.org/wiki/Range_minimum_query#Solution_using_constant_time_and_linearithmic_space

// lcaRange is a data structure that can compute lowest common ancestor queries
// in O(n lg n) precomputed space and O(1) time per query.
type lcaRange struct {

        "some/location/intermediate/child/sub1/leaf1" | [5]
        "some/location/intermediate/child/sub1/leaf2" | [6]
        "some/location/intermediate/child/sub3/leaf"  | [7]
    }

    def "can query ancestors values"() {
        ValuedVfsHierarchy<Integer> hierarchy = complexHierarchy()

        when:
        def visitor = new CollectingValueVisitor()
        hierarchy.visitValues(location, visitor)
        then: