case 14:
          k2 ^= (long) toUnsignedInt(bb.get(13)) << 40; // fall through
        case 13:
          k2 ^= (long) toUnsignedInt(bb.get(12)) << 32; // fall through
        case 12:
          k2 ^= (long) toUnsignedInt(bb.get(11)) << 24; // fall through
        case 11:
          k2 ^= (long) toUnsignedInt(bb.get(10)) << 16; // fall through
        case 10:

        | ((source[offset + 3] & 0xFF) << 24);
  }

  /**
   * Indicates that the load and store operations will be very efficient because of use of VarHandle
   * or Unsafe. May be useful for calling code to fall back on an alternative implementation that is
   * slower than those implementations but faster than the pure-Java mask-and-shift.
   */
  static boolean usingFastPath() {
    return byteArray.usesFastPath();
  }

### OpenAPI { #openapi }

**FastAPI** generiert ein „Schema“ mit all Ihren APIs unter Verwendung des **OpenAPI**-Standards zur Definition von APIs.

#### „Schema“ { #schema }

Ein „Schema“ ist eine Definition oder Beschreibung von etwas. Nicht der eigentliche Code, der es implementiert, sondern lediglich eine abstrakte Beschreibung.

#### API-„Schema“ { #api-schema }

                "test text", 1.0f, (field, boost) -> QueryBuilders.matchQuery(field, "test text").boost(boost),
                (field, text, boost) -> QueryBuilders.matchQuery(field, text).boost(boost));

        // Should fall back to default query builder
        assertNotNull(result);
        assertTrue(result instanceof DefaultQueryBuilder);
    }

    /**
     * Test convertWithFieldCheck() adds query text to context.
     */

     * >40% faster than the Euclidean algorithm in benchmarks.
     */
    int aTwos = Integer.numberOfTrailingZeros(a);
    a >>= aTwos; // divide out all 2s
    int bTwos = Integer.numberOfTrailingZeros(b);
    b >>= bTwos; // divide out all 2s
    while (a != b) { // both a, b are odd
      // The key to the binary GCD algorithm is as follows:
      // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).

            } catch (final Throwable ignore) {
                // Fall through to next option
            }
        }

        // Check for Commons Logging
        if (isClassAvailable("org.apache.commons.logging.LogFactory")) {
            try {
                return new JclLoggerAdapterFactory();
            } catch (final Throwable ignore) {
                // Fall through to next option
            }
        }

            // and only for plain old jars. Not war files, not ear files, not anything else.
            return determineBuildOutputDirectoryForArtifact(project, artifact);
        }

        // The fall-through indicates that the artifact cannot be found;
        // for instance if package produced nothing or classifier problems.
        return null;
    }

        existingCounter = countMap.putIfAbsent(element, new AtomicInteger(occurrences));
        if (existingCounter == null) {
          return 0;
        }
        // existingCounter != null: fall through to operate against the existing AtomicInteger
      }

      while (true) {
        int oldValue = existingCounter.get();
        if (oldValue != 0) {
          try {

     * 1. Check if field is DEFAULT_FIELD and apply default query builder
     * 2. Check if field is a search field and apply field-specific query
     * 3. Fall back to default query builder for unsupported fields
     *
     * This reduces code duplication across query command implementations.
     *
     * @param fessConfig the Fess configuration

        existingCounter = countMap.putIfAbsent(element, new AtomicInteger(occurrences));
        if (existingCounter == null) {
          return 0;
        }
        // existingCounter != null: fall through to operate against the existing AtomicInteger
      }

      while (true) {
        int oldValue = existingCounter.get();
        if (oldValue != 0) {
          try {