| 114 | } |
| 115 | |
| 116 | func (rt *ROATable) Add(roa *ROA) { |
| 117 | b := rt.getBucket(roa) |
| 118 | for _, r := range b.entries { |
| 119 | if r.Equal(roa) { |
| 120 | // we already have the same one |
| 121 | return |
| 122 | } |
| 123 | } |
| 124 | b.entries = append(b.entries, roa) |
| 125 | sort.Slice(b.entries, func(i, j int) bool { |
| 126 | r1 := b.entries[i] |
| 127 | r2 := b.entries[j] |
| 128 | |
| 129 | if r1.MaxLen < r2.MaxLen { |
| 130 | return true |
| 131 | } else if r1.MaxLen > r2.MaxLen { |
| 132 | return false |
| 133 | } |
| 134 | |
| 135 | if r1.AS < r2.AS { |
| 136 | return true |
| 137 | } |
| 138 | return false |
| 139 | }) |
| 140 | } |
| 141 | |
| 142 | func (rt *ROATable) Delete(roa *ROA) { |
| 143 | tree := rt.roa2tree(roa) |