You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@lenya.apache.org by rf...@apache.org on 2007/08/01 22:15:21 UTC
svn commit: r561936 -
/lenya/trunk/src/modules/sitetree/java/src/org/apache/lenya/cms/site/tree2/TreeNodeImpl.java
Author: rfrovarp
Date: Wed Aug 1 13:15:18 2007
New Revision: 561936
URL: http://svn.apache.org/viewvc?view=rev&rev=561936
Log:
Correctly retrieves list of preceding siblings now. Can now move node up to top position in a substree.
Modified:
lenya/trunk/src/modules/sitetree/java/src/org/apache/lenya/cms/site/tree2/TreeNodeImpl.java
Modified: lenya/trunk/src/modules/sitetree/java/src/org/apache/lenya/cms/site/tree2/TreeNodeImpl.java
URL: http://svn.apache.org/viewvc/lenya/trunk/src/modules/sitetree/java/src/org/apache/lenya/cms/site/tree2/TreeNodeImpl.java?view=diff&rev=561936&r1=561935&r2=561936
==============================================================================
--- lenya/trunk/src/modules/sitetree/java/src/org/apache/lenya/cms/site/tree2/TreeNodeImpl.java (original)
+++ lenya/trunk/src/modules/sitetree/java/src/org/apache/lenya/cms/site/tree2/TreeNodeImpl.java Wed Aug 1 13:15:18 2007
@@ -171,7 +171,7 @@
SiteNode[] children = this.parent.getChildren();
int pos = Arrays.asList(children).indexOf(this);
List siblings = new ArrayList();
- for (int i = 0; i < pos - 1; i++) {
+ for (int i = 0; i < pos ; i++) {
siblings.add(children[i]);
}
return (SiteTreeNode[]) siblings.toArray(new TreeNodeImpl[siblings.size()]);
---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@lenya.apache.org
For additional commands, e-mail: commits-help@lenya.apache.org