43d241c28d
- Add arena allocator for zero-allocation hot paths - Add thread pool for parallel operations - Add mmap utilities for memory-mapped I/O - Implement queue_index with heap-based priority queue - Implement dataset_hash with SIMD support (SHA-NI, ARMv8) - Add runtime SIMD detection for cross-platform correctness - Add comprehensive tests and benchmarks
68 lines
1.9 KiB
C++
68 lines
1.9 KiB
C++
#pragma once
|
|
#include "../storage/index_storage.h"
|
|
#include "../heap/binary_heap.h"
|
|
#include "queue_index.h"
|
|
#include <cstring>
|
|
#include <mutex>
|
|
#include <vector>
|
|
|
|
// In-memory index entry with metadata
|
|
struct IndexEntry {
|
|
qi_task_t task;
|
|
uint64_t offset; // File offset (for future direct access)
|
|
bool dirty; // Modified since last save
|
|
};
|
|
|
|
// Priority queue comparator for IndexEntry
|
|
struct EntryComparator {
|
|
bool operator()(size_t a, size_t b, const std::vector<IndexEntry>& items) const {
|
|
const auto& ta = items[a].task;
|
|
const auto& tb = items[b].task;
|
|
if (ta.priority != tb.priority) {
|
|
return ta.priority < tb.priority; // Max-heap: higher priority first
|
|
}
|
|
return ta.created_at > tb.created_at; // Earlier first
|
|
}
|
|
};
|
|
|
|
// High-level priority queue index
|
|
class PriorityQueueIndex {
|
|
IndexStorage storage_;
|
|
std::vector<IndexEntry> entries_;
|
|
BinaryHeap<IndexEntry, EntryComparator> heap_;
|
|
mutable std::mutex mutex_;
|
|
char last_error_[256];
|
|
bool dirty_ = false;
|
|
|
|
public:
|
|
explicit PriorityQueueIndex(const char* queue_dir);
|
|
~PriorityQueueIndex();
|
|
|
|
// Open/load existing index
|
|
bool open();
|
|
void close();
|
|
|
|
// Add tasks
|
|
int add_tasks(const qi_task_t* tasks, uint32_t count);
|
|
|
|
// Get next batch of tasks (highest priority first)
|
|
int get_next_batch(qi_task_t* out_tasks, uint32_t max_count, uint32_t* out_count);
|
|
|
|
// Save to disk
|
|
int save();
|
|
|
|
// Query
|
|
uint64_t count() const { return entries_.size(); }
|
|
bool empty() const { return entries_.empty(); }
|
|
|
|
// Get all tasks (returns newly allocated array, caller must free)
|
|
int get_all_tasks(qi_task_t** out_tasks, size_t* out_count);
|
|
|
|
// Error handling
|
|
const char* last_error() const { return last_error_[0] ? last_error_ : nullptr; }
|
|
void clear_error() { last_error_[0] = '\0'; }
|
|
|
|
private:
|
|
void load_entries();
|
|
void rebuild_heap();
|
|
};
|