[Résolu] lien caché

[15-Apr-2026 12:57:22 UTC] PHP Fatal error: Allowed memory size of 536870912 bytes exhausted (tried to allocate 40960 bytes) in /home/clients/acaaea54c68ae491ccfbf0bed8674cc7/sites/growyandtasty.com/wp-content/plugins/sitepress-multilingual-cms/vendor/wpml/wpml/src/Core/Component/WordsToTranslate/Domain/Calculator/Diff.php on line 111

  public function diffArrays(
    $b,
    $c,
    // Following parameters are for performance reasons on recursion calls.
    $bStart = 0,
    $bEnd = null,
    $cStart = 0,
    $cEnd = null,
    $cValuesAsIndex = null
  ) {
    $bEnd = $bEnd ?? count( $b );
    $cEnd = $cEnd ?? count( $c );

    if ( $bStart >= $bEnd && $cStart >= $cEnd ) {
      // Nothing to check.
      return [];
    }

    if ( $cValuesAsIndex === null ) {
      // Flip the array to get the indexes of the values.
      $cValuesAsIndex = [];
      foreach ( $c as $index => $value ) {
        // Must be multidimensional as the same value can appear multiple times.
        $cValuesAsIndex[ $value ][] = $index;
      }
    }

    $maxMatchingWordsInARow = 0;
    $maxMatchAStart = $bStart;
    $maxMatchBstart = $cStart;

    $prevRow = [];

    // Loop $b array to find the longest match (words in a row) in the $b array.
    for ( $bIndex = $bStart; $bIndex < $bEnd; $bIndex++ ) {
      $value = $b[ $bIndex ];

      // Check if the value is in the $b array.
      /** @var int[] $matchIndexes */
      $matchIndexes = $cValuesAsIndex[ $value ] ?? [];

      $currRow = [];

      foreach ( $matchIndexes as $matchIndex ) {
        // The $b (before) value is also in the $c (current) array.

        if ( $matchIndex < $cStart || $matchIndex >= $cEnd ) {
          // The match is outside the current (recursion) range.
          continue;
        }

        $prevMatch = $prevRow[ $matchIndex - 1 ] ?? 0;

        // Set current match count (count of words in a row).
        $currRow[ $matchIndex ] = $prevMatch + 1;

        // Check if the current words in a row is greater than the max.
        if ( $currRow[ $matchIndex ] > $maxMatchingWordsInARow ) {
          $maxMatchingWordsInARow = $currRow[ $matchIndex ];
          $maxMatchAStart = $bIndex + 1 - $maxMatchingWordsInARow;
          $maxMatchBstart = $matchIndex + 1 - $maxMatchingWordsInARow;
        }
      }

      $prevRow = $currRow;
    }

    if ( $maxMatchingWordsInARow === 0 ) {
      // No matches at all.
      // Current range of $b was removed and current rage of $b was added.
      return [
        [
          self::DIFF_KEY_REMOVED => array_slice( $b, $bStart, $bEnd - $bStart ),
          self::DIFF_KEY_ADDED => array_slice( $c, $cStart, $cEnd - $cStart ),
        ],
      ];
    }

    // There are matches, but we still need to check the parts left and right of the matched words.
    return array_merge(
      // Left: Everything before the $maxMatchingWordsInARow.
      $this->diffArrays(
        $b,
        $c,
        $bStart,
        $maxMatchAStart,
        $cStart,
        $maxMatchBstart,
        $cValuesAsIndex
      ),
      // ---
      // Middle: The matching words.
      array_slice( $c, $maxMatchBstart, $maxMatchingWordsInARow ),
      // ---
      // Right: Everything after the $maxMatchingWordsInARow.
      $this->diffArrays(
        $b,
        $c,
        $maxMatchAStart + $maxMatchingWordsInARow,
        $bEnd,
        $maxMatchBstart + $maxMatchingWordsInARow,
        $cEnd,
        $cValuesAsIndex
      )
    );
  }