- From: Yves Lafon via cvs-syncmail <cvsmail@w3.org>
- Date: Wed, 14 Sep 2005 15:14:19 +0000
- To: www-validator-cvs@w3.org
Update of /sources/public/2002/css-validator/html/tree
In directory hutz:/tmp/cvs-serv9389/html/tree
Modified Files:
ActiveTree.java SimpleTree.java Tree.java
Log Message:
>From Jean-Guilhem Rouel (again!)
Reformatting of code
Fix for bug 774 [1] (even more warnings)
Fix for bug 768 [2]
Modification of the soap output format (each warning list and error list has
the URI it refers to)
[1] http://www.w3.org/Bugs/Public/show_bug.cgi?id=774
[2] http://www.w3.org/Bugs/Public/show_bug.cgi?id=768
Index: ActiveTree.java
===================================================================
RCS file: /sources/public/2002/css-validator/html/tree/ActiveTree.java,v
retrieving revision 1.2
retrieving revision 1.3
diff -u -d -r1.2 -r1.3
--- ActiveTree.java 8 Apr 2002 21:22:41 -0000 1.2
+++ ActiveTree.java 14 Sep 2005 15:14:17 -0000 1.3
@@ -37,10 +37,10 @@
listeners.trimToSize();
}
}
-
+
public void setParent(Tree parent) {
super.setParent(parent);
- if (listeners == null)
+ if (listeners == null)
return;
for(int i = 0; i < listeners.size(); i++) {
TreeListener l = (TreeListener)listeners.elementAt(i);
@@ -48,9 +48,9 @@
}
}
-
+
public void enter() {
- if (listeners == null)
+ if (listeners == null)
return;
for(int i = 0; i < listeners.size(); i++) {
TreeListener l = (TreeListener)listeners.elementAt(i);
@@ -59,7 +59,7 @@
}
public void exit() {
- if (listeners == null)
+ if (listeners == null)
return;
for(int i = 0; i < listeners.size(); i++) {
TreeListener l = (TreeListener)listeners.elementAt(i);
@@ -70,7 +70,7 @@
public void replace(Tree child, int rank) {
super.replace(child, rank);
- if (listeners == null)
+ if (listeners == null)
return;
for(int i = 0; i < listeners.size(); i++) {
TreeListener l = (TreeListener)listeners.elementAt(i);
@@ -80,7 +80,7 @@
public void attach(Tree child, int rank) {
super.attach(child, rank);
- if (listeners == null)
+ if (listeners == null)
return;
for(int i = 0; i < listeners.size(); i++) {
TreeListener l = (TreeListener)listeners.elementAt(i);
@@ -90,7 +90,7 @@
public void attach(Tree child, Tree after) {
super.attach(child, after);
- if (listeners == null)
+ if (listeners == null)
return;
int rank = indexOf(child);
for(int i = 0; i < listeners.size(); i++) {
@@ -98,7 +98,7 @@
l.notifyAttach(child, rank);
}
}
-
+
public void detach(Tree child) {
int rank = indexOf(child);
super.detach(child);
@@ -113,7 +113,7 @@
public void move(Tree child, int rank) {
int oldRank = indexOf(child);
super.move(child, rank);
- if (listeners == null)
+ if (listeners == null)
return;
for(int i = 0; i < listeners.size(); i++) {
TreeListener l = (TreeListener)listeners.elementAt(i);
Index: SimpleTree.java
===================================================================
RCS file: /sources/public/2002/css-validator/html/tree/SimpleTree.java,v
retrieving revision 1.2
retrieving revision 1.3
diff -u -d -r1.2 -r1.3
--- SimpleTree.java 8 Apr 2002 21:22:41 -0000 1.2
+++ SimpleTree.java 14 Sep 2005 15:14:17 -0000 1.3
@@ -12,7 +12,7 @@
*/
public class SimpleTree implements Tree {
private static Enumeration NO_CHILD = new EmptyEnumeration();
-
+
Vector children = null;
Tree parent;
@@ -23,11 +23,11 @@
public Tree getParent() {
return parent;
}
-
+
public void setParent(Tree child) {
parent = child;
}
-
+
public int getRank() {
return parent.indexOf(this);
}
@@ -63,7 +63,7 @@
}
child.setParent(this);
}
-
+
public void detach(Tree child) {
children.removeElement(child);
child.setParent(null);
@@ -87,7 +87,7 @@
public Enumeration children() {
return (children != null ) ? children.elements() : NO_CHILD;
}
-
+
private final void checkChildren() {
if(children == null) {
children = new Vector(1, 1);
Index: Tree.java
===================================================================
RCS file: /sources/public/2002/css-validator/html/tree/Tree.java,v
retrieving revision 1.2
retrieving revision 1.3
diff -u -d -r1.2 -r1.3
--- Tree.java 8 Apr 2002 21:22:41 -0000 1.2
+++ Tree.java 14 Sep 2005 15:14:17 -0000 1.3
@@ -24,20 +24,20 @@
/**
* @return the parent Tree of this Tree or null.
- */
+ */
Tree getParent();
/**
* Sets the parent for this tree.
*
* If the 'tree' has no notifier, it inherits its parent's one.
- */
+ */
void setParent(Tree parent);
/**
* @return the index of this Tree in its parent.
- */
+ */
int getRank();
/**
@@ -57,7 +57,7 @@
*
* replace the 'rank'th child by 'child'.
* If rank is invalid, throws an ArrayOutOfBoundsException.
- */
+ */
void replace(Tree child, int rank);
/**
@@ -65,7 +65,7 @@
*
* inserts a new child at rank 'rank'.
* If rank is invalid, throws an ArrayOutOfBoundsException.
- */
+ */
void attach(Tree child, int rank);
/**
@@ -73,7 +73,7 @@
*
* inserts a new child after the child 'after'.
* If 'after' does not exist, throws an ArrayOutOfBoundsException.
- */
+ */
void attach(Tree child, Tree after);
/**
@@ -81,7 +81,7 @@
*
* removes the child at rank 'rank'.
* If rank is invalid, throws an ArrayOutOfBoundsException.
- */
+ */
void detach(Tree child);
/**
@@ -91,7 +91,7 @@
/**
* list of children
- */
+ */
Enumeration children();
}
Received on Wednesday, 14 September 2005 15:16:01 UTC