2993 lines
129 KiB
HTML
2993 lines
129 KiB
HTML
<html>
|
|
<head>
|
|
<title>Coverage for Doctrine_Node_NestedSet</title>
|
|
<style type="text/css">
|
|
.covered{ background: green;}
|
|
.normal{ background: white;}
|
|
.red{ background: red;}
|
|
.orange{ background: #f90;}
|
|
</style>
|
|
</head>
|
|
<body><h1>Coverage for Doctrine_Node_NestedSet</h1><p><a href="index.php">Back to coverage report</a></p><table>
|
|
<tr><td>1</td>
|
|
<td class="normal"><?php
|
|
</td></tr>
|
|
<tr><td>2</td>
|
|
<td class="normal">/*
|
|
</td></tr>
|
|
<tr><td>3</td>
|
|
<td class="normal"> * $Id: NestedSet.php 2967 2007-10-21 09:00:40Z romanb $
|
|
</td></tr>
|
|
<tr><td>4</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>5</td>
|
|
<td class="normal"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
</td></tr>
|
|
<tr><td>6</td>
|
|
<td class="normal"> * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
</td></tr>
|
|
<tr><td>7</td>
|
|
<td class="normal"> * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
</td></tr>
|
|
<tr><td>8</td>
|
|
<td class="normal"> * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
</td></tr>
|
|
<tr><td>9</td>
|
|
<td class="normal"> * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
</td></tr>
|
|
<tr><td>10</td>
|
|
<td class="normal"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
</td></tr>
|
|
<tr><td>11</td>
|
|
<td class="normal"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
</td></tr>
|
|
<tr><td>12</td>
|
|
<td class="normal"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
</td></tr>
|
|
<tr><td>13</td>
|
|
<td class="normal"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
</td></tr>
|
|
<tr><td>14</td>
|
|
<td class="normal"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
</td></tr>
|
|
<tr><td>15</td>
|
|
<td class="normal"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
</td></tr>
|
|
<tr><td>16</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>17</td>
|
|
<td class="normal"> * This software consists of voluntary contributions made by many individuals
|
|
</td></tr>
|
|
<tr><td>18</td>
|
|
<td class="normal"> * and is licensed under the LGPL. For more information, see
|
|
</td></tr>
|
|
<tr><td>19</td>
|
|
<td class="normal"> * <http://www.phpdoctrine.com>.
|
|
</td></tr>
|
|
<tr><td>20</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>21</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>22</td>
|
|
<td class="normal">/**
|
|
</td></tr>
|
|
<tr><td>23</td>
|
|
<td class="normal"> * Doctrine_Node_NestedSet
|
|
</td></tr>
|
|
<tr><td>24</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>25</td>
|
|
<td class="normal"> * @package Doctrine
|
|
</td></tr>
|
|
<tr><td>26</td>
|
|
<td class="normal"> * @subpackage Node
|
|
</td></tr>
|
|
<tr><td>27</td>
|
|
<td class="normal"> * @license http://www.opensource.org/licenses/lgpl-license.php LGPL
|
|
</td></tr>
|
|
<tr><td>28</td>
|
|
<td class="normal"> * @link www.phpdoctrine.com
|
|
</td></tr>
|
|
<tr><td>29</td>
|
|
<td class="normal"> * @since 1.0
|
|
</td></tr>
|
|
<tr><td>30</td>
|
|
<td class="normal"> * @version $Revision: 2967 $
|
|
</td></tr>
|
|
<tr><td>31</td>
|
|
<td class="normal"> * @author Joe Simms <joe.simms@websites4.com>
|
|
</td></tr>
|
|
<tr><td>32</td>
|
|
<td class="normal"> * @author Roman Borschel <roman@code-factory.org>
|
|
</td></tr>
|
|
<tr><td>33</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>34</td>
|
|
<td class="covered">class Doctrine_Node_NestedSet extends Doctrine_Node implements Doctrine_Node_Interface
|
|
</td></tr>
|
|
<tr><td>35</td>
|
|
<td class="normal">{
|
|
</td></tr>
|
|
<tr><td>36</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>37</td>
|
|
<td class="normal"> * test if node has previous sibling
|
|
</td></tr>
|
|
<tr><td>38</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>39</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>40</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>41</td>
|
|
<td class="normal"> public function hasPrevSibling()
|
|
</td></tr>
|
|
<tr><td>42</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>43</td>
|
|
<td class="red"> return $this->isValidNode($this->getPrevSibling());
|
|
</td></tr>
|
|
<tr><td>44</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>45</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>46</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>47</td>
|
|
<td class="normal"> * test if node has next sibling
|
|
</td></tr>
|
|
<tr><td>48</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>49</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>50</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>51</td>
|
|
<td class="normal"> public function hasNextSibling()
|
|
</td></tr>
|
|
<tr><td>52</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>53</td>
|
|
<td class="red"> return $this->isValidNode($this->getNextSibling());
|
|
</td></tr>
|
|
<tr><td>54</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>55</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>56</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>57</td>
|
|
<td class="normal"> * test if node has children
|
|
</td></tr>
|
|
<tr><td>58</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>59</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>60</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>61</td>
|
|
<td class="normal"> public function hasChildren()
|
|
</td></tr>
|
|
<tr><td>62</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>63</td>
|
|
<td class="red"> return (($this->getRightValue() - $this->getLeftValue() ) >1 );
|
|
</td></tr>
|
|
<tr><td>64</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>65</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>66</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>67</td>
|
|
<td class="normal"> * test if node has parent
|
|
</td></tr>
|
|
<tr><td>68</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>69</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>70</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>71</td>
|
|
<td class="normal"> public function hasParent()
|
|
</td></tr>
|
|
<tr><td>72</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>73</td>
|
|
<td class="red"> return !$this->isRoot();
|
|
</td></tr>
|
|
<tr><td>74</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>75</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>76</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>77</td>
|
|
<td class="normal"> * gets record of prev sibling or empty record
|
|
</td></tr>
|
|
<tr><td>78</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>79</td>
|
|
<td class="normal"> * @return object Doctrine_Record
|
|
</td></tr>
|
|
<tr><td>80</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>81</td>
|
|
<td class="normal"> public function getPrevSibling()
|
|
</td></tr>
|
|
<tr><td>82</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>83</td>
|
|
<td class="red"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>84</td>
|
|
<td class="red"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>85</td>
|
|
<td class="red"> $q = $q->addWhere("$baseAlias.rgt = ?", $this->getLeftValue() - 1);
|
|
</td></tr>
|
|
<tr><td>86</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>87</td>
|
|
<td class="red"> $result = $q->execute();
|
|
</td></tr>
|
|
<tr><td>88</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>89</td>
|
|
<td class="red"> if (count($result) <= 0) {
|
|
</td></tr>
|
|
<tr><td>90</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>91</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>92</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>93</td>
|
|
<td class="red"> if ($result instanceof Doctrine_Collection) {
|
|
</td></tr>
|
|
<tr><td>94</td>
|
|
<td class="red"> $sibling = $result->getFirst();
|
|
</td></tr>
|
|
<tr><td>95</td>
|
|
<td class="red"> } else if (is_array($result)) {
|
|
</td></tr>
|
|
<tr><td>96</td>
|
|
<td class="red"> $sibling = array_shift($result);
|
|
</td></tr>
|
|
<tr><td>97</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>98</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>99</td>
|
|
<td class="red"> return $sibling;
|
|
</td></tr>
|
|
<tr><td>100</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>101</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>102</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>103</td>
|
|
<td class="normal"> * gets record of next sibling or empty record
|
|
</td></tr>
|
|
<tr><td>104</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>105</td>
|
|
<td class="normal"> * @return object Doctrine_Record
|
|
</td></tr>
|
|
<tr><td>106</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>107</td>
|
|
<td class="normal"> public function getNextSibling()
|
|
</td></tr>
|
|
<tr><td>108</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>109</td>
|
|
<td class="red"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>110</td>
|
|
<td class="red"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>111</td>
|
|
<td class="red"> $q = $q->addWhere("$baseAlias.lft = ?", $this->getRightValue() + 1);
|
|
</td></tr>
|
|
<tr><td>112</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>113</td>
|
|
<td class="red"> $result = $q->execute();
|
|
</td></tr>
|
|
<tr><td>114</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>115</td>
|
|
<td class="red"> if (count($result) <= 0) {
|
|
</td></tr>
|
|
<tr><td>116</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>117</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>118</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>119</td>
|
|
<td class="red"> if ($result instanceof Doctrine_Collection) {
|
|
</td></tr>
|
|
<tr><td>120</td>
|
|
<td class="red"> $sibling = $result->getFirst();
|
|
</td></tr>
|
|
<tr><td>121</td>
|
|
<td class="red"> } else if (is_array($result)) {
|
|
</td></tr>
|
|
<tr><td>122</td>
|
|
<td class="red"> $sibling = array_shift($result);
|
|
</td></tr>
|
|
<tr><td>123</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>124</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>125</td>
|
|
<td class="red"> return $sibling;
|
|
</td></tr>
|
|
<tr><td>126</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>127</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>128</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>129</td>
|
|
<td class="normal"> * gets siblings for node
|
|
</td></tr>
|
|
<tr><td>130</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>131</td>
|
|
<td class="normal"> * @return array array of sibling Doctrine_Record objects
|
|
</td></tr>
|
|
<tr><td>132</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>133</td>
|
|
<td class="normal"> public function getSiblings($includeNode = false)
|
|
</td></tr>
|
|
<tr><td>134</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>135</td>
|
|
<td class="red"> $parent = $this->getParent();
|
|
</td></tr>
|
|
<tr><td>136</td>
|
|
<td class="red"> $siblings = array();
|
|
</td></tr>
|
|
<tr><td>137</td>
|
|
<td class="red"> if ($parent->exists()) {
|
|
</td></tr>
|
|
<tr><td>138</td>
|
|
<td class="red"> foreach ($parent->getNode()->getChildren() as $child) {
|
|
</td></tr>
|
|
<tr><td>139</td>
|
|
<td class="red"> if ($this->isEqualTo($child) && !$includeNode) {
|
|
</td></tr>
|
|
<tr><td>140</td>
|
|
<td class="red"> continue;
|
|
</td></tr>
|
|
<tr><td>141</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>142</td>
|
|
<td class="red"> $siblings[] = $child;
|
|
</td></tr>
|
|
<tr><td>143</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>144</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>145</td>
|
|
<td class="red"> return $siblings;
|
|
</td></tr>
|
|
<tr><td>146</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>147</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>148</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>149</td>
|
|
<td class="normal"> * gets record of first child or empty record
|
|
</td></tr>
|
|
<tr><td>150</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>151</td>
|
|
<td class="normal"> * @return object Doctrine_Record
|
|
</td></tr>
|
|
<tr><td>152</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>153</td>
|
|
<td class="normal"> public function getFirstChild()
|
|
</td></tr>
|
|
<tr><td>154</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>155</td>
|
|
<td class="red"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>156</td>
|
|
<td class="red"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>157</td>
|
|
<td class="red"> $q->addWhere("$baseAlias.lft = ?", $this->getLeftValue() + 1);
|
|
</td></tr>
|
|
<tr><td>158</td>
|
|
<td class="red"> $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>159</td>
|
|
<td class="red"> $result = $q->execute();
|
|
</td></tr>
|
|
<tr><td>160</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>161</td>
|
|
<td class="red"> if (count($result) <= 0) {
|
|
</td></tr>
|
|
<tr><td>162</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>163</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>164</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>165</td>
|
|
<td class="red"> if ($result instanceof Doctrine_Collection) {
|
|
</td></tr>
|
|
<tr><td>166</td>
|
|
<td class="red"> $child = $result->getFirst();
|
|
</td></tr>
|
|
<tr><td>167</td>
|
|
<td class="red"> } else if (is_array($result)) {
|
|
</td></tr>
|
|
<tr><td>168</td>
|
|
<td class="red"> $child = array_shift($result);
|
|
</td></tr>
|
|
<tr><td>169</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>170</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>171</td>
|
|
<td class="red"> return $child;
|
|
</td></tr>
|
|
<tr><td>172</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>173</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>174</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>175</td>
|
|
<td class="normal"> * gets record of last child or empty record
|
|
</td></tr>
|
|
<tr><td>176</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>177</td>
|
|
<td class="normal"> * @return object Doctrine_Record
|
|
</td></tr>
|
|
<tr><td>178</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>179</td>
|
|
<td class="normal"> public function getLastChild()
|
|
</td></tr>
|
|
<tr><td>180</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>181</td>
|
|
<td class="red"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>182</td>
|
|
<td class="red"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>183</td>
|
|
<td class="red"> $q->addWhere("$baseAlias.rgt = ?", $this->getRightValue() - 1);
|
|
</td></tr>
|
|
<tr><td>184</td>
|
|
<td class="red"> $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>185</td>
|
|
<td class="red"> $result = $q->execute();
|
|
</td></tr>
|
|
<tr><td>186</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>187</td>
|
|
<td class="red"> if (count($result) <= 0) {
|
|
</td></tr>
|
|
<tr><td>188</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>189</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>190</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>191</td>
|
|
<td class="red"> if ($result instanceof Doctrine_Collection) {
|
|
</td></tr>
|
|
<tr><td>192</td>
|
|
<td class="red"> $child = $result->getFirst();
|
|
</td></tr>
|
|
<tr><td>193</td>
|
|
<td class="red"> } else if (is_array($result)) {
|
|
</td></tr>
|
|
<tr><td>194</td>
|
|
<td class="red"> $child = array_shift($result);
|
|
</td></tr>
|
|
<tr><td>195</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>196</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>197</td>
|
|
<td class="red"> return $child;
|
|
</td></tr>
|
|
<tr><td>198</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>199</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>200</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>201</td>
|
|
<td class="normal"> * gets children for node (direct descendants only)
|
|
</td></tr>
|
|
<tr><td>202</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>203</td>
|
|
<td class="normal"> * @return mixed The children of the node or FALSE if the node has no children.
|
|
</td></tr>
|
|
<tr><td>204</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>205</td>
|
|
<td class="normal"> public function getChildren()
|
|
</td></tr>
|
|
<tr><td>206</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>207</td>
|
|
<td class="covered"> return $this->getDescendants(1);
|
|
</td></tr>
|
|
<tr><td>208</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>209</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>210</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>211</td>
|
|
<td class="normal"> * gets descendants for node (direct descendants only)
|
|
</td></tr>
|
|
<tr><td>212</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>213</td>
|
|
<td class="normal"> * @return mixed The descendants of the node or FALSE if the node has no descendants.
|
|
</td></tr>
|
|
<tr><td>214</td>
|
|
<td class="normal"> * @todo Currently all descendants are fetched, no matter the depth. Maybe there is a better
|
|
</td></tr>
|
|
<tr><td>215</td>
|
|
<td class="normal"> * solution with less overhead.
|
|
</td></tr>
|
|
<tr><td>216</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>217</td>
|
|
<td class="normal"> public function getDescendants($depth = null, $includeNode = false)
|
|
</td></tr>
|
|
<tr><td>218</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>219</td>
|
|
<td class="covered"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>220</td>
|
|
<td class="covered"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>221</td>
|
|
<td class="covered"> $params = array($this->record->get('lft'), $this->record->get('rgt'));
|
|
</td></tr>
|
|
<tr><td>222</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>223</td>
|
|
<td class="covered"> if ($includeNode) {
|
|
</td></tr>
|
|
<tr><td>224</td>
|
|
<td class="red"> $q->addWhere("$baseAlias.lft >= ? AND $baseAlias.rgt <= ?", $params)->addOrderBy("$baseAlias.lft asc");
|
|
</td></tr>
|
|
<tr><td>225</td>
|
|
<td class="red"> } else {
|
|
</td></tr>
|
|
<tr><td>226</td>
|
|
<td class="covered"> $q->addWhere("$baseAlias.lft > ? AND $baseAlias.rgt < ?", $params)->addOrderBy("$baseAlias.lft asc");
|
|
</td></tr>
|
|
<tr><td>227</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>228</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>229</td>
|
|
<td class="covered"> if ($depth !== null) {
|
|
</td></tr>
|
|
<tr><td>230</td>
|
|
<td class="covered"> $q->addWhere("$baseAlias.level <= ?", $this->record['level'] + $depth);
|
|
</td></tr>
|
|
<tr><td>231</td>
|
|
<td class="covered"> }
|
|
</td></tr>
|
|
<tr><td>232</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>233</td>
|
|
<td class="covered"> $q = $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>234</td>
|
|
<td class="covered"> $result = $q->execute();
|
|
</td></tr>
|
|
<tr><td>235</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>236</td>
|
|
<td class="covered"> if (count($result) <= 0) {
|
|
</td></tr>
|
|
<tr><td>237</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>238</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>239</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>240</td>
|
|
<td class="covered"> return $result;
|
|
</td></tr>
|
|
<tr><td>241</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>242</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>243</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>244</td>
|
|
<td class="normal"> * gets record of parent or empty record
|
|
</td></tr>
|
|
<tr><td>245</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>246</td>
|
|
<td class="normal"> * @return object Doctrine_Record
|
|
</td></tr>
|
|
<tr><td>247</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>248</td>
|
|
<td class="normal"> public function getParent()
|
|
</td></tr>
|
|
<tr><td>249</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>250</td>
|
|
<td class="red"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>251</td>
|
|
<td class="red"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>252</td>
|
|
<td class="red"> $q->addWhere("$baseAlias.lft < ? AND $baseAlias.rgt > ?", array($this->getLeftValue(), $this->getRightValue()))
|
|
</td></tr>
|
|
<tr><td>253</td>
|
|
<td class="red"> ->addOrderBy("$baseAlias.rgt asc");
|
|
</td></tr>
|
|
<tr><td>254</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>255</td>
|
|
<td class="red"> $result = $q->execute();
|
|
</td></tr>
|
|
<tr><td>256</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>257</td>
|
|
<td class="red"> if (count($result) <= 0) {
|
|
</td></tr>
|
|
<tr><td>258</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>259</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>260</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>261</td>
|
|
<td class="red"> if ($result instanceof Doctrine_Collection) {
|
|
</td></tr>
|
|
<tr><td>262</td>
|
|
<td class="red"> $parent = $result->getFirst();
|
|
</td></tr>
|
|
<tr><td>263</td>
|
|
<td class="red"> } else if (is_array($result)) {
|
|
</td></tr>
|
|
<tr><td>264</td>
|
|
<td class="red"> $parent = array_shift($result);
|
|
</td></tr>
|
|
<tr><td>265</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>266</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>267</td>
|
|
<td class="red"> return $parent;
|
|
</td></tr>
|
|
<tr><td>268</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>269</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>270</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>271</td>
|
|
<td class="normal"> * gets ancestors for node
|
|
</td></tr>
|
|
<tr><td>272</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>273</td>
|
|
<td class="normal"> * @param integer $deth The depth 'upstairs'.
|
|
</td></tr>
|
|
<tr><td>274</td>
|
|
<td class="normal"> * @return mixed The ancestors of the node or FALSE if the node has no ancestors (this
|
|
</td></tr>
|
|
<tr><td>275</td>
|
|
<td class="normal"> * basically means it's a root node).
|
|
</td></tr>
|
|
<tr><td>276</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>277</td>
|
|
<td class="normal"> public function getAncestors($depth = null)
|
|
</td></tr>
|
|
<tr><td>278</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>279</td>
|
|
<td class="covered"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>280</td>
|
|
<td class="covered"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>281</td>
|
|
<td class="covered"> $q->addWhere("$baseAlias.lft < ? AND $baseAlias.rgt > ?", array($this->getLeftValue(), $this->getRightValue()))
|
|
</td></tr>
|
|
<tr><td>282</td>
|
|
<td class="covered"> ->addOrderBy("$baseAlias.lft asc");
|
|
</td></tr>
|
|
<tr><td>283</td>
|
|
<td class="covered"> if ($depth !== null) {
|
|
</td></tr>
|
|
<tr><td>284</td>
|
|
<td class="red"> $q->addWhere("$baseAlias.level >= ?", $this->record['level'] - $depth);
|
|
</td></tr>
|
|
<tr><td>285</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>286</td>
|
|
<td class="covered"> $q = $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>287</td>
|
|
<td class="covered"> $ancestors = $q->execute();
|
|
</td></tr>
|
|
<tr><td>288</td>
|
|
<td class="covered"> if (count($ancestors) <= 0) {
|
|
</td></tr>
|
|
<tr><td>289</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>290</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>291</td>
|
|
<td class="covered"> return $ancestors;
|
|
</td></tr>
|
|
<tr><td>292</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>293</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>294</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>295</td>
|
|
<td class="normal"> * gets path to node from root, uses record::toString() method to get node names
|
|
</td></tr>
|
|
<tr><td>296</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>297</td>
|
|
<td class="normal"> * @param string $seperator path seperator
|
|
</td></tr>
|
|
<tr><td>298</td>
|
|
<td class="normal"> * @param bool $includeNode whether or not to include node at end of path
|
|
</td></tr>
|
|
<tr><td>299</td>
|
|
<td class="normal"> * @return string string representation of path
|
|
</td></tr>
|
|
<tr><td>300</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>301</td>
|
|
<td class="normal"> public function getPath($seperator = ' > ', $includeRecord = false)
|
|
</td></tr>
|
|
<tr><td>302</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>303</td>
|
|
<td class="red"> $path = array();
|
|
</td></tr>
|
|
<tr><td>304</td>
|
|
<td class="red"> $ancestors = $this->getAncestors();
|
|
</td></tr>
|
|
<tr><td>305</td>
|
|
<td class="red"> foreach ($ancestors as $ancestor) {
|
|
</td></tr>
|
|
<tr><td>306</td>
|
|
<td class="red"> $path[] = $ancestor->__toString();
|
|
</td></tr>
|
|
<tr><td>307</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>308</td>
|
|
<td class="red"> if ($includeRecord) {
|
|
</td></tr>
|
|
<tr><td>309</td>
|
|
<td class="red"> $path[] = $this->getRecord()->__toString();
|
|
</td></tr>
|
|
<tr><td>310</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>311</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>312</td>
|
|
<td class="red"> return implode($seperator, $path);
|
|
</td></tr>
|
|
<tr><td>313</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>314</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>315</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>316</td>
|
|
<td class="normal"> * gets number of children (direct descendants)
|
|
</td></tr>
|
|
<tr><td>317</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>318</td>
|
|
<td class="normal"> * @return int
|
|
</td></tr>
|
|
<tr><td>319</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>320</td>
|
|
<td class="normal"> public function getNumberChildren()
|
|
</td></tr>
|
|
<tr><td>321</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>322</td>
|
|
<td class="covered"> return count($this->getChildren());
|
|
</td></tr>
|
|
<tr><td>323</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>324</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>325</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>326</td>
|
|
<td class="normal"> * gets number of descendants (children and their children)
|
|
</td></tr>
|
|
<tr><td>327</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>328</td>
|
|
<td class="normal"> * @return int
|
|
</td></tr>
|
|
<tr><td>329</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>330</td>
|
|
<td class="normal"> public function getNumberDescendants()
|
|
</td></tr>
|
|
<tr><td>331</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>332</td>
|
|
<td class="red"> return ($this->getRightValue() - $this->getLeftValue() - 1) / 2;
|
|
</td></tr>
|
|
<tr><td>333</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>334</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>335</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>336</td>
|
|
<td class="normal"> * inserts node as parent of dest record
|
|
</td></tr>
|
|
<tr><td>337</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>338</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>339</td>
|
|
<td class="normal"> * @todo Wrap in transaction
|
|
</td></tr>
|
|
<tr><td>340</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>341</td>
|
|
<td class="normal"> public function insertAsParentOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>342</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>343</td>
|
|
<td class="normal"> // cannot insert a node that has already has a place within the tree
|
|
</td></tr>
|
|
<tr><td>344</td>
|
|
<td class="red"> if ($this->isValidNode()) {
|
|
</td></tr>
|
|
<tr><td>345</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>346</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>347</td>
|
|
<td class="normal"> // cannot insert as parent of root
|
|
</td></tr>
|
|
<tr><td>348</td>
|
|
<td class="red"> if ($dest->getNode()->isRoot()) {
|
|
</td></tr>
|
|
<tr><td>349</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>350</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>351</td>
|
|
<td class="red"> $newRoot = $dest->getNode()->getRootValue();
|
|
</td></tr>
|
|
<tr><td>352</td>
|
|
<td class="red"> $this->shiftRLValues($dest->getNode()->getLeftValue(), 1, $newRoot);
|
|
</td></tr>
|
|
<tr><td>353</td>
|
|
<td class="red"> $this->shiftRLValues($dest->getNode()->getRightValue() + 2, 1, $newRoot);
|
|
</td></tr>
|
|
<tr><td>354</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>355</td>
|
|
<td class="red"> $newLeft = $dest->getNode()->getLeftValue();
|
|
</td></tr>
|
|
<tr><td>356</td>
|
|
<td class="red"> $newRight = $dest->getNode()->getRightValue() + 2;
|
|
</td></tr>
|
|
<tr><td>357</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>358</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'] - 1;
|
|
</td></tr>
|
|
<tr><td>359</td>
|
|
<td class="red"> $this->insertNode($newLeft, $newRight, $newRoot);
|
|
</td></tr>
|
|
<tr><td>360</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>361</td>
|
|
<td class="red"> return true;
|
|
</td></tr>
|
|
<tr><td>362</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>363</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>364</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>365</td>
|
|
<td class="normal"> * inserts node as previous sibling of dest record
|
|
</td></tr>
|
|
<tr><td>366</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>367</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>368</td>
|
|
<td class="normal"> * @todo Wrap in transaction
|
|
</td></tr>
|
|
<tr><td>369</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>370</td>
|
|
<td class="normal"> public function insertAsPrevSiblingOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>371</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>372</td>
|
|
<td class="normal"> // cannot insert a node that has already has a place within the tree
|
|
</td></tr>
|
|
<tr><td>373</td>
|
|
<td class="red"> if ($this->isValidNode())
|
|
</td></tr>
|
|
<tr><td>374</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>375</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>376</td>
|
|
<td class="red"> $newLeft = $dest->getNode()->getLeftValue();
|
|
</td></tr>
|
|
<tr><td>377</td>
|
|
<td class="red"> $newRight = $dest->getNode()->getLeftValue() + 1;
|
|
</td></tr>
|
|
<tr><td>378</td>
|
|
<td class="red"> $newRoot = $dest->getNode()->getRootValue();
|
|
</td></tr>
|
|
<tr><td>379</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>380</td>
|
|
<td class="red"> $this->shiftRLValues($newLeft, 2, $newRoot);
|
|
</td></tr>
|
|
<tr><td>381</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'];
|
|
</td></tr>
|
|
<tr><td>382</td>
|
|
<td class="red"> $this->insertNode($newLeft, $newRight, $newRoot);
|
|
</td></tr>
|
|
<tr><td>383</td>
|
|
<td class="normal"> // update destination left/right values to prevent a refresh
|
|
</td></tr>
|
|
<tr><td>384</td>
|
|
<td class="normal"> // $dest->getNode()->setLeftValue($dest->getNode()->getLeftValue() + 2);
|
|
</td></tr>
|
|
<tr><td>385</td>
|
|
<td class="normal"> // $dest->getNode()->setRightValue($dest->getNode()->getRightValue() + 2);
|
|
</td></tr>
|
|
<tr><td>386</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>387</td>
|
|
<td class="red"> return true;
|
|
</td></tr>
|
|
<tr><td>388</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>389</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>390</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>391</td>
|
|
<td class="normal"> * inserts node as next sibling of dest record
|
|
</td></tr>
|
|
<tr><td>392</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>393</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>394</td>
|
|
<td class="normal"> * @todo Wrap in transaction
|
|
</td></tr>
|
|
<tr><td>395</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>396</td>
|
|
<td class="normal"> public function insertAsNextSiblingOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>397</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>398</td>
|
|
<td class="normal"> // cannot insert a node that has already has a place within the tree
|
|
</td></tr>
|
|
<tr><td>399</td>
|
|
<td class="red"> if ($this->isValidNode())
|
|
</td></tr>
|
|
<tr><td>400</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>401</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>402</td>
|
|
<td class="red"> $newLeft = $dest->getNode()->getRightValue() + 1;
|
|
</td></tr>
|
|
<tr><td>403</td>
|
|
<td class="red"> $newRight = $dest->getNode()->getRightValue() + 2;
|
|
</td></tr>
|
|
<tr><td>404</td>
|
|
<td class="red"> $newRoot = $dest->getNode()->getRootValue();
|
|
</td></tr>
|
|
<tr><td>405</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>406</td>
|
|
<td class="red"> $this->shiftRLValues($newLeft, 2, $newRoot);
|
|
</td></tr>
|
|
<tr><td>407</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'];
|
|
</td></tr>
|
|
<tr><td>408</td>
|
|
<td class="red"> $this->insertNode($newLeft, $newRight, $newRoot);
|
|
</td></tr>
|
|
<tr><td>409</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>410</td>
|
|
<td class="normal"> // update destination left/right values to prevent a refresh
|
|
</td></tr>
|
|
<tr><td>411</td>
|
|
<td class="normal"> // no need, node not affected
|
|
</td></tr>
|
|
<tr><td>412</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>413</td>
|
|
<td class="red"> return true;
|
|
</td></tr>
|
|
<tr><td>414</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>415</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>416</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>417</td>
|
|
<td class="normal"> * inserts node as first child of dest record
|
|
</td></tr>
|
|
<tr><td>418</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>419</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>420</td>
|
|
<td class="normal"> * @todo Wrap in transaction
|
|
</td></tr>
|
|
<tr><td>421</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>422</td>
|
|
<td class="normal"> public function insertAsFirstChildOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>423</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>424</td>
|
|
<td class="normal"> // cannot insert a node that has already has a place within the tree
|
|
</td></tr>
|
|
<tr><td>425</td>
|
|
<td class="red"> if ($this->isValidNode())
|
|
</td></tr>
|
|
<tr><td>426</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>427</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>428</td>
|
|
<td class="red"> $newLeft = $dest->getNode()->getLeftValue() + 1;
|
|
</td></tr>
|
|
<tr><td>429</td>
|
|
<td class="red"> $newRight = $dest->getNode()->getLeftValue() + 2;
|
|
</td></tr>
|
|
<tr><td>430</td>
|
|
<td class="red"> $newRoot = $dest->getNode()->getRootValue();
|
|
</td></tr>
|
|
<tr><td>431</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>432</td>
|
|
<td class="red"> $this->shiftRLValues($newLeft, 2, $newRoot);
|
|
</td></tr>
|
|
<tr><td>433</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'] + 1;
|
|
</td></tr>
|
|
<tr><td>434</td>
|
|
<td class="red"> $this->insertNode($newLeft, $newRight, $newRoot);
|
|
</td></tr>
|
|
<tr><td>435</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>436</td>
|
|
<td class="normal"> // update destination left/right values to prevent a refresh
|
|
</td></tr>
|
|
<tr><td>437</td>
|
|
<td class="normal"> // $dest->getNode()->setRightValue($dest->getNode()->getRightValue() + 2);
|
|
</td></tr>
|
|
<tr><td>438</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>439</td>
|
|
<td class="red"> return true;
|
|
</td></tr>
|
|
<tr><td>440</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>441</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>442</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>443</td>
|
|
<td class="normal"> * inserts node as last child of dest record
|
|
</td></tr>
|
|
<tr><td>444</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>445</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>446</td>
|
|
<td class="normal"> * @todo Wrap in transaction
|
|
</td></tr>
|
|
<tr><td>447</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>448</td>
|
|
<td class="normal"> public function insertAsLastChildOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>449</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>450</td>
|
|
<td class="normal"> // cannot insert a node that has already has a place within the tree
|
|
</td></tr>
|
|
<tr><td>451</td>
|
|
<td class="covered"> if ($this->isValidNode())
|
|
</td></tr>
|
|
<tr><td>452</td>
|
|
<td class="covered"> return false;
|
|
</td></tr>
|
|
<tr><td>453</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>454</td>
|
|
<td class="covered"> $newLeft = $dest->getNode()->getRightValue();
|
|
</td></tr>
|
|
<tr><td>455</td>
|
|
<td class="covered"> $newRight = $dest->getNode()->getRightValue() + 1;
|
|
</td></tr>
|
|
<tr><td>456</td>
|
|
<td class="covered"> $newRoot = $dest->getNode()->getRootValue();
|
|
</td></tr>
|
|
<tr><td>457</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>458</td>
|
|
<td class="covered"> $this->shiftRLValues($newLeft, 2, $newRoot);
|
|
</td></tr>
|
|
<tr><td>459</td>
|
|
<td class="covered"> $this->record['level'] = $dest['level'] + 1;
|
|
</td></tr>
|
|
<tr><td>460</td>
|
|
<td class="covered"> $this->insertNode($newLeft, $newRight, $newRoot);
|
|
</td></tr>
|
|
<tr><td>461</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>462</td>
|
|
<td class="normal"> // update destination left/right values to prevent a refresh
|
|
</td></tr>
|
|
<tr><td>463</td>
|
|
<td class="normal"> // $dest->getNode()->setRightValue($dest->getNode()->getRightValue() + 2);
|
|
</td></tr>
|
|
<tr><td>464</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>465</td>
|
|
<td class="covered"> return true;
|
|
</td></tr>
|
|
<tr><td>466</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>467</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>468</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>469</td>
|
|
<td class="normal"> * Accomplishes moving of nodes between different trees.
|
|
</td></tr>
|
|
<tr><td>470</td>
|
|
<td class="normal"> * Used by the move* methods if the root values of the two nodes are different.
|
|
</td></tr>
|
|
<tr><td>471</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>472</td>
|
|
<td class="normal"> * @param Doctrine_Record $dest
|
|
</td></tr>
|
|
<tr><td>473</td>
|
|
<td class="normal"> * @param unknown_type $newLeftValue
|
|
</td></tr>
|
|
<tr><td>474</td>
|
|
<td class="normal"> * @param unknown_type $moveType
|
|
</td></tr>
|
|
<tr><td>475</td>
|
|
<td class="normal"> * @todo Better exception handling/wrapping
|
|
</td></tr>
|
|
<tr><td>476</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>477</td>
|
|
<td class="normal"> private function _moveBetweenTrees(Doctrine_Record $dest, $newLeftValue, $moveType)
|
|
</td></tr>
|
|
<tr><td>478</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>479</td>
|
|
<td class="red"> $conn = $this->record->getTable()->getConnection();
|
|
</td></tr>
|
|
<tr><td>480</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>481</td>
|
|
<td class="normal"> try {
|
|
</td></tr>
|
|
<tr><td>482</td>
|
|
<td class="red"> $conn->beginTransaction();
|
|
</td></tr>
|
|
<tr><td>483</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>484</td>
|
|
<td class="normal"> // Move between trees: Detach from old tree & insert into new tree
|
|
</td></tr>
|
|
<tr><td>485</td>
|
|
<td class="red"> $newRoot = $dest->getNode()->getRootValue();
|
|
</td></tr>
|
|
<tr><td>486</td>
|
|
<td class="red"> $oldRoot = $this->getRootValue();
|
|
</td></tr>
|
|
<tr><td>487</td>
|
|
<td class="red"> $oldLft = $this->getLeftValue();
|
|
</td></tr>
|
|
<tr><td>488</td>
|
|
<td class="red"> $oldRgt = $this->getRightValue();
|
|
</td></tr>
|
|
<tr><td>489</td>
|
|
<td class="red"> $oldLevel = $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>490</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>491</td>
|
|
<td class="normal"> // Prepare target tree for insertion, make room
|
|
</td></tr>
|
|
<tr><td>492</td>
|
|
<td class="red"> $this->shiftRlValues($newLeftValue, $oldRgt - $oldLft - 1, $newRoot);
|
|
</td></tr>
|
|
<tr><td>493</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>494</td>
|
|
<td class="normal"> // Set new root id for this node
|
|
</td></tr>
|
|
<tr><td>495</td>
|
|
<td class="red"> $this->setRootValue($newRoot);
|
|
</td></tr>
|
|
<tr><td>496</td>
|
|
<td class="red"> $this->record->save();
|
|
</td></tr>
|
|
<tr><td>497</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>498</td>
|
|
<td class="normal"> // Close gap in old tree
|
|
</td></tr>
|
|
<tr><td>499</td>
|
|
<td class="red"> $first = $oldRgt + 1;
|
|
</td></tr>
|
|
<tr><td>500</td>
|
|
<td class="red"> $delta = $oldLft - $oldRgt - 1;
|
|
</td></tr>
|
|
<tr><td>501</td>
|
|
<td class="red"> $this->shiftRLValues($first, $delta, $oldRoot);
|
|
</td></tr>
|
|
<tr><td>502</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>503</td>
|
|
<td class="normal"> // Insert this node as a new node
|
|
</td></tr>
|
|
<tr><td>504</td>
|
|
<td class="red"> $this->setRightValue(0);
|
|
</td></tr>
|
|
<tr><td>505</td>
|
|
<td class="red"> $this->setLeftValue(0);
|
|
</td></tr>
|
|
<tr><td>506</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>507</td>
|
|
<td class="normal"> switch ($moveType) {
|
|
</td></tr>
|
|
<tr><td>508</td>
|
|
<td class="red"> case 'moveAsPrevSiblingOf':
|
|
</td></tr>
|
|
<tr><td>509</td>
|
|
<td class="red"> $this->insertAsPrevSiblingOf($dest);
|
|
</td></tr>
|
|
<tr><td>510</td>
|
|
<td class="red"> break;
|
|
</td></tr>
|
|
<tr><td>511</td>
|
|
<td class="red"> case 'moveAsFirstChildOf':
|
|
</td></tr>
|
|
<tr><td>512</td>
|
|
<td class="red"> $this->insertAsFirstChildOf($dest);
|
|
</td></tr>
|
|
<tr><td>513</td>
|
|
<td class="red"> break;
|
|
</td></tr>
|
|
<tr><td>514</td>
|
|
<td class="red"> case 'moveAsNextSiblingOf':
|
|
</td></tr>
|
|
<tr><td>515</td>
|
|
<td class="red"> $this->insertAsNextSiblingOf($dest);
|
|
</td></tr>
|
|
<tr><td>516</td>
|
|
<td class="red"> break;
|
|
</td></tr>
|
|
<tr><td>517</td>
|
|
<td class="red"> case 'moveAsLastChildOf':
|
|
</td></tr>
|
|
<tr><td>518</td>
|
|
<td class="red"> $this->insertAsLastChildOf($dest);
|
|
</td></tr>
|
|
<tr><td>519</td>
|
|
<td class="red"> break;
|
|
</td></tr>
|
|
<tr><td>520</td>
|
|
<td class="red"> default:
|
|
</td></tr>
|
|
<tr><td>521</td>
|
|
<td class="red"> throw new Exception("Unknown move operation: $moveType.");
|
|
</td></tr>
|
|
<tr><td>522</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>523</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>524</td>
|
|
<td class="red"> $diff = $oldRgt - $oldLft;
|
|
</td></tr>
|
|
<tr><td>525</td>
|
|
<td class="red"> $this->setRightValue($this->getLeftValue() + ($oldRgt - $oldLft));
|
|
</td></tr>
|
|
<tr><td>526</td>
|
|
<td class="red"> $this->record->save();
|
|
</td></tr>
|
|
<tr><td>527</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>528</td>
|
|
<td class="red"> $newLevel = $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>529</td>
|
|
<td class="red"> $levelDiff = $newLevel - $oldLevel;
|
|
</td></tr>
|
|
<tr><td>530</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>531</td>
|
|
<td class="normal"> // Relocate descendants of the node
|
|
</td></tr>
|
|
<tr><td>532</td>
|
|
<td class="red"> $diff = $this->getLeftValue() - $oldLft;
|
|
</td></tr>
|
|
<tr><td>533</td>
|
|
<td class="red"> $componentName = $this->_tree->getBaseComponent();
|
|
</td></tr>
|
|
<tr><td>534</td>
|
|
<td class="red"> $rootColName = $this->_tree->getAttribute('rootColumnName');
|
|
</td></tr>
|
|
<tr><td>535</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>536</td>
|
|
<td class="normal"> // Update lft/rgt/root/level for all descendants
|
|
</td></tr>
|
|
<tr><td>537</td>
|
|
<td class="red"> $q = new Doctrine_Query($conn);
|
|
</td></tr>
|
|
<tr><td>538</td>
|
|
<td class="red"> $q = $q->update($componentName)
|
|
</td></tr>
|
|
<tr><td>539</td>
|
|
<td class="red"> ->set($componentName . '.lft', 'lft + ?', $diff)
|
|
</td></tr>
|
|
<tr><td>540</td>
|
|
<td class="red"> ->set($componentName . '.rgt', 'rgt + ?', $diff)
|
|
</td></tr>
|
|
<tr><td>541</td>
|
|
<td class="red"> ->set($componentName . '.level', 'level + ?', $levelDiff)
|
|
</td></tr>
|
|
<tr><td>542</td>
|
|
<td class="red"> ->set($componentName . '.' . $rootColName, '?', $newRoot)
|
|
</td></tr>
|
|
<tr><td>543</td>
|
|
<td class="red"> ->where($componentName . '.lft > ? AND ' . $componentName . '.rgt < ?',
|
|
</td></tr>
|
|
<tr><td>544</td>
|
|
<td class="red"> array($oldLft, $oldRgt));
|
|
</td></tr>
|
|
<tr><td>545</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $oldRoot);
|
|
</td></tr>
|
|
<tr><td>546</td>
|
|
<td class="red"> $q->execute();
|
|
</td></tr>
|
|
<tr><td>547</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>548</td>
|
|
<td class="red"> $conn->commit();
|
|
</td></tr>
|
|
<tr><td>549</td>
|
|
<td class="red"> } catch (Exception $e) {
|
|
</td></tr>
|
|
<tr><td>550</td>
|
|
<td class="red"> $conn->rollback();
|
|
</td></tr>
|
|
<tr><td>551</td>
|
|
<td class="red"> throw $e;
|
|
</td></tr>
|
|
<tr><td>552</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>553</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>554</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>555</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>556</td>
|
|
<td class="normal"> * moves node as prev sibling of dest record
|
|
</td></tr>
|
|
<tr><td>557</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>558</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>559</td>
|
|
<td class="normal"> public function moveAsPrevSiblingOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>560</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>561</td>
|
|
<td class="red"> if ($dest->getNode()->getRootValue() != $this->getRootValue()) {
|
|
</td></tr>
|
|
<tr><td>562</td>
|
|
<td class="normal"> // Move between trees
|
|
</td></tr>
|
|
<tr><td>563</td>
|
|
<td class="red"> $this->_moveBetweenTrees($dest, $dest->getNode()->getLeftValue(), __FUNCTION__);
|
|
</td></tr>
|
|
<tr><td>564</td>
|
|
<td class="red"> } else {
|
|
</td></tr>
|
|
<tr><td>565</td>
|
|
<td class="normal"> // Move within the tree
|
|
</td></tr>
|
|
<tr><td>566</td>
|
|
<td class="red"> $oldLevel = $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>567</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'];
|
|
</td></tr>
|
|
<tr><td>568</td>
|
|
<td class="red"> $this->updateNode($dest->getNode()->getLeftValue(), $this->record['level'] - $oldLevel);
|
|
</td></tr>
|
|
<tr><td>569</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>570</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>571</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>572</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>573</td>
|
|
<td class="normal"> * moves node as next sibling of dest record
|
|
</td></tr>
|
|
<tr><td>574</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>575</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>576</td>
|
|
<td class="normal"> public function moveAsNextSiblingOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>577</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>578</td>
|
|
<td class="red"> if ($dest->getNode()->getRootValue() != $this->getRootValue()) {
|
|
</td></tr>
|
|
<tr><td>579</td>
|
|
<td class="normal"> // Move between trees
|
|
</td></tr>
|
|
<tr><td>580</td>
|
|
<td class="red"> $this->_moveBetweenTrees($dest, $dest->getNode()->getRightValue() + 1, __FUNCTION__);
|
|
</td></tr>
|
|
<tr><td>581</td>
|
|
<td class="red"> } else {
|
|
</td></tr>
|
|
<tr><td>582</td>
|
|
<td class="normal"> // Move within tree
|
|
</td></tr>
|
|
<tr><td>583</td>
|
|
<td class="red"> $oldLevel = $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>584</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'];
|
|
</td></tr>
|
|
<tr><td>585</td>
|
|
<td class="red"> $this->updateNode($dest->getNode()->getRightValue() + 1, $this->record['level'] - $oldLevel);
|
|
</td></tr>
|
|
<tr><td>586</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>587</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>588</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>589</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>590</td>
|
|
<td class="normal"> * moves node as first child of dest record
|
|
</td></tr>
|
|
<tr><td>591</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>592</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>593</td>
|
|
<td class="normal"> public function moveAsFirstChildOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>594</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>595</td>
|
|
<td class="red"> if ($dest->getNode()->getRootValue() != $this->getRootValue()) {
|
|
</td></tr>
|
|
<tr><td>596</td>
|
|
<td class="normal"> // Move between trees
|
|
</td></tr>
|
|
<tr><td>597</td>
|
|
<td class="red"> $this->_moveBetweenTrees($dest, $dest->getNode()->getLeftValue() + 1, __FUNCTION__);
|
|
</td></tr>
|
|
<tr><td>598</td>
|
|
<td class="red"> } else {
|
|
</td></tr>
|
|
<tr><td>599</td>
|
|
<td class="normal"> // Move within tree
|
|
</td></tr>
|
|
<tr><td>600</td>
|
|
<td class="red"> $oldLevel = $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>601</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'] + 1;
|
|
</td></tr>
|
|
<tr><td>602</td>
|
|
<td class="red"> $this->updateNode($dest->getNode()->getLeftValue() + 1, $this->record['level'] - $oldLevel);
|
|
</td></tr>
|
|
<tr><td>603</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>604</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>605</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>606</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>607</td>
|
|
<td class="normal"> * moves node as last child of dest record
|
|
</td></tr>
|
|
<tr><td>608</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>609</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>610</td>
|
|
<td class="normal"> public function moveAsLastChildOf(Doctrine_Record $dest)
|
|
</td></tr>
|
|
<tr><td>611</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>612</td>
|
|
<td class="red"> if ($dest->getNode()->getRootValue() != $this->getRootValue()) {
|
|
</td></tr>
|
|
<tr><td>613</td>
|
|
<td class="normal"> // Move between trees
|
|
</td></tr>
|
|
<tr><td>614</td>
|
|
<td class="red"> $this->_moveBetweenTrees($dest, $dest->getNode()->getRightValue(), __FUNCTION__);
|
|
</td></tr>
|
|
<tr><td>615</td>
|
|
<td class="red"> } else {
|
|
</td></tr>
|
|
<tr><td>616</td>
|
|
<td class="normal"> // Move within tree
|
|
</td></tr>
|
|
<tr><td>617</td>
|
|
<td class="red"> $oldLevel = $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>618</td>
|
|
<td class="red"> $this->record['level'] = $dest['level'] + 1;
|
|
</td></tr>
|
|
<tr><td>619</td>
|
|
<td class="red"> $this->updateNode($dest->getNode()->getRightValue(), $this->record['level'] - $oldLevel);
|
|
</td></tr>
|
|
<tr><td>620</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>621</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>622</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>623</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>624</td>
|
|
<td class="normal"> * Makes this node a root node. Only used in multiple-root trees.
|
|
</td></tr>
|
|
<tr><td>625</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>626</td>
|
|
<td class="normal"> * @todo Exception handling/wrapping
|
|
</td></tr>
|
|
<tr><td>627</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>628</td>
|
|
<td class="normal"> public function makeRoot($newRootId)
|
|
</td></tr>
|
|
<tr><td>629</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>630</td>
|
|
<td class="normal"> // TODO: throw exception instead?
|
|
</td></tr>
|
|
<tr><td>631</td>
|
|
<td class="red"> if ($this->getLeftValue() == 1 || ! $this->_tree->getAttribute('hasManyRoots')) {
|
|
</td></tr>
|
|
<tr><td>632</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>633</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>634</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>635</td>
|
|
<td class="red"> $oldRgt = $this->getRightValue();
|
|
</td></tr>
|
|
<tr><td>636</td>
|
|
<td class="red"> $oldLft = $this->getLeftValue();
|
|
</td></tr>
|
|
<tr><td>637</td>
|
|
<td class="red"> $oldRoot = $this->getRootValue();
|
|
</td></tr>
|
|
<tr><td>638</td>
|
|
<td class="red"> $oldLevel = $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>639</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>640</td>
|
|
<td class="normal"> try {
|
|
</td></tr>
|
|
<tr><td>641</td>
|
|
<td class="red"> $conn = $this->record->getTable()->getConnection();
|
|
</td></tr>
|
|
<tr><td>642</td>
|
|
<td class="red"> $conn->beginTransaction();
|
|
</td></tr>
|
|
<tr><td>643</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>644</td>
|
|
<td class="normal"> // Detach from old tree (close gap in old tree)
|
|
</td></tr>
|
|
<tr><td>645</td>
|
|
<td class="red"> $first = $oldRgt + 1;
|
|
</td></tr>
|
|
<tr><td>646</td>
|
|
<td class="red"> $delta = $oldLft - $oldRgt - 1;
|
|
</td></tr>
|
|
<tr><td>647</td>
|
|
<td class="red"> $this->shiftRLValues($first, $delta, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>648</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>649</td>
|
|
<td class="normal"> // Set new lft/rgt/root/level values for root node
|
|
</td></tr>
|
|
<tr><td>650</td>
|
|
<td class="red"> $this->setLeftValue(1);
|
|
</td></tr>
|
|
<tr><td>651</td>
|
|
<td class="red"> $this->setRightValue($oldRgt - $oldLft + 1);
|
|
</td></tr>
|
|
<tr><td>652</td>
|
|
<td class="red"> $this->setRootValue($newRootId);
|
|
</td></tr>
|
|
<tr><td>653</td>
|
|
<td class="red"> $this->record['level'] = 0;
|
|
</td></tr>
|
|
<tr><td>654</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>655</td>
|
|
<td class="normal"> // Update descendants lft/rgt/root/level values
|
|
</td></tr>
|
|
<tr><td>656</td>
|
|
<td class="red"> $diff = 1 - $oldLft;
|
|
</td></tr>
|
|
<tr><td>657</td>
|
|
<td class="red"> $newRoot = $newRootId;
|
|
</td></tr>
|
|
<tr><td>658</td>
|
|
<td class="red"> $componentName = $this->_tree->getBaseComponent();
|
|
</td></tr>
|
|
<tr><td>659</td>
|
|
<td class="red"> $rootColName = $this->_tree->getAttribute('rootColumnName');
|
|
</td></tr>
|
|
<tr><td>660</td>
|
|
<td class="red"> $q = new Doctrine_Query($conn);
|
|
</td></tr>
|
|
<tr><td>661</td>
|
|
<td class="red"> $q = $q->update($componentName)
|
|
</td></tr>
|
|
<tr><td>662</td>
|
|
<td class="red"> ->set($componentName . '.lft', 'lft + ?', $diff)
|
|
</td></tr>
|
|
<tr><td>663</td>
|
|
<td class="red"> ->set($componentName . '.rgt', 'rgt + ?', $diff)
|
|
</td></tr>
|
|
<tr><td>664</td>
|
|
<td class="red"> ->set($componentName . '.level', 'level - ?', $oldLevel)
|
|
</td></tr>
|
|
<tr><td>665</td>
|
|
<td class="red"> ->set($componentName . '.' . $rootColName, '?', $newRoot)
|
|
</td></tr>
|
|
<tr><td>666</td>
|
|
<td class="red"> ->where($componentName . '.lft > ? AND ' . $componentName . '.rgt < ?',
|
|
</td></tr>
|
|
<tr><td>667</td>
|
|
<td class="red"> array($oldLft, $oldRgt));
|
|
</td></tr>
|
|
<tr><td>668</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $oldRoot);
|
|
</td></tr>
|
|
<tr><td>669</td>
|
|
<td class="red"> $q->execute();
|
|
</td></tr>
|
|
<tr><td>670</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>671</td>
|
|
<td class="red"> $conn->commit();
|
|
</td></tr>
|
|
<tr><td>672</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>673</td>
|
|
<td class="red"> } catch (Exception $e) {
|
|
</td></tr>
|
|
<tr><td>674</td>
|
|
<td class="orange"> $conn->rollback();
|
|
</td></tr>
|
|
<tr><td>675</td>
|
|
<td class="orange"> throw $e;
|
|
</td></tr>
|
|
<tr><td>676</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>677</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>678</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>679</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>680</td>
|
|
<td class="normal"> * adds node as last child of record
|
|
</td></tr>
|
|
<tr><td>681</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>682</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>683</td>
|
|
<td class="normal"> public function addChild(Doctrine_Record $record)
|
|
</td></tr>
|
|
<tr><td>684</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>685</td>
|
|
<td class="red"> $record->getNode()->insertAsLastChildOf($this->getRecord());
|
|
</td></tr>
|
|
<tr><td>686</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>687</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>688</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>689</td>
|
|
<td class="normal"> * determines if node is leaf
|
|
</td></tr>
|
|
<tr><td>690</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>691</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>692</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>693</td>
|
|
<td class="normal"> public function isLeaf()
|
|
</td></tr>
|
|
<tr><td>694</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>695</td>
|
|
<td class="red"> return (($this->getRightValue() - $this->getLeftValue()) == 1);
|
|
</td></tr>
|
|
<tr><td>696</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>697</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>698</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>699</td>
|
|
<td class="normal"> * determines if node is root
|
|
</td></tr>
|
|
<tr><td>700</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>701</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>702</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>703</td>
|
|
<td class="normal"> public function isRoot()
|
|
</td></tr>
|
|
<tr><td>704</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>705</td>
|
|
<td class="red"> return ($this->getLeftValue() == 1);
|
|
</td></tr>
|
|
<tr><td>706</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>707</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>708</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>709</td>
|
|
<td class="normal"> * determines if node is equal to subject node
|
|
</td></tr>
|
|
<tr><td>710</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>711</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>712</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>713</td>
|
|
<td class="normal"> public function isEqualTo(Doctrine_Record $subj)
|
|
</td></tr>
|
|
<tr><td>714</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>715</td>
|
|
<td class="red"> return (($this->getLeftValue() == $subj->getNode()->getLeftValue()) &&
|
|
</td></tr>
|
|
<tr><td>716</td>
|
|
<td class="red"> ($this->getRightValue() == $subj->getNode()->getRightValue()) &&
|
|
</td></tr>
|
|
<tr><td>717</td>
|
|
<td class="red"> ($this->getRootValue() == $subj->getNode()->getRootValue())
|
|
</td></tr>
|
|
<tr><td>718</td>
|
|
<td class="red"> );
|
|
</td></tr>
|
|
<tr><td>719</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>720</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>721</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>722</td>
|
|
<td class="normal"> * determines if node is child of subject node
|
|
</td></tr>
|
|
<tr><td>723</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>724</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>725</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>726</td>
|
|
<td class="normal"> public function isDescendantOf(Doctrine_Record $subj)
|
|
</td></tr>
|
|
<tr><td>727</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>728</td>
|
|
<td class="red"> return (($this->getLeftValue() > $subj->getNode()->getLeftValue()) &&
|
|
</td></tr>
|
|
<tr><td>729</td>
|
|
<td class="red"> ($this->getRightValue() < $subj->getNode()->getRightValue()) &&
|
|
</td></tr>
|
|
<tr><td>730</td>
|
|
<td class="red"> ($this->getRootValue() == $subj->getNode()->getRootValue()));
|
|
</td></tr>
|
|
<tr><td>731</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>732</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>733</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>734</td>
|
|
<td class="normal"> * determines if node is child of or sibling to subject node
|
|
</td></tr>
|
|
<tr><td>735</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>736</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>737</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>738</td>
|
|
<td class="normal"> public function isDescendantOfOrEqualTo(Doctrine_Record $subj)
|
|
</td></tr>
|
|
<tr><td>739</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>740</td>
|
|
<td class="red"> return (($this->getLeftValue() >= $subj->getNode()->getLeftValue()) &&
|
|
</td></tr>
|
|
<tr><td>741</td>
|
|
<td class="red"> ($this->getRightValue() <= $subj->getNode()->getRightValue()) &&
|
|
</td></tr>
|
|
<tr><td>742</td>
|
|
<td class="red"> ($this->getRootValue() == $subj->getNode()->getRootValue()));
|
|
</td></tr>
|
|
<tr><td>743</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>744</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>745</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>746</td>
|
|
<td class="normal"> * determines if node is valid
|
|
</td></tr>
|
|
<tr><td>747</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>748</td>
|
|
<td class="normal"> * @return bool
|
|
</td></tr>
|
|
<tr><td>749</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>750</td>
|
|
<td class="normal"> public function isValidNode($record = null)
|
|
</td></tr>
|
|
<tr><td>751</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>752</td>
|
|
<td class="covered"> if ($record === null) {
|
|
</td></tr>
|
|
<tr><td>753</td>
|
|
<td class="covered"> return ($this->getRightValue() > $this->getLeftValue());
|
|
</td></tr>
|
|
<tr><td>754</td>
|
|
<td class="red"> } else if ( $record instanceof Doctrine_Record ) {
|
|
</td></tr>
|
|
<tr><td>755</td>
|
|
<td class="red"> return ($record->getNode()->getRightValue() > $record->getNode()->getLeftValue());
|
|
</td></tr>
|
|
<tr><td>756</td>
|
|
<td class="orange"> } else {
|
|
</td></tr>
|
|
<tr><td>757</td>
|
|
<td class="red"> return false;
|
|
</td></tr>
|
|
<tr><td>758</td>
|
|
<td class="normal"> }
|
|
</td></tr>
|
|
<tr><td>759</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>760</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>761</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>762</td>
|
|
<td class="normal"> * deletes node and it's descendants
|
|
</td></tr>
|
|
<tr><td>763</td>
|
|
<td class="normal"> * @todo Delete more efficiently. Wrap in transaction if needed.
|
|
</td></tr>
|
|
<tr><td>764</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>765</td>
|
|
<td class="normal"> public function delete()
|
|
</td></tr>
|
|
<tr><td>766</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>767</td>
|
|
<td class="normal"> // TODO: add the setting whether or not to delete descendants or relocate children
|
|
</td></tr>
|
|
<tr><td>768</td>
|
|
<td class="red"> $oldRoot = $this->getRootValue();
|
|
</td></tr>
|
|
<tr><td>769</td>
|
|
<td class="red"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>770</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>771</td>
|
|
<td class="red"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>772</td>
|
|
<td class="red"> $componentName = $this->_tree->getBaseComponent();
|
|
</td></tr>
|
|
<tr><td>773</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>774</td>
|
|
<td class="red"> $q = $q->addWhere("$baseAlias.lft >= ? AND $baseAlias.rgt <= ?", array($this->getLeftValue(), $this->getRightValue()));
|
|
</td></tr>
|
|
<tr><td>775</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>776</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $oldRoot);
|
|
</td></tr>
|
|
<tr><td>777</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>778</td>
|
|
<td class="red"> $coll = $q->execute();
|
|
</td></tr>
|
|
<tr><td>779</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>780</td>
|
|
<td class="red"> $coll->delete();
|
|
</td></tr>
|
|
<tr><td>781</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>782</td>
|
|
<td class="red"> $first = $this->getRightValue() + 1;
|
|
</td></tr>
|
|
<tr><td>783</td>
|
|
<td class="red"> $delta = $this->getLeftValue() - $this->getRightValue() - 1;
|
|
</td></tr>
|
|
<tr><td>784</td>
|
|
<td class="red"> $this->shiftRLValues($first, $delta, $oldRoot);
|
|
</td></tr>
|
|
<tr><td>785</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>786</td>
|
|
<td class="red"> return true;
|
|
</td></tr>
|
|
<tr><td>787</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>788</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>789</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>790</td>
|
|
<td class="normal"> * sets node's left and right values and save's it
|
|
</td></tr>
|
|
<tr><td>791</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>792</td>
|
|
<td class="normal"> * @param int $destLeft node left value
|
|
</td></tr>
|
|
<tr><td>793</td>
|
|
<td class="normal"> * @param int $destRight node right value
|
|
</td></tr>
|
|
<tr><td>794</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>795</td>
|
|
<td class="normal"> private function insertNode($destLeft = 0, $destRight = 0, $destRoot = 1)
|
|
</td></tr>
|
|
<tr><td>796</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>797</td>
|
|
<td class="covered"> $this->setLeftValue($destLeft);
|
|
</td></tr>
|
|
<tr><td>798</td>
|
|
<td class="covered"> $this->setRightValue($destRight);
|
|
</td></tr>
|
|
<tr><td>799</td>
|
|
<td class="covered"> $this->setRootValue($destRoot);
|
|
</td></tr>
|
|
<tr><td>800</td>
|
|
<td class="covered"> $this->record->save();
|
|
</td></tr>
|
|
<tr><td>801</td>
|
|
<td class="covered"> }
|
|
</td></tr>
|
|
<tr><td>802</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>803</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>804</td>
|
|
<td class="normal"> * move node's and its children to location $destLeft and updates rest of tree
|
|
</td></tr>
|
|
<tr><td>805</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>806</td>
|
|
<td class="normal"> * @param int $destLeft destination left value
|
|
</td></tr>
|
|
<tr><td>807</td>
|
|
<td class="normal"> * @todo Wrap in transaction
|
|
</td></tr>
|
|
<tr><td>808</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>809</td>
|
|
<td class="normal"> private function updateNode($destLeft, $levelDiff)
|
|
</td></tr>
|
|
<tr><td>810</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>811</td>
|
|
<td class="red"> $componentName = $this->_tree->getBaseComponent();
|
|
</td></tr>
|
|
<tr><td>812</td>
|
|
<td class="red"> $left = $this->getLeftValue();
|
|
</td></tr>
|
|
<tr><td>813</td>
|
|
<td class="red"> $right = $this->getRightValue();
|
|
</td></tr>
|
|
<tr><td>814</td>
|
|
<td class="red"> $rootId = $this->getRootValue();
|
|
</td></tr>
|
|
<tr><td>815</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>816</td>
|
|
<td class="red"> $treeSize = $right - $left + 1;
|
|
</td></tr>
|
|
<tr><td>817</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>818</td>
|
|
<td class="normal"> // Make room in the new branch
|
|
</td></tr>
|
|
<tr><td>819</td>
|
|
<td class="red"> $this->shiftRLValues($destLeft, $treeSize, $rootId);
|
|
</td></tr>
|
|
<tr><td>820</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>821</td>
|
|
<td class="red"> if ($left >= $destLeft) { // src was shifted too?
|
|
</td></tr>
|
|
<tr><td>822</td>
|
|
<td class="red"> $left += $treeSize;
|
|
</td></tr>
|
|
<tr><td>823</td>
|
|
<td class="red"> $right += $treeSize;
|
|
</td></tr>
|
|
<tr><td>824</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>825</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>826</td>
|
|
<td class="normal"> // update level for descendants
|
|
</td></tr>
|
|
<tr><td>827</td>
|
|
<td class="red"> $q = new Doctrine_Query();
|
|
</td></tr>
|
|
<tr><td>828</td>
|
|
<td class="red"> $q = $q->update($componentName)
|
|
</td></tr>
|
|
<tr><td>829</td>
|
|
<td class="red"> ->set($componentName . '.level', 'level + ?')
|
|
</td></tr>
|
|
<tr><td>830</td>
|
|
<td class="red"> ->where($componentName . '.lft > ? AND ' . $componentName . '.rgt < ?',
|
|
</td></tr>
|
|
<tr><td>831</td>
|
|
<td class="red"> array($levelDiff, $left, $right));
|
|
</td></tr>
|
|
<tr><td>832</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $rootId);
|
|
</td></tr>
|
|
<tr><td>833</td>
|
|
<td class="red"> $q->execute();
|
|
</td></tr>
|
|
<tr><td>834</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>835</td>
|
|
<td class="normal"> // now there's enough room next to target to move the subtree
|
|
</td></tr>
|
|
<tr><td>836</td>
|
|
<td class="red"> $this->shiftRLRange($left, $right, $destLeft - $left, $rootId);
|
|
</td></tr>
|
|
<tr><td>837</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>838</td>
|
|
<td class="normal"> // correct values after source (close gap in old tree)
|
|
</td></tr>
|
|
<tr><td>839</td>
|
|
<td class="red"> $this->shiftRLValues($right + 1, -$treeSize, $rootId);
|
|
</td></tr>
|
|
<tr><td>840</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>841</td>
|
|
<td class="red"> $this->record->save();
|
|
</td></tr>
|
|
<tr><td>842</td>
|
|
<td class="red"> $this->record->refresh();
|
|
</td></tr>
|
|
<tr><td>843</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>844</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>845</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>846</td>
|
|
<td class="normal"> * adds '$delta' to all Left and Right values that are >= '$first'. '$delta' can also be negative.
|
|
</td></tr>
|
|
<tr><td>847</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>848</td>
|
|
<td class="normal"> * @param int $first First node to be shifted
|
|
</td></tr>
|
|
<tr><td>849</td>
|
|
<td class="normal"> * @param int $delta Value to be shifted by, can be negative
|
|
</td></tr>
|
|
<tr><td>850</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>851</td>
|
|
<td class="normal"> private function shiftRlValues($first, $delta, $rootId = 1)
|
|
</td></tr>
|
|
<tr><td>852</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>853</td>
|
|
<td class="covered"> $qLeft = new Doctrine_Query();
|
|
</td></tr>
|
|
<tr><td>854</td>
|
|
<td class="covered"> $qRight = new Doctrine_Query();
|
|
</td></tr>
|
|
<tr><td>855</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>856</td>
|
|
<td class="normal"> // shift left columns
|
|
</td></tr>
|
|
<tr><td>857</td>
|
|
<td class="covered"> $componentName = $this->_tree->getBaseComponent();
|
|
</td></tr>
|
|
<tr><td>858</td>
|
|
<td class="covered"> $qLeft = $qLeft->update($componentName)
|
|
</td></tr>
|
|
<tr><td>859</td>
|
|
<td class="covered"> ->set($componentName . '.lft', 'lft + ?')
|
|
</td></tr>
|
|
<tr><td>860</td>
|
|
<td class="covered"> ->where($componentName . '.lft >= ?', array($delta, $first));
|
|
</td></tr>
|
|
<tr><td>861</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>862</td>
|
|
<td class="covered"> $qLeft = $this->_tree->returnQueryWithRootId($qLeft, $rootId);
|
|
</td></tr>
|
|
<tr><td>863</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>864</td>
|
|
<td class="covered"> $resultLeft = $qLeft->execute();
|
|
</td></tr>
|
|
<tr><td>865</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>866</td>
|
|
<td class="normal"> // shift right columns
|
|
</td></tr>
|
|
<tr><td>867</td>
|
|
<td class="covered"> $resultRight = $qRight->update($componentName)
|
|
</td></tr>
|
|
<tr><td>868</td>
|
|
<td class="covered"> ->set($componentName . '.rgt', 'rgt + ?')
|
|
</td></tr>
|
|
<tr><td>869</td>
|
|
<td class="covered"> ->where($componentName . '.rgt >= ?', array($delta, $first));
|
|
</td></tr>
|
|
<tr><td>870</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>871</td>
|
|
<td class="covered"> $qRight = $this->_tree->returnQueryWithRootId($qRight, $rootId);
|
|
</td></tr>
|
|
<tr><td>872</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>873</td>
|
|
<td class="covered"> $resultRight = $qRight->execute();
|
|
</td></tr>
|
|
<tr><td>874</td>
|
|
<td class="covered"> }
|
|
</td></tr>
|
|
<tr><td>875</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>876</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>877</td>
|
|
<td class="normal"> * adds '$delta' to all Left and Right values that are >= '$first' and <= '$last'.
|
|
</td></tr>
|
|
<tr><td>878</td>
|
|
<td class="normal"> * '$delta' can also be negative.
|
|
</td></tr>
|
|
<tr><td>879</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>880</td>
|
|
<td class="normal"> * @param int $first First node to be shifted (L value)
|
|
</td></tr>
|
|
<tr><td>881</td>
|
|
<td class="normal"> * @param int $last Last node to be shifted (L value)
|
|
</td></tr>
|
|
<tr><td>882</td>
|
|
<td class="normal"> * @param int $delta Value to be shifted by, can be negative
|
|
</td></tr>
|
|
<tr><td>883</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>884</td>
|
|
<td class="normal"> private function shiftRlRange($first, $last, $delta, $rootId = 1)
|
|
</td></tr>
|
|
<tr><td>885</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>886</td>
|
|
<td class="red"> $qLeft = new Doctrine_Query();
|
|
</td></tr>
|
|
<tr><td>887</td>
|
|
<td class="red"> $qRight = new Doctrine_Query();
|
|
</td></tr>
|
|
<tr><td>888</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>889</td>
|
|
<td class="normal"> // shift left column values
|
|
</td></tr>
|
|
<tr><td>890</td>
|
|
<td class="red"> $componentName = $this->_tree->getBaseComponent();
|
|
</td></tr>
|
|
<tr><td>891</td>
|
|
<td class="red"> $qLeft = $qLeft->update($componentName)
|
|
</td></tr>
|
|
<tr><td>892</td>
|
|
<td class="red"> ->set($componentName . '.lft', 'lft + ?')
|
|
</td></tr>
|
|
<tr><td>893</td>
|
|
<td class="red"> ->where($componentName . '.lft >= ? AND ' . $componentName . '.lft <= ?', array($delta, $first, $last));
|
|
</td></tr>
|
|
<tr><td>894</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>895</td>
|
|
<td class="red"> $qLeft = $this->_tree->returnQueryWithRootId($qLeft, $rootId);
|
|
</td></tr>
|
|
<tr><td>896</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>897</td>
|
|
<td class="red"> $resultLeft = $qLeft->execute();
|
|
</td></tr>
|
|
<tr><td>898</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>899</td>
|
|
<td class="normal"> // shift right column values
|
|
</td></tr>
|
|
<tr><td>900</td>
|
|
<td class="red"> $qRight = $qRight->update($componentName)
|
|
</td></tr>
|
|
<tr><td>901</td>
|
|
<td class="red"> ->set($componentName . '.rgt', 'rgt + ?')
|
|
</td></tr>
|
|
<tr><td>902</td>
|
|
<td class="red"> ->where($componentName . '.rgt >= ? AND ' . $componentName . '.rgt <= ?', array($delta, $first, $last));
|
|
</td></tr>
|
|
<tr><td>903</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>904</td>
|
|
<td class="red"> $qRight = $this->_tree->returnQueryWithRootId($qRight, $rootId);
|
|
</td></tr>
|
|
<tr><td>905</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>906</td>
|
|
<td class="red"> $resultRight = $qRight->execute();
|
|
</td></tr>
|
|
<tr><td>907</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>908</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>909</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>910</td>
|
|
<td class="normal"> * gets record's left value
|
|
</td></tr>
|
|
<tr><td>911</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>912</td>
|
|
<td class="normal"> * @return int
|
|
</td></tr>
|
|
<tr><td>913</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>914</td>
|
|
<td class="normal"> public function getLeftValue()
|
|
</td></tr>
|
|
<tr><td>915</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>916</td>
|
|
<td class="covered"> return $this->record->get('lft');
|
|
</td></tr>
|
|
<tr><td>917</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>918</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>919</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>920</td>
|
|
<td class="normal"> * sets record's left value
|
|
</td></tr>
|
|
<tr><td>921</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>922</td>
|
|
<td class="normal"> * @param int
|
|
</td></tr>
|
|
<tr><td>923</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>924</td>
|
|
<td class="normal"> public function setLeftValue($lft)
|
|
</td></tr>
|
|
<tr><td>925</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>926</td>
|
|
<td class="covered"> $this->record->set('lft', $lft);
|
|
</td></tr>
|
|
<tr><td>927</td>
|
|
<td class="covered"> }
|
|
</td></tr>
|
|
<tr><td>928</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>929</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>930</td>
|
|
<td class="normal"> * gets record's right value
|
|
</td></tr>
|
|
<tr><td>931</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>932</td>
|
|
<td class="normal"> * @return int
|
|
</td></tr>
|
|
<tr><td>933</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>934</td>
|
|
<td class="normal"> public function getRightValue()
|
|
</td></tr>
|
|
<tr><td>935</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>936</td>
|
|
<td class="covered"> return $this->record->get('rgt');
|
|
</td></tr>
|
|
<tr><td>937</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>938</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>939</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>940</td>
|
|
<td class="normal"> * sets record's right value
|
|
</td></tr>
|
|
<tr><td>941</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>942</td>
|
|
<td class="normal"> * @param int
|
|
</td></tr>
|
|
<tr><td>943</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>944</td>
|
|
<td class="normal"> public function setRightValue($rgt)
|
|
</td></tr>
|
|
<tr><td>945</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>946</td>
|
|
<td class="covered"> $this->record->set('rgt', $rgt);
|
|
</td></tr>
|
|
<tr><td>947</td>
|
|
<td class="covered"> }
|
|
</td></tr>
|
|
<tr><td>948</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>949</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>950</td>
|
|
<td class="normal"> * gets level (depth) of node in the tree
|
|
</td></tr>
|
|
<tr><td>951</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>952</td>
|
|
<td class="normal"> * @return int
|
|
</td></tr>
|
|
<tr><td>953</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>954</td>
|
|
<td class="normal"> public function getLevel()
|
|
</td></tr>
|
|
<tr><td>955</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>956</td>
|
|
<td class="red"> if ( ! isset($this->record['level'])) {
|
|
</td></tr>
|
|
<tr><td>957</td>
|
|
<td class="red"> $baseAlias = $this->_tree->getBaseAlias();
|
|
</td></tr>
|
|
<tr><td>958</td>
|
|
<td class="red"> $componentName = $this->_tree->getBaseComponent();
|
|
</td></tr>
|
|
<tr><td>959</td>
|
|
<td class="red"> $q = $this->_tree->getBaseQuery();
|
|
</td></tr>
|
|
<tr><td>960</td>
|
|
<td class="red"> $q = $q->addWhere("$baseAlias.lft < ? AND $baseAlias.rgt > ?", array($this->getLeftValue(), $this->getRightValue()));
|
|
</td></tr>
|
|
<tr><td>961</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>962</td>
|
|
<td class="red"> $q = $this->_tree->returnQueryWithRootId($q, $this->getRootValue());
|
|
</td></tr>
|
|
<tr><td>963</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>964</td>
|
|
<td class="red"> $coll = $q->execute();
|
|
</td></tr>
|
|
<tr><td>965</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>966</td>
|
|
<td class="red"> $this->record['level'] = count($coll) ? count($coll) : 0;
|
|
</td></tr>
|
|
<tr><td>967</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>968</td>
|
|
<td class="red"> return $this->record['level'];
|
|
</td></tr>
|
|
<tr><td>969</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>970</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>971</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>972</td>
|
|
<td class="normal"> * get records root id value
|
|
</td></tr>
|
|
<tr><td>973</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>974</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>975</td>
|
|
<td class="normal"> public function getRootValue()
|
|
</td></tr>
|
|
<tr><td>976</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>977</td>
|
|
<td class="covered"> if ($this->_tree->getAttribute('hasManyRoots')) {
|
|
</td></tr>
|
|
<tr><td>978</td>
|
|
<td class="red"> return $this->record->get($this->_tree->getAttribute('rootColumnName'));
|
|
</td></tr>
|
|
<tr><td>979</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>980</td>
|
|
<td class="covered"> return 1;
|
|
</td></tr>
|
|
<tr><td>981</td>
|
|
<td class="orange"> }
|
|
</td></tr>
|
|
<tr><td>982</td>
|
|
<td class="normal">
|
|
</td></tr>
|
|
<tr><td>983</td>
|
|
<td class="normal"> /**
|
|
</td></tr>
|
|
<tr><td>984</td>
|
|
<td class="normal"> * sets records root id value
|
|
</td></tr>
|
|
<tr><td>985</td>
|
|
<td class="normal"> *
|
|
</td></tr>
|
|
<tr><td>986</td>
|
|
<td class="normal"> * @param int
|
|
</td></tr>
|
|
<tr><td>987</td>
|
|
<td class="normal"> */
|
|
</td></tr>
|
|
<tr><td>988</td>
|
|
<td class="normal"> public function setRootValue($value)
|
|
</td></tr>
|
|
<tr><td>989</td>
|
|
<td class="normal"> {
|
|
</td></tr>
|
|
<tr><td>990</td>
|
|
<td class="covered"> if ($this->_tree->getAttribute('hasManyRoots')) {
|
|
</td></tr>
|
|
<tr><td>991</td>
|
|
<td class="red"> $this->record->set($this->_tree->getAttribute('rootColumnName'), $value);
|
|
</td></tr>
|
|
<tr><td>992</td>
|
|
<td class="red"> }
|
|
</td></tr>
|
|
<tr><td>993</td>
|
|
<td class="covered"> }
|
|
</td></tr>
|
|
<tr><td>994</td>
|
|
<td class="covered">}</td></tr>
|
|
</table></body></html> |