refactoring data by val
Vladimir Bauer
3 years ago
| 42 | 42 | for req := range m { |
| 43 | 43 | switch req.cmd { |
| 44 | 44 | case h_push: |
| 45 | data := req.data.(*pushData) | |
| 45 | data := req.data.(pushData) | |
| 46 | 46 | heap.Push(&bHeap, data.bar) |
| 47 | 47 | if !sync { |
| 48 | 48 | sync = data.sync |
| 66 | 66 | syncWidth(pMatrix) |
| 67 | 67 | syncWidth(aMatrix) |
| 68 | 68 | case h_iter: |
| 69 | data := req.data.(*iterData) | |
| 69 | data := req.data.(iterData) | |
| 70 | 70 | for _, b := range bHeap { |
| 71 | 71 | select { |
| 72 | 72 | case data.iter <- b: |
| 75 | 75 | } |
| 76 | 76 | close(data.iter) |
| 77 | 77 | case h_drain: |
| 78 | data := req.data.(*iterData) | |
| 78 | data := req.data.(iterData) | |
| 79 | 79 | for bHeap.Len() != 0 { |
| 80 | 80 | select { |
| 81 | 81 | case data.iter <- heap.Pop(&bHeap).(*Bar): |
| 102 | 102 | } |
| 103 | 103 | |
| 104 | 104 | func (m heapManager) push(b *Bar, sync bool) { |
| 105 | data := &pushData{b, sync} | |
| 105 | data := pushData{b, sync} | |
| 106 | 106 | m <- heapRequest{cmd: h_push, data: data} |
| 107 | 107 | } |
| 108 | 108 | |
| 109 | 109 | func (m heapManager) iter(iter chan *Bar, drop chan struct{}) { |
| 110 | data := &iterData{iter, drop} | |
| 110 | data := iterData{iter, drop} | |
| 111 | 111 | m <- heapRequest{cmd: h_iter, data: data} |
| 112 | 112 | } |
| 113 | 113 | |
| 114 | 114 | func (m heapManager) drain(iter chan *Bar, drop chan struct{}) { |
| 115 | data := &iterData{iter, drop} | |
| 115 | data := iterData{iter, drop} | |
| 116 | 116 | m <- heapRequest{cmd: h_drain, data: data} |
| 117 | 117 | } |
| 118 | 118 | |