blocks|key|771900|text|将目标与干草堆相交，并确保相交恰好等于目标：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|771901|$haystack+=+array(...);

$target+=+array('foo',+'bar');

if(count(array_intersect($haystack,+$target))+==+count($target)){
++++//+all+of+$target+is+in+$haystack
}|code-block|syntax|javascript|771902|请注意，您只需验证结果交集的大小与目标值数组的大小相同，即可确定$haystack是$target的超集。|offset|length|style|CODE|771903|要验证$haystack中是否也存在$target中的至少一个值，可以执行以下检查：|771904|+if(count(array_intersect($haystack,+$target))+>+0){
+++++//+at+least+one+of+$target+is+in+$haystack
+}|771905|entityMap^0|0|0|W|9|16|7|0|3|9|I|7|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|U|8|@$I|V|J|W|K|L]|$I|X|J|Y|K|L]]|9|@]|A|$]]|$1|M|3|N|5|6|7|Z|8|@$I|10|J|11|K|L]|$I|12|J|13|K|L]]|9|@]|A|$]]|$1|O|3|P|5|D|7|14|8|@]|9|@]|A|$E|F]]|$1|Q|3|-4|5|6|7|15|8|@]|9|@]|A|$]]]|R|$]]

Intersect the targets with the haystack and make sure the intersection is precisely equal to the targets:

<pre><code>$haystack = array(...);

$target = array('foo', 'bar');

if(count(array_intersect($haystack, $target)) == count($target)){
 // all of $target is in $haystack
}
</code></pre>

Note that you only need to verify the size of the resulting intersection is the same size as the array of target values to say that <code>$haystack</code> is a superset of <code>$target</code>.

To verify that at least one value in <code>$target</code> is also in <code>$haystack</code>, you can do this check:

<pre><code> if(count(array_intersect($haystack, $target)) &gt; 0){
 // at least one of $target is in $haystack
 }
</code></pre>

blocks|key|772033|text|作为一名开发人员，您可能应该开始学习集合操作(差、并、交)。你可以把你的数组想象成一个“集合”，而你正在搜索的密钥则是另一个。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|772034|检查是否所有的针都存在|772035|function+in_array_all($needles,+$haystack)+{
+++return+empty(array_diff($needles,+$haystack));
}

echo+in_array_all(+[3,2,5],+[5,8,3,1,2]+);+//+true,+all+3,+2,+5+present
echo+in_array_all(+[3,2,5,9],+[5,8,3,1,2]+);+//+false,+since+9+is+not+present|code-block|syntax|javascript|772036|检查针头是否存在|772037|function+in_array_any($needles,+$haystack)+{
+++return+!empty(array_intersect($needles,+$haystack));
}

echo+in_array_any(+[3,9],+[5,8,3,1,2]+);+//+true,+since+3+is+present
echo+in_array_any(+[4,9],+[5,8,3,1,2]+);+//+false,+neither+4+nor+9+is+present|772038|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|P|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|Q|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|R|8|@]|9|@]|A|$]]|$1|K|3|L|5|F|7|S|8|@]|9|@]|A|$G|H]]|$1|M|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|N|$]]

As a developer, you should probably start learning set operations (difference, union, intersection). You can imagine your array as one "set", and the keys you are searching for the other.

<h1>Check if ALL needles exist</h1>

<pre><code>function in_array_all($needles, $haystack) {
 return empty(array_diff($needles, $haystack));
}

echo in_array_all( [3,2,5], [5,8,3,1,2] ); // true, all 3, 2, 5 present
echo in_array_all( [3,2,5,9], [5,8,3,1,2] ); // false, since 9 is not present
</code></pre>

<h1>Check if ANY of the needles exist</h1>

<pre><code>function in_array_any($needles, $haystack) {
 return !empty(array_intersect($needles, $haystack));
}

echo in_array_any( [3,9], [5,8,3,1,2] ); // true, since 3 is present
echo in_array_any( [4,9], [5,8,3,1,2] ); // false, neither 4 nor 9 is present
</code></pre>

blocks|key|771811|text|if(in_array('foo',$arg)+&&+in_array('bar',$arg)){
++++//both+of+them+are+in+$arg
}

