Search Options

Results per page
Sort
Preferred Languages
Advance

Results 71 - 80 of 139 for godina (0.04 sec)

  1. android/guava/src/com/google/common/collect/CompactHashMap.java

        extends AbstractMap<K, V> implements Serializable {
      /*
       * TODO: Make this a drop-in replacement for j.u. versions, actually drop them in, and test the
       * world. Figure out what sort of space-time tradeoff we're actually going to get here with the
       * *Map variants. This class is particularly hard to benchmark, because the benefit is not only in
       * less allocation, but also having the GC do less work to scan the heap because of fewer
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 35.7K bytes
    - Viewed (0)
  2. docs/tr/docs/tutorial/first-steps.md

    ```
    
    Bu satır, yerel makinenizde uygulamanızın çalıştığı bağlantıyı gösterir.
    
    ### Kontrol Edelim
    
    Tarayıcınızı açıp <a href="http://127.0.0.1:8000" class="external-link" target="_blank">http://127.0.0.1:8000</a> bağlantısına gidin.
    
    Şu şekilde bir JSON yanıtı ile karşılaşacağız:
    
    ```JSON
    {"message": "Hello World"}
    ```
    
    ### Etkileşimli API Dokümantasyonu
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 10.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/Graphs.java

       * is always detected before reusing an edge, so no special logic is required. In the undirected
       * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going
       * from B to A).
       */
      private static boolean canTraverseWithoutReusingEdge(
          Graph<?> graph, Object nextNode, @Nullable Object previousNode) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/Graphs.java

       * is always detected before reusing an edge, so no special logic is required. In the undirected
       * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going
       * from B to A).
       */
      private static boolean canTraverseWithoutReusingEdge(
          Graph<?> graph, Object nextNode, @Nullable Object previousNode) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 01 00:26:14 UTC 2025
    - 23.3K bytes
    - Viewed (0)
  5. cmd/erasure-healing-common_test.go

    		}
    		if diskIndex != 0 && disk == nil {
    			t.Errorf("Drive erroneously filtered, driveIndex: %d", diskIndex)
    		}
    	}
    	partsMetadata[0] = partsMetadataBackup // Revert before going to the next test
    
    	// Test 3: Not synchronized DataDir
    	erasureDisks = s.getDisks()
    	partsMetadataBackup = partsMetadata[1]
    	partsMetadata[1].DataDir = "foo-random"
    
    	errs = make([]error, len(erasureDisks))
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java

     * http://creativecommons.org/publicdomain/zero/1.0/
     */
    
    /*
     * Source:
     * http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/src/test/tck-jsr166e/AtomicDoubleArrayTest.java?revision=1.13
     * (Modified to adapt to guava coding conventions)
     */
    
    package com.google.common.util.concurrent;
    
    import static java.lang.Math.max;
    import static org.junit.Assert.assertThrows;
    
    import com.google.common.annotations.GwtIncompatible;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 14.6K bytes
    - Viewed (0)
  7. android/guava-testlib/src/com/google/common/collect/testing/google/UnmodifiableCollectionTests.java

     */
    @GwtCompatible
    @NullMarked
    public class UnmodifiableCollectionTests {
    
      public static void assertMapEntryIsUnmodifiable(Entry<?, ?> entry) {
        try {
          // fine because the call is going to fail without modifying the entry
          @SuppressWarnings("unchecked")
          Entry<?, @Nullable Object> nullableValueEntry = (Entry<?, @Nullable Object>) entry;
          nullableValueEntry.setValue(null);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 14.8K bytes
    - Viewed (0)
  8. cmd/endpoint-ellipses.go

    	}
    	result = totalSizes[0]
    	for i := 1; i < len(totalSizes); i++ {
    		result = gcd(result, totalSizes[i])
    	}
    	return result
    }
    
    // isValidSetSize - checks whether given count is a valid set size for erasure coding.
    var isValidSetSize = func(count uint64) bool {
    	return (count >= setSizes[0] && count <= setSizes[len(setSizes)-1])
    }
    
    func commonSetDriveCount(divisibleSize uint64, setCounts []uint64) (setSize uint64) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 14.6K bytes
    - Viewed (0)
  9. docs/en/docs/virtual-environments.md

    You use `which` in Linux and macOS and `Get-Command` in Windows PowerShell.
    
    The way that command works is that it will go and check in the `PATH` environment variable, going through **each path in order**, looking for the program called `python`. Once it finds it, it will **show you the path** to that program.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  10. docs/en/docs/tutorial/first-steps.md

    Normally you use:
    
    * `POST`: to create data.
    * `GET`: to read data.
    * `PUT`: to update data.
    * `DELETE`: to delete data.
    
    So, in OpenAPI, each of the HTTP methods is called an "operation".
    
    We are going to call them "**operations**" too.
    
    #### Define a *path operation decorator* { #define-a-path-operation-decorator }
    
    {* ../../docs_src/first_steps/tutorial001.py hl[6] *}
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 11K bytes
    - Viewed (0)
Back to top