// share access specified in SmbFile

    // create disposition

    /*
     * Creates a new file or supersedes the existing one
     */

    static final int FILE_SUPERSEDE = 0x0;

    /*
     * Open the file or fail if it does not exist
     * aka OPEN_EXISTING
     */

    static final int FILE_OPEN = 0x1;

    /*

                SmbConstants.TYPE_NAMED_PIPE, SmbConstants.TYPE_PRINTER, SmbConstants.TYPE_COMM };

        for (int type : types) {
            // Check if it's a power of 2 (has exactly one bit set)
            assertTrue(type > 0 && (type & (type - 1)) == 0, "Resource type " + type + " should be a power of 2");
        }
    }

        }

        @Test
        @DisplayName("Should decode buffer with single referral")
        void testDecodeSingleReferral() {
            // Create buffer with one v3 referral
            byte[] testBuffer = new byte[100];
            ByteBuffer bb = ByteBuffer.wrap(testBuffer).order(ByteOrder.LITTLE_ENDIAN);

            // DfsReferralResponseBuffer header

     * @throws CIFSException if an error occurs opening the file
     */
    protected synchronized SmbFileHandleImpl ensureOpen() throws CIFSException {
        if (!isOpen()) {
            // one extra acquire to keep this open till the stream is released
            this.handle = this.file.openUnshared(this.openFlags, this.access, this.sharing, SmbConstants.ATTR_NORMAL, 0).acquire();
            if (this.append) {

        urlQueue2.setUrl("http://www.example.com/page1"); // Duplicate
        urlQueueList.add(urlQueue2);

        urlQueueService.offerAll(sessionId, urlQueueList);

        // Should only store one item (duplicates are filtered)
        int count = 0;
        while (true) {
            final OpenSearchUrlQueue polled = urlQueueService.poll(sessionId);
            if (polled == null) {
                break;

                } catch (final Exception e) {
                    // Catch any unexpected errors during line processing
                    // Log if logger is available, but continue parsing
                    // This ensures that one bad line doesn't break the entire parse
                    continue;
                }
            }

            return robotsTxt;
        } catch (final java.io.IOException e) {

        final ClearScrollRequestBuilder mockClearScrollBuilder = mock(ClearScrollRequestBuilder.class);

        // Setup search response with one hit
        when(mockClient.prepareSearch("test-index")).thenReturn(mockSearchBuilder);
        when(mockSearchBuilder.setScroll(any(Scroll.class))).thenReturn(mockSearchBuilder);

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

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

        // Multiple leading backslashes - only first one gets stripped, then trailing ones get stripped
        // But getPath() adds a backslash at the beginning, so \\fourth\path\\ becomes \fourth\path\
        request.setPath("\\\\fourth\\path\\\\");

                /* For name queries resolved by different sources (e.g. WINS,
                 * BCAST, Node Status) we need to augment the hashcode generated
                 * for the addresses hostname or failed lookups for one type will
                 * be cached and cause other types to fail even though they may
                 * not be the authority for the name. For example, if a WINS lookup

    Library.  A suitable mechanism is one that (1) uses at run time a
    copy of the library already present on the user's computer system,
    rather than copying library functions into the executable, and (2)
    will operate properly with a modified version of the library, if
    the user installs one, as long as the modified version is