Search Options

Results per page
Sort
Preferred Languages
Advance

Results 191 - 200 of 352 for nCopies (0.08 sec)

  1. LICENSE

          granted to You under this License for that Work shall terminate
          as of the date such litigation is filed.
    
       4. Redistribution. You may reproduce and distribute copies of the
          Work or Derivative Works thereof in any medium, with or without
          modifications, and in Source or Object form, provided that You
          meet the following conditions:
    
    Registered: Sun Nov 10 03:50:12 UTC 2024
    - Last Modified: Mon Jan 11 04:26:17 UTC 2021
    - 11.1K bytes
    - Viewed (0)
  2. tensorflow/c/c_api_experimental.h

    // in tests only.)
    TF_CAPI_EXPORT int TF_PickUnusedPortOrDie(void);
    
    // Fast path method that makes constructing a single scalar tensor require less
    // overhead and copies.
    TF_CAPI_EXPORT extern TFE_TensorHandle* TFE_NewTensorHandleFromScalar(
        TF_DataType data_type, void* data, size_t len, TF_Status* status);
    
    // Specify the server_def that enables collective ops.
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Thu Apr 27 21:07:00 UTC 2023
    - 15.1K bytes
    - Viewed (0)
  3. src/archive/zip/writer.go

    		w.last = nil
    		return dirWriter{}, nil
    	}
    
    	fw := &fileWriter{
    		header: h,
    		zipw:   w.cw,
    	}
    	w.last = fw
    	return fw, nil
    }
    
    // Copy copies the file f (obtained from a [Reader]) into w. It copies the raw
    // form directly bypassing decompression, compression, and validation.
    func (w *Writer) Copy(f *File) error {
    	r, err := f.OpenRaw()
    	if err != nil {
    		return err
    	}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Sep 23 14:32:33 UTC 2024
    - 19.4K bytes
    - Viewed (0)
  4. guava/src/com/google/common/io/Files.java

          imports = "com.google.common.io.Files")
      public static void write(CharSequence from, File to, Charset charset) throws IOException {
        asCharSink(to, charset).write(from);
      }
    
      /**
       * Copies all bytes from a file to an output stream.
       *
       * <p><b>{@link java.nio.file.Path} equivalent:</b> {@link
       * java.nio.file.Files#copy(java.nio.file.Path, OutputStream)}.
       *
       * @param from the source file
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Jul 22 19:03:12 UTC 2024
    - 33.1K bytes
    - Viewed (0)
  5. src/archive/tar/strconv.go

    func (*parser) parseString(b []byte) string {
    	if i := bytes.IndexByte(b, 0); i >= 0 {
    		return string(b[:i])
    	}
    	return string(b)
    }
    
    // formatString copies s into b, NUL-terminating if possible.
    func (f *formatter) formatString(b []byte, s string) {
    	if len(s) > len(b) {
    		f.err = ErrFieldTooLong
    	}
    	copy(b, s)
    	if len(s) < len(b) {
    		b[len(s)] = 0
    	}
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Aug 01 14:28:42 UTC 2023
    - 9K bytes
    - Viewed (0)
  6. licenses/github.com/spf13/cobra/LICENSE.txt

          granted to You under this License for that Work shall terminate
          as of the date such litigation is filed.
    
       4. Redistribution. You may reproduce and distribute copies of the
          Work or Derivative Works thereof in any medium, with or without
          modifications, and in Source or Object form, provided that You
          meet the following conditions:
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Sat Oct 26 02:47:39 UTC 2019
    - 9.9K bytes
    - Viewed (0)
  7. src/bytes/bytes.go

    // See go.dev/issue/67401.
    //
    // Note that this comment is not part of the doc comment.
    //
    //go:linkname Repeat
    
    // Repeat returns a new byte slice consisting of count copies of b.
    //
    // It panics if count is negative or if the result of (len(b) * count)
    // overflows.
    func Repeat(b []byte, count int) []byte {
    	if count == 0 {
    		return []byte{}
    	}
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Sep 03 20:55:15 UTC 2024
    - 35.6K bytes
    - Viewed (0)
  8. cni/pkg/install/install.go

    	// note: we create a file watcher for each invocation, otherwise when we write to the directories
    	// we would get infinite looping of events
    	//
    	// Additionally, fsnotify will lose existing watches on atomic copies (due to overwrite/rename),
    	// so we have to re-watch after re-copy to make sure we always have fresh watches.
    	watcher, err := util.CreateFileWatcher(targets...)
    	if err != nil {
    		return err
    	}
    	defer func() {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Fri Aug 09 21:33:51 UTC 2024
    - 13.5K bytes
    - Viewed (0)
  9. ci/official/containers/linux_arm64/builder.devtoolset/gcc9-fixups.patch

    --- a/misc/sys/cdefs.h
    +++ b/misc/sys/cdefs.h
    @@ -423,4 +423,14 @@
     # endif
     #endif
     
    +/* Undefine (also defined in libc-symbols.h).  */
    +#undef __attribute_copy__
    +#if __GNUC_PREREQ (9, 0)
    +/* Copies attributes from the declaration or type referenced by
    +   the argument.  */
    +# define __attribute_copy__(arg) __attribute__ ((__copy__ (arg)))
    +#else
    +# define __attribute_copy__(arg)
    +#endif
    +
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Mon Sep 18 14:52:45 UTC 2023
    - 8.9K bytes
    - Viewed (0)
  10. guava/src/com/google/common/util/concurrent/AtomicLongMap.java

       * associated with {@code key}, or zero if there was no such value.
       */
      @CanIgnoreReturnValue
      public long put(K key, long newValue) {
        return getAndUpdate(key, x -> newValue);
      }
    
      /**
       * Copies all of the mappings from the specified map to this map. The effect of this call is
       * equivalent to that of calling {@code put(k, v)} on this map once for each mapping from key
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Apr 01 16:15:01 UTC 2024
    - 11.8K bytes
    - Viewed (0)
Back to top