Correct sample code for demo optimization (CF-876)

[mohammedahmed18]

PR Type

Bug fix

---

Description

• Fix sample code for tag handling

• Add future annotations import

• Prevent KeyError using dict.get

• Safeguard empty or missing tag lists

---

Diagram Walkthrough

flowchart LR
  Sample["Sample function in cmd_init.py"] -- "before: direct ['tags'] access" --> KeyErr["Possible KeyError / failures"]
  Sample -- "after: use get('tags', [])" --> Safe["Safe handling of missing tags"]
  Safe -- "return set(common_tags)" --> Output["Correct result"]

Loading

File Walkthrough

	Relevant files
Bug fix	cmd_init.py Make sample function robust to missing tags                            codeflash/cli_cmds/cmd_init.py Prepend future annotations import to sample. Use article.get("tags", []) to avoid KeyError. Initialize common_tags from first article with default list. Keep output as set for uniqueness. +6/-3

---

[github-actions]

PR Reviewer Guide 🔍

Here are some key observations to aid the review process:

⏱️ Estimated effort to review: 2 🔵🔵⚪⚪⚪

🧪 No relevant tests

🔒 No security concerns identified

⚡ Recommended focus areas for review Sample Code Robustness The embedded sample now uses string annotations (PEP 585) with from future import annotations and safer dict.get access. Validate that the generated file is executed in environments where future annotations are acceptable and that the string literal content preserves indentation and newlines correctly when written to disk. find_common_tags_content = """from __future__ import annotations def find_common_tags(articles: list[dict[str, list[str]]]) -> set[str]: if not articles: return set() common_tags = articles[0].get("tags", []) for article in articles[1:]: common_tags = [tag for tag in common_tags if tag in article.get("tags", [])] return set(common_tags) """

[github-actions]

PR Code Suggestions ✨

Explore these optional code suggestions:

Category	Suggestion	Impact
General	Use set intersections for efficiency Convert the first article's tags to a set and use set intersection for subsequent articles to avoid O(n*m) list scans and eliminate duplicates early. This also prevents order-dependent behavior and is more robust for large inputs. codeflash/cli_cmds/cmd_init.py [1233-1241] def find_common_tags(articles: list[dict[str, list[str]]]) -> set[str]: if not articles: return set() - common_tags = articles[0].get("tags", []) + common = set(articles[0].get("tags", [])) for article in articles[1:]: - common_tags = [tag for tag in common_tags if tag in article.get("tags", [])] - return set(common_tags) + common &= set(article.get("tags", [])) + if not common: + break + return common Suggestion importance[1-10]: 8 __ Why: The suggestion is accurate and improves both correctness and performance by eliminating duplicate tags early and reducing complexity via set intersections; it also matches the new hunk code precisely.	Medium