mirror of
https://github.com/kamilwylegala/cakephp2-php8.git
synced 2024-11-15 11:28:25 +00:00
Removing methods from Set test case
git-svn-id: https://svn.cakephp.org/repo/branches/1.2.x.x@6524 3807eeeb-6ff5-0310-8944-8be069107fe0
This commit is contained in:
parent
ae57eecc19
commit
dfe2ead19e
1 changed files with 1 additions and 51 deletions
|
@ -1077,7 +1077,6 @@ class SetTest extends UnitTestCase {
|
|||
)
|
||||
));
|
||||
$this->assertEqual($result, $expected);
|
||||
|
||||
$string ='<data><post title="Title of this post" description="cool" /></data>';
|
||||
|
||||
$xml = new Xml($string);
|
||||
|
@ -1090,55 +1089,6 @@ class SetTest extends UnitTestCase {
|
|||
$set = new Set(array('a' => 'hi'));
|
||||
$this->assertFalse($set->check('a.b'));
|
||||
}
|
||||
|
||||
function __flatten($results, $key = null) {
|
||||
$stack = array();
|
||||
foreach ($results as $k => $r) {
|
||||
if (is_array($r)) {
|
||||
$stack = am($stack, Set::__flatten($r, $k));
|
||||
} else {
|
||||
if (!$key) {
|
||||
$key = $k;
|
||||
}
|
||||
$stack[] = array(
|
||||
'id' => $key,
|
||||
'value' => $r
|
||||
);
|
||||
}
|
||||
}
|
||||
return $stack;
|
||||
}
|
||||
|
||||
/**
|
||||
* Sorts an array by any value, determined by a Set-compatible path
|
||||
*
|
||||
* @param array $data
|
||||
* @param string $path A Set-compatible path to the array value
|
||||
* @param string $dir asc/desc
|
||||
* @return unknown
|
||||
*/
|
||||
function sort($data, $path, $dir) {
|
||||
|
||||
$result = Set::extract($data, $path);
|
||||
$result = Set::__flatten($result);
|
||||
$keys = Set::extract($result, '{n}.id');
|
||||
$values = Set::extract($result, '{n}.value');
|
||||
|
||||
if ($dir == 'asc') {
|
||||
$dir = SORT_ASC;
|
||||
}
|
||||
if ($dir == 'desc') {
|
||||
$dir = SORT_DESC;
|
||||
}
|
||||
|
||||
array_multisort($values, $dir, $keys, $dir);
|
||||
|
||||
$sorted = array();
|
||||
foreach ($keys as $k) {
|
||||
$sorted[] = $data[$k];
|
||||
}
|
||||
return $sorted;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
?>
|
Loading…
Reference in a new issue