*/
    long fileIndex() throws CIFSException;

    /**
     * Return the attributes of this file. Attributes are represented as a
     * bitset that must be masked with <code>ATTR_*</code> constants to determine
     * if they are set or unset. The value returned is suitable for use with
     * the <code>setAttributes()</code> method.
     *

  - [Known Issues](#known-issues)
  - [Urgent Upgrade Notes](#urgent-upgrade-notes)
    - [(No, really, you MUST read this before you upgrade)](#no-really-you-must-read-this-before-you-upgrade)
  - [Changes by Kind](#changes-by-kind-16)
    - [Deprecation](#deprecation)
    - [API Change](#api-change-4)
    - [Feature](#feature-8)

 * that associates each key with a collection of values. All methods of {@link Multimap} are
 * supported, including those specified as optional in the interface.
 *
 * <p>To implement a multimap, a subclass must define the method {@link #createCollection()}, which
 * creates an empty collection of values for a key.
 *
 * <p>The multimap constructor takes a map that has a single entry for each distinct key. When you

   * the returned {@code ListeningExecutorService} never calls the delegate's {@code submit}, {@code
   * invokeAll}, and {@code invokeAny} methods, so any special handling of tasks must be implemented
   * in the delegate's {@code execute} method or by wrapping the returned {@code
   * ListeningExecutorService}.
   *

	subSys, inputs, tgt, err := GetSubSys(s)
	if err != nil {
		return false, err
	}
	if len(inputs) < 2 {
		return false, Errorf("sub-system '%s' must have key", subSys)
	}

	dynamic = SubSystemsDynamic.Contains(subSys)

	fields := kvFields(inputs[1], defaultKVS[subSys].Keys())
	if len(fields) == 0 {

              bool expect_failure = false) {
    DefineT(num_opers, opers, ToOutput(inputs), ToOutput(outputs), output_names,
            expect_failure);
  }

  // Caller must delete[] the returned value
  static const char** ToArray(const std::vector<std::string>& strs) {
    const char** ptr = nullptr;
    if (!strs.empty()) {
      ptr = new const char*[strs.size()];

        tag1.setId("test");
        tag1.setCss("highlight");

        PrunedTag tag2 = new PrunedTag("div");
        tag2.setId("test");
        tag2.setCss("highlight");

        // Equal objects must have equal hash codes
        assertEquals(tag1.hashCode(), tag2.hashCode());

        // Hash code should be consistent
        int hash1 = tag1.hashCode();
        int hash2 = tag1.hashCode();

    assertThat(decoded).isEqualTo(date("2050-01-01T00:00:00.000+0000").time)
    assertThat(encoded).isEqualTo(generalizedTimeDer)
  }

  /**
   * Conforming applications MUST be able to process validity dates that are encoded in either
   * UTCTime or GeneralizedTime.
   */
  @Test fun `can read GENERALIZED_TIME before 2050`() {

        assertEquals(result1, result2);
    }

    @Test
    public void test_generateId_distinctForSpecialChars() {
        // Distinct special-character inputs must produce distinct IDs
        String withBrackets = crawlingInfoHelper.generateId("file:///data/logs[2024]/access.log");
        String withoutBrackets = crawlingInfoHelper.generateId("file:///data/logs2024/access.log");

   * eliminate duplicate keys (for buildKeepingLast()) then we have to ensure that a later call to
   * buildOrThrow() will still throw as if the duplicates had not been eliminated. And the exception
   * message must mention two values that were associated with the duplicate key in two different
   * calls to Builder.put (though we don't really care *which* two values if there were more than