| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | |||||
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 |
| 24 | 25 | 26 | 27 | 28 | 29 | 30 |
- 라인트레이서
- Arduino
- html
- 시스템프로그래밍
- 아두이노
- Algorithm
- Visual Micro
- 아두이노 컴파일러
- 수광 소자
- LineTracer
- 운영체제
- Stack
- set
- 아두이노 소스
- queue
- directx
- map
- arduino compiler
- C언어
- 컴퓨터 그래픽스
- 통계학
- WinAPI
- c++
- Deque
- list
- Array
- 자료구조
- vector
- priority_queue
- stl
- Today
- Total
목록전체 글 (545)
Kim's Programming
Algorithm - adjacent_find()
소스) 123456789101112131415161718192021222324252627282930#include#include#include bool find_adj(int i,int j){ if (i == j) return true; return false;} void main(){ std::vector Vector = { 1,3,3,5,7,7,9,11,13,15 }; std::vector::iterator Iter; Iter = std::adjacent_find(Vector.begin(), Vector.end()); if (Iter != Vector.end()) std::cout
Algorithm - find_first_of()
소스) 123456789101112131415161718192021222324252627282930313233#include#include#include bool find_first(int i,int j){ if (i == j) return true; return false;} void main(){ std::vector Vector = { 1,3,5,7,9,11,13,15 }; std::vector::iterator Iter; std::vector::iterator Iter2; int Array[] = { 3,5,7 }; Iter = std::find_first_of(Vector.begin(), Vector.end(), Array, Array + 3); if (Iter != Vector.end()) s..
12345678910111213141516171819202122232425262728293031#include#include#include#include int _tmain(int argv, TCHAR agrc[]){ DWORD Return = 0; STARTUPINFO si = { 0, }; PROCESS_INFORMATION pi; TCHAR CommandLine[30] = _T("notepad.exe"); si.cb = sizeof(si); si.dwFlags = STARTF_USEPOSITION | STARTF_USESIZE; si.dwX = 100; si.dwY = 200; si.dwXSize = 300; si.dwXSize = 200; si.lpTitle = _T("Process"); BOOL..
Deque - pop_back()
소스) 12345678910111213141516171819#include#include void print(std::deque Target_Deque){ for (std::deque::iterator Iter = Target_Deque.begin(); Iter != Target_Deque.end(); ++Iter) std::cout
Deque - end()
소스) 12345678910111213141516171819#include#include void print(std::deque Target_Deque){ for (std::deque::iterator Iter = Target_Deque.begin(); Iter != Target_Deque.end(); ++Iter) std::cout
Map - value_comp()
소스) 1234567891011121314151617181920212223242526272829#include#include#include void print(std::map Target_Map){ for (std::map::iterator IterPos = Target_Map.begin(); IterPos != Target_Map.end(); ++IterPos) std::cout
Map - upper_bound()
소스) 1234567891011121314151617181920212223242526#include#include#include void print(std::map Target_Map){ for (std::map::iterator IterPos = Target_Map.begin(); IterPos != Target_Map.end(); ++IterPos) std::cout
