- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 126 for REVERSED (0.1 sec)
-
tensorflow/compiler/mlir/quantization/tensorflow/gen_quantized_function_library.py
for line in module.splitlines(): f.write('\n "') f.write(line.rstrip().replace('"', r'\"')) f.write('\\n"') f.write(';\n') for namespace in reversed(namespaces): f.write('}} // namespace {0}\n'.format(namespace)) f.write( '#endif // TENSORFLOW_COMPILER_MLIR_QUANTIZATION_TENSORFLOW_PASSES_QUANTIZED_FUNCTION_LIBRARY_H_' )
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Dec 20 01:38:06 UTC 2022 - 8.4K bytes - Viewed (0) -
tensorflow/cc/gradients/linalg_grad.cc
grad_shape_with_reduced_labels); // Compute the VJP for the final step (viz. "aabbcd->bdca"). We can // use einsum with the input and output subscripts reversed (viz. // "bdca->aabbcd") since the output axis labels now appear in the // input subscripts. return Einsum(scope, {broadcasted_grad}, absl::StrCat(reduced_subs, output_subs, "->", input_subs)); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 07 23:11:54 UTC 2022 - 20.4K bytes - Viewed (0) -
src/hash/crc32/crc32.go
// Package crc32 implements the 32-bit cyclic redundancy check, or CRC-32, // checksum. See https://en.wikipedia.org/wiki/Cyclic_redundancy_check for // information. // // Polynomials are represented in LSB-first form also known as reversed representation. // // See https://en.wikipedia.org/wiki/Mathematics_of_cyclic_redundancy_checks#Reversed_representations_and_reciprocal_polynomials // for information. package crc32 import ( "errors" "hash"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 12 05:36:29 UTC 2024 - 7.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/GeneralRange.java
getLowerBoundType(), getUpperEndpoint(), getUpperBoundType()); } @LazyInit @CheckForNull private transient GeneralRange<T> reverse; /** Returns the same range relative to the reversed comparator. */ GeneralRange<T> reverse() { GeneralRange<T> result = reverse; if (result == null) { result = new GeneralRange<>( Ordering.from(comparator).reverse(),
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.8K bytes - Viewed (0) -
src/vendor/golang.org/x/net/http2/hpack/tables.go
// nameValueMatch becomes false. // // The returned index is a 1-based HPACK index. For dynamic tables, HPACK says // that index 1 should be the newest entry, but t.ents[0] is the oldest entry, // meaning t.ents is reversed for dynamic tables. Hence, when t is a dynamic // table, the return value i actually refers to the entry t.ents[t.len()-i]. // // All tables are assumed to be a dynamic tables except for the global staticTable. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 22:32:44 UTC 2022 - 7.5K bytes - Viewed (0) -
src/html/template/url.go
// // This filter conservatively assumes that all schemes other than the following // are unsafe: // - http: Navigates to a new website, and may open a new window or tab. // These side effects can be reversed by navigating back to the // previous website, or closing the window or tab. No irreversible // changes will take place without further user interaction with // the new website. // - https: Same as http.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 06 15:48:16 UTC 2022 - 6.6K bytes - Viewed (0) -
src/cmd/go/internal/mvs/graph.go
queue := g.roots for _, m := range g.roots { firstRequires[m] = module.Version{} } for len(queue) > 0 { m := queue[0] queue = queue[1:] if f(m) { // Construct the path reversed (because we're starting from the far // endpoint), then reverse it. path := []module.Version{m} for { m = firstRequires[m] if m.Path == "" { break } path = append(path, m)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 01 02:52:19 UTC 2023 - 6.3K bytes - Viewed (0) -
platforms/core-configuration/core-serialization-codecs/src/main/kotlin/org/gradle/internal/serialize/codecs/core/jos/JavaObjectSerializationCodec.kt
&& name == methodName && parameterTypes[0].isAssignableFrom(parameterType) } }.onEach { serializationMethod -> serializationMethod.isAccessible = true }.reversed() private inline fun ReadContext.decodingBeanWithId(id: Int, decode: (Any, Class<*>, BeanStateReader) -> Unit): Any { val beanType = readClass() return withBeanTrace(beanType) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 23:09:56 UTC 2024 - 11.4K bytes - Viewed (0) -
src/strconv/decimal.go
func trim(a *decimal) { for a.nd > 0 && a.d[a.nd-1] == '0' { a.nd-- } if a.nd == 0 { a.dp = 0 } } // Assign v to a. func (a *decimal) Assign(v uint64) { var buf [24]byte // Write reversed decimal in buf. n := 0 for v > 0 { v1 := v / 10 v -= 10 * v1 buf[n] = byte(v + '0') n++ v = v1 } // Reverse again to produce forward decimal in a.d. a.nd = 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jul 15 19:41:25 UTC 2017 - 11K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/GeneralRange.java
getLowerBoundType(), getUpperEndpoint(), getUpperBoundType()); } @LazyInit @CheckForNull private transient GeneralRange<T> reverse; /** Returns the same range relative to the reversed comparator. */ GeneralRange<T> reverse() { GeneralRange<T> result = reverse; if (result == null) { result = new GeneralRange<>( Ordering.from(comparator).reverse(),
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.8K bytes - Viewed (0)