@@ -253,8 +253,6 @@ fn dispatch<'a, S: StrDrive>(
253
253
ctx. skip_char ( state, 1 ) ;
254
254
}
255
255
}
256
- /* assert subpattern */
257
- /* <ASSERT> <skip> <back> <pattern> */
258
256
SreOpcode :: ASSERT => op_assert ( state, ctx) ,
259
257
SreOpcode :: ASSERT_NOT => op_assert_not ( state, ctx) ,
260
258
SreOpcode :: AT => {
@@ -334,7 +332,6 @@ fn op_assert<'a, S: StrDrive>(state: &mut State<'a, S>, ctx: &mut MatchContext<'
334
332
return ctx. failure ( ) ;
335
333
}
336
334
337
- // let next_ctx = state.next_ctx(ctx, 3, |state, ctx| {
338
335
let next_ctx = next_ctx ! ( offset 3 , state, ctx, |state, ctx| {
339
336
if state. popped_has_matched {
340
337
ctx. skip_code_from( state, 1 ) ;
@@ -371,7 +368,6 @@ fn op_assert_not<'a, S: StrDrive>(state: &mut State<'a, S>, ctx: &mut MatchConte
371
368
// alternation
372
369
// <BRANCH> <0=skip> code <JUMP> ... <NULL>
373
370
fn op_branch < ' a , S : StrDrive > ( state : & mut State < ' a , S > , ctx : & mut MatchContext < ' a , S > ) {
374
- // state.marks_push();
375
371
mark ! ( push, state) ;
376
372
377
373
ctx. count = 1 ;
@@ -403,7 +399,6 @@ fn op_branch<'a, S: StrDrive>(state: &mut State<'a, S>, ctx: &mut MatchContext<'
403
399
/* <MIN_REPEAT_ONE> <skip> <1=min> <2=max> item <SUCCESS> tail */
404
400
fn op_min_repeat_one < ' a , S : StrDrive > ( state : & mut State < ' a , S > , ctx : & mut MatchContext < ' a , S > ) {
405
401
let min_count = ctx. peek_code ( state, 2 ) as usize ;
406
- // let max_count = ctx.peek_code(state, 3) as usize;
407
402
408
403
if ctx. remaining_chars ( state) < min_count {
409
404
return ctx. failure ( ) ;
0 commit comments