btreeReverseMapStats handles rmapbt stats.
(us []uint32)
| 596 | |
| 597 | // btreeReverseMapStats handles rmapbt stats. |
| 598 | func btreeReverseMapStats(us []uint32) (BtreeReverseMapStats, error) { |
| 599 | if l := len(us); l != 15 { |
| 600 | return BtreeReverseMapStats{}, fmt.Errorf("incorrect number of values for rmapbt stats: %d", l) |
| 601 | } |
| 602 | |
| 603 | return BtreeReverseMapStats{ |
| 604 | Lookup: us[0], |
| 605 | Compare: us[1], |
| 606 | Insrec: us[2], |
| 607 | Delrec: us[3], |
| 608 | NewRoot: us[4], |
| 609 | KillRoot: us[5], |
| 610 | Increment: us[6], |
| 611 | Decrement: us[7], |
| 612 | Lshift: us[8], |
| 613 | Rshift: us[9], |
| 614 | Split: us[10], |
| 615 | Join: us[11], |
| 616 | Alloc: us[12], |
| 617 | Free: us[13], |
| 618 | Moves: us[14], |
| 619 | }, nil |
| 620 | } |
| 621 | |
| 622 | // btreeRefCountStats handles refcntbt stats. |
| 623 | func btreeRefCountStats(us []uint32) (BtreeRefCountStats, error) { |
no outgoing calls
no test coverage detected
searching dependent graphs…