if err != nil {
		return nil, err
	}

	parts := make([]*ObjectPartInfo, len(partMetaPaths))
	for idx, partMetaPath := range partMetaPaths {
		var partNumber int
		fmt.Sscanf(pathutil.Base(partMetaPath), "part.%d.meta", &partNumber)

		if contextCanceled(ctx) {
			parts[idx] = &ObjectPartInfo{
				Error:  ctx.Err().Error(),
				Number: partNumber,
			}
			continue
		}

		Field2 float32 `gorm:"column:field2"`
	}

	if err := DB.AutoMigrate(&AutoIncrementStruct{}); err != nil {
		t.Fatalf("AutoMigrate err: %v", err)
	}

	const ROWS = 10
	for idx := 0; idx < ROWS; idx++ {
		if err := DB.Create(&AutoIncrementStruct{}).Error; err != nil {
			t.Fatalf("create auto_increment_struct fail, err: %v", err)
		}
	}

	rows := make([]*AutoIncrementStruct, 0, ROWS)

        translatedSid.sid_type = 1;
        translatedSid.rid = 2;
        translatedSid.sid_index = 3;

        translatedSid.encode(mockNdrBuffer);

        verify(mockNdrBuffer).align(4);
        verify(mockNdrBuffer).enc_ndr_short(translatedSid.sid_type);
        verify(mockNdrBuffer).enc_ndr_long(translatedSid.rid);
        verify(mockNdrBuffer).enc_ndr_long(translatedSid.sid_index);
    }

    }

    @Override
    public K[] createArray(int length) {
      // TODO: with appropriate refactoring of OneSizeGenerator, we can perhaps
      // tidy this up and get rid of the casts here and in
      // MapValueCollectionGenerator.

      return ((TestMapGenerator<K, V>) mapGenerator.getInnerGenerator()).createKeyArray(length);
    }

    @Override

			objectsToDelete[object] = index
		}
	}

	toNames := func(input map[ObjectToDelete]int) (output []ObjectToDelete) {
		output = make([]ObjectToDelete, len(input))
		idx := 0
		for obj := range input {
			output[idx] = obj
			idx++
		}
		return
	}

	// Disable timeouts and cancellation
	ctx = bgContext(ctx)

	deleteList := toNames(objectsToDelete)

      // Check to see if the floor(log2(num)) + 1 has changed.
      if ((num & nextPowerOfTwo) != 0) {
        nextPowerOfTwo <<= 1;
        bits++;
      }
      // Get rid of the 2s in num.
      int tz = Long.numberOfTrailingZeros(num);
      long normalizedNum = num >> tz;
      shift += tz;
      // Adjust floor(log2(num)) + 1.
      int normalizedBits = bits - tz;

	// Position of this version or object in a multi-object delete call,
	// no other caller must set this value other than multi-object delete call.
	// usage in other calls in undefined please avoid.
	Idx int `msg:"i"`

	// Combined checksum when object was uploaded.
	Checksum []byte `msg:"cs,allownil"`

	// Versioned - indicates if this file is versioned or not.
	Versioned bool `msg:"vs"`
}

		err = msgp.WrapError(err, "SuccessorModTime")
		return
	}
	z.Fresh, err = dc.ReadBool()
	if err != nil {
		err = msgp.WrapError(err, "Fresh")
		return
	}
	z.Idx, err = dc.ReadInt()
	if err != nil {
		err = msgp.WrapError(err, "Idx")
		return
	}
	if dc.IsNil() {
		err = dc.ReadNil()
		if err != nil {
			err = msgp.WrapError(err)
			return
		}
		z.Checksum = nil
	} else {

		c.Fatalf("GetLDAPPolicyEntities should not fail: %v", err)
	}
	{
		// Check that the mapping we created exists.
		idx := slices.IndexFunc(policyResult.PolicyMappings, func(e madmin.PolicyEntities) bool {
			return e.Policy == policy && slices.Contains(e.Groups, actualGroupDN)
		})
		if idx < 0 {
			c.Fatalf("expected groupDN (%s) to be present in mapping list: %#v", actualGroupDN, policyResult)
		}
	}

by ByteEncode, according to FIPS 203, Algorithm 5. func ringCompressAndEncod(s []byte, f ringElement, d uint8) []byte { var b byte var bIdx uint8 for i := 0; i < n; i++ { c := compress(f[i], d) var cIdx uint8 for cIdx < d { b |= byte(c>>cIdx) << bIdx bits := min(8-bIdx, d-cIdx) bIdx += bits cIdx += bits if bIdx == 8 { s = append(s, b) b = 0 bIdx = 0 } } } if bIdx != 0 { panic("mlkem: internal error: bitsFilled != 0") } return s } // ringDecodeAndDecompr decodes an encoding of a ring element where...