pub struct IOExamples {
pub(crate) inputs: Vec<Value>,
pub(crate) output: Value,
}
Expand description
A struct that holds input and output examples for string synthesis problems.
The structure consists of two fields: inputs
, which is a vector containing multiple Value
elements, and output
, a single Value
representing the expected result.
This setup is designed to facilitate the storage and retrieval of example data necessary for evaluating and validating synthesis algorithms, by providing concrete cases of input-output relationships.
Fields§
§inputs: Vec<Value>
§output: Value
Implementations§
Source§impl IOExamples
impl IOExamples
Sourcepub(crate) fn parse(
examples: Pair<'_, Rule>,
sig: &FunSig,
dedup: bool,
) -> Result<Self, Error>
pub(crate) fn parse( examples: Pair<'_, Rule>, sig: &FunSig, dedup: bool, ) -> Result<Self, Error>
Parses a collection of input/output examples according to a specified function signature and optional deduplication flag, returning a structured set of examples or an error.
It begins by extracting relevant metadata from the provided function signature, such as function name, argument types, and return type.
The function processes the provided examples by iterating over them, ensuring each example contains a correct number of arguments and matching types.
If the ‘dedup’ parameter is set to true, duplicates are removed using a HashSet
.
Finally, the function constructs the inputs
and output
, organizing each example’s inputs by type before returning the assembled IOExamples
structure.
Sourcepub fn extract_constants(&self) -> Vec<&'static str>
pub fn extract_constants(&self) -> Vec<&'static str>
Extracts and returns a list of constant substrings identified in the input and output examples of string synthesis problems.
The method iterates over all input strings and the output string, treating them as a unified sequence.
For each string, it generates all possible substrings using all_slices
and counts their occurrences.
It then evaluates each distinct substring, checking for specific filtering conditions: the substring must appear with sufficient frequency, must either be a significant length or show certain frequency patterns, and should not be simple numeric or alphanumeric characters.
Substrings meeting these criteria that are not already surpassed in count by longer substrings are added to the list of constants.
This approach helps in identifying significant repeating string patterns, which can play a crucial role in constructing string transformation rules.
Trait Implementations§
Source§impl Clone for IOExamples
impl Clone for IOExamples
Source§fn clone(&self) -> IOExamples
fn clone(&self) -> IOExamples
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreAuto Trait Implementations§
impl Freeze for IOExamples
impl RefUnwindSafe for IOExamples
impl Send for IOExamples
impl Sync for IOExamples
impl Unpin for IOExamples
impl UnwindSafe for IOExamples
Blanket Implementations§
Source§impl<T> AllocForAny<T> for T
impl<T> AllocForAny<T> for T
Source§fn galloc(self) -> &'static T
fn galloc(self) -> &'static T
Provides a method to allocate an instance of T
on the heap with a static lifetime.
This implementation of galloc
takes ownership of the T
instance and uses the alloc
function to place it in a location with a static lifetime, presumably managing it in a way that ensures its persistence for the duration of the program.
This can be particularly useful for scenarios where a static lifetime is required, such as when interfacing with systems or patterns that necessitate global state or long-lived data.
Source§fn galloc_mut(self) -> &'static T
fn galloc_mut(self) -> &'static T
Provides a method that moves the instance and returns a reference to it allocated with a static lifetime.
This method utilizes alloc_mut
to perform the allocation, likely involving allocating the resource in a manner that ensures it lives for the entire duration of the application.
These semantics allow the user to safely assume that the reference will not expire during the program’s execution, making it suitable for long-lived data structures or operations that require such guarantees.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more