Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 81 for sub32 (0.05 sec)

  1. tests/query_test.go

    	}
    
    	var sub2 []User
    	// only offset
    	if result := DB.Offset(3).Where("name = ?", users[0].Name).FindInBatches(&sub2, 2, func(tx *gorm.DB, batch int) error {
    		return nil
    	}); result.Error != nil || result.RowsAffected != 7 {
    		t.Errorf("Failed to batch find, got error %v, rows affected: %v", result.Error, result.RowsAffected)
    	}
    
    	var sub3 []User
    Registered: Wed Jun 12 16:27:09 UTC 2024
    - Last Modified: Wed May 08 04:07:58 UTC 2024
    - 49.8K bytes
    - Viewed (0)
  2. tensorflow/compiler/mlir/tensorflow/tests/breakup-islands.mlir

    // CHECK:    %[[MUL:.*]], %[[MUL_control:.*]] = tf_executor.island wraps "tf.Mul"(%[[SUB1]], %arg1)
    // CHECK:    %[[SUB2:.*]], %[[SUB2_control:.*]] = tf_executor.island(%[[ADD2_control]], %[[MUL_control]]) wraps "tf.Sub"(%[[ADD1]], %[[SUB1]])
    // CHECK:    %[[PRINT1:.*]], %[[PRINT1_control:.*]] = tf_executor.island wraps "tf.Print"(%[[SUB2]]) <{message = "sub result"}>
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Oct 31 08:59:10 UTC 2023
    - 28.5K bytes
    - Viewed (0)
  3. pilot/pkg/serviceregistry/serviceentry/controller.go

    	// so that we can deterministically allocate an IP.
    	// We use "Double Hashning" for collision detection.
    	// The hash algorithm is
    	// - h1(k) = Sum32 hash of the service key (namespace + "/" + hostname)
    	// - Check if we have an empty slot for h1(x) % MAXIPS. Use it if available.
    	// - If there is a collision, apply second hash i.e. h2(x) = PRIME - (Key % PRIME)
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Wed May 29 15:31:09 UTC 2024
    - 36.8K bytes
    - Viewed (0)
  4. pkg/kubelet/container/helpers.go

    func HashContainer(container *v1.Container) uint64 {
    	hash := fnv.New32a()
    	containerJSON, _ := json.Marshal(pickFieldsToHash(container))
    	hashutil.DeepHashObject(hash, containerJSON)
    	return uint64(hash.Sum32())
    }
    
    // pickFieldsToHash pick fields that will affect the running status of the container for hash,
    // currently this field range only contains `image` and `name`.
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Tue Jun 04 06:25:43 UTC 2024
    - 14.3K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/reflect/TypeTokenTest.java

      public void testGetSubtype_recursiveTypeBoundInSubtypeTranslatedAsIs() {
        class BaseWithTypeVar<T> {}
        class Outer<O> {
          class Sub<X> extends BaseWithTypeVar<List<X>> {}
    
          class Sub2<Y extends Sub2<Y>> extends BaseWithTypeVar<List<Y>> {}
        }
        ParameterizedType subtype =
            (ParameterizedType)
                new TypeToken<BaseWithTypeVar<List<?>>>() {}.getSubtype(Outer.Sub.class).getType();
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 22 17:15:24 UTC 2024
    - 88.7K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/reflect/TypeTokenTest.java

      public void testGetSubtype_recursiveTypeBoundInSubtypeTranslatedAsIs() {
        class BaseWithTypeVar<T> {}
        class Outer<O> {
          class Sub<X> extends BaseWithTypeVar<List<X>> {}
    
          class Sub2<Y extends Sub2<Y>> extends BaseWithTypeVar<List<Y>> {}
        }
        ParameterizedType subtype =
            (ParameterizedType)
                new TypeToken<BaseWithTypeVar<List<?>>>() {}.getSubtype(Outer.Sub.class).getType();
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Thu Feb 22 17:15:24 UTC 2024
    - 88.7K bytes
    - Viewed (0)
  7. src/cmd/compile/internal/walk/compare.go

    	// We also include the string representation of the node to distinguish autogenerated expression since
    	// those get the same `src.XPos`
    	io.WriteString(hash, fmt.Sprintf("%v", n))
    
    	return ir.NewInt(base.Pos, int64(hash.Sum32()))
    }
    
    // The result of walkCompare MUST be assigned back to n, e.g.
    //
    //	n.Left = walkCompare(n.Left, init)
    func walkCompare(n *ir.BinaryExpr, init *ir.Nodes) ir.Node {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 24 21:55:14 UTC 2023
    - 16.2K bytes
    - Viewed (0)
  8. pkg/controller/history/controller_history.go

    	}
    	if revision.Data.Object != nil {
    		hashutil.DeepHashObject(hf, revision.Data.Object)
    	}
    	if probe != nil {
    		hf.Write([]byte(strconv.FormatInt(int64(*probe), 10)))
    	}
    	return rand.SafeEncodeString(fmt.Sprint(hf.Sum32()))
    }
    
    // SortControllerRevisions sorts revisions by their Revision.
    func SortControllerRevisions(revisions []*apps.ControllerRevision) {
    	sort.Stable(byRevision(revisions))
    }
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Nov 05 13:33:52 UTC 2021
    - 18.2K bytes
    - Viewed (0)
  9. docs/config/README.md

    export MINIO_DOMAIN=mydomain.com
    minio server /data
    ```
    
    For advanced use cases `MINIO_DOMAIN` environment variable supports multiple-domains with comma separated values.
    
    ```sh
    export MINIO_DOMAIN=sub1.mydomain.com,sub2.mydomain.com
    minio server /data
    ```
    
    ## Explore Further
    
    * [MinIO Quickstart Guide](https://min.io/docs/minio/linux/index.html#quickstart-for-linux)
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon Sep 11 21:48:54 UTC 2023
    - 17.7K bytes
    - Viewed (0)
  10. pkg/controller/tainteviction/taint_eviction.go

    type podUpdateItem struct {
    	podName      string
    	podNamespace string
    	nodeName     string
    }
    
    func hash(val string, max int) int {
    	hasher := fnv.New32a()
    	io.WriteString(hasher, val)
    	return int(hasher.Sum32() % uint32(max))
    }
    
    // GetPodsByNodeNameFunc returns the list of pods assigned to the specified node.
    type GetPodsByNodeNameFunc func(nodeName string) ([]*v1.Pod, error)
    
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Sat May 04 18:33:12 UTC 2024
    - 19.9K bytes
    - Viewed (0)
Back to top