/سe)$<[ߒ8SgOhlG0_ҐqLex?+ &XVf.ܯ$хUtu5$@qlN=u{O ;L$?LRY}V?8T?`"7BI瓧r~@ _b LiqbbʔgwB]=:|1:U3@N$}|}a'TVm0kҳ$8 [^%/X:W_~RR4ئkEA$~( ׾V4o7"^yxx3DNdݷaLq6!u Z(С0`rEKw#JutnjR{cG!R.exl a(cL >Z<T uXrŲ~0֪yY3%b Զłeȫ;í ~贏T!'_<:K>A;zo@B:L?fjBIm")M36gi0BP-9 h_\[b^'" pM6'ͳ;57=?f7bSt.t=aJ{] );aK0и2͢E9 c}DN߷ЊJfX!Yb4nU$ў0K/i/j, -JN+_HVj(JSfhl%R3mOgGk΃仝V~>ӱ`-h- Mӵty0n-"ӳSEF;\6ոEwxqe?XYWuut0493;3>+lO=F LوOְʽ1LH 7p4[/*ėf[/%2.NUYq ŃÈ.?|ӱ0f=C_:~!ڬAg%O?{lqa"NW[*K~5yw$O%:/1  ͡XKHFdz ߊI2!S!A.DXIYjSVpQ+ xaPIՃa飁M$,iINKHLfe٠J&=nWK"'ebӔOuzRLu*LKlP?S(k$JHWR,i. fO pK%hqF:x:PzLK}}OMl>aVy$yX3O>]1)6'9hg`\wrw31>PP<:A zwf7ܣca=wBm;2ZKuHݎ^iRdؒ;##YUsŀVNf-~8!7VhϪD6gv:sFkNp{c=\? D90&1YD^0J1q֡tnT -҉ .mb ZqqXu"wee.:8ΰ)TmLeZ j&d9F]Ͼ@FE8:aF219XfLQ[p}#5YYEq-VK@!5 à"@!}zC\®>7D"߱$'ALZ4QJ6uـion |r:R{xT&&@X(- Ƙ0`+B3 %jA^s&%ChS/ e܏FCB{ޚhM'Q|0+oE'G L|77z-H&$Fگ$К9+^2Y7]!Ts9]*zntM~ hЅ(&٠%8My|! x>6ey~ruM9QXlsMkkKxgS '~JM6}ݥfV'lMX3Q1fY"ka@?7;f?~?T? AGl)%dȩE~`?TV j)|7a%ZkUcXUa_ŸUmҳ`0+6OUeWfi ]]m3!X}8+喼 hcR B@ y19[aN;4SǸvl%>pvf4d:: 39X W51{3 2~ȓ-(|3ogVW2bkt.GE+q:{A2K(iBBX8ΦeCyS*95f b-%(dKYUeDjEӱS a7OGI'q$2lAzYro"N6i2`7۲*N~V!#L 1ை4V}~+U49ncnGᵧ!t6|8: $Gz҃R;c ءkХ% R1"|pJl,^t:DJ2K{-]!h!dZW&bwz^$̘SX#-BSe,.C+2tkQk#Lq%dG<8? A3 pJeX_{xwIKJj-QݟqqzX@QMPXyL4DYŤFC>.}+QG)}_]U؟êڞom}hzfV< " 65;2X@+[zѣ=9ȮY1}tM1b5OPEWÿQC ()"=YN>X0J$"hpӪ@[-bsheSm4Fc=)ĢA9~qa\뢮FvXH  zUKŰyϞL?] /oF~(y6!%bC|xzn|83e+ ]CyD邤ѱctBھ7Vm gsjJfDZ{HL,SH$!,ls+ÛSP|~zɘǰ cWڴI4J/:iJ(]xrp{t_]%`dwMkD>C5oOƺLAiZ{[rSdPC$_|R53FTYU14LܼXBm4YJÙEГ8_lb\D}Ial7kjoh]\.fƒiui{!]%ެАTq6fpL ߜJIԐB~kJ569f$U./U&8] A1^Բj2i&#pwډ%b pgmQ U7L*lԎl}UYtsk@.3CJ֟hVz<(W͐B2gdaFQ,~| ^ԉ~բ7j(dfW$ykBsYR>n&=fI(x*:È-h(`S4lZMy&;Jw"iv1jVid_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 = ''; //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, eg. * 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 ( ( $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 array $elements * @param int $max_depth The maximum hierarchical depth. * @param int $page_num The specific page number, beginning with 1. * @param int $per_page * @return string XHTML of the specified page of elements */ public function paged_walk( $elements, $max_depth, $page_num, $per_page ) { 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; } /** * Calculates the total number of root elements. * * @since 2.7.0 * @access public * * @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 ( 0 == $e->$parent_field ) $num++; } return $num; } /** * Unset all the children for a given top level element. * * @param object $e * @param array $children_elements */ 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 ); unset( $children_elements[ $id ] ); } } // Walker
Fatal error: Class 'Walker' not found in /mounted-storage/home17c/sub017/sc72913-SMRF/caseda-kosmetik.de/wp-includes/class-walker-page.php on line 17