// removeEntry based on the uid of the lock message, removes a single entry from the
// lockRequesterInfo array or the whole array from the map (in case of a write lock
// or last read lock)
// UID and optionally owner must match for entries to be deleted.
func (l *localLocker) removeEntry(name string, args dsync.LockArgs, lri *[]lockRequesterInfo) bool {
	// Find correct entry to remove based on uid.
	for index, entry := range *lri {

                if (ctx != null) {
                    try {
                        ctx.decode(buffer, ncpos, dataLen);
                        contexts[i] = ctx;
                    } catch (Exception e) {
                        throw new SMBProtocolDecodingException(
                                "Failed to decode negotiate context at position " + i + ": " + e.getMessage(), e);
                    }

            // Verify source key is copied correctly
            for (int i = 0; i < SOURCE_KEY_SIZE; i++) {
                assertEquals(sourceKey[i], buffer[startIndex + i], "Source key byte at position " + i + " doesn't match");
            }
        }

        @Test
        @DisplayName("Should encode chunk count correctly")
        void testEncodeChunkCount() {
            // Given

	NoLock                              bool      // indicates to lower layers if the caller is expecting to hold locks.
	HasIfMatch                          bool      // indicates if the request has If-Match header
	ProxyRequest                        bool      // only set for GET/HEAD in active-active replication scenario
	ProxyHeaderSet                      bool      // only set for GET/HEAD in active-active replication scenario

replication, the replication status is reflected as `PENDING`.

If 3 or more targets are participating in active-active replication, the replication configuration for replica metadata sync, delete marker replication and delete replication should match to avoid inconsistent picture between the clusters. It is not recommended to turn on asymmetric replication - for e.g. if three sites A,B,C are participating in replication, it would be better to avoid replication setups like A -> [B, C], B -> A. In...

      E e = (E) element;
      AvlNode<E> root = rootReference.get();
      if (!range.contains(e) || root == null) {
        return 0;
      }
      return root.count(comparator(), e);
    } catch (ClassCastException | NullPointerException e) {
      return 0;
    }
  }

  @CanIgnoreReturnValue
  @Override
  public int add(@ParametricNullness E element, int occurrences) {

        assertFalse(item.isBadWord(badWords));

        // Test with matching bad word
        String[] badWords2 = { "test", "bad" };
        assertTrue(item.isBadWord(badWords2));

        // Test with partial match
        item.setText("testing something");
        String[] badWords3 = { "test" };
        assertTrue(item.isBadWord(badWords3));
    }

    @Test
    public void testToEmptyMap() {

        def projectDir = 'C:\\tcagent1\\work\\f63322e10dd6b396\\'

        expect:
        (line =~ KillLeakingJavaProcesses.generateLeakingProcessKillPattern(projectDir)).find()
    }

    def "does not match worker process started by main build VM on Windows"() {

        group = ciGroup
    }

    register("allVersionsCrossVersionTest") {
        description = "Run cross-version tests against all released versions (latest patch release of each)"
        group = ciGroup
    }

    register("allVersionsIntegMultiVersionTest") {
        description = "Run all multi-version integration tests with all version to cover"
        group = ciGroup

          new BinaryPredicate<Double, Double>() {
            @Override
            public boolean apply(@Nullable Double actual, @Nullable Double expected) {
              // Test for equality to allow non-finite values to match; otherwise, use the finite
              // test.
              return actual.equals(expected)
                  || FINITE_QUANTILE_CORRESPONDENCE.compare(actual, expected);
            }
          },