mark propositionless search states as solutions

[scpubgit/DX.git] / lib / DX / SearchState.pm

diff --git a/lib/DX/SearchState.pm b/lib/DX/SearchState.pm
index 1053f48..1548f11 100644 (file)
--- a/lib/DX/SearchState.pm
+++ b/lib/DX/SearchState.pm
@@ -1,6 +1,7 @@
 package DX::SearchState;
 
 use Types::Standard qw(Maybe);
+use DX::Step::Backtrack;
 use DX::Step::InvokeNextPredicate;
 use DX::Class;
 
@@ -8,54 +9,42 @@ has current_hypothesis => (is => 'ro', isa => Hypothesis, required => 1);
 
 has next_step => (is => 'ro', isa => Maybe[Step]);
 
+has propositions => (is => 'ro', isa => PropositionSequence, required => 1);
+
 has alternatives => (is => 'ro', isa => AlternativeList, required => 1);
 
+has is_solution_state => (is => 'ro', required => 1);
+
+sub next_proposition {
+  my ($self, $hyp) = @_;
+  $hyp ||= $self->current_hypothesis;
+  $self->propositions->members->[
+    $hyp->resolved_propositions->resolved_count
+  ];
+}
+
 sub new_for {
-  my ($class, $hyp) = @_;
+  my ($class, $hyp, $props) = @_;
   $class->new(
     current_hypothesis => $hyp,
     alternatives => [],
-    next_step => DX::Step::InvokeNextPredicate->new,
+    propositions => $props,
+    (@{$props->members}
+      ? (
+          next_step => DX::Step::InvokeNextPredicate->new(
+            proposition => $props->members->[0],
+          ),
+          is_solution_state => 0,
+        )
+      : ( is_solution_state => 1 )
+    ),
   );
 }
 
 sub with_one_step {
   my ($self) = @_;
-  my $hyp = $self->current_hypothesis;
   return undef unless my $step = $self->next_step;
-  my ($first_alt, @rest_alt) = my @alt = @{$self->alternatives};
-  my ($new_hyp, $alt_step) = $step->apply_to($hyp);
-  if ($new_hyp) {
-    return $self->but(
-      current_hypothesis => $new_hyp,
-      alternatives => [
-        ($alt_step
-          ? [ $hyp, $alt_step ]
-          : ()),
-        @alt
-      ],
-      next_step => DX::Step::InvokeNextPredicate->new,
-    );
-  }
-  if ($alt_step) {
-    return $self->but(next_step => $alt_step);
-  }
-  return undef unless $first_alt;
-  trace 'search.backtrack.rewind_to' => $first_alt->[1];
-  return $self->but(
-    current_hypothesis => $first_alt->[0],
-    alternatives => \@rest_alt,
-    next_step => $first_alt->[1],
-  );
-}
-
-sub find_solution {
-  my $state = $_[0];
-  while ($state and @{$state->current_hypothesis->outstanding_propositions}) {
-    $state = $state->with_one_step;
-  }
-  trace 'search.solution.hyp' => $state->current_hypothesis if $state;
-  return $state;
+  return $step->apply_to($self);
 }
 
 sub force_backtrack {
@@ -63,17 +52,9 @@ sub force_backtrack {
   my ($first_alt, @rest_alt) = @{$self->alternatives};
   return undef unless $first_alt;
   trace 'search.backtrack.forced' => $first_alt->[0];
-  return ref($self)->new(
-    current_hypothesis => $first_alt->[0],
-    next_step => $first_alt->[1],
-    alternatives => \@rest_alt
-  );
-}
-
-sub find_next_solution {
-  my ($self) = @_;
-  return undef unless my $bt = $self->force_backtrack;
-  return $bt->find_solution;
+  return $self->but(
+    next_step => DX::Step::Backtrack->new,
+  )->with_one_step;
 }
 
 1;