c = Multisets.immutableEntry(entries.get(2), sortedMultiset.count(entries.get(2)));
      }
    }
  }

  /** Resets the contents of sortedMultiset to have entries a, c, for the navigation tests. */
  // Needed to stop Eclipse whining
  private void resetWithHole() {
    List<E> container = new ArrayList<>();
    container.addAll(nCopies(a.getCount(), a.getElement()));
    container.addAll(nCopies(c.getCount(), c.getElement()));

     *
     * @param accessResultList the list of access results to clean up
     * @return the time taken for the cleanup operation in milliseconds, or -1 if no cleanup was needed
     */
    private long cleanupAccessResults(final List<OpenSearchAccessResult> accessResultList) {
        if (!accessResultList.isEmpty()) {
            final long execTime = systemHelper.getCurrentTimeAsLong();

            if (values.length > 1) {
                list.add(values[0]);
            }
        }
    }

    /**
     * Processes parent group information for nested groups.
     * @param user The Azure AD user.
     * @param groupList The list to add group names to.
     * @param roleList The list to add role names to.
     * @param id The group ID to process.
     */

	Owner Owner

	// Container for one or more buckets.
	Buckets struct {
		Buckets []Bucket `xml:"Bucket"`
	} // Buckets are nested
}

// Upload container for in progress multipart upload
type Upload struct {
	Key          string
	UploadID     string `xml:"UploadId"`
	Initiator    Initiator
	Owner        Owner
	StorageClass string

   * at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first
   * element in the result.
   *
   * <p>If needed, the {@link Traverser} class provides more flexible and lighter-weight ways to
   * list the nodes reachable from a given node or nodes. See the <a

   * are guaranteed to not deadlock each other.
   *
   * <p>It should be noted that using a {@code Striped<L>} with relatively few stripes, and {@code
   * bulkGet(keys)} with a relative large number of keys can cause an excessive number of shared
   * stripes (much like the birthday paradox, where much fewer than anticipated birthdays are needed
   * for a pair of them to match). Please consider carefully the implications of the number of

   * at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first
   * element in the result.
   *
   * <p>If needed, the {@link Traverser} class provides more flexible and lighter-weight ways to
   * list the nodes reachable from a given node or nodes. See the <a

    Smb2CreateRequest request = new Smb2CreateRequest();
    request.setPath(handle.path);
    request.addReconnectContext(handle.fileId);
    
    // Add lease context if needed
    if (handle.leaseKey != null) {
        request.addLeaseContext(handle.leaseKey, Smb2LeaseState.SMB2_LEASE_NONE, false);
    }
    
    Smb2CreateResponse response = (Smb2CreateResponse) tree.send(request);
    

        </field>
      </fields>
    </class>

    <class xdoc.anchorName="dependency">
      <name>Dependency</name>
      <version>1.0.0/1.1.0</version>
      <description>Definition of a dependency, needed by the plugin at runtime.</description>
      <fields>
        <field>
          <name>groupId</name>
          <required>true</required>
          <version>1.0.0+</version>
          <type>String</type>

     * for this entry is one, this is simply the string representation of the corresponding element.
     * Otherwise, it is the string representation of the element, followed by the three characters
     * {@code " x "} (space, letter x, space), followed by the count.
     */
    @Override
    String toString();
  }

  // Comparison and hashing

  /**