// 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,
        // and the transitive property of equality, this implies that nodeU equals nodeV.
        // If nodeU equals nodeV, condition1 == condition2, so checking condition1 is sufficient.

        assertEquals(-1, SmbConstants.FOREVER);
    }

    @Test
    @DisplayName("Should validate flag combinations work correctly")
    void testFlagCombinations() {
        // Test that flags can be combined with bitwise OR
        int combinedShareAccess = SmbConstants.FILE_SHARE_READ | SmbConstants.FILE_SHARE_WRITE;
        assertEquals(0x03, combinedShareAccess);

### There are no limits on how many server pools can be combined

```
minio server http://host{1...32}/export{1...32} http://host{1...12}/export{1...12}
```

In above example there are two server pools

- 32 * 32 = 1024 drives pool1
- 12 * 12 = 144 drives pool2

                0x00000020, // FILE_ATTRIBUTE_ARCHIVE
                0x00000080, // FILE_ATTRIBUTE_NORMAL
                0x00000100, // FILE_ATTRIBUTE_TEMPORARY
                0x00000037 // Combined attributes
        };

        for (int attr : attributes) {
            FileBasicInfo info = new FileBasicInfo(0L, 0L, 0L, 0L, attr);
            assertEquals(attr, info.getAttributes());

 * ACE and <i>all</i> of the bits in the desired access bits match bits in
 * the access mask of the ACE, the access check is successful. Otherwise,
 * more ACEs are evaluated until all desired access bits (combined)
 * are "allowed". If all of the desired access bits are not "allowed"
 * the then same process is repeated for inherited ACEs.
 * <p>
 * For example, if user <code>WNET\alice</code> tries to open a file

  Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU General Public License into a single
combined work, and to convey the resulting work.  The terms of this
License will continue to apply to the part which is the covered work,
but the work with which it is combined will remain governed by version
3 of the GNU General Public License.

 * ACE and <i>all</i> of the bits in the desired access bits match bits in
 * the access mask of the ACE, the access check is successful. Otherwise,
 * more ACEs are evaluated until all desired access bits (combined)
 * are "allowed". If all of the desired access bits are not "allowed"
 * the then same process is repeated for inherited ACEs.
 * <p>
 * For example, if user <code>WNET\alice</code> tries to open a file

        when(logonInfo.getUserFlags()).thenReturn(PacConstants.LOGON_RESOURCE_GROUPS);
        assertEquals(PacConstants.LOGON_RESOURCE_GROUPS, logonInfo.getUserFlags());

        // Test with combined flags
        int combinedFlags = PacConstants.LOGON_EXTRA_SIDS | PacConstants.LOGON_RESOURCE_GROUPS;
        when(logonInfo.getUserFlags()).thenReturn(combinedFlags);

    int pipeType;

    /**
     * Open the Named Pipe resource specified by the url
     * parameter. The pipeType parameter should be at least one of
     * the <code>PIPE_TYPE</code> flags combined with the bitwise OR
     * operator <code>|</code>. See the examples listed above.
     */

    /**
     * Constructs an SmbNamedPipe for a specified pipe on an SMB server.
     *

  /**
   * All node connections in this graph, in edge insertion order.
   *
   * <p>Note: This field and {@link #adjacentNodeValues} cannot be combined into a single
   * LinkedHashMap because one target node may be mapped to both a predecessor and a successor. A
   * LinkedHashMap combines two such edges into a single node-value pair, even though the edges may
   * not have been inserted consecutively.
   */