- Sort Score
- Result 10 results
- Languages All
Results 191 - 200 of 668 for Koss (0.06 sec)
-
src/main/resources/fess_indices/fess/sv/stopwords.txt
över än dig kan sina här ha mot alla under någon eller allt mycket sedan ju denna själv detta åt utan varit hur ingen mitt ni bli blev oss din dessa några deras blir mina samma vilken er sådan vår blivit dess inom mellan sådant varför varje vilka ditt vem vilket sitta sådana
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Mon Nov 27 12:59:36 UTC 2023 - 700 bytes - Viewed (0) -
tensorflow/compiler/mlir/stablehlo/stablehlo.py
"""StableHLO Portable Python APIs. This setup only exports the the StableHLO Portable C++ APIs, which have signatures that do not rely on MLIR classes. Exporting all of MLIR Python bindings to TF OSS has high maintenance implications, especially given the frequency that TF updates the revision of LLVM used. """ # pylint: disable=wildcard-import
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 16 19:48:21 UTC 2023 - 1K bytes - Viewed (0) -
COMPLIANCE.md
relying on apocryphal or anecdotal advice. [MinIO Commercial Licensing](https://min.io/pricing) is the best option for applications that trigger AGPLv3 obligations (e.g. open sourcing your application). Applications using MinIO - or any other OSS-licensed code - without validating their usage do so at their own risk....
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sat Feb 12 00:51:25 UTC 2022 - 1.1K bytes - Viewed (0) -
src/go/ast/import.go
import ( "cmp" "go/token" "slices" "strconv" ) // SortImports sorts runs of consecutive import lines in import blocks in f. // It also removes duplicate imports when it is possible to do so without data loss. func SortImports(fset *token.FileSet, f *File) { for _, d := range f.Decls { d, ok := d.(*GenDecl) if !ok || d.Tok != token.IMPORT { // Not an import declaration, so we're done. // Imports are always first.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 5.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/debug/BUILD
load("//tensorflow:tensorflow.bzl", "tf_cc_test") load( "//tensorflow/core/platform:build_config.bzl", "tf_proto_library", ) # OSS only: This target is header-only. Link `debug_options_proto_cc_impl` only to # `libtensorflow_framework.so` via `lib_internal_impl`. Do NOT link `debug_options_proto_cc_impl` # directly unless the target does not link `libtensorflow_framework.so`. tf_proto_library( name = "debug_options_proto",
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jan 10 05:39:34 UTC 2024 - 2.2K bytes - Viewed (0) -
platforms/core-execution/file-watching/src/main/java/org/gradle/internal/watch/registry/FileWatcherUpdater.java
* On OSs with hierarchical file system events (currently Windows and macOS) this is what we tell the * operating system to watch. * See {@link org.gradle.internal.watch.registry.impl.HierarchicalFileWatcherUpdater}.</dd> * * <dt>watched directories</dt> * <dd>On OSs with non-hierarchical file system events (currently Linux only) we don't watch whole
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jan 25 15:08:33 UTC 2024 - 5.1K bytes - Viewed (0) -
src/database/sql/doc.txt
not in each driver. The drivers then only have to deal with a smaller set of types. * Be flexible with type conversions, but be paranoid about silent truncation or other loss of precision. * Handle concurrency well. Users shouldn't need to care about the database's per-connection thread safety issues (or lack thereof), and shouldn't have to maintain their own free pools of connections.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 22 06:48:08 UTC 2024 - 2.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
// The upper bound on the length of an array and the bounds on the int values mean that, in // this case only, we can compute the sum as a long without risking overflow or loss of // precision. So we do that, as it's slightly quicker than the Knuth algorithm. long sum = 0; for (int index = 0; index < values.length; ++index) { sum += values[index]; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleMath.java
// The upper bound on the length of an array and the bounds on the int values mean that, in // this case only, we can compute the sum as a long without risking overflow or loss of // precision. So we do that, as it's slightly quicker than the Knuth algorithm. long sum = 0; for (int index = 0; index < values.length; ++index) { sum += values[index]; }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tfr/examples/mnist/BUILD
python_version = "PY3", tags = [ "no_cuda_asan", # Not needed, and there were issues with timeouts. "no_oss", # Avoid downloading mnist data set in oss. "nomultivm", # Not needed. Save some resources and test time. "notap", # The test is too long to run as part of llvm presubmits (b/173661843). "notpu", # Takes too long (b/192305423)
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Oct 24 11:50:40 UTC 2023 - 3K bytes - Viewed (0)