commit c33b97c9900c93f1c82124680808507f171cc598 · drubery.com/icfp2007

+60 -45

dna2rna/src/parser.rs

···

       1
        
       use crate::dna::Base;

     

       0
        
       
     

       2
        
       use crate::dna::DnaRef;

     

       3
        
       use crate::pattern::Pattern;

     

       4
        
       use crate::pattern::PatternItem;

     

       5
        
       use crate::rna::Rna;

     

       6
        
       use crate::template::Template;

     

       7
        
       use crate::template::TemplateItem;

     

       0
        
       
     

       8
        
       

     

       9
        
       pub struct Parser<'a> {

     

       10
       -
           buf: &'a DnaRef,

     

       0
        
       
     

       11
        
           index: usize,

     

       12
        
       }

     

       13
        
       

     

       14
        
       impl<'a> Parser<'a> {

     

       15
        
           pub fn new(buf: &'a DnaRef) -> Parser<'a> {

     

       16
       -
               Parser { buf: buf, index: 0 }

     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       17
        
           }

     

       18
        
       

     

       19
        
           pub fn index(&self) -> usize {

     

       20
        
               self.index

     

       21
        
           }

     

       22
        
       

     

       23
       -
           pub fn next_is(&mut self, next: &[Base]) -> bool {

     

       24
       -
               if self.index + next.len() > self.buf.len() {

     

       25
       -
                   return false;

     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       26
        
               }

     

       0
        
       
     

       27
        
       

     

       28
       -
               for i in 0..next.len() {

     

       29
       -
                   if self.buf[self.index + i] != next[i] {

     

       30
       -
                       return false;

     

       31
       -
                   }

     

       32
       -
               }

     

       0
        
       
     

       0
        
       
     

       33
        
       

     

       34
       -
               return true;

     

       0
        
       
     

       0
        
       
     

       0
        
       
     

       35
        
           }

     

       36
        
       

     

       37
        
           pub fn nat(&mut self) -> Option<usize> {

     
···

       39
        
               let mut bit = 1;

     

       40
        
               loop {

     

       41
        
                   if self.next_is(&[Base::P]) {

     

       42
       -
                       self.index += 1;

     

       43
        
                       return Some(ret);

     

       44
        
                   } else if self.next_is(&[Base::I]) || self.next_is(&[Base::F]) {

     

       45
       -
                       self.index += 1;

     

       46
        
                   } else if self.next_is(&[Base::C]) {

     

       47
        
                       ret += bit;

     

       48
       -
                       self.index += 1;

     

       49
        
                   } else {

     

       50
        
                       return None;

     

       51
        
                   }

     
···

       58
        
               let mut ret = Vec::new();

     

       59
        
               loop {

     

       60
        
                   if self.next_is(&[Base::C]) {

     

       61
       -
                       self.index += 1;

     

       62
        
                       ret.push(Base::I);

     

       63
        
                   } else if self.next_is(&[Base::F]) {

     

       64
       -
                       self.index += 1;

     

       65
        
                       ret.push(Base::C);

     

       66
        
                   } else if self.next_is(&[Base::P]) {

     

       67
       -
                       self.index += 1;

     

       68
        
                       ret.push(Base::F);

     

       69
        
                   } else if self.next_is(&[Base::I, Base::C]) {

     

       70
       -
                       self.index += 2;

     

       71
        
                       ret.push(Base::P);

     

       72
        
                   } else {

     

       73
        
                       return ret;

     
···

       80
        
               let mut level = 0;

     

       81
        
               loop {

     

       82
        
                   if self.next_is(&[Base::C]) {

     

       83
       -
                       self.index += 1;

     

       84
        
                       ret.push(PatternItem::Base(Base::I));

     

       85
        
                   } else if self.next_is(&[Base::F]) {

     

       86
       -
                       self.index += 1;

     

       87
        
                       ret.push(PatternItem::Base(Base::C));

     

       88
        
                   } else if self.next_is(&[Base::P]) {

     

       89
       -
                       self.index += 1;

     

       90
        
                       ret.push(PatternItem::Base(Base::F));

     

       91
        
                   } else if self.next_is(&[Base::I, Base::C]) {

     

       92
       -
                       self.index += 2;

     

       93
        
                       ret.push(PatternItem::Base(Base::P));

     

       94
        
                   } else if self.next_is(&[Base::I, Base::P]) {

     

       95
       -
                       self.index += 2;

     

       96
        
                       let n = self.nat()?;

     

       97
        
                       ret.push(PatternItem::Skip(n));

     

       98
        
                   } else if self.next_is(&[Base::I, Base::F]) {

     

       99
       -
                       self.index += 3;

     

       100
        
                       let s = self.consts();

     

       101
        
                       ret.push(PatternItem::Search(s));

     

       102
        
                   } else if self.next_is(&[Base::I, Base::I, Base::P]) {

     

       103
       -
                       self.index += 3;

     

       104
        
                       level += 1;

     

       105
        
                       ret.push(PatternItem::Open);

     

       106
        
                   } else if self.next_is(&[Base::I, Base::I, Base::C])

     

       107
        
                       || self.next_is(&[Base::I, Base::I, Base::F])

     

       108
        
                   {

     

       109
       -
                       self.index += 3;

     

       110
        
                       if level == 0 {

     

       111
        
                           return Some(ret);

     

       112
        
                       }

     

       113
        
                       level -= 1;

     

       114
        
                       ret.push(PatternItem::Close);

     

       115
        
                   } else if self.next_is(&[Base::I, Base::I, Base::I]) {

     

       116
       -
                       self.index += 3;

     

       117
       -
                       let mut new_rna = Vec::new();

     

       118
       -
                       for i in 0..7 {

     

       119
       -
                           new_rna.push(self.buf[self.index + i]);

     

       120
       -
                       }

     

       121
        
                       self.index += 7;

     

       122
       -
                       rna.push(new_rna.try_into().unwrap());

     

       123
        
                   } else {

     

       124
        
                       return None;

     

       125
        
                   }

     
···

       130
        
               let mut ret = Vec::new();

     

       131
        
               loop {

     

       132
        
                   if self.next_is(&[Base::C]) {

     

       133
       -
                       self.index += 1;

     

       134
        
                       ret.push(TemplateItem::Base(Base::I));

     

       135
        
                   } else if self.next_is(&[Base::F]) {

     

       136
       -
                       self.index += 1;

     

       137
        
                       ret.push(TemplateItem::Base(Base::C));

     

       138
        
                   } else if self.next_is(&[Base::P]) {

     

       139
       -
                       self.index += 1;

     

       140
        
                       ret.push(TemplateItem::Base(Base::F));

     

       141
        
                   } else if self.next_is(&[Base::I, Base::C]) {

     

       142
       -
                       self.index += 2;

     

       143
        
                       ret.push(TemplateItem::Base(Base::P));

     

       144
        
                   } else if self.next_is(&[Base::I, Base::P]) || self.next_is(&[Base::I, Base::F]) {

     

       145
       -
                       self.index += 2;

     

       146
        
                       let l = self.nat()?;

     

       147
        
                       let n = self.nat()?;

     

       148
        
                       ret.push(TemplateItem::Ref(n, l));

     

       149
        
                   } else if self.next_is(&[Base::I, Base::I, Base::C])

     

       150
        
                       || self.next_is(&[Base::I, Base::I, Base::F])

     

       151
        
                   {

     

       152
       -
                       self.index += 3;

     

       153
        
                       return Some(ret);

     

       154
        
                   } else if self.next_is(&[Base::I, Base::I, Base::P]) {

     

       155
       -
                       self.index += 3;

     

       156
        
                       let n = self.nat()?;

     

       157
        
                       ret.push(TemplateItem::Len(n));

     

       158
        
                   } else if self.next_is(&[Base::I, Base::I, Base::I]) {

     

       159
       -
                       self.index += 3;

     

       160
       -
                       let mut new_rna = Vec::new();

     

       161
       -
                       for i in 0..7 {

     

       162
       -
                           new_rna.push(self.buf[self.index + i]);

     

       163
       -
                       }

     

       164
        
                       self.index += 7;

     

       165
       -
                       rna.push(new_rna.try_into().unwrap());

     

       166
        
                   } else {

     

       167
        
                       return None;

     

       168
        
                   }

···

       1
        
       use crate::dna::Base;

     

       2
       +
       use crate::dna::DnaIterator;

     

       3
        
       use crate::dna::DnaRef;

     

       4
        
       use crate::pattern::Pattern;

     

       5
        
       use crate::pattern::PatternItem;

     

       6
        
       use crate::rna::Rna;

     

       7
        
       use crate::template::Template;

     

       8
        
       use crate::template::TemplateItem;

     

       9
       +
       use std::mem;

     

       10
        
       

     

       11
        
       pub struct Parser<'a> {

     

       12
       +
           iter: DnaIterator<'a>,

     

       13
       +
           peeked: Vec<Base>,

     

       14
        
           index: usize,

     

       15
        
       }

     

       16
        
       

     

       17
        
       impl<'a> Parser<'a> {

     

       18
        
           pub fn new(buf: &'a DnaRef) -> Parser<'a> {

     

       19
       +
               Parser {

     

       20
       +
                   iter: buf.iter(),

     

       21
       +
                   peeked: Vec::new(),

     

       22
       +
                   index: 0,

     

       23
       +
               }

     

       24
        
           }

     

       25
        
       

     

       26
        
           pub fn index(&self) -> usize {

     

       27
        
               self.index

     

       28
        
           }

     

       29
        
       

     

       30
       +
           fn peek_to(&mut self, n: usize) {

     

       31
       +
               while self.peeked.len() < n {

     

       32
       +
                   if let Some(b) = self.iter.next() {

     

       33
       +
                       self.peeked.push(b);

     

       34
       +
                   } else {

     

       35
       +
                       return;

     

       36
       +
                   }

     

       37
        
               }

     

       38
       +
           }

     

       39
        
       

     

       40
       +
           pub fn next_is(&mut self, next: &[Base]) -> bool {

     

       41
       +
               self.peek_to(next.len());

     

       42
       +
       	if self.peeked.len() < next.len() {

     

       43
       +
       	  return false;

     

       44
       +
       	}

     

       45
       +
               return &self.peeked[..next.len()] == next;

     

       46
       +
           }

     

       47
        
       

     

       48
       +
           pub fn advance(&mut self, n: usize) {

     

       49
       +
               self.peek_to(n);

     

       50
       +
               self.index += n;

     

       51
       +
               self.peeked.drain(..n);

     

       52
        
           }

     

       53
        
       

     

       54
        
           pub fn nat(&mut self) -> Option<usize> {

     
···

       56
        
               let mut bit = 1;

     

       57
        
               loop {

     

       58
        
                   if self.next_is(&[Base::P]) {

     

       59
       +
                       self.advance(1);

     

       60
        
                       return Some(ret);

     

       61
        
                   } else if self.next_is(&[Base::I]) || self.next_is(&[Base::F]) {

     

       62
       +
                       self.advance(1);

     

       63
        
                   } else if self.next_is(&[Base::C]) {

     

       64
        
                       ret += bit;

     

       65
       +
                       self.advance(1);

     

       66
        
                   } else {

     

       67
        
                       return None;

     

       68
        
                   }

     
···

       75
        
               let mut ret = Vec::new();

     

       76
        
               loop {

     

       77
        
                   if self.next_is(&[Base::C]) {

     

       78
       +
                       self.advance(1);

     

       79
        
                       ret.push(Base::I);

     

       80
        
                   } else if self.next_is(&[Base::F]) {

     

       81
       +
                       self.advance(1);

     

       82
        
                       ret.push(Base::C);

     

       83
        
                   } else if self.next_is(&[Base::P]) {

     

       84
       +
                       self.advance(1);

     

       85
        
                       ret.push(Base::F);

     

       86
        
                   } else if self.next_is(&[Base::I, Base::C]) {

     

       87
       +
                       self.advance(2);

     

       88
        
                       ret.push(Base::P);

     

       89
        
                   } else {

     

       90
        
                       return ret;

     
···

       97
        
               let mut level = 0;

     

       98
        
               loop {

     

       99
        
                   if self.next_is(&[Base::C]) {

     

       100
       +
                       self.advance(1);

     

       101
        
                       ret.push(PatternItem::Base(Base::I));

     

       102
        
                   } else if self.next_is(&[Base::F]) {

     

       103
       +
                       self.advance(1);

     

       104
        
                       ret.push(PatternItem::Base(Base::C));

     

       105
        
                   } else if self.next_is(&[Base::P]) {

     

       106
       +
                       self.advance(1);

     

       107
        
                       ret.push(PatternItem::Base(Base::F));

     

       108
        
                   } else if self.next_is(&[Base::I, Base::C]) {

     

       109
       +
                       self.advance(2);

     

       110
        
                       ret.push(PatternItem::Base(Base::P));

     

       111
        
                   } else if self.next_is(&[Base::I, Base::P]) {

     

       112
       +
                       self.advance(2);

     

       113
        
                       let n = self.nat()?;

     

       114
        
                       ret.push(PatternItem::Skip(n));

     

       115
        
                   } else if self.next_is(&[Base::I, Base::F]) {

     

       116
       +
                       self.advance(3);

     

       117
        
                       let s = self.consts();

     

       118
        
                       ret.push(PatternItem::Search(s));

     

       119
        
                   } else if self.next_is(&[Base::I, Base::I, Base::P]) {

     

       120
       +
                       self.advance(3);

     

       121
        
                       level += 1;

     

       122
        
                       ret.push(PatternItem::Open);

     

       123
        
                   } else if self.next_is(&[Base::I, Base::I, Base::C])

     

       124
        
                       || self.next_is(&[Base::I, Base::I, Base::F])

     

       125
        
                   {

     

       126
       +
                       self.advance(3);

     

       127
        
                       if level == 0 {

     

       128
        
                           return Some(ret);

     

       129
        
                       }

     

       130
        
                       level -= 1;

     

       131
        
                       ret.push(PatternItem::Close);

     

       132
        
                   } else if self.next_is(&[Base::I, Base::I, Base::I]) {

     

       133
       +
                       self.advance(3);

     

       134
       +
                       self.peek_to(7);

     

       135
       +
                       let mut r = Vec::new();

     

       136
       +
                       mem::swap(&mut r, &mut self.peeked);

     

       137
       +
                       rna.push(r.try_into().unwrap());

     

       138
        
                       self.index += 7;

     

       0
        
       
     

       139
        
                   } else {

     

       140
        
                       return None;

     

       141
        
                   }

     
···

       146
        
               let mut ret = Vec::new();

     

       147
        
               loop {

     

       148
        
                   if self.next_is(&[Base::C]) {

     

       149
       +
                       self.advance(1);

     

       150
        
                       ret.push(TemplateItem::Base(Base::I));

     

       151
        
                   } else if self.next_is(&[Base::F]) {

     

       152
       +
                       self.advance(1);

     

       153
        
                       ret.push(TemplateItem::Base(Base::C));

     

       154
        
                   } else if self.next_is(&[Base::P]) {

     

       155
       +
                       self.advance(1);

     

       156
        
                       ret.push(TemplateItem::Base(Base::F));

     

       157
        
                   } else if self.next_is(&[Base::I, Base::C]) {

     

       158
       +
                       self.advance(2);

     

       159
        
                       ret.push(TemplateItem::Base(Base::P));

     

       160
        
                   } else if self.next_is(&[Base::I, Base::P]) || self.next_is(&[Base::I, Base::F]) {

     

       161
       +
                       self.advance(2);

     

       162
        
                       let l = self.nat()?;

     

       163
        
                       let n = self.nat()?;

     

       164
        
                       ret.push(TemplateItem::Ref(n, l));

     

       165
        
                   } else if self.next_is(&[Base::I, Base::I, Base::C])

     

       166
        
                       || self.next_is(&[Base::I, Base::I, Base::F])

     

       167
        
                   {

     

       168
       +
                       self.advance(3);

     

       169
        
                       return Some(ret);

     

       170
        
                   } else if self.next_is(&[Base::I, Base::I, Base::P]) {

     

       171
       +
                       self.advance(3);

     

       172
        
                       let n = self.nat()?;

     

       173
        
                       ret.push(TemplateItem::Len(n));

     

       174
        
                   } else if self.next_is(&[Base::I, Base::I, Base::I]) {

     

       175
       +
                       self.advance(3);

     

       176
       +
                       self.peek_to(7);

     

       177
       +
                       let mut r = Vec::new();

     

       178
       +
                       mem::swap(&mut r, &mut self.peeked);

     

       179
       +
                       rna.push(r.try_into().unwrap());

     

       180
        
                       self.index += 7;

     

       0
        
       
     

       181
        
                   } else {

     

       182
        
                       return None;

     

       183
        
                   }