if(in_array('foo',$arg)+%7C%7C+in_array('bar',$arg)){
++++//at+least+one+of+them+are+in+$arg
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|771812|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>if(in_array('foo',$arg) &amp;&amp; in_array('bar',$arg)){
 //both of them are in $arg
}

if(in_array('foo',$arg) || in_array('bar',$arg)){
 //at least one of them are in $arg
}
</code></pre>

blocks|key|555582|text|使用@Rok+Kralj+answer+(最好的国际海事组织)来检查大海桑田，你可以使用(bool)而不是!!，后者在代码审查期间有时会让人感到困惑。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|555583|function+in_array_any($needles,+$haystack)+{
+++return+(bool)array_intersect($needles,+$haystack);
}

echo+in_array_any(+array(3,9),+array(5,8,3,1,2)+);+//+true,+since+3+is+present
echo+in_array_any(+array(4,9),+array(5,8,3,1,2)+);+//+false,+neither+4+nor+9+is+present|code-block|syntax|javascript|555584|https://glot.io/snippets/f7dhw4kmju|555585|entityMap|0|LINK|mutability|MUTABLE|url^0|18|6|1H|2|0|0|0|Z|0|0^^$0|@$1|2|3|4|5|6|7|T|8|@$9|U|A|V|B|C]|$9|W|A|X|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|Y|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|Z|8|@]|D|@$9|10|A|11|1|12]]|E|$]]|$1|M|3|-4|5|6|7|13|8|@]|D|@]|E|$]]]|N|$O|$5|P|Q|R|E|$S|L]]]]

Going off of @Rok Kralj answer (best IMO) to check if any of needles exist in the haystack, you can use <code>(bool)</code> instead of <code>!!</code> which sometimes can be confusing during code review.

<pre><code>function in_array_any($needles, $haystack) {
 return (bool)array_intersect($needles, $haystack);
}

echo in_array_any( array(3,9), array(5,8,3,1,2) ); // true, since 3 is present
echo in_array_any( array(4,9), array(5,8,3,1,2) ); // false, neither 4 nor 9 is present
</code></pre>

<a href="https://glot.io/snippets/f7dhw4kmju" rel="nofollow noreferrer">https://glot.io/snippets/f7dhw4kmju</a>

blocks|key|771981|text|对于这个问题，Mark+Elliot的解决方案是最好的。如果您需要在数组元素之间进行更复杂的比较操作，并且您使用的是PHP+5.3，那么您可能还需要考虑如下内容：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|771982|<?php

//+First+Array+To+Compare
$a1+=+array('foo','bar','c');

//+Target+Array
$b1+=+array('foo','bar');


//+Evaluation+Function+-+we+pass+guard+and+target+array
$b=true;
$test+=+function($x)+use+(&$b,+$b1)+{
++++++++if+(!in_array($x,$b1))+{
++++++++++++++++$b=false;
++++++++}
};


//+Actual+Test+on+array+(can+be+repeated+with+others,+but+guard+
//+needs+to+be+initialized+again,+due+to+by+reference+assignment+above)
array_walk($a1,+$test);
var_dump($b);|code-block|syntax|javascript|771983|这依赖于闭包；比较函数可以变得更加强大。祝好运!|771984|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

IMHO Mark Elliot's solution's best one for this problem. If you need to make more complex comparison operations between array elements AND you're on PHP 5.3, you might also think about something like the following:

<pre><code>&lt;?php

// First Array To Compare
$a1 = array('foo','bar','c');

// Target Array
$b1 = array('foo','bar');


// Evaluation Function - we pass guard and target array
$b=true;
$test = function($x) use (&amp;$b, $b1) {
 if (!in_array($x,$b1)) {
 $b=false;
 }
};


// Actual Test on array (can be repeated with others, but guard 
// needs to be initialized again, due to by reference assignment above)
array_walk($a1, $test);
var_dump($b);
</code></pre>

This relies on a closure; comparison function can become much more powerful.
Good luck!

blocks|key|555646|text|如果你只是想通过比较检查来优化这个搜索，我会这么做的：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|555647|public+function+items_in_array($needles,+$haystack)
{
++++foreach+($needles+as+$needle)+{
++++++++if+(!in_array($needle,+$haystack))+{
++++++++++++return+false;
++++++++}
++++}

++++return+true;
}|code-block|syntax|javascript|555648|如果你愿意丑陋地做这件事，做多个if(in_array(...&&in_array(...会更快。|offset|length|style|CODE|555649|我使用array_intersect、array_diff和in_array分别对100个和100,000个阵列元素以及2到15个针头进行了测试。|555650|in_array总是快得多，即使我必须为不同的针头做15倍的操作。array_diff的速度也比array_intersect快得多。|555651|因此，如果您只是想搜索一些东西，看看它们是否存在于数组中，那么in_array()在性能方面是最好的。如果您需要知道实际的差异/匹配，那么使用array_diff/array_intersect可能更简单。|555652|如果我在下面这个丑陋的例子中计算错误，请随时告诉我。|555653|<?php



$n1+=+rand(0,100000);
$n2+=+rand(0,100000);
$n2+=+rand(0,100000);
$n3+=+rand(0,100000);
$n4+=+rand(0,100000);
$n5+=+rand(0,100000);
$n6+=+rand(0,100000);
$n7+=+rand(0,100000);
$n8+=+rand(0,100000);
$n9+=+rand(0,100000);
$n10+=+rand(0,100000);
$n11+=+rand(0,100000);
$n12+=+rand(0,100000);
$n13+=+rand(0,100000);
$n14+=+rand(0,100000);
$n15+=+rand(0,100000);
$narr+=+[$n1,+$n2,+$n3,+$n4,+$n5,+$n6,+$n7,+$n8,+$n9,+$n10,+$n11,+$n12,+$n13,+$n14,+$n15];

$arr+=+[];
for($i+=+0;+$i<100000+;+$i%2B%2B)
{
++++
++++$arr[]+=+rand(0,100000);
++++
}


function+array_in_array($needles,+$haystack)
{
++++foreach($needles+as+$needle)
++++{
++++
++++++++if+(!in_array($needle,+$haystack))
++++++++++++{
++++++++++++++++return+false;
++++++++++++}

++++}
++++
++++return+true;
}

$start_time+=+microtime(true);
$failed+=+true;
if(array_in_array($narr,+$arr))
{
++++echo+" true0 ";
}

$total_time+=+microtime(true)+-+$start_time;
echo+"<hr>";
echo($total_time);



$start_time+=+microtime(true);

if+(
++++in_array($n1,+$arr)+!==+false+&&
++++in_array($n2,+$arr)+!==+false+&&
++++in_array($n3,+$arr)+!==+false+&&
++++in_array($n4,+$arr)+!==+false+&&
++++in_array($n5,+$arr)+!==+false+&&
++++in_array($n6,+$arr)+!==+false+&&
++++in_array($n7,+$arr)+!==+false+&&
++++in_array($n8,+$arr)+!==+false+&&
++++in_array($n9,+$arr)+!==+false+&&
++++in_array($n10,+$arr)+!==+false+&&
++++in_array($n11,+$arr)+!==+false+&&
++++in_array($n12,+$arr)+!==+false+&&
++++in_array($n13,+$arr)+!==+false+&&
++++in_array($n14,+$arr)+!==+false+&&
++++in_array($n15,+$arr)!==+false)+{
++++echo+" true1 ";
}

$total_time+=+microtime(true)+-+$start_time;
echo+"<hr>";
echo($total_time);

$first_time+=+$total_time;

echo+"<hr>";

$start_time+=+microtime(true);

if+(empty($diff+=+array_diff($narr,$arr)))
{

++++echo+" true2 ";
}


$total_time+=+microtime(true)+-+$start_time;
echo($total_time);
print_r($diff);
echo+"<hr>";

echo+"<hr>";
if+($first_time+>+$total_time)
{
++++echo+"First+time+was+slower";
}

if+($first_time+<+$total_time)
{
++++echo+"First+time+was+faster";
}

echo+"<hr>";


$start_time+=+microtime(true);

if+(count(($itrs+=+array_intersect($narr,$arr)))+==+count($narr))
{

++++echo+" true3 ";
++++print_r($result);
}


$total_time+=+microtime(true)+-+$start_time;
echo+"<hr>";
echo($total_time);

print_r($itrs);

echo+"<hr>";

if+($first_time+<+$total_time)
{
++++echo+"First+time+was+faster";
}


echo+"<hr>";
print_r($narr);
echo+"<hr>";
print_r($arr);|555654|entityMap^0|0|0|G|T|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|Z|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|10|8|@$I|11|J|12|K|L]]|9|@]|A|$]]|$1|M|3|N|5|6|7|13|8|@]|9|@]|A|$]]|$1|O|3|P|5|6|7|14|8|@]|9|@]|A|$]]|$1|Q|3|R|5|6|7|15|8|@]|9|@]|A|$]]|$1|S|3|T|5|6|7|16|8|@]|9|@]|A|$]]|$1|U|3|V|5|D|7|17|8|@]|9|@]|A|$E|F]]|$1|W|3|-4|5|6|7|18|8|@]|9|@]|A|$]]]|X|$]]

