P͜Z>V UX>V/X>VdNZ>Vs1X>Vn/X>Vd'X>Vdw%\>V?p'X>VnmcX>V,.?.X>Vd0'X>Vn)X>V-/`ғX>V/\>V? Z>V౫Z>V&(И[>V???7/X>Vd`X>V Z>Vd?P/Z>V%'` Z>Vd?Y>V/X>Vom.co or1xX>V$Hint.coAX>VMCIaorg.dm@1X>V[Zmil.co!(eval 2338)A8X>Varts.co1xX>V$bc.ca1&X>VX>VR̗gc.ca1X>VQ*mb.ca1W>VX>VVEnb.ca18X>Vadm.br1hX>Vvadv.br1X>Vwagr.br1X>Vޒam.br1X>VIarq.br1(X>Vwart.br10GV>VXX>V׾1ato.br1X>Vbio.br1]X>VX>Vhbmd.br1X>V+ߊcim.br1X>V=cng.br1&X>VHX>Vuocnt.br1xX>V4Fcom.brAX>VH]gob.gt@1X>V~dpn.br1X>Vy]eco.br1X>VHX>V$ecn.br1xX>V?edu.br1X>VPP eng.br1X>V;=[esp.br1X>V^etc.brX>Vh9X>VX>V0̬X>VX>V("X>VeSY>Vb#X>VxQX>V X>VU>V-`Y>VX>V(X>V"X>V@9X>VU>V8>X>VxS"X>VmX>Vxf@Y>V"X>V8X>V4X>VP2\>V("X>V X>V@uX>V(X>V cX>VX>VX>VhX>V \>V(U>VMuX>VHX>VxfX>V-"X>V(Y.X>VwX>VX>V X>VX"X>VG"X>V 2\>V!X>Vw"X>V%VX>V!X>VY>V"X>VeY>VX"X>VhBY>VxU>VxgX>V_"X>VY>V80U>V+Y>VX"X>V@X>VX>VaY>V(!X>V5X>VK"X>V(V>V5X>VX>VHX>VȿX>V8"X>V0^Y>VX>V9X>VX>VY>V"X>VdFY>V(X>VNY>VhX>V`dX>VFX>V \>V8}"X>VD\>V7X>V/X>VX>Vay( $indexable->id, $this->saved_ancestors, true ) ) { return true; } $this->saved_ancestors[] = $indexable->id; return false; } /** * Saves the ancestors. * * @param Indexable $indexable The indexable. * * @return void */ private function save_ancestors( $indexable ) { if ( empty( $indexable->ancestors ) ) { $this->indexable_hierarchy_repository->add_ancestor( $indexable->id, 0, 0 ); return; } $depth = \count( $indexable->ancestors ); foreach ( $indexable->ancestors as $ancestor ) { $this->indexable_hierarchy_repository->add_ancestor( $indexable->id, $ancestor->id, $depth ); --$depth; } } /** * Adds ancestors for a post. * * @param int $indexable_id The indexable id, this is the id of the original indexable. * @param int $post_id The post id, this is the id of the post currently being evaluated. * @param int[] $parents The indexable IDs of all parents. * * @return void */ private function add_ancestors_for_post( $indexable_id, $post_id, &$parents ) { $post = $this->post->get_post( $post_id ); if ( ! isset( $post->post_parent ) ) { return; } if ( $post->post_parent !== 0 && $this->post->get_post( $post->post_parent ) !== null ) { $ancestor = $this->indexable_repository->find_by_id_and_type( $post->post_parent, 'post' ); if ( $this->is_invalid_ancestor( $ancestor, $indexable_id, $parents ) ) { return; } $parents[ $this->get_indexable_id( $ancestor ) ] = $ancestor; $this->add_ancestors_for_post( $indexable_id, $ancestor->object_id, $parents ); return; } $primary_term_id = $this->find_primary_term_id_for_post( $post ); if ( $primary_term_id === 0 ) { return; } $ancestor = $this->indexable_repository->find_by_id_and_type( $primary_term_id, 'term' ); if ( $this->is_invalid_ancestor( $ancestor, $indexable_id, $parents ) ) { return; } $parents[ $this->get_indexable_id( $ancestor ) ] = $ancestor; $this->add_ancestors_for_term( $indexable_id, $ancestor->object_id, $parents ); } /** * Adds ancestors for a term. * * @param int $indexable_id The indexable id, this is the id of the original indexable. * @param int $term_id The term id, this is the id of the term currently being evaluated. * @param int[] $parents The indexable IDs of all parents. * * @return void */ private function add_ancestors_for_term( $indexable_id, $term_id, &$parents = [] ) { $term = \get_term( $term_id ); $term_parents = $this->get_term_parents( $term ); foreach ( $term_parents as $parent ) { $ancestor = $this->indexable_repository->find_by_id_and_type( $parent->term_id, 'term' ); if ( $this->is_invalid_ancestor( $ancestor, $indexable_id, $parents ) ) { continue; } $parents[ $this->get_indexable_id( $ancestor ) ] = $ancestor; } } /** * Gets the primary term ID for a post. * * @param WP_Post $post The post. * * @return int The primary term ID. 0 if none exists. */ private function find_primary_term_id_for_post( $post ) { $main_taxonomy = $this->options->get( 'post_types-' . $post->post_type . '-maintax' ); if ( ! $main_taxonomy || $main_taxonomy === '0' ) { return 0; } $primary_term_id = $this->get_primary_term_id( $post->ID, $main_taxonomy ); if ( $primary_term_id ) { $term = \get_term( $primary_term_id ); if ( $term !== null && ! \is_wp_error( $term ) ) { return $primary_term_id; } } $terms = \get_the_terms( $post->ID, $main_taxonomy ); if ( ! \is_array( $terms ) || empty( $terms ) ) { return 0; } return $this->find_deepest_term_id( $terms ); } /** * Find the deepest term in an array of term objects. * * @param array $terms Terms set. * * @return int The deepest term ID. */ private function find_deepest_term_id( $terms ) { /* * Let's find the deepest term in this array, by looping through and then * unsetting every term that is used as a parent by another one in the array. */ $terms_by_id = []; foreach ( $terms as $term ) { $terms_by_id[ $term->term_id ] = $term; } foreach ( $terms as $term ) { unset( $terms_by_id[ $term->parent ] ); } /* * As we could still have two subcategories, from different parent categories, * let's pick the one with the lowest ordered ancestor. */ $parents_count = -1; $term_order = 9999; // Because ASC. $deepest_term = \reset( $terms_by_id ); foreach ( $terms_by_id as $term ) { $parents = $this->get_term_parents( $term ); $new_parents_count = \count( $parents ); if ( $new_parents_count < $parents_count ) { continue; } $parent_order = 9999; // Set default order. foreach ( $parents as $parent ) { if ( $parent->parent === 0 && isset( $parent->term_order ) ) { $parent_order = $parent->term_order; } } // Check if parent has lowest order. if ( $new_parents_count > $parents_count || $parent_order < $term_order ) { $term_order = $parent_order; $deepest_term = $term; } $parents_count = $new_parents_count; } return $deepest_term->term_id; } /** * Get a term's parents. * * @param WP_Term $term Term to get the parents for. * * @return WP_Term[] An array of all this term's parents. */ private function get_term_parents( $term ) { $tax = $term->taxonomy; $parents = []; while ( (int) $term->parent !== 0 ) { $term = \get_term( $term->parent, $tax ); $parents[] = $term; } return $parents; } /** * Checks if an ancestor is valid to add. * * @param Indexable $ancestor The ancestor (presumed indexable) to check. * @param int $indexable_id The indexable id we're adding ancestors for. * @param int[] $parents The indexable ids of the parents already added. * * @return bool */ private function is_invalid_ancestor( $ancestor, $indexable_id, $parents ) { // If the ancestor is not an Indexable, it is invalid by default. if ( ! \is_a( $ancestor, 'Yoast\WP\SEO\Models\Indexable' ) ) { return true; } // Don't add ancestors if they're unindexed, already added or the same as the main object. if ( $ancestor->post_status === 'unindexed' ) { return true; } $ancestor_id = $this->get_indexable_id( $ancestor ); if ( \array_key_exists( $ancestor_id, $parents ) ) { return true; } if ( $ancestor_id === $indexable_id ) { return true; } return false; } /** * Returns the ID for an indexable. Catches situations where the id is null due to errors. * * @param Indexable $indexable The indexable. * * @return string|int A unique ID for the indexable. */ private function get_indexable_id( Indexable $indexable ) { if ( $indexable->id === 0 ) { return "{$indexable->object_type}:{$indexable->object_id}"; } return $indexable->id; } /** * Returns the primary term id of a post. * * @param int $post_id The post ID. * @param string $main_taxonomy The main taxonomy. * * @return int The ID of the primary term. */ private function get_primary_term_id( $post_id, $main_taxonomy ) { $primary_term = $this->primary_term_repository->find_by_post_id_and_taxonomy( $post_id, $main_taxonomy, false ); if ( $primary_term ) { return $primary_term->term_id; } return \get_post_meta( $post_id, WPSEO_Meta::$meta_prefix . 'primary_' . $main_taxonomy, true ); } } https://www.onlinekladionice.com/post-sitemap.xml 2026-05-06T18:27:40+00:00 https://www.onlinekladionice.com/post-sitemap2.xml 2024-10-09T00:28:52+00:00 https://www.onlinekladionice.com/post-sitemap3.xml 2025-07-31T13:20:24+00:00 https://www.onlinekladionice.com/post-sitemap4.xml 2026-05-06T18:27:40+00:00 https://www.onlinekladionice.com/page-sitemap.xml 2025-11-26T13:25:22+00:00 https://www.onlinekladionice.com/predictions-sitemap.xml 2026-05-04T22:17:23+00:00 https://www.onlinekladionice.com/predictions-sitemap2.xml 2022-03-16T23:15:25+00:00 https://www.onlinekladionice.com/predictions-sitemap3.xml 2022-04-21T23:15:49+00:00 https://www.onlinekladionice.com/predictions-sitemap4.xml 2022-06-30T14:15:16+00:00 https://www.onlinekladionice.com/predictions-sitemap5.xml 2022-08-23T13:15:12+00:00 https://www.onlinekladionice.com/predictions-sitemap6.xml 2023-10-09T22:15:59+00:00 https://www.onlinekladionice.com/predictions-sitemap7.xml 2023-11-27T23:16:15+00:00 https://www.onlinekladionice.com/predictions-sitemap8.xml 2024-01-07T23:16:21+00:00 https://www.onlinekladionice.com/predictions-sitemap9.xml 2024-02-19T23:17:06+00:00 https://www.onlinekladionice.com/predictions-sitemap10.xml 2024-03-31T22:15:41+00:00 https://www.onlinekladionice.com/predictions-sitemap11.xml 2024-04-30T22:15:44+00:00 https://www.onlinekladionice.com/predictions-sitemap12.xml 2024-08-05T22:15:47+00:00 https://www.onlinekladionice.com/predictions-sitemap13.xml 2024-09-16T22:20:10+00:00 https://www.onlinekladionice.com/predictions-sitemap14.xml 2024-10-27T23:15:56+00:00 https://www.onlinekladionice.com/predictions-sitemap15.xml 2024-12-02T23:16:21+00:00 https://www.onlinekladionice.com/predictions-sitemap16.xml 2025-01-16T23:15:47+00:00 https://www.onlinekladionice.com/predictions-sitemap17.xml 2025-02-22T23:15:18+00:00 https://www.onlinekladionice.com/predictions-sitemap18.xml 2025-03-30T22:16:39+00:00 https://www.onlinekladionice.com/predictions-sitemap19.xml 2025-04-28T22:18:47+00:00 https://www.onlinekladionice.com/predictions-sitemap20.xml 2025-08-02T22:15:13+00:00 https://www.onlinekladionice.com/predictions-sitemap21.xml 2025-09-15T22:16:51+00:00 https://www.onlinekladionice.com/predictions-sitemap22.xml 2025-10-26T23:16:21+00:00 https://www.onlinekladionice.com/predictions-sitemap23.xml 2025-12-08T23:15:43+00:00 https://www.onlinekladionice.com/predictions-sitemap24.xml 2026-01-26T23:17:05+00:00 https://www.onlinekladionice.com/predictions-sitemap25.xml 2026-03-01T23:16:08+00:00 https://www.onlinekladionice.com/predictions-sitemap26.xml 2026-04-13T22:15:15+00:00 https://www.onlinekladionice.com/predictions-sitemap27.xml 2026-05-04T22:17:23+00:00 https://www.onlinekladionice.com/competitions-sitemap.xml 2026-05-04T22:17:23+00:00