) .card-footer {\n    border-bottom-right-radius: 0;\n  }\n  .card-group > .card:not(:first-child) {\n    border-top-left-radius: 0;\n    border-bottom-left-radius: 0;\n  }\n  .card-group > .card:not(:first-child) .card-img-top,\n  .card-group > .card:not(:first-child) .card-header {\n    border-top-left-radius: 0;\n  }\n  .card-group > .card:not(:first-child) .card-img-bottom,\n  .card-group > .card:not(:first-child) .card-footer {\n    border-bottom-left-radius: 0;\n  }\n}\n\n.accordion {\n  -...

        final String customPath = "/api/v1/dynamic";
        mockRequest.setServletPath(originalPath);

        webApiRequest = new WebApiRequest(mockRequest, customPath);

        // First call without SAStruts.method
        mockRequest.setQueryString("query=test");
        assertEquals(customPath, webApiRequest.getServletPath());

        // Second call with SAStruts.method

		// Output: 42
	}

In C, a function argument written as a fixed size array
actually requires a pointer to the first element of the array.
C compilers are aware of this calling convention and adjust
the call accordingly, but Go cannot. In Go, you must pass
the pointer to the first element explicitly: C.f(&C.x[0]).

Calling variadic C functions is not supported. It is possible to

                response.setExtendedSecurity(false);

                /*
                 * Create SMB signature digest if necessary
                 * Only the first SMB_COM_SESSION_SETUP_ANX with non-null or
                 * blank password initializes signing.
                 */
                if (!anonymous && isSignatureSetupRequired()) {

 *
 * <p>The trie data is stored in a {@link CharSequence} where each node takes 3 characters:
 *
 * <ol>
 *   <li>The offset of the label in the {@code stringPool}.
 *   <li>The index of the first child node in the {@code trieData}.
 *   <li>A bitfield containing:
 *       <ul>
 *         <li>Bits 0-10: Number of children.
 *         <li>Bit 11: Whether this node represents an exclusion (!rule).

                .limit(limit)
                .toList();
    }

    public void printAnalysis() {
        System.out.printf("Analyzed %d POMs%n%n", totalPoms);

        // First, get all paths
        List<PathAnalysis> allPaths = getPathAnalysisSorted();

        // Create groups based on the final path component
        Map<String, List<PathAnalysis>> groupedPaths = new HashMap<>();

    future.set(1);
    assertEquals(1, future.get(-1, SECONDS).intValue());
  }

  @J2ktIncompatible
  @GwtIncompatible // threads
  public void testOverflowTimeout() throws Exception {
    // First, sanity check that naive multiplication would really overflow to a negative number:
    long nanosPerSecond = NANOSECONDS.convert(1, SECONDS);
    assertThat(nanosPerSecond * Long.MAX_VALUE).isLessThan(0L);

 * degrades more gracefully for worst-case input.
 *
 * <p>The implementation does not necessarily use a <i>stable</i> sorting algorithm; when multiple
 * equivalent elements are added to it, it is undefined which will come first in the output.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
final class TopKSelector<
    T extends @Nullable Object> {

  /**

     * @param parser The XML parser
     * @return Converted array instance
     */
    private Object parseArray(final MXParser parser, final TypeLiteral<?> toType) throws Exception {
        // convert to a collection first then convert that into an array
        final Collection<?> collection = parseCollection(parser, toType);
        final Object array = Array.newInstance(toType.getRawType(), collection.size());

        int i = 0;

fi

CLASSWORLDS_LAUNCHER=org.codehaus.plexus.classworlds.launcher.Launcher

# traverses directory structure from process work directory to filesystem root
# first directory with .mvn subdirectory is considered project base directory
find_maven_basedir() {

  if [ -z "$1" ]
  then
    echo "Path not specified to find_maven_basedir"
    return 1
  fi