PHP 8.2.29
Preview: class-wp-walker.php Size: 13.01 KB
/home/medyaist/vetplusveteriner.com/wp-includes/class-wp-walker.php
<?php
/**
 * A class for displaying various tree-like structures.
 *
 * Extend the Walker class to use it, see examples below. Child classes
 * do not need to implement all of the abstract methods in the class. The child
 * only needs to implement the methods that are needed.
 *
 * @since 2.1.0
 *
 * @package WordPress
 * @abstract
 */
#[AllowDynamicProperties]
class Walker {
	/**
	 * What the class handles.
	 *
	 * @since 2.1.0
	 * @var string
	 */
	public $tree_type;

	/**
	 * DB fields to use.
	 *
	 * @since 2.1.0
	 * @var string[]
	 */
	public $db_fields;

	/**
	 * Max number of pages walked by the paged walker.
	 *
	 * @since 2.7.0
	 * @var int
	 */
	public $max_pages = 1;

	/**
	 * Whether the current element has children or not.
	 *
	 * To be used in start_el().
	 *
	 * @since 4.0.0
	 * @var bool
	 */
	public $has_children;

	/**
	 * Starts the list before the elements are added.
	 *
	 * The $args parameter holds additional values that may be used with the child
	 * class methods. This method is called at the start of the output list.
	 *
	 * @since 2.1.0
	 * @abstract
	 *
	 * @param string $output Used to append additional content (passed by reference).
	 * @param int    $depth  Depth of the item.
	 * @param array  $args   An array of additional arguments.
	 */
	public function start_lvl( &$output, $depth = 0, $args = array() ) {}

	/**
	 * Ends the list of after the elements are added.
	 *
	 * The $args parameter holds additional values that may be used with the child
	 * class methods. This method finishes the list at the end of output of the elements.
	 *
	 * @since 2.1.0
	 * @abstract
	 *
	 * @param string $output Used to append additional content (passed by reference).
	 * @param int    $depth  Depth of the item.
	 * @param array  $args   An array of additional arguments.
	 */
	public function end_lvl( &$output, $depth = 0, $args = array() ) {}

	/**
	 * Starts the element output.
	 *
	 * The $args parameter holds additional values that may be used with the child
	 * class methods. Also includes the element output.
	 *
	 * @since 2.1.0
	 * @since 5.9.0 Renamed `$object` (a PHP reserved keyword) to `$data_object` for PHP 8 named parameter support.
	 * @abstract
	 *
	 * @param string $output            Used to append additional content (passed by reference).
	 * @param object $data_object       The data object.
	 * @param int    $depth             Depth of the item.
	 * @param array  $args              An array of additional arguments.
	 * @param int    $current_object_id Optional. ID of the current item. Default 0.
	 */
	public function start_el( &$output, $data_object, $depth = 0, $args = array(), $current_object_id = 0 ) {}

	/**
	 * Ends the element output, if needed.
	 *
	 * The $args parameter holds additional values that may be used with the child class methods.
	 *
	 * @since 2.1.0
	 * @since 5.9.0 Renamed `$object` (a PHP reserved keyword) to `$data_object` for PHP 8 named parameter support.
	 * @abstract
	 *
	 * @param string $output      Used to append additional content (passed by reference).
	 * @param object $data_object The data object.
	 * @param int    $depth       Depth of the item.
	 * @param array  $args        An array of additional arguments.
	 */
	public function end_el( &$output, $data_object, $depth = 0, $args = array() ) {}

