Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 258 for Qspare (0.12 sec)

  1. src/archive/tar/reader_test.go

    		{pax + trash[:511], 0, io.ErrUnexpectedEOF},
    		{sparse[:511], 0, io.ErrUnexpectedEOF},
    		{sparse[:512], 0, io.ErrUnexpectedEOF},
    		{sparse[:3584], 1, io.EOF},
    		{sparse[:9200], 1, io.EOF}, // Terminate in padding of sparse header
    		{sparse[:9216], 1, io.EOF},
    		{sparse[:9728], 2, io.ErrUnexpectedEOF},
    		{sparse[:10240], 2, io.EOF},
    		{sparse[:11264], 2, io.ErrUnexpectedEOF},
    		{sparse, 5, io.EOF},
    		{sparse + trash, 5, io.EOF},
    	}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 03 15:48:09 UTC 2024
    - 46.9K bytes
    - Viewed (0)
  2. src/archive/tar/writer_test.go

    			}, nil},
    			testClose{nil},
    		},
    		// TODO(dsnet): Re-enable this test when adding sparse support.
    		// See https://golang.org/issue/22735
    		/*
    			}, {
    				file: "testdata/gnu-nil-sparse-data.tar",
    				tests: []testFnc{
    					testHeader{Header{
    						Typeflag:    TypeGNUSparse,
    						Name:        "sparse.db",
    						Size:        1000,
    						SparseHoles: []sparseEntry{{Offset: 1000, Length: 0}},
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Sep 23 14:32:33 UTC 2024
    - 39.4K bytes
    - Viewed (0)
  3. src/main/java/jcifs/smb/SmbTreeImpl.java

        private final List<StackTraceElement[]> releases;
    
        private DfsReferralData treeReferral;
    
    
        SmbTreeImpl ( SmbSessionImpl session, String share, String service ) {
            this.session = session.acquire();
            this.share = share.toUpperCase();
            if ( service != null && !service.startsWith("??") ) {
                this.service = service;
            }
            this.service0 = this.service;
    
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Thu Jan 05 13:06:39 UTC 2023
    - 29.6K bytes
    - Viewed (0)
  4. src/archive/tar/common.go

    	// Keywords for GNU sparse files in a PAX extended header.
    	paxGNUSparse          = "GNU.sparse."
    	paxGNUSparseNumBlocks = "GNU.sparse.numblocks"
    	paxGNUSparseOffset    = "GNU.sparse.offset"
    	paxGNUSparseNumBytes  = "GNU.sparse.numbytes"
    	paxGNUSparseMap       = "GNU.sparse.map"
    	paxGNUSparseName      = "GNU.sparse.name"
    	paxGNUSparseMajor     = "GNU.sparse.major"
    	paxGNUSparseMinor     = "GNU.sparse.minor"
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 13 21:03:27 UTC 2024
    - 24.5K bytes
    - Viewed (0)
  5. guava/src/com/google/common/escape/CharEscaperBuilder.java

    import org.checkerframework.checker.nullness.qual.Nullable;
    
    /**
     * Simple helper class to build a "sparse" array of objects based on the indexes that were added to
     * it. The array will be from 0 to the maximum index given. All non-set indexes will contain null
     * (so it's not really a sparse array, just a pseudo sparse array). The builder can also return a
     * CharEscaper based on the generated array.
     *
     * @author Sven Mawson
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jan 18 20:55:09 UTC 2022
    - 4K bytes
    - Viewed (0)
  6. src/archive/tar/writer.go

    	// TODO(dsnet): Re-enable this when adding sparse support.
    	// See https://golang.org/issue/22735
    	/*
    		// Handle sparse files.
    		var spd sparseDatas
    		var spb []byte
    		if len(hdr.SparseHoles) > 0 {
    			sph := append([]sparseEntry{}, hdr.SparseHoles...) // Copy sparse map
    			sph = alignSparseEntries(sph, hdr.Size)
    			spd = invertSparseEntries(sph, hdr.Size)
    
    			// Format the sparse map.
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Oct 02 14:22:59 UTC 2024
    - 19.6K bytes
    - Viewed (0)
  7. tensorflow/c/eager/gradients.cc

      return handle_->DataType();
    }
    AbstractTensorHandle* TapeTensor::GetHandle() const { return handle_; }
    
    AbstractTensorHandle* TapeTensor::ZerosLike() const { return nullptr; }
    
    class TapeVSpace
        : public eager::VSpace<AbstractTensorHandle, GradientFunction, TapeTensor> {
     public:
      explicit TapeVSpace(AbstractContext* ctx) : ctx_(ctx) {}
      ~TapeVSpace() override {}
    
      // Returns the number of elements in the gradient tensor.
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 19.7K bytes
    - Viewed (0)
  8. src/main/java/jcifs/smb/SmbTreeConnection.java

                              SmbTreeImpl uct = smbSession.getSmbTree(share, null).unwrap(SmbTreeImpl.class);
                              SmbTreeImpl ct = connectTree(loc, host, share, trans, uct, dr) ) {
    
                            if ( dr != null ) {
                                ct.setTreeReferral(dr);
                                if ( dr != start ) {
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Tue Jul 07 10:50:16 UTC 2020
    - 31K bytes
    - Viewed (0)
  9. licenses/github.com/cespare/xxhash/v2/LICENSE.txt

    Copyright (c) 2016 Caleb Spare
    
    MIT License
    
    Permission is hereby granted, free of charge, to any person obtaining
    a copy of this software and associated documentation files (the
    "Software"), to deal in the Software without restriction, including
    without limitation the rights to use, copy, modify, merge, publish,
    distribute, sublicense, and/or sell copies of the Software, and to
    permit persons to whom the Software is furnished to do so, subject to
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Tue Jul 21 18:11:13 UTC 2020
    - 1K bytes
    - Viewed (0)
  10. docs/fr/docs/python-types.md

    ```
    John Doe
    ```
    
    La fonction :
    
    * Prend un `first_name` et un `last_name`.
    * Convertit la première lettre de chaque paramètre en majuscules grâce à `title()`.
    * Concatène les résultats avec un espace entre les deux.
    
    {*../../docs_src/python_types/tutorial001.py hl[2] *}
    
    ### Limitations
    
    C'est un programme très simple.
    
    Mais maintenant imaginez que vous l'écriviez de zéro.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 15:21:34 UTC 2024
    - 10K bytes
    - Viewed (0)
Back to top