type: KClass<T>,
  compute: () -> T,
): T {
  var computed: T? = null

  while (true) {
    val tags = get()

    // If the element is already present. Return it.
    val existing = tags[type]
    if (existing != null) return existing

    if (computed == null) {
      computed = compute()
    }

    // If we successfully add the computed element, we're done.

// just nice to know that it compiles.
void* create(TF_OpKernelConstruction* ctx) {
  TF_DataType type;
  TF_Status* s = TF_NewStatus();
  TF_OpKernelConstruction_GetAttrType(ctx, "foobar", &type, s);
  TF_DeleteStatus(s);
  return NULL;
}

// A compute function. This will never actually get called in this test, it's
// just nice to know that it compiles.
void compute(void* kernel, TF_OpKernelContext* ctx) {

the LICENSE file. //go:build !purego package sha3 import ( "crypto/internal/fips140/subtle" "crypto/internal/fips140deps/cpu" "crypto/internal/impl" ) // This file contains code for using the 'compute intermediate // message digest' (KIMD) and 'compute last message digest' (KLMD) // instructions to compute SHA-3 and SHAKE hashes on IBM Z. See // [z/Architecture Principles of Operation, Fourteen Edition]. // // [z/Architecture Principles of Operation, Fourteen Edition]: https://www.ibm.com/docs/e...

the LICENSE file. //go:build !purego package sha3 import ( "crypto/internal/fips140/subtle" "crypto/internal/fips140deps/cpu" "crypto/internal/impl" ) // This file contains code for using the 'compute intermediate // message digest' (KIMD) and 'compute last message digest' (KLMD) // instructions to compute SHA-3 and SHAKE hashes on IBM Z. See // [z/Architecture Principles of Operation, Fourteen Edition]. // // [z/Architecture Principles of Operation, Fourteen Edition]: https://www.ibm.com/docs/e...

        /** User's group memberships. */
        protected volatile String[] groups;

        /** User's role assignments. */
        protected volatile String[] roles;

        /** User's computed permissions. */
        protected volatile String[] permissions;

        /** Entra ID authentication result. */
        protected IAuthenticationResult authResult;

        /**

Asynchronous code just means that the language 💬 has a way to tell the computer / program 🤖 that at some point in the code, it 🤖 will have to wait for *something else* to finish somewhere else. Let's say that *something else* is called "slow-file" 📝.

So, during that time, the computer can go and do some other work, while "slow-file" 📝 finishes.

  private double sumOfProductsOfDeltas = 0.0;

  /** Adds the given pair of values to the dataset. */
  public void add(double x, double y) {
    // We extend the recursive expression for the one-variable case at Art of Computer Programming
    // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i.
    // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i.

  }

  public void testGet() {
    Object computed = new Object();
    LoadingCache<Object, Object> cache =
        CacheBuilder.newBuilder()
            .maximumSize(0)
            .removalListener(listener)
            .build(constantLoader(computed));

    Object key = new Object();
    assertThat(cache.getUnchecked(key)).isSameInstanceAs(computed);

  }

  public void testGet() {
    Object computed = new Object();
    LoadingCache<Object, Object> cache =
        CacheBuilder.newBuilder()
            .maximumSize(0)
            .removalListener(listener)
            .build(constantLoader(computed));

    Object key = new Object();
    assertThat(cache.getUnchecked(key)).isSameInstanceAs(computed);

        byte[] actual = NtlmUtil.getNTLMv2Response(key, server, clientChallenge, nanos1601, avPairs);

        // Assert
        assertArrayEquals(expected, actual, "Computed response must match manual construction");
        // Also verify client challenge sits at mac(16) + blob offset 16
        assertArrayEquals(clientChallenge, Arrays.copyOfRange(actual, 16 + 16, 16 + 16 + 8));
    }