1 files changed, 59 insertions, 5 deletions
diff --git a/prolog/problems/sorting/quick_sort_2/common.py b/prolog/problems/sorting/quick_sort_2/common.py
index 85ababe..8b9bcb7 100644
--- a/prolog/problems/sorting/quick_sort_2/common.py
+++ b/prolog/problems/sorting/quick_sort_2/common.py
@@ -1,11 +1,11 @@
-# coding=utf-8
-
 from operator import itemgetter
+import socket
+
 import prolog.engine
-import server.problems
+from server.hints import Hint, HintPopup
 
 id = 125
-number = 32
+number = 60
 visible = False
 facts = None
 
@@ -28,6 +28,17 @@ quick_sort([Pivot|T], Sorted) :-
   conc125(SortedSmaller, [Pivot|SortedGreater], Sorted).
 '''
 
+hint_type = {
+    'eq_instead_of_equ_markup': HintPopup('eq_instead_of_equ_markup'),
+    'eq_instead_of_equ': Hint('eq_instead_of_equ'),
+    'predicate_always_false': Hint('predicate_always_false'),
+    'base_case': Hint('base_case'),
+    'recursive_case': Hint('recursive_case'),
+    'timeout': Hint('timeout'),
+    'arbitrary_base_case': Hint('arbitrary_base_case'),
+    'forgotten_pivot': Hint('forgotten_pivot'),
+}
+
 test_cases = [
     ('quick_sort([], X)',
         [{'X': '[]'}]),
@@ -59,5 +70,48 @@ def test(code, aux_code):
     return n_correct, len(test_cases), hints
 
 def hint(code, aux_code):
-    # TODO
+    tokens = prolog.util.tokenize(code)
+
+    try:
+        engine_id, output = prolog.engine.create(code=code+aux_code, timeout=1.0)
+
+        # strict equality testing instead of simple matching
+        # this is usually (but not necessarily) wrong
+        targets = [prolog.util.Token('EQ', '==')]
+        marks = [(t.pos, t.pos + len(t.val)) for t in tokens if t in targets]
+        if marks:
+            return [{'id': 'eq_instead_of_equ_markup', 'start': m[0], 'end': m[1]} for m in marks] + \
+                   [{'id': 'eq_instead_of_equ'}]
+
+        if prolog.engine.ask_truthTO(engine_id, 'quick_sort([], [yowza])'):
+            return [{'id': 'arbitrary_base_case'}]
+
+        if prolog.engine.ask_truthTO(engine_id, '''\
+                quick_sort([3, 5, 9, 6, 3, 7, 2], []),
+                asserta(quick_sort([], [q])),
+                quick_sort([3, 5, 9, 6, 3, 7, 2], [q, q, q, q, q, q, q, q]),
+                retract(quick_sort([], [q]))'''):
+            return [{'id': 'forgotten_pivot'}]
+
+        # missing/failed base case
+        if not prolog.engine.ask_truthTO(engine_id, 'quick_sort([], [])'):
+            return [{'id': 'base_case'}]
+
+        # target predicate seems to always be false
+        if not prolog.engine.ask_truthTO(engine_id, 'quick_sort(_, _)'):
+            return [{'id': 'predicate_always_false'}]
+
+        # base case works, the recursive doesn't (but it doesn't timeout)
+        # this may be left as the last, most generic hint
+        if not prolog.engine.ask_truth(engine_id,
+                'quick_sort([41, 82, -2, 100], [-2, 41, 82, 100])'):
+            return [{'id': 'recursive_case'}]
+
+    except socket.timeout as ex:
+        return [{'id': 'timeout'}]
+
+    finally:
+        if engine_id:
+            prolog.engine.destroy(engine_id)
+
     return []