dirge-agent 0.12.5

Minimalistic coding agent written in Rust, optimized for memory footprint and performance
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133

/*
 * Test program for DAP integration tests — C++ variant.
 *
 * Exercises DAP variable inspection across C++-specific types:
 *   - std::string, std::vector<T>, std::map<K,V>
 *   - Classes with public/private members, const methods
 *   - Inheritance: Base → Derived with virtual method
 *   - Smart pointers: std::unique_ptr, raw owning pointer
 *   - Templates: std::pair<K,V>, std::array<int,N>
 *   - References: const T& parameters
 *
 * Intended to be run with lldb-dap or gdb.
 */

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <array>
#include <memory>
#include <numeric>

/* ── inheritance hierarchy ────────────────────────────────────────── */

class Debuggable {
public:
    Debuggable(const char *tag) : tag_(tag) {}
    virtual const char* describe() const { return tag_; }
    virtual ~Debuggable() = default;
private:
    const char *tag_;
};

class Counter : public Debuggable {
public:
    Counter(int start = 0)
        : Debuggable("counter"), value_(start), threshold_(0.5) {}

    int  increment()       { return ++value_; }
    int  value()     const { return value_; }
    double threshold() const { return threshold_; }

    const char* describe() const override { return "Counter::describe"; }

private:
    int    value_;
    double threshold_;
};

/* ── templates + smart pointers ───────────────────────────────────── */

std::vector<int> process_items(const std::vector<int> &items) {
    std::vector<int> results;
    for (auto item : items) {
        int doubled = item * 2;     /* conditional bp: item > 10 */
        results.push_back(doubled);
    }
    return results;
}

long factorial(long n) {
    if (n <= 1) return 1;
    return n * factorial(n - 1);
}

/* nested calls */
int inner(int x) {
    int square = x * x;
    return square;
}
int middle(int x) {
    int y = x + 3;
    int z = inner(y);
    return z + 1;
}
int outer() {
    int result = middle(5);
    return result * 2;
}

/* ── main ────────────────────────────────────────────────────────── */

int main() {
    /* scalars + strings */
    std::string text = "Hello, DAP!";
    int number = 42;
    double pi = 3.141592653589793;
    bool flag = true;

    /* containers */
    std::vector<int> items = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 15, 20};
    std::map<std::string, int> mapping = {{"key_a", 100}, {"key_b", 200}};
    std::array<int, 5> fixed = {10, 20, 30, 40, 50};

    /* objects */
    Counter counter(10);
    std::unique_ptr<int> heap_int = std::make_unique<int>(999);
    int *raw_ptr = heap_int.get();

    /* [bp-1] inspect: text, number, pi, flag, items, mapping,
     *   counter.value(), counter.threshold(), *heap_int, raw_ptr */

    std::cout << "text   = " << text   << std::endl;
    std::cout << "number = " << number << std::endl;
    std::cout << "pi     = " << pi     << std::endl;
    std::cout << "flag   = " << (flag ? "true" : "false") << std::endl;

    auto doubled = process_items(items);
    std::cout << "doubled[0] = " << doubled[0]
              << "  size = "      << doubled.size() << std::endl;

    /* [bp-2] after loop */

    long fact = factorial(5);
    std::cout << "factorial(5) = " << fact << std::endl;

    counter.increment();
    counter.increment();
    std::cout << "counter = " << counter.value() << std::endl;

    /* [bp-3] after counter ops */

    int outer_result = outer();
    std::cout << "outer = " << outer_result << std::endl;

    /* [bp-4] near end */

    int x = 10, y = 20;
    int z = x + y;
    std::cout << "z = " << z << std::endl;

    return 0;
}