TreeBehavior.php 38 KB

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