	/**
	 * Traverses elements to create list from elements.
	 *
	 * Display one element if the element doesn't have any children otherwise,
	 * display the element and its children. Will only traverse up to the max
	 * depth and no ignore elements under that depth. It is possible to set the
	 * max depth to include all depths, see walk() method.
	 *
	 * This method should not be called directly, use the walk() method instead.
	 *
	 * @since 2.5.0
	 *
	 * @param object $element           Data object.
	 * @param array  $children_elements List of elements to continue traversing (passed by reference).
	 * @param int    $max_depth         Max depth to traverse.
	 * @param int    $depth             Depth of current element.
	 * @param array  $args              An array of arguments.
	 * @param string $output            Used to append additional content (passed by reference).
	 */
	public function display_element( $element, &$children_elements, $max_depth, $depth, $args, &$output ) {
		if ( ! $element ) {
			return;
		}

		$max_depth = (int) $max_depth;
		$depth     = (int) $depth;

		$id_field = $this->db_fields['id'];
		$id       = $element->$id_field;

		// Display this element.
		$this->has_children = ! empty( $children_elements[ $id ] );
		if ( isset( $args[0] ) && is_array( $args[0] ) ) {
			$args[0]['has_children'] = $this->has_children; // Back-compat.
		}

		$this->start_el( $output, $element, $depth, ...array_values( $args ) );

		// Descend only when the depth is right and there are children for this element.
		if ( ( 0 === $max_depth || $max_depth > $depth + 1 ) && isset( $children_elements[ $id ] ) ) {

			foreach ( $children_elements[ $id ] as $child ) {

				if ( ! isset( $newlevel ) ) {
					$newlevel = true;
					// Start the child delimiter.
					$this->start_lvl( $output, $depth, ...array_values( $args ) );
				}
				$this->display_element( $child, $children_elements, $max_depth, $depth + 1, $args, $output );
			}
			unset( $children_elements[ $id ] );
		}

		if ( isset( $newlevel ) && $newlevel ) {
			// End the child delimiter.
			$this->end_lvl( $output, $depth, ...array_values( $args ) );
		}

		// End this element.
		$this->end_el( $output, $element, $depth, ...array_values( $args ) );
	}

	/**
	 * Displays array of elements hierarchically.
	 *
	 * Does not assume any existing order of elements.
	 *
	 * $max_depth = -1 means flatly display every element.
	 * $max_depth = 0 means display all levels.
	 * $max_depth > 0 specifies the number of display levels.
	 *
	 * @since 2.1.0
	 * @since 5.3.0 Formalized the existing `...$args` parameter by adding it
	 *              to the function signature.
	 *
	 * @param array $elements  An array of elements.
	 * @param int   $max_depth The maximum hierarchical depth.
	 * @param mixed ...$args   Optional additional arguments.
	 * @return string The hierarchical item output.
	 */
	public function walk( $elements, $max_depth, ...$args ) {
		$output = '';

		$max_depth = (int) $max_depth;

		// Invalid parameter or nothing to walk.
		if ( $max_depth < -1 || empty( $elements ) ) {
			return $output;
		}

		$parent_field = $this->db_fields['parent'];

		// Flat display.
		if ( -1 === $max_depth ) {
			$empty_array = array();
			foreach ( $elements as $e ) {
				$this->display_element( $e, $empty_array, 1, 0, $args, $output );
			}
			return $output;
		}

		/*
		 * Need to display in hierarchical order.
		 * Separate elements into two buckets: top level and children elements.
		 * Children_elements is two dimensional array. Example:
		 * Children_elements[10][] contains all sub-elements whose parent is 10.
		 */
		$top_level_elements = array();
		$children_elements  = array();
		foreach ( $elements as $e ) {
			if ( empty( $e->$parent_field ) ) {
				$top_level_elements[] = $e;
			} else {
				$children_elements[ $e->$parent_field ][] = $e;
			}
		}

		/*
		 * When none of the elements is top level.
		 * Assume the first one must be root of the sub elements.
		 */
		if ( empty( $top_level_elements ) ) {

			$first = array_slice( $elements, 0, 1 );
			$root  = $first[0];

			$top_level_elements = array();
			$children_elements  = array();
			foreach ( $elements as $e ) {
				if ( $root->$parent_field === $e->$parent_field ) {
					$top_level_elements[] = $e;
				} else {
					$children_elements[ $e->$parent_field ][] = $e;
				}
			}
		}

		foreach ( $top_level_elements as $e ) {
			$this->display_element( $e, $children_elements, $max_depth, 0, $args, $output );
		}

		/*
		 * If we are displaying all levels, and remaining children_elements is not empty,
		 * then we got orphans, which should be displayed regardless.
		 */
		if ( ( 0 === $max_depth ) && count( $children_elements ) > 0 ) {
			$empty_array = array();
			foreach ( $children_elements as $orphans ) {
				foreach ( $orphans as $op ) {
					$this->display_element( $op, $empty_array, 1, 0, $args, $output );
				}
			}
		}

		return $output;
	}

