ripdiff 0.8.1

Terminal UI for watching and reviewing agent progress
Documentation 
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111

#include <tree_sitter/parser.h>
#include <wctype.h>

enum TokenType {
  LONG_BUF_LIT,
  LONG_STR_LIT
};

void* tree_sitter_janet_simple_external_scanner_create(
    void
)
{
  return NULL;
}

void tree_sitter_janet_simple_external_scanner_destroy(
  void* payload
)
{
}

void tree_sitter_janet_simple_external_scanner_reset(
  void* payload
)
{
}

unsigned tree_sitter_janet_simple_external_scanner_serialize(
  void* payload,
  char* buffer
)
{
  return 0;
}

void tree_sitter_janet_simple_external_scanner_deserialize(
  void *payload,
  const char *buffer,
  unsigned length
)
{
}

bool tree_sitter_janet_simple_external_scanner_scan(
  void *payload,
  TSLexer *lexer,
  const bool *valid_symbols
)
{
  // skip a bit brother
  while (iswspace(lexer->lookahead)) {
    lexer->advance(lexer, true);
  }
  // there can be only...two?
  if (valid_symbols[LONG_BUF_LIT] || valid_symbols[LONG_STR_LIT]) {
    // so which one was it?
    if (lexer->lookahead == '@') {
      lexer->result_symbol = LONG_BUF_LIT;
      lexer->advance(lexer, false);
    } else {
      lexer->result_symbol = LONG_STR_LIT;
    }
    // long strings start with one or more backticks
    // consume the first backtick
    if (lexer->lookahead != '`') {
      return false;
    }
    // getting here means a backtick was encountered
    lexer->advance(lexer, false);
    uint32_t n_backticks = 1;
    // arrive at a total number of backticks
    for (;;) {
      if (lexer->lookahead == 0) {
        return false;
      }
      // found one!
      if (lexer->lookahead == '`') {
        n_backticks++;
        lexer->advance(lexer, false);
        continue;
      } else { // nope, time to bail
        lexer->advance(lexer, false);
        break;
      }
    }
    // getting here means the last character examined was NOT a backtick.
    // now keep looking until n_backticks are found
    uint32_t cbt = 0; // consecutive backticks
    for (;;) {
      if (lexer->lookahead == 0) {
        return false;
      }
      // found one!
      if (lexer->lookahead == '`') {
        cbt++;
        // are we there yet?
        if (cbt == n_backticks) {
          lexer->advance(lexer, false);
          return true;
        }
      } else { // nope, better reset the count
        cbt = 0;
      }
      // next!
      lexer->advance(lexer, false);
    }

  }

  return false;
}