}
		res, ok := val.([]string)
		if !ok {
			return nil, errors.New("unexpected policy type")
		}
		return res, nil
	}
	return getPolicies()
}

// AddUsersToGroup - adds users to group, creating the group if needed.
func (store *IAMStoreSys) AddUsersToGroup(ctx context.Context, group string, members []string) (updatedAt time.Time, err error) {
	if group == "" {
		return updatedAt, errInvalidArgument
	}

§EcBSizeÒ §EcIndex ¦EcDistœ ¨CSumAlgo ¨PartNums‘ ©PartETagsÀ©PartSizes‘|ªPartASizes‘|¤Size|¥MTimeÓ É ¥— H§MetaSys ¼x-minio-internal-inline-dataÄ true§MetaUsr‚¬content-typeªtext/plain¤etagÙ cfc3c55bdcdef4cf23f6¡v Î ]YÌ ¤nullÄ2ñ #ç¬ €7 gq ”28u ä·ŽßÈ' 2± Z ration xmlns="http multisitea/data/disterasure/xl10/.minio.sys/._format.json multisitea/data/disterasure/xl10/.minio.sys/format.json {"version":"1","format":"xl","id":"88d75d7b-222c-4255-82c2-f047b5d68b9d","xl":{"version":"3","this":"7c61eb5a-cbaa-4d45-...

0, Q, ..., 8Q v.points[0].FromP3(q) tmpP3 := Point{} tmpP1xP1 := projP1xP1{} for i := 0; i < 7; i++ { // Compute (i+1)*Q as Q + i*Q and convert to a projCached // This is needlessly complicated because the API has explicit // receivers instead of creating stack objects and relying on RVO v.points[i+1].FromP3(tmpP3.fromP1xP1(tmpP1xP1.Add(q, &v.points[i]))) } } // This is not optimised for speed; fixed-base tables should be precomputed. func (v *affineLookupTable) FromP3(q *Point) { // Goal: v.points[i]...

0, Q, ..., 8Q v.points[0].FromP3(q) tmpP3 := Point{} tmpP1xP1 := projP1xP1{} for i := 0; i < 7; i++ { // Compute (i+1)*Q as Q + i*Q and convert to a projCached // This is needlessly complicated because the API has explicit // receivers instead of creating stack objects and relying on RVO v.points[i+1].FromP3(tmpP3.fromP1xP1(tmpP1xP1.Add(q, &v.points[i]))) } } // This is not optimised for speed; fixed-base tables should be precomputed. func (v *affineLookupTable) FromP3(q *Point) { // Goal: v.points[i]...