Skip to content

fixing execute_task_hints.rs tests #204

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 25, 2025
Merged

fixing execute_task_hints.rs tests #204

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file added crates/cairo-program-runner-lib/resources/compiled_programs/test_programs/fibonacci_pie.zip
View file
Open in desktop
Binary file not shown.
39 changes: 1 addition & 38 deletions crates/cairo-program-runner-lib/src/hints/bootloader_hints.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -492,6 +492,7 @@ mod tests {
use crate::hints::codes::*;
use crate::hints::hint_processors::MinimalBootloaderHintProcessor;
use crate::hints::types::{BootloaderConfig, SimpleBootloaderInput};
use crate::test_utils::prepare_ids_data_for_test;
use cairo_vm::hint_processor::builtin_hint_processor::builtin_hint_processor_definition::HintProcessorData;
use cairo_vm::hint_processor::builtin_hint_processor::hint_utils::get_maybe_relocatable_from_var_name;
use cairo_vm::hint_processor::hint_processor_definition::HintProcessorLogic;
Expand Down Expand Up @@ -529,44 +530,6 @@ mod tests {
}
}

fn prepare_refrences_for_test(num: i32) -> HashMap<usize, HintReference> {
// Create a HashMap of HintReferences for testing.
// output should look like:
// {
// 0: HintReference::new_simple(-num),
// 1: HintReference::new_simple(-num + 1),
// ...
// num - 1: HintReference::new_simple(-1),
// num: HintReference::new_simple(0),
// }
let mut references = HashMap::<usize, HintReference>::new();
for i in 0..num {
references.insert(i as usize, HintReference::new_simple(i - num));
}
references
}

fn prepare_ids_data_for_test(
names: &[&str],
) -> std::collections::HashMap<String, HintReference> {
// Create a HashMap of HintReferences for testing, where each name corresponds to a
// HintReference.
// The output should look like:
// {
// "name1": HintReference::new_simple(-num),
// "name2": HintReference::new_simple(-num + 1),
// ...
// "nameN": HintReference::new_simple(-1),
// }
// where num is the length of names.
let references = prepare_refrences_for_test(names.len() as i32);
let mut ids_data = std::collections::HashMap::<String, HintReference>::new();
for (i, name) in names.iter().enumerate() {
ids_data.insert(name.to_string(), references.get(&i).unwrap().clone());
}
ids_data
}

#[rstest]
fn test_prepare_simple_bootloader_output_segment(bootloader_input: BootloaderInput) {
// Tests that after running prepare_simple_bootloader_output_segment,
Expand Down
Loading