and it may store non-pointer data, C pointers, or Go pointers to pinned
memory through those pointers. It may not store a Go pointer to unpinned
memory in memory pointed to by a C pointer (which again, implies that it
may not store a string, slice, channel, and so forth). A Go function
called by C code may take a Go pointer but it must preserve the property
that the Go memory to which it points (and the Go memory to which that
memory points, and so on) is pinned.

	}

	doubleAgeRes := &result{}
	if err := DB.Table("users").Select("age + age as age").Where("id = ?", user3.ID).Scan(&doubleAgeRes).Error; err != nil {
		t.Errorf("Scan to pointer of pointer")
	}

	if doubleAgeRes.Age != int(res.Age)*2 {
		t.Errorf("Scan double age as age, expect: %v, got %v", res.Age*2, doubleAgeRes.Age)
	}

	var results []result

        when(mockNdrBuffer.dec_ndr_long()).thenReturn(0); // null pointer

        shareInfo0.decode(mockNdrBuffer);

        assertNull(shareInfo0.netname);
        verify(mockNdrBuffer).align(4);
        verify(mockNdrBuffer).dec_ndr_long();
        // Should not decode string if pointer is null
        verify(mockDeferredBuffer, never()).dec_ndr_string();
    }

    @Test

the toolchain, such as a frame pointer.
The set of pseudo-registers is the same for all architectures:
</p>

<ul>

<li>
<code>FP</code>: Frame pointer: arguments and locals.
</li>

<li>
<code>PC</code>: Program counter:
jumps and branches.
</li>

<li>
<code>SB</code>: Static base pointer: global symbols.
</li>

<li>

  /**
   * Contains the link pointers corresponding with the entries, in the range of [0, size()). The
   * 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,

   *
   * <p>Currently, the UNSET value means "null pointer", and any non negative value x is the actual
   * index.
   *
   * <p>Its size must be a power of two.
   */
  private transient int[] table;

  /**
   * Contains the logical entries, in the range of [0, size()). The high 32 bits of each long is the
   * smeared hash of the element, whereas the low 32 bits is the "next" pointer (pointing to the

// const declaration. It is zero-indexed.
const iota = 0 // Untyped int.

// nil is a predeclared identifier representing the zero value for a
// pointer, channel, func, interface, map, or slice type.
var nil Type // Type must be a pointer, channel, func, interface, map, or slice type

// Type is here for the purposes of documentation only. It is a stand-in

    }

    @Test
    @DisplayName("Test PacUnicodeString check method with null pointer")
    void testPacUnicodeStringCheckWithNullPointer() throws Exception {
        // When pointer is 0, the string should be null
        PacUnicodeString unicodeString = new PacUnicodeString((short) 0, (short) 0, 0);

        // check() expects null when pointer is 0 but doesn't accept empty string
        assertThrows(PACDecodingException.class, () -> {

            assertEquals(6, entry.name.maximum_length);
        }

        @Test
        @DisplayName("Should decode entry with null buffer pointer")
        void testDecodeNullBufferPointer() throws NdrException {
            // Given: Mocked buffer data with null pointer
            samr.SamrSamEntry entry = new samr.SamrSamEntry();
            when(mockNdrBuffer.dec_ndr_long()).thenReturn(1, 0); // idx, _name_bufferp = 0

        NdrBuffer dstOut = new NdrBuffer(encodeBufferOut, 0);

        // Simulate info pointer (non-null)
        dstOut.enc_ndr_long(1); // Non-null pointer for info
        info.encode(dstOut); // Encode the info structure

        // Simulate totalentries pointer (non-null)
        dstOut.enc_ndr_long(1); // Non-null pointer for totalentries
        totalentries.encode(dstOut); // Encode the totalentries