main.cpp

// SPDX-License-Identifier: Apache-2.0
// Copyright 2026 Jussi Pakkanen

#include <stdio.h>
#include <pystd2026.hpp>
#include <pystd2026_introsort.hpp>
#include <assert.h>

struct WordCount {
    const pystd2026::U8String *str;
    size_t count;

    int operator<=>(const WordCount &o) const {
        auto diff = (int64_t)o.count - (int64_t)count;
        if(diff != 0) {
            return diff;
        }
        return (int64_t)o.str->size_bytes() - (int64_t)str->size_bytes();
    }
};

int file_main(int argc, char **argv) {
    if(argc != 2) {
        printf("%s <infile>\n", argv[0]);
        return 0;
    }
    try {
        pystd2026::HashMap<pystd2026::U8String, size_t> counts;
        pystd2026::File f(argv[1], "r");
        for(auto &&line : f) {
            pystd2026::U8String u8line(move(line));
            auto words = u8line.split_ascii();
            for(const auto &w : words) {
                ++counts[w];
            }
        }
        pystd2026::Vector<WordCount> stats;
        for(const auto item : counts) {
            stats.push_back(WordCount{item.key, *item.value});
        }
        pystd2026::introsort(stats.begin(), stats.end());
        for(const auto &i : stats) {
            printf("%d %s\n", (int)i.count, i.str->c_str());
        }
    } catch(const pystd2026::PyException &e) {
        printf("%s\n", e.what().c_str());
        return 1;
    }

    return 0;
}

int hashmap_main(int, char **) {
    pystd2026::HashMap<pystd2026::U8String, size_t> wordcounter;
    pystd2026::U8String key1("key1");
    pystd2026::U8String key2("key2");

    printf("Initial size: %d\n", (int)wordcounter.size());
    printf("Contains key1: %d\n", (int)wordcounter.contains(key1));
    printf("Contains key2: %d\n", (int)wordcounter.contains(key2));

    printf("Inserting key1.\n");
    wordcounter.insert(key1, 66);
    printf("Size: %d\n", (int)wordcounter.size());
    printf("Contains key1: %d\n", (int)wordcounter.contains(key1));
    printf("Value of key1: %d\n", (int)*wordcounter.lookup(key1));
    printf("Contains key2: %d\n", (int)wordcounter.contains(key2));

    return 0;
}

int split_main(int, char **) {
    pystd2026::U8String text("aa bb cc");
    auto r = text.split_ascii();
    printf("Split array size: %d\n", (int)r.size());
    for(size_t i = 0; i < r.size(); ++i) {
        printf(" %s\n", r[i].c_str());
    }
    return 0;
}

int main(int argc, char **argv) {
    if(false) {
        return hashmap_main(argc, argv);
    } else if(false) {
        return split_main(argc, argv);
    } else {
        return file_main(argc, argv);
    }
}