STL

Transcription

1

2

3 А Э STL 3

4 А 5 1 2К 7 STL

5 ВВ Э ё C++ - C++ (StaЧНarН TОЦpХatО LТbrarв (STL)) STL ё STL ё C++ ё 5

6 ё 6

7 1 1) ; 2) STL ; 3) ) ; ) ; ) 4) ; 5) C++ 7

8 2 STL К ё (Standard Template Library(STL)) C++ ё 1 К ; ; ; ; 5 К ё Э 8

9 1) ; 2) - ; 3) ; 4) ; - 5) ; 6) " - - "; 7) Э 9

10 3 (vector) ё ё vector (deque) 10

11 К (list) STL 11

12 4А (set) - " " - (multiset) Э (map) " first pair second T& operator[](const " - key_type& x) 12

13 (multimap) 13

14 5 ( ) - 1) К ; 2) ; 3) ; 4) К ё К 14

15 1) ; 2) К ; 3) ; 4) 3 3 ё

16 2- ё C++ (int float char ) ё ё К 16

17 17

18 6 ё К / ё STL Э 18

19 n К n - n Э Э 19

20 7 Extensible Markup Language (XML) К -2 ё - К К БML бцх К 20

21 STL ё C++ 21

22 8 C++ 1- Name vector STL Insert O(N) Find - O(N) Erase O(N) Element access O(1) O(1) O(1) deque O(N) O(N) - O(1) O(1) O(logN) O(logN) O(logN) O(logN) list set multiset map multimap O(N) O(N) O(N) O(N) O(N) O(N) - O(1) O(1) O(logN) O(logN + count(key)) O(logN) O(logN + count(key)) O(1) O(N) O(logN) O(logN) O(logN) O(logN) - ё ё ё iterator insert(const_iterator position const T& x); 22

23 ё void push_back(const T& x); Э push_back(x) 3- push_back(x) 23 insert(end x) insert(end x)

24 4- push_back(x) insert(end x) push_back(x) template<class InputIterator class T> InputIterator find(inputiterator first InputIterator last const T& value); iterator erase(const_iterator position); ё void pop_back(); 24

25 Э pop_back() 5-6- pop_back() pop_back() erase(end) erase(end) 25 erase(end)

26 pop_back() reference operator[](size_type n); Э reference front(); Э front() 7- front() operator[0] 26 operator[0]

27 8- front() operator[0] front() reference back(); Э back() 27 operator[size - 1]

28 back() back() operator[size - 1] operator[size - 1] back() ё 28

29 iterator insert(const_iterator position const T& x); ё void push_front(const T& x); Э push_front(x) 11 - push_front(x) 29 insert(begin x) insert(begin x)

30 12 - push_front(x) insert(begin x) push_front() void push_back(const T& x); Э push_back(x) 30 insert(end x)

31 push_back(x) push_back(x) insert(end x) insert(end x) push_back() template<class InputIterator class T> 31

32 InputIterator find(inputiterator first InputIterator last const T& value); iterator erase(const_iterator position); ё void pop_front(); Э pop_front() 15 - pop_front() 32 erase(begin) erase(begin)

33 16 - pop_front() erase(begin) pop_front() void pop_back(); Э pop_back() 33 erase(end)

34 17 - pop_back() 18 - pop_back() erase(end) erase(end) 34 pop_back()

35 reference operator[](size_type n); Э reference front(); Э front() 19 - front() operator[0] 35 operator[0]

36 20 - front() operator[0] front() reference back(); Э back() 36 operator[size - 1]

37 back() back() operator[size - 1] operator[size - 1] 37 back()

38 ё iterator insert(const_iterator position const T& x); void push_front(const T& x); Э push_front(x) 23 - push_front(x) 38 insert(begin x) insert(begin x)

39 24 - push_front(x) insert(begin x) push_front(x) void push_back(const T& x); Э push_back(x) 39 insert(end x)

40 push_back(x) push_back(x) insert(end x) insert(end x) push_back(x) template<class InputIterator class T> 40

