- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 162 for Element (1.63 sec)
-
android/guava/src/com/google/common/collect/Synchronized.java
@Override public int setCount(@ParametricNullness E element, int count) { synchronized (mutex) { return delegate().setCount(element, count); } } @Override public boolean setCount(@ParametricNullness E element, int oldCount, int newCount) { synchronized (mutex) { return delegate().setCount(element, oldCount, newCount); } } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 53.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Synchronized.java
@Override public int setCount(@ParametricNullness E element, int count) { synchronized (mutex) { return delegate().setCount(element, count); } } @Override public boolean setCount(@ParametricNullness E element, int oldCount, int newCount) { synchronized (mutex) { return delegate().setCount(element, oldCount, newCount); } } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 57.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/lower_static_tensor_list.cc
RankedTensorType list_element_ty = subtypes.front().dyn_cast<RankedTensorType>(); if (!list_element_ty) return failure(); // Extract tensor elements for the TensorList and construct result type // based on the number of elements and element shape. const std::vector<tensorflow::Tensor> &tensors = list->tensors(); llvm::SmallVector<int64_t, 4> result_shape = { static_cast<int64_t>(tensors.size())};
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 70.7K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/util/strategicpatch/patch.go
t, err := sliceElementType(s) if err != nil { return nil, err } // If the elements are not maps... if t.Kind() != reflect.Map { // Sort the elements, because they may have been merged out of order. return deduplicateAndSortScalars(s), nil } // Elements are maps - if one of the keys of the map is a map or a // list, we may need to recurse into it. newS := []interface{}{}
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 01 23:34:23 UTC 2023 - 75.5K bytes - Viewed (0) -
src/reflect/type.go
func appendGCProg(dst []byte, typ *abi.Type) []byte { if typ.Kind_&abi.KindGCProg != 0 { // Element has GC program; emit one element. n := uintptr(*(*uint32)(unsafe.Pointer(typ.GCData))) prog := typ.GcSlice(4, 4+n-1) return append(dst, prog...) } // Element is small with pointer mask; use as literal bits. ptrs := typ.PtrBytes / goarch.PtrSize mask := typ.GcSlice(0, (ptrs+7)/8)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 85.5K bytes - Viewed (0) -
staging/src/k8s.io/api/extensions/v1beta1/types.go
// is case sensitive and done on a path element by element basis. A path // element refers to the list of labels in the path split by the '/' // separator. A request is a match for path p if every p is an element-wise // prefix of p of the request path. Note that if the last element of the // path is a substring of the last element in request path, it is not a
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Nov 27 20:06:29 UTC 2023 - 61.3K bytes - Viewed (0) -
src/runtime/mbitmap.go
// repeated until we hit "start+s.elemsize". // This tiling algorithm supports array data, since the type always refers to // the element type of the array. Single objects are considered the same as // single-element arrays. // The tiling algorithm may scan data past the end of the compiler-recognized // object, but any unused data within the allocation slot (i.e. within s.elemsize)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
src/go/printer/nodes.go
// were indented wholesale (starting with the very first element, rather // than starting at the first line break). func (p *printer) indentList(list []ast.Expr) bool { // Heuristic: indentList reports whether there are more than one multi- // line element in the list, or if there is any element that is not // starting on the same line as the previous one ends. if len(list) >= 2 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 17 18:53:17 UTC 2023 - 52.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 17 15:27:58 UTC 2024 - 49.2K bytes - Viewed (0) -
src/go/types/expr.go
typ = check.typ(e.Type) base = typ case hint != nil: // no composite literal type present - use hint (element type of enclosing type) typ = hint base, _ = deref(coreType(typ)) // *T implies &T{} if base == nil { check.errorf(e, InvalidLit, "invalid composite literal element type %s (no core type)", typ) goto Error } default:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 02:09:54 UTC 2024 - 49.7K bytes - Viewed (0)