100 tasks from the HWE arm-linux code-gen pool (outside the lk/man/pth range given to batch 22), each with at least one independent contract-edge defect and plain public docs. Claude reviewed 100/100 USABLE against current digests; no ID or source overlap with main or batch 22. Difficulty is unmeasured. progress.md records the wrap-up: all Codex sessions and Qwen schedulers stopped for the user's rollout, Qwen results so far (57 HARD of 373), and what is left on each batch branch. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
88 lines
3.6 KiB
C++
88 lines
3.6 KiB
C++
#include "engine.hpp"
|
|
#include <charconv>
|
|
#include <iostream>
|
|
#include <sstream>
|
|
#include <string>
|
|
#include <vector>
|
|
#include <map>
|
|
using namespace ordered;
|
|
static void print_job(const JobView& v) {
|
|
std::cout << ' ' << v.id << ' ' << static_cast<int>(v.state) << ' ' << v.total
|
|
<< ' ' << v.remaining << ' ' << v.value << ' ' << v.ticket;
|
|
}
|
|
int main() {
|
|
Engine engine;
|
|
const std::map<std::string, std::size_t> arities = {
|
|
{"C", 2}, {"S", 4}, {"W", 2}, {"X", 2}, {"F", 2},
|
|
{"D", 1}, {"J", 2}, {"Q", 1}, {"L", 1}, {"E", 2}
|
|
};
|
|
std::string line;
|
|
while (std::getline(std::cin, line)) {
|
|
std::istringstream stream(line);
|
|
std::vector<std::string> tokens;
|
|
std::string token;
|
|
while (stream >> token) tokens.push_back(token);
|
|
if (tokens.empty()) {
|
|
std::cout << "INPUT\n";
|
|
continue;
|
|
}
|
|
auto arity = arities.find(tokens[0]);
|
|
if (arity == arities.end() || tokens.size() != arity->second + 1) {
|
|
std::cout << "INPUT\n";
|
|
continue;
|
|
}
|
|
std::vector<Number> v;
|
|
bool parsed = true;
|
|
for (std::size_t i = 1; i < tokens.size(); ++i) {
|
|
Number number = 0;
|
|
const auto& item = tokens[i];
|
|
auto result = std::from_chars(item.data(), item.data() + item.size(), number);
|
|
if (result.ec != std::errc{} || result.ptr != item.data() + item.size()) {
|
|
parsed = false;
|
|
}
|
|
v.push_back(number);
|
|
}
|
|
if (!parsed) {
|
|
std::cout << "INPUT\n";
|
|
continue;
|
|
}
|
|
const auto& op = tokens[0];
|
|
if (op == "C" || op == "S" || op == "X" || op == "F") {
|
|
Code r = Code::Ok;
|
|
if (op == "C") r = engine.create(v[0], v[1]);
|
|
if (op == "S") r = engine.submit(v[0], v[1], v[2], v[3]);
|
|
if (op == "X") r = engine.cancel(v[0], v[1]);
|
|
if (op == "F") r = engine.release(v[0], v[1]);
|
|
std::cout << "R " << static_cast<int>(r) << '\n';
|
|
} else if (op == "W" || op == "D") {
|
|
auto r = op == "W" ? engine.work(v[0], v[1]) : engine.destroy(v[0]);
|
|
std::cout << "W " << static_cast<int>(r.code) << ' ' << r.spent << ' ' << r.finished << '\n';
|
|
} else if (op == "J") {
|
|
auto r = engine.job(v[0], v[1]);
|
|
std::cout << "J " << static_cast<int>(r.code);
|
|
print_job(r);
|
|
std::cout << '\n';
|
|
} else if (op == "Q") {
|
|
auto s = engine.stats(v[0]);
|
|
std::cout << "Q " << static_cast<int>(s.code) << ' ' << s.capacity << ' ' << s.closed
|
|
<< ' ' << s.accepted << ' ' << s.started << ' ' << s.completed
|
|
<< ' ' << s.cancelled << ' ' << s.released << ' ' << s.waiting
|
|
<< ' ' << s.running << ' ' << s.retained << ' ' << s.ticks << ' ' << s.total_value << '\n';
|
|
} else if (op == "L") {
|
|
auto r = engine.jobs(v[0]);
|
|
std::cout << "L " << static_cast<int>(r.code) << ' ' << r.entries.size();
|
|
for (const auto& j : r.entries) print_job(j);
|
|
std::cout << '\n';
|
|
} else if (op == "E") {
|
|
auto r = engine.events(v[0], v[1]);
|
|
std::cout << "E " << static_cast<int>(r.code) << ' ' << r.entries.size();
|
|
for (const auto& e : r.entries) {
|
|
std::cout << ' ' << e.serial << ' ' << e.queue << ' ' << e.job << ' '
|
|
<< static_cast<int>(e.kind) << ' ' << e.ticket << ' ' << e.remaining
|
|
<< ' ' << e.ticks << ' ' << e.value;
|
|
}
|
|
std::cout << '\n';
|
|
}
|
|
}
|
|
}
|