41 InputIterator find(inputiterator first InputIterator last const T& value); iterator erase(const_iterator position); void pop_front(); Э pop_front() 27 - pop_front() 41 erase(begin) erase(begin)

42 28 - pop_front() erase(begin) pop_front(x) void pop_back(); Э pop_back() 42 erase(end)

43 pop_back() pop_back() erase(end) erase(end) pop_back(x) Ч ( 43 )

44 for (iterator it = listbegin(); it!= listend() && n > 0; ++it --n); reference front(); Э reference back(); Э ё pair<iterator bool> insert(const value_type& x); Э iterator insert(const_iterator position const value_type& x); 44

45 insert(x) insert(x) insert(iterator x) insert(iterator x) 45

46 33 - insert(x) 34 - insert(x) insert(iterator x) insert(iterator x) 46

47 insert(x) insert(x) insert(iterator x) insert(iterator x) 47

48 insert(x) insert(x) insert(iterator x) insert(iterator x) 48

49 Э insert(x) insert(x) insert(iterator x) insert(iterator x) 49

50 insert(x) insert(x) insert(iterator x) insert(iterator x) 50

51 insert(iterator x) template<class InputIterator class T> InputIterator find(inputiterator first InputIterator last const T& value); size_type erase(const key_type& x); Э iterator find(const key_type& x); Э ё T& operator[](const Key& x); 51

52 9 К - - operator[] front() - operator[end] back() insert(iterator x) push_back(x) push_front(x) erase(iterator) pop_front() pop_back() erase(end) shrink_to_fit() 52

53 1) insert(iterator x) Э ё ; 2) erase(x); 3) Tfind(x) stdfind(first last value) 53 T-

54 10 STL vector<map<int set<int>>> Test; void Insert(int int int) 43-54

55 44 - void Erase(int int int) 45-55

56 46 - bool Find(int) 47-56

57 48 - int operator()(int int int) 49-57

58 50 - STL 58

59 ComboBox TextBox ComboBox TextBox Node Node -node MyControl -link Line -next List<int> -prev int -level int +Node() +Node(newNode MyControl) +Next int {set} +NextSize int {get} +GetNext(index int) int +Prev int{get set} 59

60 +Level int {get set} +IsChild bool {get} +IsParent bool {get} +X double {get} +Y double {get} +Width double {get} +Height double {get} +CentreX double {get} +CentreY double {get} +isfreenode bool {get} +isingraph bool {get} +SetColor() void Next GetNext index Nodes CreateNode() AddNode 60

61 52 - AddLink CreateLink() isingraph isfreenode ё 61

62 53 - ё 54-62

63 Create library CheckInputData() ё void Visit(int index int maxlevel XmlNode branch XmlDocument xdoc List<String> typeonlevel) index - NШНОs maxlevel 63

64 бцх branch - xdoc - бцх typeonlevel - ё typeonlevel 56 - С Мpp 64

65 C++ CreateHeader() CreateCpp() CreateHeader() ё include using name h 57 - h 65

66 CreateCpp() branch n- n m init ё branch branch[i][j] К j init i- m

67 n operator () n k kё 59 - Ч Insert() 67

68 Erase() 68

69 62 - ё ё 69

70 А Ю Э STL C++ Э Э 70

71 А 1 - Ы / ++ / ДЭ 2 Сttps//ruаТФТpОНТaШrР/аТФТ/ И ] // URL И ( ) 3 XML ДЭ ] // URL Сttps//ruаТФТpОНТaШrР/аТФТ/БML ( ) 4 Extensible Markup Language (XML) ДЭ Сttps//аааа3ШrР/БML/ ( ] // URL ) 5 Standard Template Library Programmer`s Guide [Э ] // URL http//wwwsgicom/tech/stl/indexhtml ( ) WorkТЧР DraПt StaЧНarН ПШr PrШРraЦЦТЧР LaЧРuaРО C++ ДЭ ] // URLhttp//wwwopen-stdorg/ ( 7 Templates (C++) ДЭ ) ]//URL https//msdnmicrosoftcom/ en-us/library/y097fkabaspx ( ) 71

72