@@ -73,7 +73,7 @@ public Object clone() throws CloneNotSupportedException {
7373 * @return the number of predicates that this walker has.
7474 */
7575 public int getPredicateCount () {
76- if (-1 == m_predCount ) return (null == m_predicates ) ? 0 : m_predicates .length ;
76+ if (-1 == m_predCount ) return (null == predicates_ ) ? 0 : predicates_ .length ;
7777 return m_predCount ;
7878 }
7979
@@ -88,9 +88,9 @@ public int getPredicateCount() {
8888 public void setPredicateCount (final int count ) {
8989 if (count > 0 ) {
9090 final Expression [] newPredicates = new Expression [count ];
91- System .arraycopy (m_predicates , 0 , newPredicates , 0 , count );
92- m_predicates = newPredicates ;
93- } else m_predicates = null ;
91+ System .arraycopy (predicates_ , 0 , newPredicates , 0 , count );
92+ predicates_ = newPredicates ;
93+ } else predicates_ = null ;
9494 }
9595
9696 /**
@@ -106,10 +106,10 @@ protected void initPredicateInfo(final Compiler compiler, final int opPos)
106106 final int pos = compiler .getFirstPredicateOpPos (opPos );
107107
108108 if (pos > 0 ) {
109- m_predicates = compiler .getCompiledPredicates (pos );
110- if (null != m_predicates ) {
111- for (final Expression m_predicate : m_predicates ) {
112- m_predicate .exprSetParent (this );
109+ predicates_ = compiler .getCompiledPredicates (pos );
110+ if (null != predicates_ ) {
111+ for (final Expression predicate : predicates_ ) {
112+ predicate .exprSetParent (this );
113113 }
114114 }
115115 }
@@ -122,7 +122,7 @@ protected void initPredicateInfo(final Compiler compiler, final int opPos)
122122 * @return A predicate expression.
123123 */
124124 public Expression getPredicate (final int index ) {
125- return m_predicates [index ];
125+ return predicates_ [index ];
126126 }
127127
128128 /**
@@ -223,7 +223,7 @@ boolean executePredicates(final int context, final XPathContext xctxt)
223223 xctxt .pushCurrentNode (context );
224224
225225 for (int i = 0 ; i < nPredicates ; i ++) {
226- final XObject pred = m_predicates [i ].execute (xctxt );
226+ final XObject pred = predicates_ [i ].execute (xctxt );
227227 // System.out.println("\nBack from executing predicate expression - waiting
228228 // count:
229229 // "+m_lpi.getWaitingCount());
@@ -262,7 +262,7 @@ boolean executePredicates(final int context, final XPathContext xctxt)
262262 // We can't set m_foundLast = true unless we're sure that -all-
263263 // remaining parameters are stable, or else last() fails. Fixed so
264264 // only sets m_foundLast if on the last predicate
265- if (m_predicates [i ].isStableNumber () && i == nPredicates - 1 ) {
265+ if (predicates_ [i ].isStableNumber () && i == nPredicates - 1 ) {
266266 m_foundLast = true ;
267267 }
268268 } else if (!pred .bool ()) return false ;
@@ -362,10 +362,10 @@ public boolean canTraverseOutsideSubtree() {
362362 * @param visitor The visitor whose appropriate method will be called.
363363 */
364364 public void callPredicateVisitors (final XPathVisitor visitor ) {
365- if (null != m_predicates ) {
366- for (final Expression m_predicate : m_predicates ) {
367- if (visitor .visitPredicate (m_predicate )) {
368- m_predicate .callVisitors (visitor );
365+ if (null != predicates_ ) {
366+ for (final Expression predicate : predicates_ ) {
367+ if (visitor .visitPredicate (predicate )) {
368+ predicate .callVisitors (visitor );
369369 }
370370 }
371371 }
@@ -377,14 +377,14 @@ public boolean deepEquals(final Expression expr) {
377377 if (!super .deepEquals (expr )) return false ;
378378
379379 final PredicatedNodeTest pnt = (PredicatedNodeTest ) expr ;
380- if (null != m_predicates ) {
380+ if (null != predicates_ ) {
381381
382- final int n = m_predicates .length ;
383- if ((null == pnt .m_predicates ) || (pnt .m_predicates .length != n )) return false ;
382+ final int n = predicates_ .length ;
383+ if ((null == pnt .predicates_ ) || (pnt .predicates_ .length != n )) return false ;
384384 for (int i = 0 ; i < n ; i ++) {
385- if (!m_predicates [i ].deepEquals (pnt .m_predicates [i ])) return false ;
385+ if (!predicates_ [i ].deepEquals (pnt .predicates_ [i ])) return false ;
386386 }
387- } else if (null != pnt .m_predicates ) return false ;
387+ } else if (null != pnt .predicates_ ) return false ;
388388
389389 return true ;
390390 }
@@ -407,7 +407,7 @@ public boolean deepEquals(final Expression expr) {
407407 *
408408 * @serial
409409 */
410- private Expression [] m_predicates ;
410+ private Expression [] predicates_ ;
411411
412412 /** An array of counts that correspond to the number of predicates the step contains. */
413413 protected transient int [] m_proximityPositions ;
0 commit comments