return;
    } catch (Error e) {
      /*
       * StackOverflowError, OutOfMemoryError (e.g., from allocating ExecutionException), or
       * something. Try to treat it like a RuntimeException. If we overflow the stack again, the
       * resulting Error will propagate upward up to the root call to set().
       */
      setException(e);
      return;
    }

    T transformResult;
    try {

	tok := in.Stack.Next()
	if tok != scanner.Ident {
		in.expectText("expected identifier after '#'")
	}
	if !in.enabled() {
		// Can only start including again if we are at #else or #endif but also
		// need to keep track of nested #if[n]defs.
		// We let #line through because it might affect errors.
		switch in.Stack.Text() {
		case "else", "endif", "ifdef", "ifndef", "line":

        SmbSessionImpl s1 = transport.getSmbSession(ctx);
        assertNotNull(s1);
        assertEquals(1, transport.getNumSessions());
        s1.close();

        // Act: request again with same context -> reuse existing
        SmbSessionImpl s2 = transport.getSmbSession(ctx);
        assertNotNull(s2);
        assertEquals(1, transport.getNumSessions(), "Should reuse existing session");
        s2.close();

// SUCH DAMAGE.
//

package jcifs.smb1.util;

/**
 * This code is derived from the above source
 * JCIFS API
 * Norbert Hranitzky
 *
 * <p>and modified again by Michael B. Allen
 */

public class DES {

    private final int[] encryptKeys = new int[32];
    private final int[] decryptKeys = new int[32];

    private final int[] tempInts = new int[2];

    /**

        Arrays.fill(newFileId1, (byte) 0xAA);
        request.setFileId(newFileId1);

        // Change flags
        request.setCloseFlags(0x0000);

        // Change file ID again
        byte[] newFileId2 = new byte[16];
        Arrays.fill(newFileId2, (byte) 0xBB);
        request.setFileId(newFileId2);

        // Verify final state

            // Test buffer release and reuse
            bufferManager.releaseSendRegion(sendRegion);
            bufferManager.releaseReceiveRegion(recvRegion);

            // Allocate again to test pooling
            RdmaMemoryRegion newSendRegion = bufferManager.getSendRegion(4096);
            assertNotNull(newSendRegion, "Should be able to allocate new send region");

            // Release the new region

        setTree(c, tree);

        // Act: first acquire triggers tree.acquire()
        c.acquire();
        verify(tree, times(1)).acquire();

        // Act: second acquire does not call tree.acquire again
        c.acquire();
        verify(tree, times(1)).acquire();

        // Act: first release does not release yet (usage -> 1)
        c.release();
        verify(tree, never()).release();

After a week, the token will be expired and the user will not be authorized and will have to sign in again to get a new token. And if the user (or a third party) tried to modify the token to change the expiration, you would be able to discover it, because the signatures would not match.

	// We removed len(rResources) read sources.
	if len(l.lockUID) != len(rResources)+len(wResources)*m {
		t.Fatalf("lockUID len, got %d, want %d + %d", len(l.lockUID), len(rResources), len(wResources)*m)
	}

	// RUnlock again, different uids
	for i, name := range rResources {
		arg := dsync.LockArgs{
			UID:       rUIDs[i*2+1],
			Resources: []string{name},
			Source:    "minio",
			Owner:     "owner",
			Quorum:    &quorum,
		}

        StackTraceElement[] originalStackTrace = exception.getStackTrace();
        assertNotNull(originalStackTrace);
        assertTrue(originalStackTrace.length > 0);

        // Fill in stack trace again
        Throwable filled = exception.fillInStackTrace();
        assertSame(exception, filled);

        StackTraceElement[] newStackTrace = exception.getStackTrace();
        assertNotNull(newStackTrace);