Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 403 for ok (0.2 sec)

  1. tests/callbacks_test.go

    	createCallback.Remove("c1")
    	if ok, msg := assertCallbacks(createCallback, []string{"c3", "c4", "c2"}); !ok {
    		t.Errorf("callbacks tests failed, got %v", msg)
    	}
    
    	createCallback.Remove("c4")
    	if ok, msg := assertCallbacks(createCallback, []string{"c3", "c2"}); !ok {
    		t.Errorf("callbacks tests failed, got %v", msg)
    	}
    
    	createCallback.Remove("c2")
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Tue Mar 26 03:33:36 GMT 2024
    - 7.2K bytes
    - Viewed (0)
  2. callbacks/update.go

    							assignValue(field, value[k])
    						}
    					} else if v, ok := selectColumns[field.Name]; (ok && v) || (!ok && !restricted) {
    						assignValue(field, value[k])
    					}
    					continue
    				}
    			}
    
    			if v, ok := selectColumns[k]; (ok && v) || (!ok && !restricted) {
    				set = append(set, clause.Assignment{Column: clause.Column{Name: k}, Value: kv})
    			}
    		}
    
    		if !stmt.SkipHooks && stmt.Schema != nil {
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Mon Mar 18 05:44:55 GMT 2024
    - 9.4K bytes
    - Viewed (1)
  3. tensorflow/c/c_api_test.cc

      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    
      TF_Operation* b = Placeholder(graph, s, "B");
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    
      TF_Operation* two = ScalarConst(2, graph, s);
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    
      TF_Operation* plus2 = Add(a, two, graph, s, "plus2");
      ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Mon Apr 15 03:35:10 GMT 2024
    - 96.9K bytes
    - Viewed (3)
  4. cmd/bucket-policy.go

    	for k, v := range claims {
    		vStr, ok := v.(string)
    		if ok {
    			// Trim any LDAP specific prefix
    			args[strings.ToLower(strings.TrimPrefix(k, "ldap"))] = []string{vStr}
    		}
    	}
    
    	// Add groups claim which could be a list. This will ensure that the claim
    	// `jwt:groups` works.
    	if grpsVal, ok := claims["groups"]; ok {
    		if grpsIs, ok := grpsVal.([]interface{}); ok {
    			grps := []string{}
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Thu Apr 04 12:04:40 GMT 2024
    - 8K bytes
    - Viewed (0)
  5. callbacks/create.go

    		callMethod(db, func(value interface{}, tx *gorm.DB) (called bool) {
    			if db.Statement.Schema.BeforeSave {
    				if i, ok := value.(BeforeSaveInterface); ok {
    					called = true
    					db.AddError(i.BeforeSave(tx))
    				}
    			}
    
    			if db.Statement.Schema.BeforeCreate {
    				if i, ok := value.(BeforeCreateInterface); ok {
    					called = true
    					db.AddError(i.BeforeCreate(tx))
    				}
    			}
    			return called
    		})
    	}
    }
    
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Mon Apr 08 03:29:55 GMT 2024
    - 12.5K bytes
    - Viewed (0)
  6. tensorflow/c/eager/c_api_test_util.cc

      TFE_Execute(op, &var_handle, &num_retvals, status);
      if (TF_GetCode(status) != TF_OK) return nullptr;
      TFE_DeleteOp(op);
      if (TF_GetCode(status) != TF_OK) return nullptr;
      CHECK_EQ(1, num_retvals);
    
      // Assign 'value' to it.
      op = TFE_NewOp(ctx, "AssignVariableOp", status);
      if (TF_GetCode(status) != TF_OK) return nullptr;
      TFE_OpSetAttrType(op, "dtype", TF_FLOAT);
      TFE_OpAddInput(op, var_handle, status);
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Wed Feb 21 22:37:46 GMT 2024
    - 23.5K bytes
    - Viewed (2)
  7. migrator/migrator.go

    	var oldTable, newTable interface{}
    	if v, ok := oldName.(string); ok {
    		oldTable = clause.Table{Name: v}
    	} else {
    		stmt := &gorm.Statement{DB: m.DB}
    		if err := stmt.Parse(oldName); err == nil {
    			oldTable = m.CurrentTable(stmt)
    		} else {
    			return err
    		}
    	}
    
    	if v, ok := newName.(string); ok {
    		newTable = clause.Table{Name: v}
    	} else {
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Fri Apr 26 07:15:49 GMT 2024
    - 29K bytes
    - Viewed (0)
  8. clause/where.go

    func (where Where) Build(builder Builder) {
    	if len(where.Exprs) == 1 {
    		if andCondition, ok := where.Exprs[0].(AndConditions); ok {
    			where.Exprs = andCondition.Exprs
    		}
    	}
    
    	// Switch position if the first query expression is a single Or condition
    	for idx, expr := range where.Exprs {
    		if v, ok := expr.(OrConditions); !ok || len(v.Exprs) > 1 {
    			if idx != 0 {
    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)
  9. prepare_stmt.go

    	if sqldb, ok := db.ConnPool.(*sql.DB); ok {
    		return sqldb, nil
    	}
    
    	if dbConnector, ok := db.ConnPool.(GetDBConnector); ok && dbConnector != nil {
    		return dbConnector.GetDBConn()
    	}
    
    	return nil, ErrInvalidDB
    }
    
    func (db *PreparedStmtDB) Close() {
    	db.Mux.Lock()
    	defer db.Mux.Unlock()
    
    	for _, query := range db.PreparedSQL {
    		if stmt, ok := db.Stmts[query]; ok {
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Thu Mar 28 08:47:39 GMT 2024
    - 6.4K bytes
    - Viewed (0)
  10. schema/field.go

    	}
    
    	if v, ok := field.TagSettings["DEFAULT"]; ok {
    		field.HasDefaultValue = true
    		field.DefaultValue = v
    	}
    
    	if num, ok := field.TagSettings["SIZE"]; ok {
    		if field.Size, err = strconv.Atoi(num); err != nil {
    			field.Size = -1
    		}
    	}
    
    	if p, ok := field.TagSettings["PRECISION"]; ok {
    		field.Precision, _ = strconv.Atoi(p)
    	}
    
    	if s, ok := field.TagSettings["SCALE"]; ok {
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Mon Apr 15 03:20:20 GMT 2024
    - 32K bytes
    - Viewed (1)
Back to top