handleLeaseBreak(key, newState);
    });
    
    try {
        future.get(5, TimeUnit.SECONDS);  // 5 second timeout
    } catch (TimeoutException e) {
        // Force lease release if break handling times out
        releaseLease(key);
        log.warn("Lease break timeout for key: {}", key);
    }
}
```

### 10.2 Fallback to Oplocks
```java

		t.Errorf("should find product, but got error %v", err)
	}

	if productWithItem.Item.AfterFindCallTimes != 0 {
		t.Fatalf("AfterFind should not be called times:%d", productWithItem.Item.AfterFindCallTimes)
	}
}

type Product5 struct {
	gorm.Model
	Name string
}

var beforeUpdateCall int

func (p *Product5) BeforeUpdate(*gorm.DB) error {

     }
    ```

    You may also skip the retry when you’ve hit an application-defined attempt limit:

    ```kotlin
    if (response.responseCount >= 3) {
      return null // If we've failed 3 times, give up.
    }
    ```

    This above code relies on this `responseCount` extension val:

    ```kotlin
    val Response.responseCount: Int

	statsTime           time.Time
	rttMsSum, maxRttMs  float64
	successRequestCount int64
	failedRequestCount  int64
}

type metrics struct {
	sync.Mutex
	LastCheckSuccess time.Time
	LastCheckFailure time.Time
	lastFullMinute   serviceRTTMinuteStats
	currentMinute    serviceRTTMinuteStats
}

func (h *metrics) setConnSuccess(reqStartTime time.Time) {
	h.Lock()
	defer h.Unlock()

//
// If size resp. actualSize is unknown at the time of calling
// NewReader then it should be set to -1.
// When size is >=0 it *must* match the amount of data provided by r.
//
// NewReader may try merge the given size, MD5 and SHA256 values
// into src - if src is a Reader - to avoid computing the same
// checksums multiple times.
// NewReader enforces S3 compatibility strictly by ensuring caller

	// content that may have been created, we always serve
	// the latest object.
	sort.Slice(poolObjInfos, func(i, j int) bool {
		mtime1 := poolObjInfos[i].ObjInfo.ModTime
		mtime2 := poolObjInfos[j].ObjInfo.ModTime
		return mtime1.After(mtime2)
	})

	defPool := PoolObjInfo{Index: -1}
	for _, pinfo := range poolObjInfos {
		// skip all objects from suspended pools if asked by the
		// caller.

                    i_in_24 = selected.hour() >= 12 ? (i == 12 ? 12 : i + 12) : (i == 12 ? 0 : i);

                var time = selected.clone().hour(i_in_24);
                var disabled = false;
                if (minDate && time.minute(59).isBefore(minDate))
                    disabled = true;
                if (maxDate && time.minute(0).isAfter(maxDate))
                    disabled = true;

  /**
   * This test attempts to create a situation in which one thread is constantly changing a file from
   * being a real directory to being a symlink to another directory. It then calls
   * deleteDirectoryContents thousands of times on a directory whose subtree contains the file
   * that's switching between directory and symlink to try to ensure that under no circumstance does

    public void testCloseIdempotent() {
        NtlmPasswordAuthenticator auth = new NtlmPasswordAuthenticator("user", "IdempotentPass123!");

        assertFalse(auth.isClosed());

        // Close multiple times
        auth.close();
        assertTrue(auth.isClosed());

        auth.close(); // Should not throw
        assertTrue(auth.isClosed());

        auth.close(); // Should still not throw

   *         .putAll("several", 1, 2, 3)
   *         .putAll("many", 1, 2, 3, 4, 5)
   *         .build();
   * }
   *
   * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build
   * multiple multimaps in series. Each multimap contains the key-value mappings in the previously
   * created multimaps.
   *
   * @since 2.0
   */