| | |
| |
|
| | |
| | max_iterations: 150 |
| | checkpoint_interval: 15 |
| | log_level: "INFO" |
| | file_suffix: ".rs" |
| |
|
| | |
| | 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 |
| | |
| | |
| | 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: |
| | num_top_programs: 4 |
| | num_diverse_programs: 3 |
| | |
| | |
| | include_artifacts: true |
| | max_artifact_bytes: 8192 |
| |
|
| | |
| | database: |
| | population_size: 150 |
| | num_islands: 4 |
| | |
| | |
| | feature_dimensions: |
| | - "score" |
| | - "performance_score" |
| | - "adaptability_score" |
| | feature_bins: 8 |
| |
|
| | |
| | evaluator: |
| | timeout: 60 |
| | parallel_evaluations: 3 |
| | |
| | |
| | cascade_evaluation: false |