|  support |  documentation |  report a bug |  advanced search |  search howto |  statistics |  random bug |  login
Bug #55062 comparison function is not anticommutative for arrays claimed to be comparable
Submitted: 2011-06-29 05:39 UTC Modified: -
Avg. Score:1.0 ± 0.0
Reproduced:1 of 1 (100.0%)
Same Version:1 (100.0%)
Same OS:1 (100.0%)
From: Assigned:
Status: Open Package: Scripting Engine problem
PHP Version: trunk-SVN-2011-06-29 (SVN) OS: Irrelevant
Private report: No CVE-ID: None
View Add Comment Developer Edit
Welcome! If you don't have a Git account, you can't do anything here.
You can add a comment by following this link or if you reported this bug, you can edit this bug over here.
Block user comment
Status: Assign to:
Bug Type:
New email:
PHP Version: OS:


 [2011-06-29 05:39 UTC]
This discussion is limited to the subsets of the array domain with elements that the manual claims are comparable between each other:
«Array with fewer members is smaller, if key from operand 1 is not found in operand 2 then arrays are uncomparable, otherwise - compare value by value»
Whether the relations should be total (or partial) orders in the entire array domain is beyond the scope of this bug report.

The comparison function used to compare arrays with the operators, <, <=, >, >= is not anticommutative, i.e., swapping the arguments doesn't change the sign. It should be the case that

cmp(a, b) = - cmp(b, a)

The reason for this is that the relations <, <=, >, >=  should be antisymmetric, i.e., R(a, b) and R(b, a) cannot both be true unless maybe a == b (in which case the relation is reflexive, as is the case of <= and >=).

The relationship between the comparison function and the relations easily follows by how the relations are defined:
a < b  === cmp(a,b) == -1
a <= b === cmp(a,b) <= 0
a > b  === cmp(b,a) == -1
a >= b === cmp(b,a) <= 0

It is important that the relations are antisymmetric because it's a requirement for relation to be a total (or even partial!) order. Without that property, it's impossible to, for instance, reliably sort or do a binary search in an array of arrays.

The problem is the comparison function is sensitive to the order of the arguments. It starts by comparing the value of the first element of the first operand with the corresponding (i.e., with the same key) element in the second operand. One can see that, for any two arrays with the same length and keys, if reset($a) < $b[key($a)] && reset($b) < $x[key($a)], then $a < $b and $b < $a.


Test script:
$b = array("a" => 1, "b" => 2);
$a = array("b" => 1, "a" => 2);
var_dump($a < $b);
var_dump($b < $a);
var_dump($b > $a);
var_dump($a > $b);

Expected result:
bool(true)   //or false
bool(false)  //or true
bool(true)   //or false
bool(false)  //or true

Actual result:


Add a Patch

Pull Requests

Add a Pull Request

PHP Copyright © 2001-2020 The PHP Group
All rights reserved.
Last updated: Wed Aug 12 10:01:25 2020 UTC