}

        // Check for directory traversal
        if (path.contains("..") || path.contains("./") || path.contains(".\\")) {
            failedValidations.incrementAndGet();
            log.warn("Path contains traversal sequences: {}", sanitizeForLog(path));
            throw new SmbException("Path contains directory traversal");
        }

        // Check individual components

        this.remoteRepositories = remoteRepositories;

        return this;
    }

    /**
     * Gets the artifact filter that controls traversal of the dependency graph.
     *
     * @return The filter used to determine which of the artifacts in the dependency graph should be traversed or
     *         {@code null} to collect all transitive dependencies.
     */
    public ArtifactFilter getCollectionFilter() {

                    "Destination array bounds exceeded: offset=" + dstOffset + ", length=" + length + ", array.length=" + dst.length);
        }
    }

    /**
     * Validates SMB path to prevent traversal attacks
     *
     * @param path the path to validate
     * @throws IllegalArgumentException if path is invalid
     */
    public static void validateSmbPath(String path) {
        if (path == null) {

 * href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data.
 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * breadth first traversal) that only need a way of accessing the successors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :

	preloadMap := parsePreloadMap(db.Statement.Schema, preloads)

	// avoid random traversal of the map
	preloadNames := make([]string, 0, len(preloadMap))
	for key := range preloadMap {
		preloadNames = append(preloadNames, key)
	}
	sort.Strings(preloadNames)

                + "test_script.py";
        assertEquals(expectedPath, pythonJob.getPyFilePath());
    }

    // Test getPyFilePath with directory traversal attempt
    public void test_getPyFilePath_withDirectoryTraversal() {
        pythonJob.filename("../../malicious.py");

        assertThrows(IllegalArgumentException.class, () -> InputValidator.validateArrayBounds(src, 0, dst, 50, 60));
    }

    @ParameterizedTest
    @DisplayName("Test path traversal detection")
    @ValueSource(strings = { "../etc/passwd", "..\\windows\\system32", "folder/../../../etc", "test/../../root", "..\\..\\..\\windows" })
    void testPathTraversal(String path) {

 * Collection} and {@link Iterator} interfaces. The Iterator provided in method {@link #iterator()}
 * is not guaranteed to traverse the elements of the MonitorBasedPriorityBlockingQueue in
 * any particular order. If you need ordered traversal, consider using {@code
 * Arrays.sort(pq.toArray())}. Also, method {@code drainTo} can be used to remove some or

		t.Skip()
	}
	defer DetectTestLeak(t)()
	ExecExtendedObjectLayerAPITest(t, testPathTraversalExploit, []string{"PutObject"})
}

// testPathTraversal exploit test, exploits path traversal on windows
// with following object names "\\../.minio.sys/config/iam/${username}/identity.json"
// #16852
func testPathTraversalExploit(obj ObjectLayer, instanceType, bucketName string, apiRouter http.Handler,

  }

  /**
   * Creates an {@code MonitorBasedArrayBlockingQueue} with the given (fixed) capacity, the
   * specified access policy and initially containing the elements of the given collection, added in
   * traversal order of the collection's iterator.
   *
   * @param capacity the capacity of this queue
   * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal,