(s nilnessTableSet, t nilnessTable)
| 523 | type nilnessTableSet []nilnessTable |
| 524 | |
| 525 | func add(s nilnessTableSet, t nilnessTable) (nilnessTableSet, bool) { |
| 526 | // TODO: an efficient check for whether t is already in s. |
| 527 | for _, v := range s { |
| 528 | if v.equals(t) { |
| 529 | return s, false |
| 530 | } |
| 531 | } |
| 532 | return append(s, t), true |
| 533 | } |
| 534 | |
| 535 | func newNilnessTableSet() nilnessTableSet { |
| 536 | return make(nilnessTableSet, 0) |
no test coverage detected