* and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
   */
  @VisibleForTesting transient long @Nullable [] links;

  /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
  private transient int firstEntry;

  /** Pointer to the last node in the linked list, or {@code ENDPOINT} if there are no entries. */

    def "validates present files for javadoc links"() {
        given:
        sampleDoc << """
=== Valid Javadoc Links

Be sure to see: `@link:{javadocPath}/org/gradle/api/tasks/InputDirectory.html[InputDirectory]`

    // link:{javadocPath}/org/gradle/api/java/archives/ManifestMergeDetails.html[ManifestMergeDetails]
    private final Pattern javadocLinkPattern = Pattern.compile("link:\\{javadocPath\\}/(.*?\\.html)");
    // link:../samples/sample_problems_api_usage.html[end-to-end sample]
    private final Pattern samplesLinkPattern = Pattern.compile("link:../samples/(.*?\\.html)");

  verbose = args.verbose
  build_log_path = os.path.expandvars(args.build_log)
  links = parse_log(build_log_path, verbose=verbose)

  if args.xml_out_path:
    output_path = os.path.expandvars(args.xml_out_path)
    create_xml_file(links, output_path, verbose=verbose)
  if args.print:
    print_invocation_results(links)


if __name__ == '__main__':

        }
        phase.links().forEach(link -> {
            if (link.pointer().type() == Lifecycle.Pointer.Type.PROJECT) {
                if (link.kind() == Lifecycle.Link.Kind.AFTER) {
                    graph.addEdge(graph.addVertex(link.pointer().phase()), ep0);
                } else {
                    graph.addEdge(ep3, graph.addVertex(BEFORE + link.pointer().phase()));
                }
            }

    public void setDomain(final String domain) {
        this.domain = domain;
    }

    @Override
    public String getLink() {
        return this.link;
    }

    @Override
    public void setLink(final String link) {
        this.link = link;
    }

    /**
     * @return the key
     */
    @Override
    public String getKey() {
        return this.key;
    }

    /**

            }
            roots.remove(root);
            links = null;
        }

        if (links == null) {
            log.trace("Loadings roots");
            final String refServerName = domain;
            dr = fetchRootReferral(tf, domain, root, refServerName);
            links = cacheRootReferral(tf, domain, root, roots, dr, links);
        } else if (links instanceof NegativeCacheEntry) {

                 */
                CacheEntry links = (CacheEntry) roots.get(root);
                if (links != null && now > links.expiration) {
                    roots.remove(root);
                    links = null;
                }

                if (links == null) {
                    trans = getDc(domain, auth);
                    if (trans == null) {
                        return null;

      // We need to rewrite the `next` link of each of the elements so that it is in the appropriate
      // linked list starting from `newTable`. In general, each element from the old linked list
      // belongs to a different linked list from `newTable`. We insert each element in turn at the
      // head of its appropriate `newTable` linked list.
      while (oldNext != UNSET) {
        int entryIndex = oldNext - 1;

////

## Links da Web e internos { #web-and-internal-links }

//// tab | Teste

O texto do link deve ser traduzido, o endereço do link deve permanecer inalterado:

* [Link para o título acima](#code-snippets)
* [Link interno](index.md#installation){.internal-link target=_blank}
* <a href="https://sqlmodel.tiangolo.com/" class="external-link" target="_blank">Link externo</a>