/*
* reserved comment block
* DO NOT REMOVE OR ALTER!
*/
/*
* Copyright 2001-2005 The Apache Software Foundation.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* $Id: AnyNodeCounter.java,v 1.2.4.1 2005/09/06 05:54:53 pvedula Exp $
*/
/**
* @author Jacek Ambroziak
* @author Santiago Pericas-Geertsen
*/
}
boolean hasFrom) {
}
return this;
}
int result;
//See Errata E24
else return formatNumbers((int)_value);
}
else {
result = 0;
if (matchesCount(next)) {
++result;
}
next--;
//%HZ%: Is this the best way of finding the root? Is it better to check
//%HZ%: parent(next)?
/*
if (next == root) {
break;
}
else {
--next;
}
*/
}
}
return formatNumbers(result);
}
}
}
int result;
//See Errata E24
}
else {
result = 0;
while (next >= 0) {
result++;
}
//%HZ%: Is this the best way of finding the root? Is it better to check
//%HZ%: parent(next)?
break;
}
else {
--next;
}
}
}
return formatNumbers(result);
}
}
}