Avoid deeply nested control flow statements.

Open

                    if i.dir == dirSOI || i.icmp.uCompare(ukey, i.key) > 0 {
                        i.key = append(i.key[:0], ukey...)
                        i.value = append(i.value[:0], i.iter.Value()...)
                        i.dir = dirForward
                        return true

Avoid deeply nested control flow statements.

Open

                    if incoming.batch.internalLen > mergeLimit {
                        overflow = true
                        break merge
                    }

Method Writer.Close has 7 return statements (exceeds 4 allowed).

Open

func (w *Writer) Close() error {
    if w.err != nil {
        return w.err
    }

Avoid deeply nested control flow statements.

Open

                    goto cont

Avoid deeply nested control flow statements.

Open

                    if !del {
                        i.key = append(i.key[:0], ukey...)
                        i.value = append(i.value[:0], i.iter.Value()...)
                    }

Avoid deeply nested control flow statements.

Open

                    if overlaps.size() > int64(v.s.o.GetCompactionGPOverlaps(level)) {
                        break
                    }

Avoid deeply nested control flow statements.

Open

                    if setFunc == nil {
                        n.mu.Unlock()
                        n.unref()
                        return nil
                    }

Avoid deeply nested control flow statements.

Open

                    if internalLen > mergeLimit {
                        overflow = true
                        break merge
                    }

Avoid deeply nested control flow statements.

Open

                    if err := b.flush(b.stash(hasLastUkey, lastUkey, lastSeq, i)); err != nil {
                        return err
                    }

Method DB.flush has a Cognitive Complexity of 23 (exceeds 20 allowed). Consider refactoring.

Open

func (db *DB) flush(n int) (mdb *memDB, mdbFree int, err error) {
    delayed := false
    slowdownTrigger := db.s.o.GetWriteL0SlowdownTrigger()
    pauseTrigger := db.s.o.GetWriteL0PauseTrigger()
    // 请问您知道这里为什么要用匿名函数吗，我理解的是直接用循环就可以

• Read up
  Read up

Method DB.CompactRange has 7 return statements (exceeds 4 allowed).

Open

func (db *DB) CompactRange(r util.Range) error {
    if err := db.ok(); err != nil {
        return err
    }

Avoid deeply nested control flow statements.

Open

                    if atomic.AddUint32(sizeHalfPtr, 1) == 20 {
                        atomic.StoreUint32(sizePtr, uint32(cap(b)/2))
                        atomic.StoreUint32(sizeHalfPtr, 0)
                    } else {
                        select {

Avoid deeply nested control flow statements.

Open

                } else if v.levels[pLevel].overlaps(v.s.icmp, umin, umax, false) {
                    break
                }

Function NewReader has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

func NewReader(f io.ReaderAt, size int64, fd storage.FileDesc, cache *cache.NamespaceGetter, bpool *util.BufferPool, o *opt.Options) (*Reader, error) {

Method indexedIterator.Prev has 7 return statements (exceeds 4 allowed).

Open

func (i *indexedIterator) Prev() bool {
    if i.err != nil {
        return false
    } else if i.Released() {
        i.err = ErrIterReleased

Avoid deeply nested control flow statements.

Open

                    if n.value == nil {
                        n.size = 0
                        n.mu.Unlock()
                        n.unref()
                        return nil

Similar blocks of code found in 2 locations. Consider refactoring.

Open

func (tf tFiles) searchMinUkey(icmp *iComparer, umin []byte) int {
    return sort.Search(len(tf), func(i int) bool {
        return icmp.ucmp.Compare(tf[i].imin.ukey(), umin) > 0
    })
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

func (tf tFiles) searchMaxUkey(icmp *iComparer, umax []byte) int {
    return sort.Search(len(tf), func(i int) bool {
        return icmp.ucmp.Compare(tf[i].imax.ukey(), umax) > 0
    })
}

• Read up
  Read up

Method DB.recoverJournalRO has 6 return statements (exceeds 4 allowed).

Open

func (db *DB) recoverJournalRO() error {
    // Get all journals and sort it by file number.
    rawFds, err := db.s.stor.List(storage.TypeJournal)
    if err != nil {
        return err

Method tableCompactionBuilder.run has 6 return statements (exceeds 4 allowed).

Open

func (b *tableCompactionBuilder) run(cnt *compactionTransactCounter) (err error) {
    snapResumed := b.snapIter > 0
    hasLastUkey := b.snapHasLastUkey // The key might has zero length, so this is necessary.
    lastUkey := append([]byte{}, b.snapLastUkey...)
    lastSeq := b.snapLastSeq