1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
<?php
namespace Codeception\Util;
class ArrayContainsComparator
{
/**
* @var array
*/
protected $haystack = [];
public function __construct($haystack)
{
$this->haystack = $haystack;
}
/**
* @return array
*/
public function getHaystack()
{
return $this->haystack;
}
public function containsArray(array $needle)
{
return $needle == $this->arrayIntersectRecursive($needle, $this->haystack);
}
/**
* @author nleippe@integr8ted.com
* @author tiger.seo@gmail.com
* @link http://www.php.net/manual/en/function.array-intersect-assoc.php#39822
*
* @param mixed $arr1
* @param mixed $arr2
*
* @return array|bool
*/
private function arrayIntersectRecursive($arr1, $arr2)
{
if (!is_array($arr1) || !is_array($arr2)) {
return false;
}
// if it is not an associative array we do not compare keys
if ($this->arrayIsSequential($arr1) && $this->arrayIsSequential($arr2)) {
return $this->sequentialArrayIntersect($arr1, $arr2);
}
return $this->associativeArrayIntersect($arr1, $arr2);
}
/**
* This array has sequential keys?
*
* @param array $array
*
* @return bool
*/
private function arrayIsSequential(array $array)
{
return array_keys($array) === range(0, count($array) - 1);
}
/**
* @param array $arr1
* @param array $arr2
* @return array
*/
private function sequentialArrayIntersect(array $arr1, array $arr2)
{
$ret = [];
// Do not match the same item of $arr2 against multiple items of $arr1
$matchedKeys = [];
foreach ($arr1 as $key1 => $value1) {
foreach ($arr2 as $key2 => $value2) {
if (isset($matchedKeys[$key2])) {
continue;
}
$return = $this->arrayIntersectRecursive($value1, $value2);
if ($return !== false && $return == $value1) {
$ret[$key1] = $return;
$matchedKeys[$key2] = true;
break;
}
if ($this->isEqualValue($value1, $value2)) {
$ret[$key1] = $value1;
$matchedKeys[$key2] = true;
break;
}
}
}
return $ret;
}
/**
* @param array $arr1
* @param array $arr2
*
* @return array|bool|null
*/
private function associativeArrayIntersect(array $arr1, array $arr2)
{
$commonKeys = array_intersect(array_keys($arr1), array_keys($arr2));
$ret = [];
foreach ($commonKeys as $key) {
$return = $this->arrayIntersectRecursive($arr1[$key], $arr2[$key]);
if ($return) {
$ret[$key] = $return;
continue;
}
if ($this->isEqualValue($arr1[$key], $arr2[$key])) {
$ret[$key] = $arr1[$key];
}
}
if (empty($commonKeys)) {
foreach ($arr2 as $arr) {
$return = $this->arrayIntersectRecursive($arr1, $arr);
if ($return && $return == $arr1) {
return $return;
}
}
}
if (count($ret) < min(count($arr1), count($arr2))) {
return null;
}
return $ret;
}
private function isEqualValue($val1, $val2)
{
if (is_numeric($val1)) {
$val1 = (string) $val1;
}
if (is_numeric($val2)) {
$val2 = (string) $val2;
}
return $val1 === $val2;
}
}