Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 45 for linkend (0.05 seconds)

  1. build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/AssembleDslDocTask.groovy

            String blockName = tr.td[0].text().trim()
            gradlebuild.docs.dsl.docbook.model.BlockDoc blockDoc = project.getBlock(blockName)
            tr.children = {
                td { link(linkend: blockDoc.id) { literal("$blockName { }")} }
                td(blockDoc.description)
            }
        }
    
        def mergeTypes(Element typeTable, DslDocModel model) {
            typeTable.addFirst {
                thead {
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Dec 09 08:14:05 GMT 2020
    - 9.8K bytes
    - Click Count (0)
  2. build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/JavadocConverter.java

                }
                Element element = document.createElement("link");
                String targetId = String.format("%s.%s", classMetaData.getClassName(), href.substring(1));
                element.setAttribute("linkend", targetId);
                nodes.push(element);
                return true;
            }
    
            @Override
            public void onEndElement(String element) {
                nodes.pop();
            }
    
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed May 21 06:20:45 GMT 2025
    - 29.3K bytes
    - Click Count (0)
  3. src/cmd/cgo/doc.go

    using internal linking, cmd/link can generate Go binaries by itself.
    
    In order to allow linking arbitrary object files without requiring
    dynamic libraries, cgo supports an "external" linking mode too. In
    external linking mode, cmd/link does not process any host object files.
    Instead, it collects all the Go code and writes a single go.o object
    file containing it. Then it invokes the host linker (usually gcc) to
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Dec 08 22:37:14 GMT 2025
    - 43.9K bytes
    - Click Count (0)
  4. LICENSE

    this license for certain libraries in order to permit linking those
    libraries into non-free programs.
    
      When a program is linked with a library, whether statically or using
    a shared library, the combination of the two is legally speaking a
    combined work, a derivative of the original library.  The ordinary
    General Public License therefore permits such linking only if the
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Mon Jan 18 20:25:38 GMT 2016
    - 25.8K bytes
    - Click Count (0)
  5. guava/src/com/google/common/collect/CompactLinkedHashMap.java

       * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
       * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are
       * all "null" (UNSET).
       *
       * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list,
       * and a node with "next" pointer equal to {@code ENDPOINT} is the last node.
       */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 10.2K bytes
    - Click Count (0)
  6. tensorflow/c/BUILD

            "//conditions:default": [],
        }),
        tags = [
            "no_cuda_asan",  # TODO(b/181771536)
            "no_windows",  # TODO(b/155444728)
        ],
        # We must ensure that the dependencies can be dynamically linked since
        # the shared library must be able to use core:framework.
        deps = [
            ":c_api",
            ":c_api_internal",
            ":c_test_util",
            ":test_op_kernel",
            ":tf_buffer",
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Tue Feb 17 18:49:14 GMT 2026
    - 30.3K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/collect/CompactHashMap.java

          // 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;
            int oldEntry = entries[entryIndex];
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 35.7K bytes
    - Click Count (0)
  8. src/cmd/asm/internal/asm/endtoend_test.go

    	data, err := os.ReadFile(input)
    	if err != nil {
    		t.Error(err)
    		return
    	}
    	lineno := 0
    	lines := strings.Split(string(data), "\n")
    	for _, line := range lines {
    		lineno++
    
    		fileline := fmt.Sprintf("%s:%d", input, lineno)
    		if m := errRE.FindStringSubmatch(line); m != nil {
    			all := m[1]
    			mm := errQuotesRE.FindAllStringSubmatch(all, -1)
    			if len(mm) != 1 {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Mar 20 17:02:17 GMT 2026
    - 12.6K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/CompactHashMap.java

          // 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;
            int oldEntry = entries[entryIndex];
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 39.6K bytes
    - Click Count (0)
  10. doc/asm.html

    are reserved by the compiler and linker.
    </p>
    
    <p>
    <code>R10</code> points to the <code>g</code> (goroutine) structure.
    Within assembler source code, this pointer must be referred to as <code>g</code>;
    the name <code>R10</code> is not recognized.
    </p>
    
    <p>
    To make it easier for people and compilers to write assembly, the ARM linker
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Nov 14 19:09:46 GMT 2025
    - 36.5K bytes
    - Click Count (0)
Back to Top