	/**
	 * Produces a page of nested elements.
	 *
	 * Given an array of hierarchical elements, the maximum depth, a specific page number,
	 * and number of elements per page, this function first determines all top level root elements
	 * belonging to that page, then lists them and all of their children in hierarchical order.
	 *
	 * $max_depth = 0 means display all levels.
	 * $max_depth > 0 specifies the number of display levels.
	 *
	 * @since 2.7.0
	 * @since 5.3.0 Formalized the existing `...$args` parameter by adding it
	 *              to the function signature.
	 *
	 * @param array $elements  An array of elements.
	 * @param int   $max_depth The maximum hierarchical depth.
	 * @param int   $page_num  The specific page number, beginning with 1.
	 * @param int   $per_page  Number of elements per page.
	 * @param mixed ...$args   Optional additional arguments.
	 * @return string XHTML of the specified page of elements.
	 */
	public function paged_walk( $elements, $max_depth, $page_num, $per_page, ...$args ) {
		$output = '';

		$max_depth = (int) $max_depth;

		if ( empty( $elements ) || $max_depth < -1 ) {
			return $output;
		}

		$parent_field = $this->db_fields['parent'];

		$count = -1;
		if ( -1 === $max_depth ) {
			$total_top = count( $elements );
		}
		if ( $page_num < 1 || $per_page < 0 ) {
			// No paging.
			$paging = false;
			$start  = 0;
			if ( -1 === $max_depth ) {
				$end = $total_top;
			}
			$this->max_pages = 1;
		} else {
			$paging = true;
			$start  = ( (int) $page_num - 1 ) * (int) $per_page;
			$end    = $start + $per_page;
			if ( -1 === $max_depth ) {
				$this->max_pages = (int) ceil( $total_top / $per_page );
			}
		}

		// Flat display.
		if ( -1 === $max_depth ) {
			if ( ! empty( $args[0]['reverse_top_level'] ) ) {
				$elements = array_reverse( $elements );
				$oldstart = $start;
				$start    = $total_top - $end;
				$end      = $total_top - $oldstart;
			}

			$empty_array = array();
			foreach ( $elements as $e ) {
				++$count;
				if ( $count < $start ) {
					continue;
				}
				if ( $count >= $end ) {
					break;
				}
				$this->display_element( $e, $empty_array, 1, 0, $args, $output );
			}
			return $output;
		}

		/*
		 * Separate elements into two buckets: top level and children elements.
		 * Children_elements is two dimensional array, e.g.
		 * $children_elements[10][] contains all sub-elements whose parent is 10.
		 */
		$top_level_elements = array();
		$children_elements  = array();
		foreach ( $elements as $e ) {
			if ( empty( $e->$parent_field ) ) {
				$top_level_elements[] = $e;
			} else {
				$children_elements[ $e->$parent_field ][] = $e;
			}
		}

		$total_top = count( $top_level_elements );
		if ( $paging ) {
			$this->max_pages = (int) ceil( $total_top / $per_page );
		} else {
			$end = $total_top;
		}

		if ( ! empty( $args[0]['reverse_top_level'] ) ) {
			$top_level_elements = array_reverse( $top_level_elements );
			$oldstart           = $start;
			$start              = $total_top - $end;
			$end                = $total_top - $oldstart;
		}
		if ( ! empty( $args[0]['reverse_children'] ) ) {
			foreach ( $children_elements as $parent => $children ) {
				$children_elements[ $parent ] = array_reverse( $children );
			}
		}

		foreach ( $top_level_elements as $e ) {
			++$count;

			// For the last page, need to unset earlier children in order to keep track of orphans.
			if ( $end >= $total_top && $count < $start ) {
					$this->unset_children( $e, $children_elements );
			}

			if ( $count < $start ) {
				continue;
			}

			if ( $count >= $end ) {
				break;
			}

			$this->display_element( $e, $children_elements, $max_depth, 0, $args, $output );
		}

		if ( $end >= $total_top && count( $children_elements ) > 0 ) {
			$empty_array = array();
			foreach ( $children_elements as $orphans ) {
				foreach ( $orphans as $op ) {
					$this->display_element( $op, $empty_array, 1, 0, $args, $output );
				}
			}
		}

		return $output;
	}

