Divide and conquer

[pwochner]

Description

This PR includes a basic implementation of divide and conquer functions.

Main additions:

divide_and_conquer: Main function implementing the divide-and-conquer search procedure.

divide: Breaks down a problem specification into individual subproblems, each consisting of a single input-output example.

decide: Decides if a partial program should be kept. Programs are kept if they satisfy at least one subproblem.

conquer: Combines solutions to subproblems into a global solution program using a decision tree. Helper functions for decision tree:

• get_predicates: Generates predicates for feature tests in the decision tree (BFS iterator with provided start symbol).
• get_features: Constructs feature matrix by evaluating every IOExample inputs on all predicates.
• get_labels: Extracts labels for each subproblem. First partial program that satisfied the subproblem is used as label.
• construct_final_program: Recursively constructs the final program from the decision tree.

[codecov]

Codecov Report

Attention: Patch coverage is 96.77419% with 4 lines in your changes missing coverage. Please review.

Project coverage is 76.09%. Comparing base (8fe642a) to head (c80c010).
Report is 6 commits behind head on master.

Files with missing lines	Patch %	Lines
src/divide_conquer_functions/conquer.jl	95.65%	3 Missing ⚠️
src/search_procedure.jl	97.82%	1 Missing ⚠️

Additional details and impacted files

@@            Coverage Diff             @@
##           master     #134      +/-   ##
==========================================
+ Coverage   71.26%   76.09%   +4.83%     
==========================================
  Files          20       22       +2     
  Lines         689      774      +85     
==========================================
+ Hits          491      589      +98     
+ Misses        198      185      -13     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.