@@ -208,42 +208,33 @@ public Node(Model m, int level) {
208208 }
209209
210210
211- public static final Comparator <NodeActivation .Key > BEGIN_COMP = new Comparator <Key >() {
212- @ Override
213- public int compare (Key k1 , Key k2 ) {
214- int r ;
215- r = Range .compare (k1 .range , k2 .range , false );
216- if (r != 0 ) return r ;
217- r = Utils .compareInteger (k1 .rid , k2 .rid );
218- if (r != 0 ) return r ;
219- return InterprNode .compare (k1 .interpretation , k2 .interpretation );
220- }
211+ public static final Comparator <NodeActivation .Key > BEGIN_COMP = (k1 , k2 ) -> {
212+ int r ;
213+ r = Range .compare (k1 .range , k2 .range , false );
214+ if (r != 0 ) return r ;
215+ r = Utils .compareInteger (k1 .rid , k2 .rid );
216+ if (r != 0 ) return r ;
217+ return InterprNode .compare (k1 .interpretation , k2 .interpretation );
221218 };
222219
223220
224- public static final Comparator <NodeActivation .Key > END_COMP = new Comparator <Key >() {
225- @ Override
226- public int compare (Key k1 , Key k2 ) {
227- int r ;
228- r = Range .compare (k1 .range , k2 .range , true );
229- if (r != 0 ) return r ;
230- r = Utils .compareInteger (k1 .rid , k2 .rid );
231- if (r != 0 ) return r ;
232- return InterprNode .compare (k1 .interpretation , k2 .interpretation );
233- }
221+ public static final Comparator <NodeActivation .Key > END_COMP = (k1 , k2 ) -> {
222+ int r ;
223+ r = Range .compare (k1 .range , k2 .range , true );
224+ if (r != 0 ) return r ;
225+ r = Utils .compareInteger (k1 .rid , k2 .rid );
226+ if (r != 0 ) return r ;
227+ return InterprNode .compare (k1 .interpretation , k2 .interpretation );
234228 };
235229
236230
237- public static final Comparator <NodeActivation .Key > RID_COMP = new Comparator <Key >() {
238- @ Override
239- public int compare (Key k1 , Key k2 ) {
240- int r ;
241- r = Utils .compareInteger (k1 .rid , k2 .rid );
242- if (r != 0 ) return r ;
243- r = Range .compare (k1 .range , k2 .range , false );
244- if (r != 0 ) return r ;
245- return InterprNode .compare (k1 .interpretation , k2 .interpretation );
246- }
231+ public static final Comparator <NodeActivation .Key > RID_COMP = (k1 , k2 ) -> {
232+ int r ;
233+ r = Utils .compareInteger (k1 .rid , k2 .rid );
234+ if (r != 0 ) return r ;
235+ r = Range .compare (k1 .range , k2 .range , false );
236+ if (r != 0 ) return r ;
237+ return InterprNode .compare (k1 .interpretation , k2 .interpretation );
247238 };
248239
249240
0 commit comments