* 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 :

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

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

        assertEquals("/etc/passwd.log", AdminLogAction.sanitizeFilename(". ./. ./etc/passwd.log"));
    }

    @Test
    public void test_sanitizeFilename_pathTraversalPatterns() {
        // Common path traversal attack patterns - multiple slashes are normalized to single
        assertEquals("/etc/passwd.log", AdminLogAction.sanitizeFilename("../etc/passwd.log"));

    }

    // ===================================================================================
    //                                                                  Path Traversal
    //                                                                  ================

    @Test
    public void test_validateFilePath_pathTraversal_dotdot() {
        final FessAdminAction action = createAction();

        assertTrue(result.toString().contains("example.com"));
        assertTrue(result.toString().contains("path"));
        assertTrue(result.toString().endsWith("page.html"));
    }

    // --- path traversal prevention tests ---

    @Test
    public void test_buildFilePath_dotDotTraversal() {
        final Path result =

  }

  /**
   * 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,

 * 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
 * all elements in priority order and place them in another collection.
 *

   * is now at some position before {@code index}. The second element is the one that was swapped
   * down to replace the element at {@code index}. This fact is used by iterator.remove so as to
   * visit elements during a traversal once and only once.
   */
  @CanIgnoreReturnValue
  private @Nullable MoveDesc<E> removeAt(int index) {
    checkPositionIndex(index, size);
    modCount++;
    size--;
    if (size == index) {

   * is now at some position before {@code index}. The second element is the one that was swapped
   * down to replace the element at {@code index}. This fact is used by iterator.remove so as to
   * visit elements during a traversal once and only once.
   */
  @CanIgnoreReturnValue
  private @Nullable MoveDesc<E> removeAt(int index) {
    checkPositionIndex(index, size);
    modCount++;
    size--;
    if (size == index) {

  }

  /**
   * 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,