Coverage Report

Created: 2026-10-13 06:54

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/aspell/modules/tokenizer/basic.cpp
Line
Count
Source
1
2
// This file is part of The New Aspell
3
// Copyright (C) 2001 by Kevin Atkinson under the GNU LGPL license
4
// version 2.0 or 2.1.  You should have received a copy of the LGPL
5
// license along with this library if you did not you can find
6
// it at http://www.gnu.org/.
7
8
#include "tokenizer.hpp"
9
#include "convert.hpp"
10
#include "speller.hpp"
11
12
13
namespace acommon {
14
15
  class TokenizerBasic : public Tokenizer
16
  {
17
  public:
18
    bool advance();
19
  };
20
21
24.3k
  bool TokenizerBasic::advance() {
22
24.3k
    word_begin = word_end;
23
24.3k
    begin_pos = end_pos;
24
24.3k
    FilterChar * cur = word_begin;
25
24.3k
    unsigned int cur_pos = begin_pos;
26
24.3k
    word.clear();
27
28
    // skip spaces (non-word characters)
29
2.63M
    while (*cur != 0 &&
30
2.63M
     !(is_word(*cur)
31
2.61M
       || (is_begin(*cur) && is_word(cur[1])))) 
32
2.61M
    {
33
2.61M
      cur_pos += cur->width;
34
2.61M
      ++cur;
35
2.61M
    }
36
37
24.3k
    if (*cur == 0) return false;
38
39
23.5k
    word_begin = cur;
40
23.5k
    begin_pos = cur_pos;
41
42
23.5k
    if (is_begin(*cur) && is_word(cur[1]))
43
35
    {
44
35
      cur_pos += cur->width;
45
35
      ++cur;
46
35
    }
47
48
15.3M
    while (is_word(*cur) || 
49
339k
     (is_middle(*cur) && 
50
315k
      cur > word_begin && is_word(cur[-1]) &&
51
315k
      is_word(cur[1]) )) 
52
15.3M
    {
53
15.3M
      word.append(*cur);
54
15.3M
      cur_pos += cur->width;
55
15.3M
      ++cur;
56
15.3M
    }
57
58
23.5k
    if (is_end(*cur))
59
979
    {
60
979
      word.append(*cur);
61
979
      cur_pos += cur->width;
62
979
      ++cur;
63
979
    }
64
65
23.5k
    word.append('\0');
66
23.5k
    word_end = cur;
67
23.5k
    end_pos = cur_pos;
68
69
23.5k
    return true;
70
24.3k
  }
71
#undef increment__
72
73
  PosibErr<Tokenizer *> new_tokenizer(Speller * speller)
74
739
  {
75
739
    Tokenizer * tok = new TokenizerBasic();
76
739
    speller->setup_tokenizer(tok);
77
739
    return tok;
78
739
  }
79
80
}