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,80 @@
+---
+id: cpp-stacks
+title: "C++ Stacks"
+category: "Programming_Language"
+status: "draft"
+verification_status: "conceptual"
+canonical_id: ""
+aliases: ["std::stack", "LIFO", "C++ 스택"]
+duplicate_of: ""
+source_trust_level: "B"
+confidence_score: 0.86
+created_at: 2026-07-04
+updated_at: 2026-07-04
+review_reason: ""
+merge_history: []
+tags: ["cpp", "programming-language", "w3schools", "stl", "stack", "lifo"]
+raw_sources: ["https://www.w3schools.com/cpp/cpp_stacks.asp"]
+applied_in: []
+github_commit: ""
+---
+
+# [[CPP Stacks]]
+
+## 🎯 한 줄 통찰 (One-line insight)
+A `stack` is the STL's most restrictive container by design — it exposes ONLY `.top()`, deliberately hiding every other element, which is the opposite philosophy from vector's "give me any index" approach; this is a case where LESS access is the feature, because the LIFO guarantee (pancakes added/removed only from the top) is what makes stacks useful for problems like undo-history or call-stack simulation, and that guarantee would be broken if arbitrary access were allowed. [S1]
+
+## 🧠 핵심 개념 (Core concepts)
+- **LIFO (Last In, First Out)** — the defining order: the last element pushed is the first one that can be accessed or removed. [S1]
+- **`stack<type> name`** — requires `<stack>`; unlike vector/list, a stack CANNOT be initialized with a curly-brace list at declaration time — elements must be added via `.push()` after declaring. [S1]
+- **`.push()`** — adds an element to the top of the stack. [S1]
+- **`.top()`** — the ONLY way to read (or, via assignment, change) an element; always refers to the most recently pushed element. [S1]
+- **`.pop()`** — removes the top (most recently added) element; note this differs from vector's `.pop_back()` naming but same "remove from the active end" idea. [S1]
+- **`.size()` / `.empty()`** — same semantics as vector/list. [S1]
+- **Stacks and Queues are paired concepts** — the page explicitly notes queues (FIFO) are the mirror-image structure covered next. [S1]
+
+## 📖 세부 내용 (Details)
+- Declaration: `stack<string> cars;` then `cars.push("Volvo"); cars.push("BMW"); cars.push("Ford"); cars.push("Mazda");` — resulting order top-to-bottom: Mazda(top), Ford, BMW, Volvo. [S1]
+- Access/modify: `cars.top()` returns `"Mazda"`; `cars.top() = "Tesla";` changes only the top element. [S1]
+- Remove: `cars.pop();` removes Mazda, making Ford the new top. [S1]
+- Attempting `stack<string> cars = {"Volvo", "BMW", "Ford", "Mazda"};` is explicitly called out as NOT allowed — a direct contrast to vector/list initialization syntax. [S1]
+
+## ⚖️ 모순 및 업데이트 (Contradictions & updates)
+- **선언 시 초기화가 불가능함**: vector와 list는 `= {...}` 중괄호 리스트로 선언과 동시에 초기화할 수 있었지만, stack은 선언 후 반드시 `.push()`로만 요소를 채울 수 있다는 제약이 이번 챕터에서 vector/list와의 차이로 명시됨. [S1]
+- **접근 가능한 요소가 단 하나(top)로 제한됨**: vector(인덱스 전체)·list(양 끝)에 비해 stack은 오직 top 요소 하나만 읽기/쓰기 가능하다는 점이 LIFO 보장을 위한 의도적 설계 제약으로 확인됨. [S1]
+
+## 🛠️ 적용 사례 (Applied in summary)
+현재 발견된 실제 적용 사례가 없습니다 — 자동차 이름을 push()로 쌓고 top()으로 확인하는 예제가 원문에서 제시됨. [S1]
+
+## 💻 코드 패턴 (Code patterns)
+Stack push/top/pop — only the top element is ever reachable (C++):
+```cpp
+#include <stack>
+stack<string> cars;
+cars.push("Volvo");
+cars.push("BMW");
+cars.push("Ford");
+cars.push("Mazda");        // top is now "Mazda"
+
+cout << cars.top();        // "Mazda"
+cars.pop();                 // removes "Mazda"
+cout << cars.top();        // now "Ford"
+```
+
+## ✅ 검증 상태 및 신뢰도
+- **상태:** draft
+- **검증 단계:** conceptual
+- **출처 신뢰도:** B (W3Schools — widely used educational reference, not a primary standards body)
+- **신뢰 점수:** 0.86
+- **중복 검사 결과:** 신규 생성 (New discovery)
+
+## 🔗 지식 그래프 (Knowledge Graph)
+- **상위/루트:** [[C++ Tutorial]]
+- **관련 개념:** [[CPP List]], [[CPP Queues]], [[CPP Data Structures]]
+- **참조 맥락:** 데이터 구조(STL) 섹션 — Queues 챕터와 짝을 이루는 챕터, Queues로 이어짐.
+
+## 📚 출처 (Sources)
+- [S1] W3Schools — C++ Stacks — https://www.w3schools.com/cpp/cpp_stacks.asp
+
+## 📝 변경 이력 (Change history)
+- 2026-07-04: Initial draft synthesized from the W3Schools "C++ Stacks" page (Astra wiki-curation, P-Reinforce v3.1 format).