* simple approach would be for each caller CAS it from null to a Set populated with its
     * exception. But there's another race: If the first thread fails with an exception and a second
     * thread immediately fails with the same exception:
     *
     * Thread1: calls setException(), which returns true, context switch before it can CAS
     * seenExceptionsField to its exception
     *

      // return condition1 || condition2;
      if (nodeU().equals(other.nodeU())) { // check condition1
        // Here's the tricky bit. We don't have to explicitly check for condition2 in this case.
        // Why? The second half of condition2 requires that nodeV equals other.nodeU.
        // We already know that nodeU equals other.nodeU. Combined with the earlier statement,

     *
     * @param primary true if primary
     */
    public void setPrimary(boolean primary) {
        this.isPrimary = primary;
    }

    /**
     * Get number of bytes sent
     *
     * @return bytes sent
     */
    public long getBytesSent() {
        return bytesSent.get();
    }

    /**
     * Get number of bytes received
     *
     * @return bytes received
     */

	m.percUtil = float64(ioStats.TotalTicks) * 100 / (durationSecs * 1000)

	return
}

func newDriveMetricsCache() *cachevalue.Cache[storageMetrics] {
	var (
		// prevDriveIOStats is used to calculate "per second"
		// values for IOStat related disk metrics e.g. reads/sec.
		prevDriveIOStats            map[string]madmin.DiskIOStats
		prevDriveIOStatsMu          sync.RWMutex
		prevDriveIOStatsRefreshedAt time.Time
	)

        assertEquals(3, dst[1] & 0xFF, "Data length low byte");
        assertEquals(0, dst[2] & 0xFF, "Data length high byte");
        assertEquals(2, dst[3], "First data byte");
        assertEquals(3, dst[4], "Second data byte");
        assertEquals(4, dst[5], "Third data byte");
    }

    /**
     * Test readParameterWordsWireFormat always returns 0
     */
    @Test

				for _, t := range convertibleTypes {
					if rv.Type().ConvertibleTo(t) {
						convertParams(rv.Convert(t).Interface(), idx)
						return
					}
				}
				vars[idx] = escaper + strings.ReplaceAll(fmt.Sprint(v), escaper, escaper+escaper) + escaper
			}
		}
	}

	for idx, v := range avars {
		convertParams(v, idx)
	}

	if numericPlaceholder == nil {
		var idx int
		var newSQL strings.Builder

    //    were added to the queue. It's easily possible for one thread to take the head of the
    //    queue, immediately followed by another thread taking the next element in the queue. That
    //    second thread can then dispatch to the subscriber it took before the first thread does.
    //
    // All this makes me really wonder if there's any value in queueing here at all. A dispatcher

        request = new Smb2CreateRequest(mockConfig, "initial\\path.txt");
        assertEquals("\\initial\\path.txt", request.getPath());

        request.setPath("\\second\\path.txt");
        assertEquals("\\second\\path.txt", request.getPath());

        request.setPath("third\\path\\");
        assertEquals("\\third\\path", request.getPath());

        }

        @Test
        @DisplayName("Binary constructor with invalid sub_authority_count throws RuntimeCIFSException")
        void testBinaryConstructorInvalidCount() {
            // Arrange: second byte is sub_authority_count > 100
            byte[] bytes = new byte[1 + 1 + 6];
            bytes[0] = 1; // revision
            bytes[1] = (byte) 101; // invalid count

            // Act + Assert

		t.Errorf("Expected key1 to exist, but it was evicted")
	}
}

func TestLRU_Add_Eviction(t *testing.T) {
	lru := lru.NewLRU[string, int](0, nil, time.Second*2)
	lru.Add("key1", 1)
	lru.Add("key2", 2)
	lru.Add("key3", 3)
	time.Sleep(time.Second * 3)
	if lru.Cap() != 0 {
		t.Errorf("Expected lru to be empty, but it was not")
	}

}

func BenchmarkLRU_Rand_NoExpire(b *testing.B) {