assertEquals(48, SMBUtil.readInt2(buffer, 0)); // Structure size
            assertEquals(1, SMBUtil.readInt2(buffer, 2)); // Lock count

            // Verify lock sequence (bits 4-7 are sequence number, bits 0-27 are index)
            int lockSequence = SMBUtil.readInt4(buffer, 4);
            assertEquals(0, lockSequence); // Default values

            // Verify file ID

        if (value != null && filePathMap.containsKey(value)) {
            return filePathMap.get(value);
        }
        return value;
    }

    /**
     * Updates the thumbnail field in the search index.
     * @param thumbnailId The thumbnail ID.
     * @param value The thumbnail value to update.
     */
    protected void updateThumbnailField(final String thumbnailId, final String value) {
        // TODO bulk

     */
    @Override
    public boolean canReuse(final CIFSContext tc, final boolean forceSigning) {
        return this.getConfig().equals(tc.getConfig());
    }

    /**
     * Returns the index of the selected SMB dialect from the negotiation.
     *
     * @return the dialectIndex
     */
    public int getDialectIndex() {
        return this.dialectIndex;
    }

    /**

          }
        };

    Multimap<Integer, String> index = Multimaps.index(badGuys, stringLengthFunction);

    assertEquals(expectedIndex, index);
  }

  public void testIndex_nullValue() {
    List<@Nullable Integer> values = Arrays.asList(1, null);
    assertThrows(
        NullPointerException.class,
        () -> Multimaps.index((List<Integer>) values, Functions.identity()));
  }

        // Check all constants are unique
        for (int i = 0; i < constants.length; i++) {
            for (int j = i + 1; j < constants.length; j++) {
                assertTrue(constants[i] != constants[j], "Constants at index " + i + " and " + j + " should be unique");
            }
        }
    }

    /**
     * Test mock implementation of FileInformation interface
     */
    @Test

                searchLogList.forEach(this::writeSearchLogEvent);
            }
            // insert search log
            storeSearchLogList(searchLogList);
            // update suggest index
            if (fessConfig.isSuggestSearchLog()) {
                final SuggestHelper suggestHelper = ComponentUtil.getSuggestHelper();
                suggestHelper.indexFromSearchLog(searchLogList);
            }

  display: block;
  position: absolute;
  top: -10px;
  right: 0;
  font-size: 0.5rem;
  color: #e6e6e6;
  background-color: #666;
  border-radius: 10px;
  padding: 0 10px;
  z-index: 10;
}

.announce-wrapper .sponsor-image {
  display: block;
  border-radius: 20px;
}

.announce-wrapper>div {
  min-height: 40px;
  display: flex;
  align-items: center;
}

        ASN1EncodableVector encPart = new ASN1EncodableVector();
        encPart.add(new DERTaggedObject(true, 0, new ASN1Integer(encType)));
        // Add kvno (key version number) field that is optional but expected when accessing index 2
        encPart.add(new DERTaggedObject(true, 1, new ASN1Integer(1))); // kvno
        encPart.add(new DERTaggedObject(true, 2, new DEROctetString(encryptedData)));

   * from the implementation in MURMUR128_MITZ_32 because we're avoiding the multiplication in the
   * loop and doing a (much simpler) += hash2. We're also changing the index to a positive number by
   * AND'ing with Long.MAX_VALUE instead of flipping the bits.
   */
  MURMUR128_MITZ_64() {
    @Override
    public <T extends @Nullable Object> boolean put(

        buf[33] = 4; // wordCount
        buf[34] = (byte) 0xFF; // andxCommand
        // andxOffset (ignored when 0xFF)
        buf[36] = 0;
        buf[37] = 0;
        // byteCount at index start + 1 + wordCount*2 = 33 + 1 + 8 = 42
        ServerMessageBlock.writeInt2(20, buf, 42);

        int len = block.decode(buf, 0);
        assertTrue(len > 0);
        assertEquals(4, block.wordCount);