normalize-languages 0.3.1

Tree-sitter language support and dynamic grammar loading
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

#include <iostream>
#include <vector>
#include <stdexcept>

template <typename T>
class Stack {
public:
    // Pushes an item onto the stack.
    void push(const T& item) {
        items.push_back(item);
    }

    T pop() {
        if (items.empty()) {
            throw std::underflow_error("Stack is empty");
        }
        T top = items.back();
        items.pop_back();
        return top;
    }

    const T& peek() const {
        if (items.empty()) {
            throw std::underflow_error("Stack is empty");
        }
        return items.back();
    }

    bool empty() const { return items.empty(); }
    std::size_t size() const { return items.size(); }

private:
    std::vector<T> items;
};

[[nodiscard]] std::string classify(int n) {
    if (n < 0) {
        return "negative";
    } else if (n == 0) {
        return "zero";
    } else {
        return "positive";
    }
}

int sum_evens(const std::vector<int>& numbers) {
    int total = 0;
    for (int n : numbers) {
        if (n % 2 == 0) {
            total += n;
        }
    }
    return total;
}

int main() {
    Stack<int> s;
    s.push(10);
    s.push(20);
    std::cout << s.pop() << "\n";
    std::cout << classify(-3) << "\n";
    std::vector<int> nums = {1, 2, 3, 4, 5};
    std::cout << sum_evens(nums) << "\n";
    return 0;
}