If you're looking to optimize this search with just a comparison check only I would do:
<pre><code>public function items_in_array($needles, $haystack)
{
 foreach ($needles as $needle) {
 if (!in_array($needle, $haystack)) {
 return false;
 }
 }

 return true;
}
</code></pre>
if you're willing to do it ugly doing multiple <code>if(in_array(...&amp;&amp;in_array(...</code> is even faster.
I did a test with 100 and another with 100,000 array elements and between 2 and 15 needles using array_intersect, array_diff, and in_array.
in_array was always significantly faster even when I had to do it 15x for different needles. array_diff was also quite a bit faster than array_intersect.
So if you're just trying to search for a couple of things to see if they exist in an array in_array() is best performance-wise. If you need to know the actual differences/matches then it's probably just easier to use array_diff/array_intersect.
Feel free to let me know if I did my calculations wrong in the ugly example below.
<pre><code>&lt;?php



$n1 = rand(0,100000);
$n2 = rand(0,100000);
$n2 = rand(0,100000);
$n3 = rand(0,100000);
$n4 = rand(0,100000);
$n5 = rand(0,100000);
$n6 = rand(0,100000);
$n7 = rand(0,100000);
$n8 = rand(0,100000);
$n9 = rand(0,100000);
$n10 = rand(0,100000);
$n11 = rand(0,100000);
$n12 = rand(0,100000);
$n13 = rand(0,100000);
$n14 = rand(0,100000);
$n15 = rand(0,100000);
$narr = [$n1, $n2, $n3, $n4, $n5, $n6, $n7, $n8, $n9, $n10, $n11, $n12, $n13, $n14, $n15];

