</tbody>
                                        </table>
                                    </div>
                                </div>
                                <c:set var="pager" value="${searchLogPager}"
                                       scope="request"/>
                                <c:if test="${!logType.endsWith('_agg')}">

        }
        for (varyField in value.split(',')) {
          result.add(varyField.trim())
        }
      }
      return result ?: emptySet()
    }

    /**
     * Returns the subset of the headers in this's request that impact the content of this's body.
     */
    fun Response.varyHeaders(): Headers {
      // Use the request headers sent over the network, since that's what the response varies on.

    int keyBits = 32;
    int hashBits = function.bits();

    // output loop tests input bit
    for (int i = 0; i < keyBits; i++) {
      int same = 0x0; // bitset for output bits with same values
      int diff = 0x0; // bitset for output bits with different values
      int count = 0;
      // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues

	srcSet := s.getHashedSet(srcObject)
	dstSet := s.getHashedSet(dstObject)

	cpSrcDstSame := srcSet == dstSet
	// Check if this request is only metadata update.
	if cpSrcDstSame && srcInfo.metadataOnly {
		// Version ID is set for the destination and source == destination version ID.

   * 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.
   */

          bytes[15], bytes[14], bytes[13], bytes[12], bytes[11], bytes[10], bytes[9], bytes[8]);
    }
  };

  /**
   * Models a lock-free array of bits.
   *
   * <p>We use this instead of java.util.BitSet because we need access to the array of longs and we
   * need compare-and-swap.
   */
  static final class LockFreeBitArray {
    private static final int LONG_ADDRESSABLE_BITS = 6;
    final AtomicLongArray data;

        String s = session.toString();
        assertTrue(s.contains("targetHost=server.example"));
        assertTrue(s.contains("targetDomain=EXAMPLE"));
    }

    @Test
    @DisplayName("getExpiration: null when unset, value when positive")
    void testGetExpiration() {
        SmbSessionImpl session = newSession();
        assertNull(session.getExpiration());
        setField(session, "expiration", 123L);

	defer t.mu.RUnlock()

	return t.syncEvents
}

func (t *apiConfig) getObjectMaxVersions() int64 {
	t.mu.RLock()
	defer t.mu.RUnlock()

	if t.objectMaxVersions <= 0 {
		// defaults to 'IntMax' when unset.
		return math.MaxInt64
	}

	return t.objectMaxVersions

    }
}

// in plugin
existingThing = objects.newInstance(DefaultExistingThing.class)
existingThing.convention("some-value")
```

It's not acceptable to treat an unset Provider as if the convention is requested when the convention could be set elsewhere:

```groovy
public interface NewThing {
    Property<String> getSomeProperty()
}

// Unacceptable
String value

			if s, ok := v.(*serializer); ok {
				if s.fieldValue == nil && s.Serializer == nil {
					rv := field.ReflectValueOf(ctx, value)
					if rv.IsValid() && rv.CanSet() {
						rv.Set(reflect.Zero(field.FieldType))
					}
					return nil
				}
				if s.fieldValue != nil {
					err = oldFieldSetter(ctx, value, s.fieldValue)