docs(10_Wiki): 위키 구조 정리 — 언어 튜토리얼 카테고리 폴더 제거 + 신규 자산 동기화

Topic_CSS/Topic_HTML/Topic_JavaScript/Topic_Prompt/Topic_Comfyui 등 기존 카테고리 폴더를 정리하고, Topic_Graphic/Dev 등 신규 산출물과 Topics 내부 세션/메모리 기록을 동기화.
2026-07-05 00:10:59 +09:00
parent a397bc4720
commit 1cfd3bbb56
1495 changed files with 68534 additions and 27 deletions
@@ -0,0 +1,71 @@
+---
+id: java-linkedhashset
+title: "Java LinkedHashSet"
+category: "Programming_Language"
+status: "draft"
+verification_status: "conceptual"
+canonical_id: ""
+aliases: ["자바 LinkedHashSet"]
+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", "linkedhashset"]
+raw_sources: ["https://www.w3schools.com/java/java_linkedhashset.asp"]
+applied_in: []
+github_commit: ""
+---
+
+# [[Java LinkedHashSet]]
+
+## 🎯 한 줄 통찰 (One-line insight)
+LinkedHashSet occupies the middle ground between HashSet and TreeSet — it preserves INSERTION order (not sorted order like TreeSet) at a smaller performance cost than TreeSet's full sorting overhead, making it the choice when you want predictable iteration order without paying for sorting. [S1]
+
+## 🧠 핵심 개념 (Core concepts)
+- **`LinkedHashSet`** — unique elements, preserving insertion order (not sorted order). [S1]
+- **Same API as HashSet/TreeSet** — `add()`, `contains()`, `remove()`, `clear()`, `size()`. [S1]
+- **Duplicate handling** — ignored, same as HashSet/TreeSet. [S1]
+- **Performance** — slightly slower than HashSet due to order tracking, but presumably faster than TreeSet's sorting (not directly compared in source). [S1]
+
+## 📖 세부 내용 (Details)
+- Insertion-order preservation: `LinkedHashSet<String> cars = new LinkedHashSet<>(); cars.add("Volvo"); cars.add("BMW"); cars.add("Ford"); cars.add("BMW"); cars.add("Mazda"); // [Volvo, BMW, Ford, Mazda] in insertion order`. [S1]
+- Comparison table: HashSet (no order, faster) vs. LinkedHashSet (insertion order preserved, slightly slower). [S1]
+
+## ⚖️ 모순 및 업데이트 (Contradictions & updates)
+소스에서 모순되는 정보는 발견되지 않음.
+
+## 🛠️ 적용 사례 (Applied in summary)
+현재 발견된 실제 적용 사례가 없습니다 — 삽입 순서를 유지하면서 중복은 배제해야 하는 목록(방문 기록, 처리 순서 등)에 LinkedHashSet이 적합하다. [S1]
+
+## 💻 코드 패턴 (Code patterns)
+LinkedHashSet preserves insertion order (Java):
+```java
+LinkedHashSet<String> cars = new LinkedHashSet<>();
+cars.add("Volvo");
+cars.add("BMW");
+cars.add("Ford");
+cars.add("BMW"); // Duplicate, ignored
+cars.add("Mazda");
+System.out.println(cars); // [Volvo, BMW, Ford, Mazda]
+```
+
+## ✅ 검증 상태 및 신뢰도
+- **상태:** draft
+- **검증 단계:** conceptual
+- **출처 신뢰도:** B (W3Schools — widely used educational reference, not a primary standards body)
+- **신뢰 점수:** 0.89
+- **중복 검사 결과:** 신규 생성 (New discovery)
+
+## 🔗 지식 그래프 (Knowledge Graph)
+- **상위/루트:** [[Java Tutorial]]
+- **관련 개념:** [[Java HashSet]], [[Java TreeSet]], [[Java Map]]
+- **참조 맥락:** Set 구현체의 마지막 — Map 인터페이스 챕터로 이어짐.
+
+## 📚 출처 (Sources)
+- [S1] W3Schools — Java LinkedHashSet — https://www.w3schools.com/java/java_linkedhashset.asp
+
+## 📝 변경 이력 (Change history)
+- 2026-07-04: Initial draft synthesized from the W3Schools "Java LinkedHashSet" page (Astra wiki-curation, P-Reinforce v3.1 format).