Justin S
first release for keyboard
Fork of
F401RE-USBHost
by 
Norimasa Okamoto
USBHost/mymap.h@10:40c7f6788902, 2014-02-05 (annotated)
- Committer:
- va009039
- Date:
- Wed Feb 05 13:34:37 2014 +0000
- Revision:
- 10:40c7f6788902
- Parent:
- 9:7f9f64cf5ded
fix endpoint callback.
Who changed what in which revision?
| User | Revision | Line number | New contents of line |
|---|---|---|---|
| va009039 | 9:7f9f64cf5ded | 1 | #pragma once |
| va009039 | 9:7f9f64cf5ded | 2 | |
| va009039 | 9:7f9f64cf5ded | 3 | template<class K,class T> |
| va009039 | 9:7f9f64cf5ded | 4 | class mymap { |
| va009039 | 9:7f9f64cf5ded | 5 | struct mypair { |
| va009039 | 10:40c7f6788902 | 6 | K first; |
| va009039 | 10:40c7f6788902 | 7 | T second; |
| va009039 | 9:7f9f64cf5ded | 8 | }; |
| va009039 | 9:7f9f64cf5ded | 9 | public: |
| va009039 | 9:7f9f64cf5ded | 10 | mymap() { |
| va009039 | 9:7f9f64cf5ded | 11 | m_size = 0; |
| va009039 | 9:7f9f64cf5ded | 12 | } |
| va009039 | 10:40c7f6788902 | 13 | T& operator[](const K& key) { |
| va009039 | 10:40c7f6788902 | 14 | int it; |
| va009039 | 10:40c7f6788902 | 15 | if (count(key) == 0) { |
| va009039 | 10:40c7f6788902 | 16 | it = insert(key, 0); |
| va009039 | 10:40c7f6788902 | 17 | } else { |
| va009039 | 10:40c7f6788902 | 18 | it = find(key); |
| va009039 | 9:7f9f64cf5ded | 19 | } |
| va009039 | 10:40c7f6788902 | 20 | return m_buf[it].second; |
| va009039 | 9:7f9f64cf5ded | 21 | } |
| va009039 | 9:7f9f64cf5ded | 22 | bool empty() { return m_size == 0 ? true : false; } |
| va009039 | 9:7f9f64cf5ded | 23 | int size() { return m_size; } |
| va009039 | 9:7f9f64cf5ded | 24 | void clear() { m_size = 0; } |
| va009039 | 10:40c7f6788902 | 25 | int count(K key) { |
| va009039 | 10:40c7f6788902 | 26 | for(int i = 0; i < m_size; i++) { |
| va009039 | 10:40c7f6788902 | 27 | if (m_buf[i].first == key) { |
| va009039 | 10:40c7f6788902 | 28 | return 1; |
| va009039 | 10:40c7f6788902 | 29 | } |
| va009039 | 10:40c7f6788902 | 30 | } |
| va009039 | 10:40c7f6788902 | 31 | return 0; |
| va009039 | 10:40c7f6788902 | 32 | } |
| va009039 | 9:7f9f64cf5ded | 33 | |
| va009039 | 9:7f9f64cf5ded | 34 | private: |
| va009039 | 9:7f9f64cf5ded | 35 | int find(K key) { |
| va009039 | 9:7f9f64cf5ded | 36 | for(int i = 0; i < m_size; i++) { |
| va009039 | 10:40c7f6788902 | 37 | if (m_buf[i].first == key) { |
| va009039 | 9:7f9f64cf5ded | 38 | return i; |
| va009039 | 9:7f9f64cf5ded | 39 | } |
| va009039 | 9:7f9f64cf5ded | 40 | } |
| va009039 | 9:7f9f64cf5ded | 41 | return -1; |
| va009039 | 9:7f9f64cf5ded | 42 | } |
| va009039 | 10:40c7f6788902 | 43 | int insert(K key, T value) { |
| va009039 | 10:40c7f6788902 | 44 | int it = find(key); |
| va009039 | 10:40c7f6788902 | 45 | if (it != -1) { |
| va009039 | 10:40c7f6788902 | 46 | m_buf[it].second = value; |
| va009039 | 10:40c7f6788902 | 47 | return it; |
| va009039 | 10:40c7f6788902 | 48 | } |
| va009039 | 10:40c7f6788902 | 49 | mypair* new_buf = new mypair[m_size+1]; |
| va009039 | 10:40c7f6788902 | 50 | if (m_size > 0) { |
| va009039 | 10:40c7f6788902 | 51 | for(int i = 0; i < m_size; i++) { |
| va009039 | 10:40c7f6788902 | 52 | new_buf[i] = m_buf[i]; |
| va009039 | 10:40c7f6788902 | 53 | } |
| va009039 | 10:40c7f6788902 | 54 | delete[] m_buf; |
| va009039 | 10:40c7f6788902 | 55 | } |
| va009039 | 10:40c7f6788902 | 56 | m_buf = new_buf; |
| va009039 | 10:40c7f6788902 | 57 | it = m_size++; |
| va009039 | 10:40c7f6788902 | 58 | m_buf[it].first = key; |
| va009039 | 10:40c7f6788902 | 59 | m_buf[it].second = value; |
| va009039 | 10:40c7f6788902 | 60 | return it; |
| va009039 | 10:40c7f6788902 | 61 | } |
| va009039 | 10:40c7f6788902 | 62 | |
| va009039 | 9:7f9f64cf5ded | 63 | int m_size; |
| va009039 | 9:7f9f64cf5ded | 64 | mypair *m_buf; |
| va009039 | 9:7f9f64cf5ded | 65 | }; |