Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 27 for claire (0.22 sec)

  1. cmd/iam.go

    		}
    
    		// Finally, if there is no parent policy, check if a policy claim is
    		// present in the session token.
    		if len(policies) == 0 {
    			// If there is no parent policy mapping, we fall back to
    			// using policy claim from JWT.
    			policySet, ok := args.GetPolicies(iamPolicyClaimNameOpenID())
    			if !ok {
    				// When claims are set, it should have a policy claim field.
    				return false
    			}
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Thu Apr 25 21:28:16 GMT 2024
    - 71.1K bytes
    - Viewed (1)
  2. clause/where_test.go

    			}},
    			"SELECT * FROM `users` WHERE `users`.`id` = ? OR `name` <> ?",
    			[]interface{}{"1", "jinzhu"},
    		},
    		{
    			[]clause.Interface{clause.Select{}, clause.From{}, clause.Where{
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Thu Apr 25 12:22:53 GMT 2024
    - 6.2K bytes
    - Viewed (0)
  3. licenses/cloud.google.com/go/auth/oauth2adapt/LICENSE

          where such license applies only to those patent claims licensable
          by such Contributor that are necessarily infringed by their
          Contribution(s) alone or by combination of their Contribution(s)
          with the Work to which such Contribution(s) was submitted. If You
          institute patent litigation against any entity (including a
          cross-claim or counterclaim in a lawsuit) alleging that the Work
    Plain Text
    - Registered: Wed May 01 22:53:12 GMT 2024
    - Last Modified: Tue Apr 30 13:56:46 GMT 2024
    - 11.1K bytes
    - Viewed (0)
  4. licenses/cloud.google.com/go/auth/LICENSE

          where such license applies only to those patent claims licensable
          by such Contributor that are necessarily infringed by their
          Contribution(s) alone or by combination of their Contribution(s)
          with the Work to which such Contribution(s) was submitted. If You
          institute patent litigation against any entity (including a
          cross-claim or counterclaim in a lawsuit) alleging that the Work
    Plain Text
    - Registered: Wed May 01 22:53:12 GMT 2024
    - Last Modified: Tue Apr 30 13:56:46 GMT 2024
    - 11.1K bytes
    - Viewed (0)
  5. clause/where.go

    package clause
    
    import (
    	"strings"
    )
    
    const (
    	AndWithSpace = " AND "
    	OrWithSpace  = " OR "
    )
    
    // Where where clause
    type Where struct {
    	Exprs []Expression
    }
    
    // Name where clause name
    func (where Where) Name() string {
    	return "WHERE"
    }
    
    // Build build where clause
    func (where Where) Build(builder Builder) {
    	if len(where.Exprs) == 1 {
    		if andCondition, ok := where.Exprs[0].(AndConditions); ok {
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Thu Apr 25 12:22:53 GMT 2024
    - 5.1K bytes
    - Viewed (0)
  6. migrator/migrator.go

    				createTableSQL += "CONSTRAINT ? UNIQUE (?),"
    				values = append(values, clause.Column{Name: uni.Name}, clause.Expr{SQL: stmt.Quote(uni.Field.DBName)})
    			}
    
    			for _, chk := range stmt.Schema.ParseCheckConstraints() {
    				createTableSQL += "CONSTRAINT ? CHECK (?),"
    				values = append(values, clause.Column{Name: chk.Name}, clause.Expr{SQL: chk.Constraint})
    			}
    
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Fri Apr 26 07:15:49 GMT 2024
    - 29K bytes
    - Viewed (0)
  7. cmd/admin-handlers-idp-ldap.go

    			writeErrorResponseJSON(ctx, w, APIErr, r.URL)
    			return
    		}
    
    		// In case of LDAP/OIDC we need to set `opts.claims` to ensure
    		// it is associated with the LDAP/OIDC user properly.
    		for k, v := range cred.Claims {
    			if k == expClaim {
    				continue
    			}
    			opts.claims[k] = v
    		}
    	} else {
    		// We still need to ensure that the target user is a valid LDAP user.
    		//
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Thu Apr 25 15:50:16 GMT 2024
    - 13.3K bytes
    - Viewed (0)
  8. cmd/admin-handlers-users.go

    		// In case of LDAP/OIDC we need to set `opts.claims` to ensure
    		// it is associated with the LDAP/OIDC user properly.
    		for k, v := range cred.Claims {
    			if k == expClaim {
    				continue
    			}
    			opts.claims[k] = v
    		}
    	} else if globalIAMSys.LDAPConfig.Enabled() {
    		// In case of LDAP we need to resolve the targetUser to a DN and
    		// query their groups:
    		opts.claims[ldapUserN] = targetUser // simple username
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Thu Apr 25 15:50:16 GMT 2024
    - 77.3K bytes
    - Viewed (0)
  9. tests/preload_test.go

    	CheckUser(t, user, user)
    
    	var user2 User
    	DB.Preload(clause.Associations).Find(&user2, "id = ?", user.ID)
    	CheckUser(t, user2, user)
    
    	user3 := *GetUser("preload_with_associations_new", Config{
    		Account:   true,
    		Pets:      2,
    		Toys:      3,
    		Company:   true,
    		Manager:   true,
    		Team:      4,
    		Languages: 3,
    		Friends:   1,
    	})
    
    	DB.Preload(clause.Associations).Find(&user3, "id = ?", user.ID)
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Thu Apr 25 12:21:03 GMT 2024
    - 14.9K bytes
    - Viewed (0)
  10. callbacks/preload.go

    import (
    	"fmt"
    	"reflect"
    	"sort"
    	"strings"
    
    	"gorm.io/gorm"
    	"gorm.io/gorm/clause"
    	"gorm.io/gorm/schema"
    	"gorm.io/gorm/utils"
    )
    
    // parsePreloadMap extracts nested preloads. e.g.
    //
    //	// schema has a "k0" relation and a "k7.k8" embedded relation
    //	parsePreloadMap(schema, map[string][]interface{}{
    //		clause.Associations: {"arg1"},
    //		"k1":                {"arg2"},
    //		"k2.k3":             {"arg3"},
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Thu Apr 25 12:21:03 GMT 2024
    - 11.6K bytes
    - Viewed (0)
Back to top