TreeBehavior.php 38 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075
  1. <?php
  2. /**
  3. * Tree behavior class.
  4. *
  5. * Enables a model object to act as a node-based tree.
  6. *
  7. * PHP 5
  8. *
  9. * CakePHP : Rapid Development Framework (http://cakephp.org)
  10. * Copyright (c) Cake Software Foundation, Inc. (http://cakefoundation.org)
  11. *
  12. * Licensed under The MIT License
  13. * For full copyright and license information, please see the LICENSE.txt
  14. * Redistributions of files must retain the above copyright notice.
  15. *
  16. * @copyright Copyright (c) Cake Software Foundation, Inc. (http://cakefoundation.org)
  17. * @link http://cakephp.org CakePHP Project
  18. * @package Cake.Model.Behavior
  19. * @since CakePHP v 1.2.0.4487
  20. * @license http://www.opensource.org/licenses/mit-license.php MIT License
  21. */
  22. App::uses('ModelBehavior', 'Model');
  23. /**
  24. * Tree Behavior.
  25. *
  26. * Enables a model object to act as a node-based tree. Using Modified Preorder Tree Traversal
  27. *
  28. * @see http://en.wikipedia.org/wiki/Tree_traversal
  29. * @package Cake.Model.Behavior
  30. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html
  31. */
  32. class TreeBehavior extends ModelBehavior {
  33. /**
  34. * Errors
  35. *
  36. * @var array
  37. */
  38. public $errors = array();
  39. /**
  40. * Defaults
  41. *
  42. * @var array
  43. */
  44. protected $_defaults = array(
  45. 'parent' => 'parent_id', 'left' => 'lft', 'right' => 'rght',
  46. 'scope' => '1 = 1', 'type' => 'nested', '__parentChange' => false, 'recursive' => -1
  47. );
  48. /**
  49. * Used to preserve state between delete callbacks.
  50. *
  51. * @var array
  52. */
  53. protected $_deletedRow = array();
  54. /**
  55. * Initiate Tree behavior
  56. *
  57. * @param Model $Model instance of model
  58. * @param array $config array of configuration settings.
  59. * @return void
  60. */
  61. public function setup(Model $Model, $config = array()) {
  62. if (isset($config[0])) {
  63. $config['type'] = $config[0];
  64. unset($config[0]);
  65. }
  66. $settings = array_merge($this->_defaults, $config);
  67. if (in_array($settings['scope'], $Model->getAssociated('belongsTo'))) {
  68. $data = $Model->getAssociated($settings['scope']);
  69. $Parent = $Model->{$settings['scope']};
  70. $settings['scope'] = $Model->escapeField($data['foreignKey']) . ' = ' . $Parent->escapeField();
  71. $settings['recursive'] = 0;
  72. }
  73. $this->settings[$Model->alias] = $settings;
  74. }
  75. /**
  76. * After save method. Called after all saves
  77. *
  78. * Overridden to transparently manage setting the lft and rght fields if and only if the parent field is included in the
  79. * parameters to be saved.
  80. *
  81. * @param Model $Model Model instance.
  82. * @param boolean $created indicates whether the node just saved was created or updated
  83. * @param array $options Options passed from Model::save().
  84. * @return boolean true on success, false on failure
  85. */
  86. public function afterSave(Model $Model, $created, $options = array()) {
  87. extract($this->settings[$Model->alias]);
  88. if ($created) {
  89. if ((isset($Model->data[$Model->alias][$parent])) && $Model->data[$Model->alias][$parent]) {
  90. return $this->_setParent($Model, $Model->data[$Model->alias][$parent], $created);
  91. }
  92. } elseif ($this->settings[$Model->alias]['__parentChange']) {
  93. $this->settings[$Model->alias]['__parentChange'] = false;
  94. return $this->_setParent($Model, $Model->data[$Model->alias][$parent]);
  95. }
  96. }
  97. /**
  98. * Runs before a find() operation
  99. *
  100. * @param Model $Model Model using the behavior
  101. * @param array $query Query parameters as set by cake
  102. * @return array
  103. */
  104. public function beforeFind(Model $Model, $query) {
  105. if ($Model->findQueryType === 'threaded' && !isset($query['parent'])) {
  106. $query['parent'] = $this->settings[$Model->alias]['parent'];
  107. }
  108. return $query;
  109. }
  110. /**
  111. * Stores the record about to be deleted.
  112. *
  113. * This is used to delete child nodes in the afterDelete.
  114. *
  115. * @param Model $Model Model instance
  116. * @param boolean $cascade
  117. * @return boolean
  118. */
  119. public function beforeDelete(Model $Model, $cascade = true) {
  120. extract($this->settings[$Model->alias]);
  121. $data = $Model->find('first', array(
  122. 'conditions' => array($Model->escapeField($Model->primaryKey) => $Model->id),
  123. 'fields' => array($Model->escapeField($left), $Model->escapeField($right)),
  124. 'recursive' => -1));
  125. if ($data) {
  126. $this->_deletedRow[$Model->alias] = current($data);
  127. }
  128. return true;
  129. }
  130. /**
  131. * After delete method.
  132. *
  133. * Will delete the current node and all children using the deleteAll method and sync the table
  134. *
  135. * @param Model $Model Model instance
  136. * @return boolean true to continue, false to abort the delete
  137. */
  138. public function afterDelete(Model $Model) {
  139. extract($this->settings[$Model->alias]);
  140. $data = $this->_deletedRow[$Model->alias];
  141. $this->_deletedRow[$Model->alias] = null;
  142. if (!$data[$right] || !$data[$left]) {
  143. return true;
  144. }
  145. $diff = $data[$right] - $data[$left] + 1;
  146. if ($diff > 2) {
  147. if (is_string($scope)) {
  148. $scope = array($scope);
  149. }
  150. $scope[][$Model->escapeField($left) . " BETWEEN ? AND ?"] = array($data[$left] + 1, $data[$right] - 1);
  151. $Model->deleteAll($scope);
  152. }
  153. $this->_sync($Model, $diff, '-', '> ' . $data[$right]);
  154. return true;
  155. }
  156. /**
  157. * Before save method. Called before all saves
  158. *
  159. * Overridden to transparently manage setting the lft and rght fields if and only if the parent field is included in the
  160. * parameters to be saved. For newly created nodes with NO parent the left and right field values are set directly by
  161. * this method bypassing the setParent logic.
  162. *
  163. * @since 1.2
  164. * @param Model $Model Model instance
  165. * @param array $options Options passed from Model::save().
  166. * @return boolean true to continue, false to abort the save
  167. * @see Model::save()
  168. */
  169. public function beforeSave(Model $Model, $options = array()) {
  170. extract($this->settings[$Model->alias]);
  171. $this->_addToWhitelist($Model, array($left, $right));
  172. if (!$Model->id || !$Model->exists()) {
  173. if (array_key_exists($parent, $Model->data[$Model->alias]) && $Model->data[$Model->alias][$parent]) {
  174. $parentNode = $Model->find('first', array(
  175. 'conditions' => array($scope, $Model->escapeField() => $Model->data[$Model->alias][$parent]),
  176. 'fields' => array($Model->primaryKey, $right), 'recursive' => $recursive
  177. ));
  178. if (!$parentNode) {
  179. return false;
  180. }
  181. list($parentNode) = array_values($parentNode);
  182. $Model->data[$Model->alias][$left] = 0;
  183. $Model->data[$Model->alias][$right] = 0;
  184. } else {
  185. $edge = $this->_getMax($Model, $scope, $right, $recursive);
  186. $Model->data[$Model->alias][$left] = $edge + 1;
  187. $Model->data[$Model->alias][$right] = $edge + 2;
  188. }
  189. } elseif (array_key_exists($parent, $Model->data[$Model->alias])) {
  190. if ($Model->data[$Model->alias][$parent] != $Model->field($parent)) {
  191. $this->settings[$Model->alias]['__parentChange'] = true;
  192. }
  193. if (!$Model->data[$Model->alias][$parent]) {
  194. $Model->data[$Model->alias][$parent] = null;
  195. $this->_addToWhitelist($Model, $parent);
  196. } else {
  197. $values = $Model->find('first', array(
  198. 'conditions' => array($scope, $Model->escapeField() => $Model->id),
  199. 'fields' => array($Model->primaryKey, $parent, $left, $right), 'recursive' => $recursive)
  200. );
  201. if ($values === false) {
  202. return false;
  203. }
  204. list($node) = array_values($values);
  205. $parentNode = $Model->find('first', array(
  206. 'conditions' => array($scope, $Model->escapeField() => $Model->data[$Model->alias][$parent]),
  207. 'fields' => array($Model->primaryKey, $left, $right), 'recursive' => $recursive
  208. ));
  209. if (!$parentNode) {
  210. return false;
  211. }
  212. list($parentNode) = array_values($parentNode);
  213. if (($node[$left] < $parentNode[$left]) && ($parentNode[$right] < $node[$right])) {
  214. return false;
  215. } elseif ($node[$Model->primaryKey] == $parentNode[$Model->primaryKey]) {
  216. return false;
  217. }
  218. }
  219. }
  220. return true;
  221. }
  222. /**
  223. * Get the number of child nodes
  224. *
  225. * If the direct parameter is set to true, only the direct children are counted (based upon the parent_id field)
  226. * If false is passed for the id parameter, all top level nodes are counted, or all nodes are counted.
  227. *
  228. * @param Model $Model Model instance
  229. * @param integer|string|boolean $id The ID of the record to read or false to read all top level nodes
  230. * @param boolean $direct whether to count direct, or all, children
  231. * @return integer number of child nodes
  232. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::childCount
  233. */
  234. public function childCount(Model $Model, $id = null, $direct = false) {
  235. if (is_array($id)) {
  236. extract(array_merge(array('id' => null), $id));
  237. }
  238. if ($id === null && $Model->id) {
  239. $id = $Model->id;
  240. } elseif (!$id) {
  241. $id = null;
  242. }
  243. extract($this->settings[$Model->alias]);
  244. if ($direct) {
  245. return $Model->find('count', array('conditions' => array($scope, $Model->escapeField($parent) => $id)));
  246. }
  247. if ($id === null) {
  248. return $Model->find('count', array('conditions' => $scope));
  249. } elseif ($Model->id === $id && isset($Model->data[$Model->alias][$left]) && isset($Model->data[$Model->alias][$right])) {
  250. $data = $Model->data[$Model->alias];
  251. } else {
  252. $data = $Model->find('first', array('conditions' => array($scope, $Model->escapeField() => $id), 'recursive' => $recursive));
  253. if (!$data) {
  254. return 0;
  255. }
  256. $data = $data[$Model->alias];
  257. }
  258. return ($data[$right] - $data[$left] - 1) / 2;
  259. }
  260. /**
  261. * Get the child nodes of the current model
  262. *
  263. * If the direct parameter is set to true, only the direct children are returned (based upon the parent_id field)
  264. * If false is passed for the id parameter, top level, or all (depending on direct parameter appropriate) are counted.
  265. *
  266. * @param Model $Model Model instance
  267. * @param integer|string $id The ID of the record to read
  268. * @param boolean $direct whether to return only the direct, or all, children
  269. * @param string|array $fields Either a single string of a field name, or an array of field names
  270. * @param string $order SQL ORDER BY conditions (e.g. "price DESC" or "name ASC") defaults to the tree order
  271. * @param integer $limit SQL LIMIT clause, for calculating items per page.
  272. * @param integer $page Page number, for accessing paged data
  273. * @param integer $recursive The number of levels deep to fetch associated records
  274. * @return array Array of child nodes
  275. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::children
  276. */
  277. public function children(Model $Model, $id = null, $direct = false, $fields = null, $order = null, $limit = null, $page = 1, $recursive = null) {
  278. if (is_array($id)) {
  279. extract(array_merge(array('id' => null), $id));
  280. }
  281. $overrideRecursive = $recursive;
  282. if ($id === null && $Model->id) {
  283. $id = $Model->id;
  284. } elseif (!$id) {
  285. $id = null;
  286. }
  287. extract($this->settings[$Model->alias]);
  288. if ($overrideRecursive !== null) {
  289. $recursive = $overrideRecursive;
  290. }
  291. if (!$order) {
  292. $order = $Model->escapeField($left) . " asc";
  293. }
  294. if ($direct) {
  295. $conditions = array($scope, $Model->escapeField($parent) => $id);
  296. return $Model->find('all', compact('conditions', 'fields', 'order', 'limit', 'page', 'recursive'));
  297. }
  298. if (!$id) {
  299. $conditions = $scope;
  300. } else {
  301. $result = array_values((array)$Model->find('first', array(
  302. 'conditions' => array($scope, $Model->escapeField() => $id),
  303. 'fields' => array($left, $right),
  304. 'recursive' => $recursive
  305. )));
  306. if (empty($result) || !isset($result[0])) {
  307. return array();
  308. }
  309. $conditions = array($scope,
  310. $Model->escapeField($right) . ' <' => $result[0][$right],
  311. $Model->escapeField($left) . ' >' => $result[0][$left]
  312. );
  313. }
  314. return $Model->find('all', compact('conditions', 'fields', 'order', 'limit', 'page', 'recursive'));
  315. }
  316. /**
  317. * A convenience method for returning a hierarchical array used for HTML select boxes
  318. *
  319. * @param Model $Model Model instance
  320. * @param string|array $conditions SQL conditions as a string or as an array('field' =>'value',...)
  321. * @param string $keyPath A string path to the key, i.e. "{n}.Post.id"
  322. * @param string $valuePath A string path to the value, i.e. "{n}.Post.title"
  323. * @param string $spacer The character or characters which will be repeated
  324. * @param integer $recursive The number of levels deep to fetch associated records
  325. * @return array An associative array of records, where the id is the key, and the display field is the value
  326. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::generateTreeList
  327. */
  328. public function generateTreeList(Model $Model, $conditions = null, $keyPath = null, $valuePath = null, $spacer = '_', $recursive = null) {
  329. $overrideRecursive = $recursive;
  330. extract($this->settings[$Model->alias]);
  331. if ($overrideRecursive !== null) {
  332. $recursive = $overrideRecursive;
  333. }
  334. $fields = null;
  335. if (!$keyPath && !$valuePath && $Model->hasField($Model->displayField)) {
  336. $fields = array($Model->primaryKey, $Model->displayField, $left, $right);
  337. }
  338. if (!$keyPath) {
  339. $keyPath = '{n}.' . $Model->alias . '.' . $Model->primaryKey;
  340. }
  341. if (!$valuePath) {
  342. $valuePath = array('%s%s', '{n}.tree_prefix', '{n}.' . $Model->alias . '.' . $Model->displayField);
  343. } elseif (is_string($valuePath)) {
  344. $valuePath = array('%s%s', '{n}.tree_prefix', $valuePath);
  345. } else {
  346. array_unshift($valuePath, '%s' . $valuePath[0], '{n}.tree_prefix');
  347. }
  348. $conditions = (array)$conditions;
  349. if ($scope) {
  350. $conditions[] = $scope;
  351. }
  352. $order = $Model->escapeField($left) . " asc";
  353. $results = $Model->find('all', compact('conditions', 'fields', 'order', 'recursive'));
  354. $stack = array();
  355. foreach ($results as $i => $result) {
  356. $count = count($stack);
  357. while ($stack && ($stack[$count - 1] < $result[$Model->alias][$right])) {
  358. array_pop($stack);
  359. $count--;
  360. }
  361. $results[$i]['tree_prefix'] = str_repeat($spacer, $count);
  362. $stack[] = $result[$Model->alias][$right];
  363. }
  364. if (empty($results)) {
  365. return array();
  366. }
  367. return Hash::combine($results, $keyPath, $valuePath);
  368. }
  369. /**
  370. * Get the parent node
  371. *
  372. * reads the parent id and returns this node
  373. *
  374. * @param Model $Model Model instance
  375. * @param integer|string $id The ID of the record to read
  376. * @param string|array $fields
  377. * @param integer $recursive The number of levels deep to fetch associated records
  378. * @return array|boolean Array of data for the parent node
  379. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::getParentNode
  380. */
  381. public function getParentNode(Model $Model, $id = null, $fields = null, $recursive = null) {
  382. if (is_array($id)) {
  383. extract(array_merge(array('id' => null), $id));
  384. }
  385. $overrideRecursive = $recursive;
  386. if (empty($id)) {
  387. $id = $Model->id;
  388. }
  389. extract($this->settings[$Model->alias]);
  390. if ($overrideRecursive !== null) {
  391. $recursive = $overrideRecursive;
  392. }
  393. $parentId = $Model->find('first', array('conditions' => array($Model->primaryKey => $id), 'fields' => array($parent), 'recursive' => -1));
  394. if ($parentId) {
  395. $parentId = $parentId[$Model->alias][$parent];
  396. $parent = $Model->find('first', array('conditions' => array($Model->escapeField() => $parentId), 'fields' => $fields, 'recursive' => $recursive));
  397. return $parent;
  398. }
  399. return false;
  400. }
  401. /**
  402. * Get the path to the given node
  403. *
  404. * @param Model $Model Model instance
  405. * @param integer|string $id The ID of the record to read
  406. * @param string|array $fields Either a single string of a field name, or an array of field names
  407. * @param integer $recursive The number of levels deep to fetch associated records
  408. * @return array Array of nodes from top most parent to current node
  409. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::getPath
  410. */
  411. public function getPath(Model $Model, $id = null, $fields = null, $recursive = null) {
  412. if (is_array($id)) {
  413. extract(array_merge(array('id' => null), $id));
  414. }
  415. $overrideRecursive = $recursive;
  416. if (empty($id)) {
  417. $id = $Model->id;
  418. }
  419. extract($this->settings[$Model->alias]);
  420. if ($overrideRecursive !== null) {
  421. $recursive = $overrideRecursive;
  422. }
  423. $result = $Model->find('first', array('conditions' => array($Model->escapeField() => $id), 'fields' => array($left, $right), 'recursive' => $recursive));
  424. if ($result) {
  425. $result = array_values($result);
  426. } else {
  427. return null;
  428. }
  429. $item = $result[0];
  430. $results = $Model->find('all', array(
  431. 'conditions' => array($scope, $Model->escapeField($left) . ' <=' => $item[$left], $Model->escapeField($right) . ' >=' => $item[$right]),
  432. 'fields' => $fields, 'order' => array($Model->escapeField($left) => 'asc'), 'recursive' => $recursive
  433. ));
  434. return $results;
  435. }
  436. /**
  437. * Reorder the node without changing the parent.
  438. *
  439. * If the node is the last child, or is a top level node with no subsequent node this method will return false
  440. *
  441. * @param Model $Model Model instance
  442. * @param integer|string $id The ID of the record to move
  443. * @param integer|boolean $number how many places to move the node or true to move to last position
  444. * @return boolean true on success, false on failure
  445. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::moveDown
  446. */
  447. public function moveDown(Model $Model, $id = null, $number = 1) {
  448. if (is_array($id)) {
  449. extract(array_merge(array('id' => null), $id));
  450. }
  451. if (!$number) {
  452. return false;
  453. }
  454. if (empty($id)) {
  455. $id = $Model->id;
  456. }
  457. extract($this->settings[$Model->alias]);
  458. list($node) = array_values($Model->find('first', array(
  459. 'conditions' => array($scope, $Model->escapeField() => $id),
  460. 'fields' => array($Model->primaryKey, $left, $right, $parent), 'recursive' => $recursive
  461. )));
  462. if ($node[$parent]) {
  463. list($parentNode) = array_values($Model->find('first', array(
  464. 'conditions' => array($scope, $Model->escapeField() => $node[$parent]),
  465. 'fields' => array($Model->primaryKey, $left, $right), 'recursive' => $recursive
  466. )));
  467. if (($node[$right] + 1) == $parentNode[$right]) {
  468. return false;
  469. }
  470. }
  471. $nextNode = $Model->find('first', array(
  472. 'conditions' => array($scope, $Model->escapeField($left) => ($node[$right] + 1)),
  473. 'fields' => array($Model->primaryKey, $left, $right), 'recursive' => $recursive)
  474. );
  475. if ($nextNode) {
  476. list($nextNode) = array_values($nextNode);
  477. } else {
  478. return false;
  479. }
  480. $edge = $this->_getMax($Model, $scope, $right, $recursive);
  481. $this->_sync($Model, $edge - $node[$left] + 1, '+', 'BETWEEN ' . $node[$left] . ' AND ' . $node[$right]);
  482. $this->_sync($Model, $nextNode[$left] - $node[$left], '-', 'BETWEEN ' . $nextNode[$left] . ' AND ' . $nextNode[$right]);
  483. $this->_sync($Model, $edge - $node[$left] - ($nextNode[$right] - $nextNode[$left]), '-', '> ' . $edge);
  484. if (is_int($number)) {
  485. $number--;
  486. }
  487. if ($number) {
  488. $this->moveDown($Model, $id, $number);
  489. }
  490. return true;
  491. }
  492. /**
  493. * Reorder the node without changing the parent.
  494. *
  495. * If the node is the first child, or is a top level node with no previous node this method will return false
  496. *
  497. * @param Model $Model Model instance
  498. * @param integer|string $id The ID of the record to move
  499. * @param integer|boolean $number how many places to move the node, or true to move to first position
  500. * @return boolean true on success, false on failure
  501. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::moveUp
  502. */
  503. public function moveUp(Model $Model, $id = null, $number = 1) {
  504. if (is_array($id)) {
  505. extract(array_merge(array('id' => null), $id));
  506. }
  507. if (!$number) {
  508. return false;
  509. }
  510. if (empty($id)) {
  511. $id = $Model->id;
  512. }
  513. extract($this->settings[$Model->alias]);
  514. list($node) = array_values($Model->find('first', array(
  515. 'conditions' => array($scope, $Model->escapeField() => $id),
  516. 'fields' => array($Model->primaryKey, $left, $right, $parent), 'recursive' => $recursive
  517. )));
  518. if ($node[$parent]) {
  519. list($parentNode) = array_values($Model->find('first', array(
  520. 'conditions' => array($scope, $Model->escapeField() => $node[$parent]),
  521. 'fields' => array($Model->primaryKey, $left, $right), 'recursive' => $recursive
  522. )));
  523. if (($node[$left] - 1) == $parentNode[$left]) {
  524. return false;
  525. }
  526. }
  527. $previousNode = $Model->find('first', array(
  528. 'conditions' => array($scope, $Model->escapeField($right) => ($node[$left] - 1)),
  529. 'fields' => array($Model->primaryKey, $left, $right),
  530. 'recursive' => $recursive
  531. ));
  532. if ($previousNode) {
  533. list($previousNode) = array_values($previousNode);
  534. } else {
  535. return false;
  536. }
  537. $edge = $this->_getMax($Model, $scope, $right, $recursive);
  538. $this->_sync($Model, $edge - $previousNode[$left] + 1, '+', 'BETWEEN ' . $previousNode[$left] . ' AND ' . $previousNode[$right]);
  539. $this->_sync($Model, $node[$left] - $previousNode[$left], '-', 'BETWEEN ' . $node[$left] . ' AND ' . $node[$right]);
  540. $this->_sync($Model, $edge - $previousNode[$left] - ($node[$right] - $node[$left]), '-', '> ' . $edge);
  541. if (is_int($number)) {
  542. $number--;
  543. }
  544. if ($number) {
  545. $this->moveUp($Model, $id, $number);
  546. }
  547. return true;
  548. }
  549. /**
  550. * Recover a corrupted tree
  551. *
  552. * The mode parameter is used to specify the source of info that is valid/correct. The opposite source of data
  553. * will be populated based upon that source of info. E.g. if the MPTT fields are corrupt or empty, with the $mode
  554. * 'parent' the values of the parent_id field will be used to populate the left and right fields. The missingParentAction
  555. * parameter only applies to "parent" mode and determines what to do if the parent field contains an id that is not present.
  556. *
  557. * @param Model $Model Model instance
  558. * @param string $mode parent or tree
  559. * @param string|integer $missingParentAction 'return' to do nothing and return, 'delete' to
  560. * delete, or the id of the parent to set as the parent_id
  561. * @return boolean true on success, false on failure
  562. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::recover
  563. */
  564. public function recover(Model $Model, $mode = 'parent', $missingParentAction = null) {
  565. if (is_array($mode)) {
  566. extract(array_merge(array('mode' => 'parent'), $mode));
  567. }
  568. extract($this->settings[$Model->alias]);
  569. $Model->recursive = $recursive;
  570. if ($mode === 'parent') {
  571. $Model->bindModel(array('belongsTo' => array('VerifyParent' => array(
  572. 'className' => $Model->name,
  573. 'foreignKey' => $parent,
  574. 'fields' => array($Model->primaryKey, $left, $right, $parent),
  575. ))));
  576. $missingParents = $Model->find('list', array(
  577. 'recursive' => 0,
  578. 'conditions' => array($scope, array(
  579. 'NOT' => array($Model->escapeField($parent) => null), $Model->VerifyParent->escapeField() => null
  580. ))
  581. ));
  582. $Model->unbindModel(array('belongsTo' => array('VerifyParent')));
  583. if ($missingParents) {
  584. if ($missingParentAction === 'return') {
  585. foreach ($missingParents as $id => $display) {
  586. $this->errors[] = 'cannot find the parent for ' . $Model->alias . ' with id ' . $id . '(' . $display . ')';
  587. }
  588. return false;
  589. } elseif ($missingParentAction === 'delete') {
  590. $Model->deleteAll(array($Model->escapeField($Model->primaryKey) => array_flip($missingParents)), false);
  591. } else {
  592. $Model->updateAll(array($Model->escapeField($parent) => $missingParentAction), array($Model->escapeField($Model->primaryKey) => array_flip($missingParents)));
  593. }
  594. }
  595. $this->_recoverByParentId($Model);
  596. } else {
  597. $db = ConnectionManager::getDataSource($Model->useDbConfig);
  598. foreach ($Model->find('all', array('conditions' => $scope, 'fields' => array($Model->primaryKey, $parent), 'order' => $left)) as $array) {
  599. $path = $this->getPath($Model, $array[$Model->alias][$Model->primaryKey]);
  600. $parentId = null;
  601. if (count($path) > 1) {
  602. $parentId = $path[count($path) - 2][$Model->alias][$Model->primaryKey];
  603. }
  604. $Model->updateAll(array($parent => $db->value($parentId, $parent)), array($Model->escapeField() => $array[$Model->alias][$Model->primaryKey]));
  605. }
  606. }
  607. return true;
  608. }
  609. /**
  610. * _recoverByParentId
  611. *
  612. * Recursive helper function used by recover
  613. *
  614. * @param Model $Model
  615. * @param integer $counter
  616. * @param mixed $parentId
  617. * @return integer $counter
  618. */
  619. protected function _recoverByParentId(Model $Model, $counter = 1, $parentId = null) {
  620. $params = array(
  621. 'conditions' => array(
  622. $this->settings[$Model->alias]['parent'] => $parentId
  623. ),
  624. 'fields' => array($Model->primaryKey),
  625. 'page' => 1,
  626. 'limit' => 100,
  627. 'order' => array($Model->primaryKey)
  628. );
  629. $scope = $this->settings[$Model->alias]['scope'];
  630. if ($scope && ($scope !== '1 = 1' && $scope !== true)) {
  631. $params['conditions'][] = $scope;
  632. }
  633. $children = $Model->find('all', $params);
  634. $hasChildren = (bool)$children;
  635. if ($parentId !== null) {
  636. if ($hasChildren) {
  637. $Model->updateAll(
  638. array($this->settings[$Model->alias]['left'] => $counter),
  639. array($Model->escapeField() => $parentId)
  640. );
  641. $counter++;
  642. } else {
  643. $Model->updateAll(
  644. array(
  645. $this->settings[$Model->alias]['left'] => $counter,
  646. $this->settings[$Model->alias]['right'] => $counter + 1
  647. ),
  648. array($Model->escapeField() => $parentId)
  649. );
  650. $counter += 2;
  651. }
  652. }
  653. while ($children) {
  654. foreach ($children as $row) {
  655. $counter = $this->_recoverByParentId($Model, $counter, $row[$Model->alias][$Model->primaryKey]);
  656. }
  657. if (count($children) !== $params['limit']) {
  658. break;
  659. }
  660. $params['page']++;
  661. $children = $Model->find('all', $params);
  662. }
  663. if ($parentId !== null && $hasChildren) {
  664. $Model->updateAll(
  665. array($this->settings[$Model->alias]['right'] => $counter),
  666. array($Model->escapeField() => $parentId)
  667. );
  668. $counter++;
  669. }
  670. return $counter;
  671. }
  672. /**
  673. * Reorder method.
  674. *
  675. * Reorders the nodes (and child nodes) of the tree according to the field and direction specified in the parameters.
  676. * This method does not change the parent of any node.
  677. *
  678. * Requires a valid tree, by default it verifies the tree before beginning.
  679. *
  680. * Options:
  681. *
  682. * - 'id' id of record to use as top node for reordering
  683. * - 'field' Which field to use in reordering defaults to displayField
  684. * - 'order' Direction to order either DESC or ASC (defaults to ASC)
  685. * - 'verify' Whether or not to verify the tree before reorder. defaults to true.
  686. *
  687. * @param Model $Model Model instance
  688. * @param array $options array of options to use in reordering.
  689. * @return boolean true on success, false on failure
  690. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::reorder
  691. */
  692. public function reorder(Model $Model, $options = array()) {
  693. $options = array_merge(array('id' => null, 'field' => $Model->displayField, 'order' => 'ASC', 'verify' => true), $options);
  694. extract($options);
  695. if ($verify && !$this->verify($Model)) {
  696. return false;
  697. }
  698. $verify = false;
  699. extract($this->settings[$Model->alias]);
  700. $fields = array($Model->primaryKey, $field, $left, $right);
  701. $sort = $field . ' ' . $order;
  702. $nodes = $this->children($Model, $id, true, $fields, $sort, null, null, $recursive);
  703. $cacheQueries = $Model->cacheQueries;
  704. $Model->cacheQueries = false;
  705. if ($nodes) {
  706. foreach ($nodes as $node) {
  707. $id = $node[$Model->alias][$Model->primaryKey];
  708. $this->moveDown($Model, $id, true);
  709. if ($node[$Model->alias][$left] != $node[$Model->alias][$right] - 1) {
  710. $this->reorder($Model, compact('id', 'field', 'order', 'verify'));
  711. }
  712. }
  713. }
  714. $Model->cacheQueries = $cacheQueries;
  715. return true;
  716. }
  717. /**
  718. * Remove the current node from the tree, and reparent all children up one level.
  719. *
  720. * If the parameter delete is false, the node will become a new top level node. Otherwise the node will be deleted
  721. * after the children are reparented.
  722. *
  723. * @param Model $Model Model instance
  724. * @param integer|string $id The ID of the record to remove
  725. * @param boolean $delete whether to delete the node after reparenting children (if any)
  726. * @return boolean true on success, false on failure
  727. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::removeFromTree
  728. */
  729. public function removeFromTree(Model $Model, $id = null, $delete = false) {
  730. if (is_array($id)) {
  731. extract(array_merge(array('id' => null), $id));
  732. }
  733. extract($this->settings[$Model->alias]);
  734. list($node) = array_values($Model->find('first', array(
  735. 'conditions' => array($scope, $Model->escapeField() => $id),
  736. 'fields' => array($Model->primaryKey, $left, $right, $parent),
  737. 'recursive' => $recursive
  738. )));
  739. if ($node[$right] == $node[$left] + 1) {
  740. if ($delete) {
  741. return $Model->delete($id);
  742. }
  743. $Model->id = $id;
  744. return $Model->saveField($parent, null);
  745. } elseif ($node[$parent]) {
  746. list($parentNode) = array_values($Model->find('first', array(
  747. 'conditions' => array($scope, $Model->escapeField() => $node[$parent]),
  748. 'fields' => array($Model->primaryKey, $left, $right),
  749. 'recursive' => $recursive
  750. )));
  751. } else {
  752. $parentNode[$right] = $node[$right] + 1;
  753. }
  754. $db = ConnectionManager::getDataSource($Model->useDbConfig);
  755. $Model->updateAll(
  756. array($parent => $db->value($node[$parent], $parent)),
  757. array($Model->escapeField($parent) => $node[$Model->primaryKey])
  758. );
  759. $this->_sync($Model, 1, '-', 'BETWEEN ' . ($node[$left] + 1) . ' AND ' . ($node[$right] - 1));
  760. $this->_sync($Model, 2, '-', '> ' . ($node[$right]));
  761. $Model->id = $id;
  762. if ($delete) {
  763. $Model->updateAll(
  764. array(
  765. $Model->escapeField($left) => 0,
  766. $Model->escapeField($right) => 0,
  767. $Model->escapeField($parent) => null
  768. ),
  769. array($Model->escapeField() => $id)
  770. );
  771. return $Model->delete($id);
  772. }
  773. $edge = $this->_getMax($Model, $scope, $right, $recursive);
  774. if ($node[$right] == $edge) {
  775. $edge = $edge - 2;
  776. }
  777. $Model->id = $id;
  778. return $Model->save(
  779. array($left => $edge + 1, $right => $edge + 2, $parent => null),
  780. array('callbacks' => false, 'validate' => false)
  781. );
  782. }
  783. /**
  784. * Check if the current tree is valid.
  785. *
  786. * Returns true if the tree is valid otherwise an array of (type, incorrect left/right index, message)
  787. *
  788. * @param Model $Model Model instance
  789. * @return mixed true if the tree is valid or empty, otherwise an array of (error type [index, node],
  790. * [incorrect left/right index,node id], message)
  791. * @link http://book.cakephp.org/2.0/en/core-libraries/behaviors/tree.html#TreeBehavior::verify
  792. */
  793. public function verify(Model $Model) {
  794. extract($this->settings[$Model->alias]);
  795. if (!$Model->find('count', array('conditions' => $scope))) {
  796. return true;
  797. }
  798. $min = $this->_getMin($Model, $scope, $left, $recursive);
  799. $edge = $this->_getMax($Model, $scope, $right, $recursive);
  800. $errors = array();
  801. for ($i = $min; $i <= $edge; $i++) {
  802. $count = $Model->find('count', array('conditions' => array(
  803. $scope, 'OR' => array($Model->escapeField($left) => $i, $Model->escapeField($right) => $i)
  804. )));
  805. if ($count != 1) {
  806. if (!$count) {
  807. $errors[] = array('index', $i, 'missing');
  808. } else {
  809. $errors[] = array('index', $i, 'duplicate');
  810. }
  811. }
  812. }
  813. $node = $Model->find('first', array('conditions' => array($scope, $Model->escapeField($right) . '< ' . $Model->escapeField($left)), 'recursive' => 0));
  814. if ($node) {
  815. $errors[] = array('node', $node[$Model->alias][$Model->primaryKey], 'left greater than right.');
  816. }
  817. $Model->bindModel(array('belongsTo' => array('VerifyParent' => array(
  818. 'className' => $Model->name,
  819. 'foreignKey' => $parent,
  820. 'fields' => array($Model->primaryKey, $left, $right, $parent)
  821. ))));
  822. foreach ($Model->find('all', array('conditions' => $scope, 'recursive' => 0)) as $instance) {
  823. if ($instance[$Model->alias][$left] === null || $instance[$Model->alias][$right] === null) {
  824. $errors[] = array('node', $instance[$Model->alias][$Model->primaryKey],
  825. 'has invalid left or right values');
  826. } elseif ($instance[$Model->alias][$left] == $instance[$Model->alias][$right]) {
  827. $errors[] = array('node', $instance[$Model->alias][$Model->primaryKey],
  828. 'left and right values identical');
  829. } elseif ($instance[$Model->alias][$parent]) {
  830. if (!$instance['VerifyParent'][$Model->primaryKey]) {
  831. $errors[] = array('node', $instance[$Model->alias][$Model->primaryKey],
  832. 'The parent node ' . $instance[$Model->alias][$parent] . ' doesn\'t exist');
  833. } elseif ($instance[$Model->alias][$left] < $instance['VerifyParent'][$left]) {
  834. $errors[] = array('node', $instance[$Model->alias][$Model->primaryKey],
  835. 'left less than parent (node ' . $instance['VerifyParent'][$Model->primaryKey] . ').');
  836. } elseif ($instance[$Model->alias][$right] > $instance['VerifyParent'][$right]) {
  837. $errors[] = array('node', $instance[$Model->alias][$Model->primaryKey],
  838. 'right greater than parent (node ' . $instance['VerifyParent'][$Model->primaryKey] . ').');
  839. }
  840. } elseif ($Model->find('count', array('conditions' => array($scope, $Model->escapeField($left) . ' <' => $instance[$Model->alias][$left], $Model->escapeField($right) . ' >' => $instance[$Model->alias][$right]), 'recursive' => 0))) {
  841. $errors[] = array('node', $instance[$Model->alias][$Model->primaryKey], 'The parent field is blank, but has a parent');
  842. }
  843. }
  844. if ($errors) {
  845. return $errors;
  846. }
  847. return true;
  848. }
  849. /**
  850. * Sets the parent of the given node
  851. *
  852. * The force parameter is used to override the "don't change the parent to the current parent" logic in the event
  853. * of recovering a corrupted table, or creating new nodes. Otherwise it should always be false. In reality this
  854. * method could be private, since calling save with parent_id set also calls setParent
  855. *
  856. * @param Model $Model Model instance
  857. * @param integer|string $parentId
  858. * @param boolean $created
  859. * @return boolean true on success, false on failure
  860. */
  861. protected function _setParent(Model $Model, $parentId = null, $created = false) {
  862. extract($this->settings[$Model->alias]);
  863. list($node) = array_values($Model->find('first', array(
  864. 'conditions' => array($scope, $Model->escapeField() => $Model->id),
  865. 'fields' => array($Model->primaryKey, $parent, $left, $right),
  866. 'recursive' => $recursive
  867. )));
  868. $edge = $this->_getMax($Model, $scope, $right, $recursive, $created);
  869. if (empty($parentId)) {
  870. $this->_sync($Model, $edge - $node[$left] + 1, '+', 'BETWEEN ' . $node[$left] . ' AND ' . $node[$right], $created);
  871. $this->_sync($Model, $node[$right] - $node[$left] + 1, '-', '> ' . $node[$left], $created);
  872. } else {
  873. $values = $Model->find('first', array(
  874. 'conditions' => array($scope, $Model->escapeField() => $parentId),
  875. 'fields' => array($Model->primaryKey, $left, $right),
  876. 'recursive' => $recursive
  877. ));
  878. if ($values === false) {
  879. return false;
  880. }
  881. $parentNode = array_values($values);
  882. if (empty($parentNode) || empty($parentNode[0])) {
  883. return false;
  884. }
  885. $parentNode = $parentNode[0];
  886. if (($Model->id == $parentId)) {
  887. return false;
  888. } elseif (($node[$left] < $parentNode[$left]) && ($parentNode[$right] < $node[$right])) {
  889. return false;
  890. }
  891. if (empty($node[$left]) && empty($node[$right])) {
  892. $this->_sync($Model, 2, '+', '>= ' . $parentNode[$right], $created);
  893. $result = $Model->save(
  894. array($left => $parentNode[$right], $right => $parentNode[$right] + 1, $parent => $parentId),
  895. array('validate' => false, 'callbacks' => false)
  896. );
  897. $Model->data = $result;
  898. } else {
  899. $this->_sync($Model, $edge - $node[$left] + 1, '+', 'BETWEEN ' . $node[$left] . ' AND ' . $node[$right], $created);
  900. $diff = $node[$right] - $node[$left] + 1;
  901. if ($node[$left] > $parentNode[$left]) {
  902. if ($node[$right] < $parentNode[$right]) {
  903. $this->_sync($Model, $diff, '-', 'BETWEEN ' . $node[$right] . ' AND ' . ($parentNode[$right] - 1), $created);
  904. $this->_sync($Model, $edge - $parentNode[$right] + $diff + 1, '-', '> ' . $edge, $created);
  905. } else {
  906. $this->_sync($Model, $diff, '+', 'BETWEEN ' . $parentNode[$right] . ' AND ' . $node[$right], $created);
  907. $this->_sync($Model, $edge - $parentNode[$right] + 1, '-', '> ' . $edge, $created);
  908. }
  909. } else {
  910. $this->_sync($Model, $diff, '-', 'BETWEEN ' . $node[$right] . ' AND ' . ($parentNode[$right] - 1), $created);
  911. $this->_sync($Model, $edge - $parentNode[$right] + $diff + 1, '-', '> ' . $edge, $created);
  912. }
  913. }
  914. }
  915. return true;
  916. }
  917. /**
  918. * get the maximum index value in the table.
  919. *
  920. * @param Model $Model
  921. * @param string $scope
  922. * @param string $right
  923. * @param integer $recursive
  924. * @param boolean $created
  925. * @return integer
  926. */
  927. protected function _getMax(Model $Model, $scope, $right, $recursive = -1, $created = false) {
  928. $db = ConnectionManager::getDataSource($Model->useDbConfig);
  929. if ($created) {
  930. if (is_string($scope)) {
  931. $scope .= " AND " . $Model->escapeField() . " <> ";
  932. $scope .= $db->value($Model->id, $Model->getColumnType($Model->primaryKey));
  933. } else {
  934. $scope['NOT'][$Model->alias . '.' . $Model->primaryKey] = $Model->id;
  935. }
  936. }
  937. $name = $Model->escapeField($right);
  938. list($edge) = array_values($Model->find('first', array(
  939. 'conditions' => $scope,
  940. 'fields' => $db->calculate($Model, 'max', array($name, $right)),
  941. 'recursive' => $recursive,
  942. 'callbacks' => false
  943. )));
  944. return (empty($edge[$right])) ? 0 : $edge[$right];
  945. }
  946. /**
  947. * get the minimum index value in the table.
  948. *
  949. * @param Model $Model
  950. * @param string $scope
  951. * @param string $left
  952. * @param integer $recursive
  953. * @return integer
  954. */
  955. protected function _getMin(Model $Model, $scope, $left, $recursive = -1) {
  956. $db = ConnectionManager::getDataSource($Model->useDbConfig);
  957. $name = $Model->escapeField($left);
  958. list($edge) = array_values($Model->find('first', array(
  959. 'conditions' => $scope,
  960. 'fields' => $db->calculate($Model, 'min', array($name, $left)),
  961. 'recursive' => $recursive,
  962. 'callbacks' => false
  963. )));
  964. return (empty($edge[$left])) ? 0 : $edge[$left];
  965. }
  966. /**
  967. * Table sync method.
  968. *
  969. * Handles table sync operations, Taking account of the behavior scope.
  970. *
  971. * @param Model $Model
  972. * @param integer $shift
  973. * @param string $dir
  974. * @param array $conditions
  975. * @param boolean $created
  976. * @param string $field
  977. * @return void
  978. */
  979. protected function _sync(Model $Model, $shift, $dir = '+', $conditions = array(), $created = false, $field = 'both') {
  980. $ModelRecursive = $Model->recursive;
  981. extract($this->settings[$Model->alias]);
  982. $Model->recursive = $recursive;
  983. if ($field === 'both') {
  984. $this->_sync($Model, $shift, $dir, $conditions, $created, $left);
  985. $field = $right;
  986. }
  987. if (is_string($conditions)) {
  988. $conditions = array($Model->escapeField($field) . " {$conditions}");
  989. }
  990. if (($scope !== '1 = 1' && $scope !== true) && $scope) {
  991. $conditions[] = $scope;
  992. }
  993. if ($created) {
  994. $conditions['NOT'][$Model->escapeField()] = $Model->id;
  995. }
  996. $Model->updateAll(array($Model->escapeField($field) => $Model->escapeField($field) . ' ' . $dir . ' ' . $shift), $conditions);
  997. $Model->recursive = $ModelRecursive;
  998. }
  999. }