(d any)
| 628 | } |
| 629 | |
| 630 | func GetOrCreateRingDesc(d any) *Desc { |
| 631 | if d == nil { |
| 632 | return NewDesc() |
| 633 | } |
| 634 | return d.(*Desc) |
| 635 | } |
| 636 | |
| 637 | // TokensHeap is an heap data structure used to merge multiple lists |
| 638 | // of sorted tokens into a single one. |