main.c

// --- main.c ---

#include "trie_sparse.h" // Your optimized sparse trie implementation
#include <stdio.h>
#include <string.h>

// Assume extract_indicator_from_log() is defined and working

void process_logs_and_check(TrieNode *root, const char *log_filepath) {
    FILE *f = fopen(log_filepath, "r");
    if (!f) {
        perror("Error opening log file");
        return;
    }
    
    char line[4096];
    int line_num = 0;
    
    printf("\n--- Starting Log Stream Processing ---\n");
    
    while (fgets(line, sizeof(line), f) != NULL) {
        line_num++;
        // 1. Extract the URI path
        char *indicator = extract_indicator_from_log(line);
        
        if (indicator) {
            // 2. Perform the high-speed Sparse Trie Lookup
            TiResult result = ti_lookup_indicator_sparse(root, indicator);

            if (result == MATCH_FOUND) {
                // 3. ALERT! Commercial value achieved.
                printf("!!! ALERT (Line %d): MATCH FOUND for URI: %s\n", line_num, indicator);
            } else {
                // For demonstration, show non-matches too
                // printf("INFO (Line %d): No match for %s\n", line_num, indicator);
            }
            free(indicator); // Cleanup memory allocated during extraction
        }
    }
    
    fclose(f);
}

int main(int argc, char *argv[]) {
    // 1. Initialize Trie Root
    TrieNode *root = create_sparse_trie_node();
    
    // 2. Load TI Feed (Build the Trie)
    if (ti_load_feed(root, "ti_feed.txt") != 0) {
        return 1;
    }
    printf("Trie built successfully from ti_feed.txt.\n");
    
    // 3. Process the Log Stream
    process_logs_and_check(root, "access.log");
    
    // 4. Cleanup
    // free_trie(root); // Remember to implement and call your recursive free function!
    
    return 0;
}