Search Options

Results per page
Sort
Preferred Languages
Advance

Results 461 - 470 of 2,816 for tave (0.1 sec)

  1. guava/src/com/google/common/collect/CompactHashSet.java

     * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for
     * every element added, the garbage collector will have to traverse {@code 1.5} references on
     * average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}.
     *
     * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 24.9K bytes
    - Viewed (0)
  2. cmd/metacache-entries.go

    }
    
    // shallowClone will create a shallow clone of the array objects,
    // but object metadata will not be cloned.
    func (m metaCacheEntriesSorted) shallowClone() metaCacheEntriesSorted {
    	// We have value receiver so we already have a copy.
    	m.o = m.o.shallowClone()
    	return m
    }
    
    // fileInfoVersions converts the metadata to FileInfoVersions where possible.
    // Metadata that cannot be decoded is skipped.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 08 15:29:58 UTC 2024
    - 24.1K bytes
    - Viewed (0)
  3. guava/src/com/google/common/hash/AbstractStreamingHasher.java

          return putBytesInternal(readBuffer);
        } finally {
          readBuffer.order(order);
        }
      }
    
      @CanIgnoreReturnValue
      private Hasher putBytesInternal(ByteBuffer readBuffer) {
        // If we have room for all of it, this is easy
        if (readBuffer.remaining() <= buffer.remaining()) {
          buffer.put(readBuffer);
          munchIfFull();
          return this;
        }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Jun 15 20:59:00 UTC 2022
    - 7.1K bytes
    - Viewed (0)
  4. guava/src/com/google/common/base/FinalizableReferenceQueue.java

     *
     * <p>Keep a strong reference to this object until all of the associated referents have been
     * finalized. If this object is garbage collected earlier, the backing thread will not invoke {@code
     * finalizeReferent()} on the remaining references.
     *
     * <p>As an example of how this is used, imagine you have a class {@code MyServer} that creates a
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Jul 11 20:51:36 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  5. src/main/java/jcifs/dcerpc/DcerpcHandle.java

                int have = doSendReceiveFragment(out, off, msg.length, inB);
    
                if ( have != 0 ) {
                    NdrBuffer hdrBuf = new NdrBuffer(inB, 0);
                    setupReceivedFragment(hdrBuf);
                    hdrBuf.setIndex(0);
                    msg.decode_header(hdrBuf);
                }
    
                NdrBuffer msgBuf;
                if ( have != 0 && !msg.isFlagSet(DCERPC_LAST_FRAG) ) {
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jun 30 10:11:57 UTC 2019
    - 12.9K bytes
    - Viewed (0)
  6. cmd/xl-storage-format-utils.go

    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU Affero General Public License for more details.
    //
    // You should have received a copy of the GNU Affero General Public License
    // along with this program.  If not, see <http://www.gnu.org/licenses/>.
    
    package cmd
    
    import (
    	"errors"
    
    	"github.com/zeebo/xxh3"
    )
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 08 15:29:58 UTC 2024
    - 5.5K bytes
    - Viewed (0)
  7. internal/mountinfo/mountinfo_linux.go

    				crossMounts = append(crossMounts, mount)
    			}
    		}
    	}
    	msg := `Cross-device mounts detected on path (%s) at following locations %s. Export path should not have any sub-mounts, refusing to start.`
    	if len(crossMounts) > 0 {
    		// if paths didn't match then we do have cross-device mount.
    		return fmt.Errorf(msg, path, crossMounts)
    	}
    	return nil
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sun Jan 02 17:15:06 UTC 2022
    - 4.7K bytes
    - Viewed (0)
  8. docs/ko/docs/tutorial/body-multiple-params.md

    ```JSON
    {
        "item": {
            "name": "Foo",
            "description": "The pretender",
            "price": 42.0,
            "tax": 3.2
        },
        "user": {
            "username": "dave",
            "full_name": "Dave Grohl"
        }
    }
    ```
    
    /// note | "참고"
    
    이전과 같이 `item`이 선언 되었더라도, 본문 내의 `item` 키가 있을 것이라고 예측합니다.
    
    ///
    
    FastAPI는 요청을 자동으로 변환해, 매개변수의 `item`과 `user`를 특별한 내용으로 받도록 할 것입니다.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 5.2K bytes
    - Viewed (0)
  9. docs/sts/README.md

    - Eliminates the need to embed long-term credentials with an application.
    - Eliminates the need to provide access to buckets and objects without having to define static credentials.
    - Temporary credentials have a limited lifetime, there is no need to rotate them or explicitly revoke them. Expired temporary credentials cannot be reused.
    
    ## Identity Federation
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 25 00:44:15 UTC 2022
    - 7.8K bytes
    - Viewed (0)
  10. cmd/bucket-lifecycle_test.go

    			},
    			expectedErr: nil,
    		},
    		{
    			// invalid; ongoing restore object request can't have expiry set on it.
    			restoreHdr:     `ongoing-request="true", expiry-date="Fri, 21 Dec 2012 00:00:00 GMT"`,
    			expectedStatus: restoreObjStatus{},
    			expectedErr:    errRestoreHDRMalformed,
    		},
    		{
    			// invalid; completed restore object request must have expiry set on it.
    			restoreHdr:     `ongoing-request="false"`,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue May 31 09:57:57 UTC 2022
    - 7K bytes
    - Viewed (0)
Back to top