File size: 1,679 Bytes
5e4510c | 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 | # Configuration for Rust Adaptive Sorting Evolution
# General settings
max_iterations: 150
checkpoint_interval: 15
log_level: "INFO"
file_suffix: ".rs"
# LLM configuration
llm:
primary_model: "gemini-flash-lite-latest"
primary_model_weight: 0.8
secondary_model: "gemini-flash-latest"
secondary_model_weight: 0.2
api_base: "https://generativelanguage.googleapis.com/v1beta/openai/"
temperature: 0.7
max_tokens: 16384
# Custom system message for Rust performance programming
system_message: |
You are an expert Rust systems programmer specializing in high-performance algorithms.
Focus on creating adaptive sorting algorithms that can handle different data patterns efficiently.
Consider hybrid approaches like introsort, adaptive pivot selection, and data-aware optimizations.
Ensure memory safety and idiomatic Rust code. Use appropriate data structures and leverage Rust's zero-cost abstractions.
# Prompt configuration
prompt:
num_top_programs: 4
num_diverse_programs: 3
# Include compilation errors and performance artifacts
include_artifacts: true
max_artifact_bytes: 8192
# Database configuration
database:
population_size: 150
num_islands: 4
# Feature dimensions for sorting algorithms
feature_dimensions:
- "score" # Overall performance score
- "performance_score" # Speed performance
- "adaptability_score" # Adaptability to different data patterns
feature_bins: 8
# Evaluator configuration
evaluator:
timeout: 60 # Rust compilation can take time
parallel_evaluations: 3
# Direct evaluation - evaluator doesn't implement cascade functions
cascade_evaluation: false |