Implement Phase E2 Enhancements for Planning Exercise Suggestion
Deploy Development / deploy (push) Successful in 40s
Test Suite / pytest-backend (push) Successful in 51s
Test Suite / lint-backend (push) Successful in 0s
Test Suite / build-frontend (push) Successful in 13s
Test Suite / k6 /health Baseline (push) Successful in 34s
Test Suite / playwright-tests (push) Successful in 1m20s
Deploy Development / deploy (push) Successful in 40s
Test Suite / pytest-backend (push) Successful in 51s
Test Suite / lint-backend (push) Successful in 0s
Test Suite / build-frontend (push) Successful in 13s
Test Suite / k6 /health Baseline (push) Successful in 34s
Test Suite / playwright-tests (push) Successful in 1m20s
- Introduced path reordering functionality using LLM with `ordered_step_indices`, allowing for dynamic adjustment of exercise progression paths. - Added AI gap filling capabilities, enabling the system to propose new exercises when unbridgeable gaps are detected. - Updated the backend to support new request parameters for path reordering and AI gap filling. - Enhanced frontend components to reflect these new features, including alerts for AI proposals and adjustments in exercise display. - Incremented version to 0.8.187 and updated changelog to document these significant enhancements in planning AI functionality.
This commit is contained in:
1 parent
c6b8c396ad
commit
c2c736dafc
9 files changed
+447
-35
No files matched your search
@@ -187,16 +187,18 @@ def insert_bridge_exercises(
|
||||
brief: PlanningSemanticBrief,
|
||||
bridge_search_fn: Callable[..., List[Dict[str, Any]]],
|
||||
max_inserts: int = _MAX_BRIDGE_INSERTS,
|
||||
) -> Tuple[List[Dict[str, Any]], List[Dict[str, Any]]]:
|
||||
) -> Tuple[List[Dict[str, Any]], List[Dict[str, Any]], List[Dict[str, Any]]]:
|
||||
"""
|
||||
Fügt zwischen großen Lücken Brücken-Übungen ein.
|
||||
bridge_search_fn(from_step, to_step, gap) -> hits
|
||||
Returns: (steps, bridge_inserts, unfilled_gaps)
|
||||
"""
|
||||
if not gaps:
|
||||
return steps, []
|
||||
return steps, [], []
|
||||
|
||||
used_ids = {int(s["exercise_id"]) for s in steps}
|
||||
used_ids = {int(s["exercise_id"]) for s in steps if s.get("exercise_id") is not None}
|
||||
inserts: List[Dict[str, Any]] = []
|
||||
unfilled: List[Dict[str, Any]] = []
|
||||
out = list(steps)
|
||||
|
||||
gap_by_pair = {
|
||||
@@ -207,6 +209,9 @@ def insert_bridge_exercises(
|
||||
while i < len(out) - 1 and len(inserts) < max_inserts:
|
||||
a = out[i]
|
||||
b = out[i + 1]
|
||||
if a.get("exercise_id") is None or b.get("exercise_id") is None:
|
||||
i += 1
|
||||
continue
|
||||
key = (int(a["exercise_id"]), int(b["exercise_id"]))
|
||||
gap = gap_by_pair.get(key)
|
||||
if not gap:
|
||||
@@ -221,6 +226,7 @@ def insert_bridge_exercises(
|
||||
step_b_id=int(b["exercise_id"]),
|
||||
)
|
||||
if not bridge_hit:
|
||||
unfilled.append(gap)
|
||||
i += 1
|
||||
continue
|
||||
|
||||
@@ -253,7 +259,7 @@ def insert_bridge_exercises(
|
||||
)
|
||||
i += 2
|
||||
|
||||
return out, inserts
|
||||
return out, inserts, unfilled
|
||||
|
||||
|
||||
def try_llm_qa_progression_path(
|
||||
@@ -271,14 +277,29 @@ def try_llm_qa_progression_path(
|
||||
|
||||
step_payload = []
|
||||
for idx, step in enumerate(steps):
|
||||
if step.get("is_ai_proposal") or step.get("exercise_id") is None:
|
||||
step_payload.append(
|
||||
{
|
||||
"index": idx + 1,
|
||||
"proposal_key": step.get("proposal_key"),
|
||||
"title": step.get("title"),
|
||||
"summary": strip_html_to_plain(step.get("summary"), max_len=400),
|
||||
"is_bridge": bool(step.get("is_bridge")),
|
||||
"is_ai_proposal": True,
|
||||
"reasons": list(step.get("reasons") or [])[:3],
|
||||
}
|
||||
)
|
||||
continue
|
||||
bundle = _load_exercise_text_bundle(cur, int(step["exercise_id"]))
|
||||
step_payload.append(
|
||||
{
|
||||
"index": idx + 1,
|
||||
"exercise_id": int(step["exercise_id"]),
|
||||
"proposal_key": step.get("proposal_key"),
|
||||
"title": step.get("title") or bundle["title"],
|
||||
"goal": strip_html_to_plain(bundle["goal"], max_len=400),
|
||||
"is_bridge": bool(step.get("is_bridge")),
|
||||
"is_ai_proposal": False,
|
||||
"reasons": list(step.get("reasons") or [])[:3],
|
||||
}
|
||||
)
|
||||
@@ -304,19 +325,52 @@ def try_llm_qa_progression_path(
|
||||
return None, False
|
||||
|
||||
|
||||
def apply_llm_path_reorder(
|
||||
steps: List[Dict[str, Any]],
|
||||
llm_qa: Mapping[str, Any],
|
||||
) -> Tuple[List[Dict[str, Any]], bool, List[str]]:
|
||||
"""
|
||||
Wendet LLM-Neuordnung an (ordered_step_indices = Permutation der aktuellen Indizes).
|
||||
"""
|
||||
raw = llm_qa.get("ordered_step_indices")
|
||||
if not isinstance(raw, list) or len(raw) != len(steps):
|
||||
return steps, False, []
|
||||
|
||||
try:
|
||||
indices = [int(x) for x in raw]
|
||||
except (TypeError, ValueError):
|
||||
return steps, False, ["Neuordnung: ungültige Indizes"]
|
||||
|
||||
if sorted(indices) != list(range(len(steps))):
|
||||
return steps, False, ["Neuordnung: keine gültige Permutation — ignoriert"]
|
||||
|
||||
if indices == list(range(len(steps))):
|
||||
return steps, False, []
|
||||
|
||||
notes = [str(n) for n in (llm_qa.get("sequence_notes") or []) if str(n).strip()]
|
||||
return [steps[i] for i in indices], True, notes
|
||||
|
||||
|
||||
def build_path_qa_summary(
|
||||
*,
|
||||
gaps: Sequence[Mapping[str, Any]],
|
||||
bridge_inserts: Sequence[Mapping[str, Any]],
|
||||
ai_proposals: Sequence[Mapping[str, Any]],
|
||||
llm_qa: Optional[Mapping[str, Any]],
|
||||
llm_applied: bool,
|
||||
reorder_applied: bool = False,
|
||||
reorder_notes: Optional[Sequence[str]] = None,
|
||||
) -> Dict[str, Any]:
|
||||
summary: Dict[str, Any] = {
|
||||
"gap_count": len(gaps),
|
||||
"large_gaps": list(gaps),
|
||||
"bridge_insert_count": len(bridge_inserts),
|
||||
"bridge_inserts": list(bridge_inserts),
|
||||
"ai_proposal_count": len(ai_proposals),
|
||||
"ai_proposals": list(ai_proposals),
|
||||
"llm_qa_applied": llm_applied,
|
||||
"reorder_applied": reorder_applied,
|
||||
"reorder_notes": list(reorder_notes or []),
|
||||
}
|
||||
if llm_qa:
|
||||
summary["overall_ok"] = bool(llm_qa.get("overall_ok", True))
|
||||
@@ -335,6 +389,7 @@ def build_path_qa_summary(
|
||||
|
||||
|
||||
__all__ = [
|
||||
"apply_llm_path_reorder",
|
||||
"build_path_qa_summary",
|
||||
"detect_path_gaps",
|
||||
"insert_bridge_exercises",
|
||||
|
||||
Reference in new issue
Block a user