summaryrefslogtreecommitdiff
path: root/src/mt/find_not_of.f
blob: 11d92875d673f9676a7a48fd7be34f26efd7fe82 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
ccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc
c
c HTCd - Copyright (C) 1998-2006 Henrik Rydberg
c
c This program is free software; you can redistribute it and/or modify
c it under the terms of the GNU General Public License as published by
c the Free Software Foundation; either version 2 of the License, or
c (at your option) any later version.
c
c This program is distributed in the hope that it will be useful,
c but WITHOUT ANY WARRANTY; without even the implied warranty of
c MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
c GNU General Public License for more details.
c
c You should have received a copy of the GNU General Public License
c along with this program; if not, write to the Free Software
c Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
c

      integer function find_not_of(s,n,c)
      byte s(0:1),c(0:1)
      integer i,m,n
      m=mod(n,16)
      do 10 i=0,m-1
         if(c(s(i)).eq.0)go to 100
 10   continue
      do 20 i=m,n-1,16
         if(c(s(i)).eq.0)go to 100
         if(c(s(i+1)).eq.0)go to 101
         if(c(s(i+2)).eq.0)go to 102
         if(c(s(i+3)).eq.0)go to 103
         if(c(s(i+4)).eq.0)go to 104
         if(c(s(i+5)).eq.0)go to 105
         if(c(s(i+6)).eq.0)go to 106
         if(c(s(i+7)).eq.0)go to 107
         if(c(s(i+8)).eq.0)go to 108
         if(c(s(i+9)).eq.0)go to 109
         if(c(s(i+10)).eq.0)go to 110
         if(c(s(i+11)).eq.0)go to 111
         if(c(s(i+12)).eq.0)go to 112
         if(c(s(i+13)).eq.0)go to 113
         if(c(s(i+14)).eq.0)go to 114
         if(c(s(i+15)).eq.0)go to 115
 20   continue
      find_not_of=-1
      return
 100  find_not_of=i
      return
 101  find_not_of=i+1
      return
 102  find_not_of=i+2
      return
 103  find_not_of=i+3
      return
 104  find_not_of=i+4
      return
 105  find_not_of=i+5
      return
 106  find_not_of=i+6
      return
 107  find_not_of=i+7
      return
 108  find_not_of=i+8
      return
 109  find_not_of=i+9
      return
 110  find_not_of=i+10
      return
 111  find_not_of=i+11
      return
 112  find_not_of=i+12
      return
 113  find_not_of=i+13
      return
 114  find_not_of=i+14
      return
 115  find_not_of=i+15
      return
      end