$arr = [];
for($i = 0; $i&lt;100000 ; $i++)
{
 
 $arr[] = rand(0,100000);
 
}


function array_in_array($needles, $haystack)
{
 foreach($needles as $needle)
 {
 
 if (!in_array($needle, $haystack))
 {
 return false;
 }

 }
 
 return true;
}

$start_time = microtime(true);
$failed = true;
if(array_in_array($narr, $arr))
{
 echo &quot;&lt;br&gt;true0&lt;br&gt;&quot;;
}

$total_time = microtime(true) - $start_time;
echo &quot;&lt;hr&gt;&quot;;
echo($total_time);



$start_time = microtime(true);

if (
 in_array($n1, $arr) !== false &amp;&amp;
 in_array($n2, $arr) !== false &amp;&amp;
 in_array($n3, $arr) !== false &amp;&amp;
 in_array($n4, $arr) !== false &amp;&amp;
 in_array($n5, $arr) !== false &amp;&amp;
 in_array($n6, $arr) !== false &amp;&amp;
 in_array($n7, $arr) !== false &amp;&amp;
 in_array($n8, $arr) !== false &amp;&amp;
 in_array($n9, $arr) !== false &amp;&amp;
 in_array($n10, $arr) !== false &amp;&amp;
 in_array($n11, $arr) !== false &amp;&amp;
 in_array($n12, $arr) !== false &amp;&amp;
 in_array($n13, $arr) !== false &amp;&amp;
 in_array($n14, $arr) !== false &amp;&amp;
 in_array($n15, $arr)!== false) {
 echo &quot;&lt;br&gt;true1&lt;br&gt;&quot;;
}

$total_time = microtime(true) - $start_time;
echo &quot;&lt;hr&gt;&quot;;
echo($total_time);

$first_time = $total_time;

echo &quot;&lt;hr&gt;&quot;;

$start_time = microtime(true);

if (empty($diff = array_diff($narr,$arr)))
{

 echo &quot;&lt;br&gt;true2&lt;br&gt;&quot;;
}


$total_time = microtime(true) - $start_time;
echo($total_time);
print_r($diff);
echo &quot;&lt;hr&gt;&quot;;

echo &quot;&lt;hr&gt;&quot;;
if ($first_time &gt; $total_time)
{
 echo &quot;First time was slower&quot;;
}

if ($first_time &lt; $total_time)
{
 echo &quot;First time was faster&quot;;
}

echo &quot;&lt;hr&gt;&quot;;


$start_time = microtime(true);

if (count(($itrs = array_intersect($narr,$arr))) == count($narr))
{

 echo &quot;&lt;br&gt;true3&lt;br&gt;&quot;;
 print_r($result);
}


$total_time = microtime(true) - $start_time;
echo &quot;&lt;hr&gt;&quot;;
echo($total_time);

print_r($itrs);

echo &quot;&lt;hr&gt;&quot;;

if ($first_time &lt; $total_time)
{
 echo &quot;First time was faster&quot;;
}


echo &quot;&lt;hr&gt;&quot;;
print_r($narr);
echo &quot;&lt;hr&gt;&quot;;
print_r($arr);
</code></pre>

How do I check for multiple values, such as:

<pre><code>$arg = array('foo','bar');

if(in_array('foo','bar',$arg))
</code></pre>

That's an example so you understand a bit better, I know it won't work.

in_array multiple values

如何检查多个值，例如：$arg = array('foo','bar');if(in_array('foo','bar',$arg))这是一个例子，所以你可以更好地理解，我知道它不会起作用。

问in_array多个值
EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问in_array多个值EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问in_array多个值
EN