f[start+5]) f[start+5] = fieldSub(f[start+1], t) f[start+1] = fieldAdd(f[start+1], t) t = fieldMontgomeryMul(zeta, f[start+6]) f[start+6] = fieldSub(f[start+2], t) f[start+2] = fieldAdd(f[start+2], t) t = fieldMontgomeryMul(zeta, f[start+7]) f[start+7] = fieldSub(f[start+3], t) f[start+3] = fieldAdd(f[start+3], t) } for start := 0; start < 256; start += 4 { m++ zeta := zetas[m] t := fieldMontgomeryMul(zeta, f[start+2]) f[start+2] = fieldSub(f[start], t) f[start] = fieldAdd(f[start], t) t = fieldMontgomeryMul(zeta,...

			}
			if needCSize {
				needCSize = false
				if len(fieldBuf) < 8 {
					return ErrFormat
				}
				f.CompressedSize64 = fieldBuf.uint64()
			}
			if needHeaderOffset {
				needHeaderOffset = false
				if len(fieldBuf) < 8 {
					return ErrFormat
				}
				f.headerOffset = int64(fieldBuf.uint64())
			}
		case ntfsExtraID:
			if len(fieldBuf) < 4 {

	}

	CheckIndices(t, results, user.ParseIndexes())
}

func TestParseIndexWithUniqueIndexAndUnique(t *testing.T) {
	type IndexTest struct {
		FieldA string `gorm:"unique;index"` // unique and index
		FieldB string `gorm:"unique"`       // unique

		FieldC string `gorm:"index:,unique"`     // uniqueIndex
		FieldD string `gorm:"uniqueIndex;index"` // uniqueIndex and index

adds // the first two and subtracts the last two. var f ringElement for i := 0; i < n; i += 2 { b := B[i/2] b_7, b_6, b_5, b_4 := b>>7, b>>6&1, b>>5&1, b>>4&1 b_3, b_2, b_1, b_0 := b>>3&1, b>>2&1, b>>1&1, b&1 f[i] = fieldSub(fieldElement(b_0+b_1), fieldElement(b_2+b_3)) f[i+1] = fieldSub(fieldElement(b_4+b_5), fieldElement(b_6+b_7)) } return f } // nttElement is an NTT representation, an element of T_q, represented as an // array according to FIPS 203, Section 2.4.4. type nttElement [n]fieldElement...