	/**
	 * Calculates the total number of root elements.
	 *
	 * @since 2.7.0
	 *
	 * @param array $elements Elements to list.
	 * @return int Number of root elements.
	 */
	public function get_number_of_root_elements( $elements ) {
		$num          = 0;
		$parent_field = $this->db_fields['parent'];

		foreach ( $elements as $e ) {
			if ( empty( $e->$parent_field ) ) {
				++$num;
			}
		}
		return $num;
	}

	/**
	 * Unsets all the children for a given top level element.
	 *
	 * @since 2.7.0
	 *
	 * @param object $element           The top level element.
	 * @param array  $children_elements The children elements.
	 */
	public function unset_children( $element, &$children_elements ) {
		if ( ! $element || ! $children_elements ) {
			return;
		}

		$id_field = $this->db_fields['id'];
		$id       = $element->$id_field;

		if ( ! empty( $children_elements[ $id ] ) && is_array( $children_elements[ $id ] ) ) {
			foreach ( (array) $children_elements[ $id ] as $child ) {
				$this->unset_children( $child, $children_elements );
			}
		}

		unset( $children_elements[ $id ] );
	}
}

Directory Contents

Dirs: 29 × Files: 157
Name Size Perms Modified Actions
- drwxr-xr-x 2025-12-03 17:56:28
Edit Download
assets DIR
- drwxr-xr-x 2025-10-15 22:49:44
Edit Download
- drwxr-xr-x 2026-01-14 05:09:42
Edit Download
- drwxr-xr-x 2026-01-14 22:15:15
Edit Download
- drwxr-xr-x 2026-01-14 22:15:33
Edit Download
blocks DIR
- drwxr-xr-x 2026-01-14 15:46:12
Edit Download
- drwxr-xr-x 2026-01-09 23:52:28
Edit Download
css DIR
- drwxr-xr-x 2025-10-15 22:49:45
Edit Download
customize DIR
- drwxr-xr-x 2026-01-14 10:05:37
Edit Download
fonts DIR
- drwxr-xr-x 2026-01-13 23:32:46
Edit Download
html-api DIR
- drwxr-xr-x 2026-01-14 19:45:51
Edit Download
ID3 DIR
- drwxr-xr-x 2026-01-13 23:26:22
Edit Download
images DIR
- drwxr-xr-x 2026-01-09 23:58:18
Edit Download
- drwxr-xr-x 2026-01-15 00:20:13
Edit Download
IXR DIR
- drwxr-xr-x 2026-01-14 05:08:41
Edit Download
js DIR
- drwxr-xr-x 2026-01-13 23:29:55
Edit Download
l10n DIR
- drwxr-xr-x 2026-01-14 18:25:54
Edit Download
- drwxr-xr-x 2025-10-15 22:49:45
Edit Download
PHPMailer DIR
- drwxr-xr-x 2026-01-13 23:29:58
Edit Download
pomo DIR
- drwxr-xr-x 2025-10-15 22:49:45
Edit Download
Requests DIR
- drwxr-xr-x 2025-10-15 22:49:45
Edit Download
rest-api DIR
- drwxr-xr-x 2026-01-07 18:29:15
Edit Download
SimplePie DIR
- drwxr-xr-x 2026-01-10 00:55:04
Edit Download
sitemaps DIR
- drwxr-xr-x 2025-10-15 22:49:45
Edit Download
- drwxr-xr-x 2026-01-14 06:43:17
Edit Download
- drwxr-xr-x 2026-01-10 00:39:22
Edit Download
Text DIR
- drwxr-xr-x 2025-10-15 22:49:45
Edit Download
- drwxr-xr-x 2026-01-07 18:07:15
Edit Download
widgets DIR
- drwxr-xr-x 2026-01-14 06:44:22
Edit Download
7.80 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
18.94 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
7.35 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
12.90 KB lrw-r--r-- 2024-11-29 19:46:22
Edit Download
61.02 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
112.05 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
42.63 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
6.61 KB lrw-r--r-- 2024-09-17 18:08:16
Edit Download
2.18 KB lrw-r--r-- 2023-04-05 10:12:26
Edit Download
13.89 KB lrw-r--r-- 2024-03-18 12:46:14
Edit Download
7.43 KB lrw-r--r-- 2023-09-14 09:46:20
Edit Download
17.46 KB lrw-r--r-- 2024-07-17 21:52:18
Edit Download
5.14 KB lrw-r--r-- 2022-09-12 12:47:14
Edit Download
8.28 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
1.32 KB lrw-r--r-- 2022-09-12 12:47:14
Edit Download
4.60 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
11.62 KB lrw-r--r-- 2025-03-05 19:17:24
Edit Download
2.50 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
1.97 KB lrw-r--r-- 2024-09-19 22:55:36
Edit Download
11.25 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
10.60 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
67.84 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
6.34 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
5.49 KB lrw-r--r-- 2025-03-04 10:06:28
Edit Download
1.99 KB lrw-r--r-- 2024-09-19 23:07:12
Edit Download
7.02 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
4.91 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
16.86 KB lrw-r--r-- 2024-05-01 21:01:10
Edit Download
24.23 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
3.97 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
47.66 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
9.22 KB lrw-r--r-- 2025-02-11 10:40:30
Edit Download
25.51 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
198.38 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
56.65 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
10.46 KB lrw-r--r-- 2025-01-22 16:48:26
Edit Download
10.95 KB lrw-r--r-- 2024-10-13 16:09:12
Edit Download
29.26 KB lrw-r--r-- 2025-01-22 16:48:26
Edit Download
70.91 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
35.30 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
15.02 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
2.57 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
39.83 KB lrw-r--r-- 2024-06-14 09:18:12
Edit Download
70.64 KB lrw-r--r-- 2025-04-25 15:28:30
Edit Download
15.56 KB lrw-r--r-- 2025-04-14 11:31:24
Edit Download
7.33 KB lrw-r--r-- 2023-02-21 13:39:20
Edit Download
253 B lrw-r--r-- 2024-09-27 16:28:14
Edit Download
7.96 KB lrw-r--r-- 2024-10-22 07:16:16
Edit Download
3.23 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
969 B lrw-r--r-- 2024-09-30 19:50:20
Edit Download
16.28 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
7.22 KB lrw-r--r-- 2023-06-24 14:17:24
Edit Download
12.95 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
6.53 KB lrw-r--r-- 2023-06-22 11:57:24
Edit Download
3.42 KB lrw-r--r-- 2022-09-12 12:47:14
Edit Download
5.84 KB lrw-r--r-- 2023-06-22 11:36:26
Edit Download
1.97 KB lrw-r--r-- 2022-12-15 18:32:18
Edit Download
4.30 KB lrw-r--r-- 2023-10-11 04:05:26
Edit Download
2.91 KB lrw-r--r-- 2022-09-12 12:47:14
Edit Download
16.46 KB lrw-r--r-- 2023-09-21 15:29:12
Edit Download
40.60 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
20.22 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
36.11 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
7.27 KB lrw-r--r-- 2024-02-27 19:38:16
Edit Download
6.62 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
16.49 KB lrw-r--r-- 2025-02-25 19:40:22
Edit Download
1.79 KB lrw-r--r-- 2024-02-05 22:25:14
Edit Download
29.82 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
6.67 KB lrw-r--r-- 2023-05-11 08:15:24
Edit Download
8.98 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
19.42 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
12.01 KB lrw-r--r-- 2024-09-13 19:12:16
Edit Download
17.11 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
1.06 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
6.74 KB lrw-r--r-- 2024-03-06 02:05:12
Edit Download
30.93 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
4.99 KB lrw-r--r-- 2024-09-03 15:19:14
Edit Download
4.25 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
24.72 KB lrw-r--r-- 2025-03-17 19:40:26
Edit Download
29.96 KB lrw-r--r-- 2025-02-09 08:09:22
Edit Download
6.34 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
159.91 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
6.72 KB lrw-r--r-- 2022-10-04 00:59:14
Edit Download
10.92 KB lrw-r--r-- 2023-05-02 12:45:22
Edit Download
4.77 KB lrw-r--r-- 2025-02-17 08:24:22
Edit Download
3.38 KB lrw-r--r-- 2022-09-12 12:47:14
Edit Download
11.18 KB lrw-r--r-- 2025-02-23 08:11:22
Edit Download
62.19 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
2.46 KB lrw-r--r-- 2023-09-08 06:32:24
Edit Download
9.17 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
31.13 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
33.38 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
7.15 KB lrw-r--r-- 2025-02-11 08:14:22
Edit Download
3.47 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
1.87 KB lrw-r--r-- 2025-01-22 16:48:26
Edit Download
30.91 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
7.29 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
7.35 KB lrw-r--r-- 2025-02-18 19:32:22
Edit Download
11.86 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
19.12 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
18.12 KB lrw-r--r-- 2025-03-26 19:07:28
Edit Download
39.99 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
5.17 KB lrw-r--r-- 2022-09-12 12:47:14
Edit Download
979 B lrw-r--r-- 2024-02-14 16:27:10
Edit Download
18.44 KB lrw-r--r-- 2025-01-22 16:48:26
Edit Download
10.24 KB lrw-r--r-- 2024-11-19 23:50:24
Edit Download
1.77 KB lrw-r--r-- 2024-06-04 08:55:14
Edit Download
34.90 KB lrw-r--r-- 2024-11-03 23:34:16
Edit Download
7.19 KB lrw-r--r-- 2024-06-06 05:02:16
Edit Download
160.50 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
64.27 KB lrw-r--r-- 2025-04-08 11:18:28
Edit Download
27.95 KB lrw-r--r-- 2024-07-19 20:44:16
Edit Download
4.69 KB lrw-r--r-- 2025-02-18 19:32:22
Edit Download
13.01 KB lrw-r--r-- 2024-07-26 04:56:14
Edit Download
3.27 KB lrw-r--r-- 2022-09-12 12:47:14
Edit Download
18.00 KB lrw-r--r-- 2024-11-02 12:01:20
Edit Download
210.40 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
25.86 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
373 B lrw-r--r-- 2022-09-20 11:17:12
Edit Download
343 B lrw-r--r-- 2022-09-20 11:17:12
Edit Download
338 B lrw-r--r-- 2022-09-20 11:17:12
Edit Download
130.93 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
37.02 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
2.24 KB lrw-r--r-- 2025-01-22 16:48:26
Edit Download
4.02 KB lrw-r--r-- 2023-05-02 12:45:22
Edit Download
214.68 KB lrw-r--r-- 2026-03-02 09:20:26
Edit Download
5.38 KB lrw-r--r-- 2024-03-04 09:41:10
Edit Download
1.16 KB lrw-r--r-- 2020-01-28 21:45:18
Edit Download
4.04 KB lrw-r--r-- 2024-03-04 09:41:10
Edit Download
9.56 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
281.84 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
14.95 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
8.44 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
20.71 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
5.72 KB lrw-r--r-- 2025-02-24 10:43:24
Edit Download
81.72 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
25.24 KB lrw-r--r-- 2025-01-22 16:48:26
Edit Download
4.81 KB lrw-r--r-- 2024-06-13 17:50:14
Edit Download
6.48 KB lrw-r--r-- 2023-02-23 22:23:20
Edit Download
2.79 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
89.69 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
4.11 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
6.94 KB lrw-r--r-- 2024-05-27 13:29:16
Edit Download
289.13 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
200 B lrw-r--r-- 2020-11-12 08:17:08
Edit Download
255 B lrw-r--r-- 2020-11-16 19:52:06
Edit Download
22.66 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
9.68 KB lrw-r--r-- 2025-12-03 17:56:34
Edit Download
23.49 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
3.16 KB lrw-r--r-- 2021-05-15 14:38:06
Edit Download
544 B lrw-r--r-- 2023-09-30 21:22:28
Edit Download
2.84 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
6.09 KB lrw-r--r-- 2025-02-17 14:49:20
Edit Download
6.41 KB lrw-r--r-- 2025-01-22 16:48:26
Edit Download
69.46 KB lrw-r--r-- 2025-12-03 17:56:33
Edit Download
445 B lrw-r--r-- 2022-07-21 19:45:12
Edit Download
799 B lrw-r--r-- 2025-01-22 16:48:26
Edit Download
If ZipArchive is unavailable, a .tar will be created (no compression).