/*
 * Written by Doug Lea with assistance from members of JCP JSR-166
 * Expert Group and released to the public domain, as explained at
 * http://creativecommons.org/publicdomain/zero/1.0/
 */

/*
 * Source:
 * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/jsr166e/extra/AtomicDoubleArray.java?revision=1.5
 * (Modified to adapt to guava coding conventions and
 * to use AtomicLongArray instead of sun.misc.Unsafe)
 */

    backward.put(value, key);
  }

  /**
   * Returns an immutable set of all nine primitive types (including {@code void}). Note that a
   * simpler way to test whether a {@code Class} instance is a member of this set is to call {@link
   * Class#isPrimitive}.
   *
   * @since 3.0
   */
  public static Set<Class<?>> allPrimitiveTypes() {
    return PRIMITIVE_TO_WRAPPER_TYPE.keySet();
  }

  /**

     */
    private Map<String, Field> buildFieldCache(Class<?> beanType) {
        Map<String, Field> fieldMap = new HashMap<>();

        for (Object member : new DeclaredMembers(beanType, View.FIELDS)) {
            Field field = (Field) member;
            if (!Modifier.isStatic(field.getModifiers())) {
                fieldMap.put(field.getName(), field);
            }
        }

        return fieldMap;

      if (name != null) path.removeAt(path.size - 1)
    }
  }

  /**
   * Execute [block] with a new namespace for type hints. Type hints from the enclosing type are no
   * longer usable by the current type's members.
   */
  fun <T> withTypeHint(block: () -> T): T {
    typeHintStack.add(null)
    try {
      return block()
    } finally {
      typeHintStack.removeAt(typeHintStack.size - 1)
    }
  }

   * of each element is the <i>maximum</i> of its counts in the two backing multisets. The iteration
   * order of the returned multiset matches that of the element set of {@code multiset1} followed by
   * the members of the element set of {@code multiset2} that are not contained in {@code
   * multiset1}, with repeated occurrences of the same element appearing consecutively.
   *

   * of each element is the <i>maximum</i> of its counts in the two backing multisets. The iteration
   * order of the returned multiset matches that of the element set of {@code multiset1} followed by
   * the members of the element set of {@code multiset2} that are not contained in {@code
   * multiset1}, with repeated occurrences of the same element appearing consecutively.
   *

            SID group = new SID(buildSidT((byte) 1, ident, 10, 20, 512), jcifs.SID.SID_TYPE_DOM_GRP, "DOM", "Domain Admins", false);

            jcifs.SID member = new SID("S-1-5-21-1000");
            jcifs.SID[] expected = new jcifs.SID[] { member };
            when(mockResolver.getGroupMemberSids(eq(mockCtx), eq("srv"), any(jcifs.SID.class), eq(512), eq(123))).thenReturn(expected);

            // Act

    static final int OPEN_FN_TRUNC = 0x02;

    int tflags, desiredAccess, searchAttributes, fileAttributes, creationTime, openFunction, allocationSize;

    // flags is NOT the same as flags member

    /**
     * Constructs an Open AndX request.
     *
     * @param config the configuration
     * @param fileName the name of the file to open
     * @param access the desired access mode

Ou você também poderia fixá-la com:

```txt
fastapi[standard]>=0.112.0,<0.113.0
```

isso significaria que você usaria as versões `0.112.0` ou superiores, mas menores que `0.113.0`, por exemplo, a versão `0.112.2` ainda seria aceita.

## Tamanho do código { #code-size }

Este exemplo pode parecer verboso. Lembre-se de que estamos misturando segurança, modelos de dados, funções utilitárias e *operações de rota* no mesmo arquivo.

Mas aqui está o ponto principal.