refactor(topics): 멀티 에이전트용 지식 재편 — _Common(공통 기본기) + Domain_* 구조

에이전트 8종(대화형/프로그래머 C·S/디자이너/설계자/기획자/QA/PD/PM)에게 [공통 기본 능력 + 롤별 Specialty] 2층으로 지식을 주입하기 위한 재분류. 문서 내용·포맷은 무수정, 폴더 이동만 (6,372개 문서 수 보존 확인). - Topic_Programming → Domain_Programming (내부 구조 보존) - Topic_Graphic → Domain_Design - Topic_Business → Domain_Product - Topic_General → Domain_General - _Common 신설: Math(구 Topic_Math_Specialty), Reasoning(구 General/From_Thinking & Reasoning), Reasoning_Creativity(구 General/From_창의성), Communication(Poetic_Blog_Writing + From_writing) - 타 도메인의 From_* 폴더는 유지 (출처 표기일 뿐, 이미 도메인에 맞게 분류된 문서) - 빈 폴더 정리 (memory/procedures) - 에이전트→폴더 매핑은 workspace의 .astra/agent-knowledge-map.json (9개 에이전트) Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-07-11 11:05:56 +09:00
parent 6549ead309
commit c24165b8bc
6193 changed files with 1717 additions and 31 deletions
@@ -0,0 +1,70 @@
+---
+id: java-linkedhashmap
+title: "Java LinkedHashMap"
+category: "Programming_Language"
+status: "draft"
+verification_status: "conceptual"
+canonical_id: ""
+aliases: ["자바 LinkedHashMap"]
+duplicate_of: ""
+source_trust_level: "B"
+confidence_score: 0.89
+created_at: 2026-07-04
+updated_at: 2026-07-04
+review_reason: ""
+merge_history: []
+tags: ["java", "programming", "w3schools", "collections-framework", "linkedhashmap"]
+raw_sources: ["https://www.w3schools.com/java/java_linkedhashmap.asp"]
+applied_in: []
+github_commit: ""
+---
+
+# [[Java LinkedHashMap]]
+
+## 🎯 한 줄 통찰 (One-line insight)
+LinkedHashMap completes the exact same three-way pattern seen in the Set hierarchy (HashSet/TreeSet/LinkedHashSet) — HashMap (no order, fastest), TreeMap (sorted, slowest), LinkedHashMap (insertion order, middle ground) — showing Java's Collections Framework applies this identical order/speed trade-off symmetrically across both Set and Map implementations. [S1]
+
+## 🧠 핵심 개념 (Core concepts)
+- **`LinkedHashMap`** — stores key-value pairs, preserving INSERTION order (not sorted order). [S1]
+- **Same API as HashMap/TreeMap** — `put()`, `get()`, `remove()`, `clear()`, `size()`, `keySet()`, `values()`. [S1]
+- **Duplicate key handling** — same as HashMap: re-putting an existing key overwrites its value silently. [S1]
+- **Performance** — slightly slower than HashMap due to order tracking (same trade-off pattern as LinkedHashSet vs. HashSet). [S1]
+
+## 📖 세부 내용 (Details)
+- Insertion-order preservation: `LinkedHashMap<String, String> capitalCities = new LinkedHashMap<>(); capitalCities.put("England", "London"); capitalCities.put("India", "New Dehli"); ... // {England=London, India=New Dehli, Austria=Wien, Norway=Oslo, USA=Washington DC} — insertion order preserved`. [S1]
+- Comparison table: HashMap (no order, faster random access) vs. LinkedHashMap (insertion order preserved, slightly slower). [S1]
+
+## ⚖️ 모순 및 업데이트 (Contradictions & updates)
+소스에서 모순되는 정보는 발견되지 않음.
+
+## 🛠️ 적용 사례 (Applied in summary)
+현재 발견된 실제 적용 사례가 없습니다 — 입력된 순서 그대로 국가-수도 목록을 유지해야 할 때 LinkedHashMap이 적합하다. [S1]
+
+## 💻 코드 패턴 (Code patterns)
+LinkedHashMap preserves insertion order (Java):
+```java
+LinkedHashMap<String, String> capitalCities = new LinkedHashMap<>();
+capitalCities.put("England", "London");
+capitalCities.put("India", "New Dehli");
+capitalCities.put("Austria", "Wien");
+System.out.println(capitalCities);
+// {England=London, India=New Dehli, Austria=Wien}
+```
+
+## ✅ 검증 상태 및 신뢰도
+- **상태:** draft
+- **검증 단계:** conceptual
+- **출처 신뢰도:** B (W3Schools — widely used educational reference, not a primary standards body)
+- **신뢰 점수:** 0.89
+- **중복 검사 결과:** 신규 생성 (New discovery)
+
+## 🔗 지식 그래프 (Knowledge Graph)
+- **상위/루트:** [[Java Tutorial]]
+- **관련 개념:** [[Java HashMap]], [[Java TreeMap]], [[Java Iterator]]
+- **참조 맥락:** Map 구현체의 마지막 — Iterator 챕터로 이어짐(모든 자료구조 공통 순회 도구).
+
+## 📚 출처 (Sources)
+- [S1] W3Schools — Java LinkedHashMap — https://www.w3schools.com/java/java_linkedhashmap.asp
+
+## 📝 변경 이력 (Change history)
+- 2026-07-04: Initial draft synthesized from the W3Schools "Java LinkedHashMap" page (Astra wiki-curation, P-Reinforce v3.1 format).