* rely on the class node analysis since it doesn't give the right superclass because
     * resolution is not complete when this visitor is executed.
     */
    private boolean isIntegrationTest(ClassNode current) {
        return current.getName().endsWith("Test") || current.getName().endsWith("Spec");
    }

    @Override
    protected boolean shouldVisitMethod(MethodNode node) {

        ExtensionInterpolator(UnaryOperator<String> transformer) {
            super(transformer);
        }

        public XmlNode transform(XmlNode node) {
            return super.transform(node);
        }
    }

    assertThat(tags[String::class]).isEqualTo("b")
    assertThat(tags.toString())
      .isEqualTo("{class kotlin.Int=5, class kotlin.Boolean=true, class kotlin.String=b}")
  }

  /** The implementation retains only the first node from the original linked list. */
  @Test
  fun replaceMiddleElement() {
    val tags =
      EmptyTags
        .plus(Integer::class, 5 as Integer)
        .plus(String::class, "a")
        .plus(Boolean::class, true)

                    (int) originalUuid.node[0], (int) originalUuid.node[1], (int) originalUuid.node[2], (int) originalUuid.node[3],
                    (int) originalUuid.node[4], (int) originalUuid.node[5]);
            when(decodeBuffer.derive(anyInt())).thenReturn(decodeBuffer);

            // When: Decoding into a new UUID

				node.Pools = append(node.Pools, ep.PoolIdx)
			}
			nodesMap[ep.Host] = node
		}
	}
	nodes = make([]Node, 0, len(nodesMap))
	for _, v := range nodesMap {
		nodes = append(nodes, v)
	}
	sort.Slice(nodes, func(i, j int) bool {
		return nodes[i].Host < nodes[j].Host
	})
	return nodes
}

// GetPoolIdx return pool index

            if (this.node == null) {
                if (_nodes < 0 || _nodes > 0xFFFF) {
                    throw new NdrException(NdrException.INVALID_CONFORMANCE);
                }
                this.node = new byte[_nodes];
            }
            _src = _src.derive(_nodei);
            for (int _i = 0; _i < _nodes; _i++) {
                this.node[_i] = (byte) _src.dec_ndr_small();
            }

      @Override
      public Iterable<? extends Character> successors(Character node) {
        checkArgument(
            graphMap.containsKey(node) || graphMap.containsValue(node),
            "Node %s is not an element of this graph",
            node);
        return Ordering.natural().immutableSortedCopy(graphMap.get(node));
      }
    };
  }

     * Lookup <code>hostname</code> and return it's <code>UniAddress</code>. If the
     * <code>possibleNTDomainOrWorkgroup</code> parameter is <code>true</code> an
     * additional name query will be performed to locate a master browser.
     *
     * @param hostname the hostname to resolve
     * @param possibleNTDomainOrWorkgroup if true, perform additional master browser lookup
     *
     * @return the first resolved address

        ExtensionInterpolator(UnaryOperator<String> transformer) {
            super(transformer);
        }

        public XmlNode transform(XmlNode node) {
            return super.transform(node);
        }
    }

        publication.getPom().withXml(xml -> {
            var node = xml.asNode();
            node.appendNode("inceptionYear", "2009");
            var licensesNode = node.appendNode("licenses");
            projectLicenses.get().entrySet().stream().sorted(Map.Entry.comparingByKey()).forEach(entry -> {
                Node license = licensesNode.appendNode("license");
                license.appendNode("name", entry.getKey());