Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1311 - 1320 of 1,343 for numbers (0.06 sec)

  1. android/guava-tests/test/com/google/common/collect/IteratorsTest.java

        iterator.remove();
        assertEquals(asList("1", "3"), list);
      }
    
      public void testPoorlyBehavedTransform() {
        Iterator<String> input = asList("1", "not a number", "3").iterator();
        Iterator<Integer> result =
            Iterators.transform(
                input,
                new Function<String, Integer>() {
                  @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 54.4K bytes
    - Viewed (0)
  2. cmd/notification.go

    					ctx := logger.SetReqInfo(ctx, reqInfo)
    					peersLogOnceIf(ctx, err, addr.String())
    				}
    
    				// Wait for a minimum of 100ms and dynamically increase this based on number of attempts.
    				if i < retryCount-1 {
    					time.Sleep(100*time.Millisecond + time.Duration(r.Float64()*float64(time.Second)))
    					continue
    				}
    			}
    			break
    		}
    	}()
    }
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 45.9K bytes
    - Viewed (0)
  3. src/main/java/org/codelibs/core/collection/CollectionsUtil.java

         * @param <V> the value type of {@link ConcurrentHashMap}
         * @param initialCapacity the initial capacity
         * @param loadFactor the load factor threshold for resizing
         * @param concurrencyLevel the estimated number of threads for concurrent updates
         * @return a new instance of {@link ConcurrentHashMap}
         * @see ConcurrentHashMap#ConcurrentHashMap(int, float, int)
         */
    Registered: Fri Sep 05 20:58:11 UTC 2025
    - Last Modified: Thu Jul 31 08:16:49 UTC 2025
    - 49.9K bytes
    - Viewed (0)
  4. docs/pt/docs/deployment/docker.md

    Se você executar **múltiplos processos por contêiner** (por exemplo, com a imagem oficial do Docker), deve garantir que o número de processos iniciados não **consuma mais memória** do que o disponível.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Nov 09 16:39:20 UTC 2024
    - 37.4K bytes
    - Viewed (0)
  5. tensorflow/c/c_api_function_test.cc

      }
    
      void VerifyFDefNodes(const tensorflow::FunctionDef& fdef,
                           const std::unordered_set<string>& nodes) {
        ASSERT_EQ(nodes.size(), fdef.node_def_size())
            << "Got unexpected number of nodes. Expected: ["
            << absl::StrJoin(nodes, ", ")
            << "] Actual nodes in fdef: " << fdef.DebugString();
        for (const NodeDef& node_def : fdef.node_def()) {
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Thu Jul 20 22:08:54 UTC 2023
    - 63.6K bytes
    - Viewed (1)
  6. src/cmd/asm/internal/asm/testdata/arm.s

    //		g = nullgen;
    //		g.Type = obj.TYPE_CONST;
    //		g.Offset = int64(
    //			(0xe << 24) |		/* opcode */
    //			($1 << 20) |		/* MCR/MRC */
    //			(($2^C_SCOND_XOR) << 28) |		/* scond */
    //			(($3 & 15) << 8) |	/* coprocessor number */
    //			(($5 & 7) << 21) |	/* coprocessor operation */
    //			(($7 & 15) << 12) |	/* arm register */
    //			(($9 & 15) << 16) |	/* Crn */
    //			(($11 & 15) << 0) |	/* Crm */
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Dec 15 20:51:01 UTC 2023
    - 69K bytes
    - Viewed (0)
  7. src/archive/zip/reader_test.go

    	}
    	r, err := NewReader(bytes.NewReader(b.Bytes()), int64(b.Len()))
    	if err != nil {
    		t.Fatalf("NewReader failed: %s", err)
    	}
    	if len(r.File) != 5 {
    		t.Errorf("Archive has unexpected number of files, got %d, want 5", len(r.File))
    	}
    }
    
    func TestCVE202139293(t *testing.T) {
    	// directory size is so large, that the check in Reader.init
    	// overflows when subtracting from the archive size, causing
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Tue Mar 11 22:19:38 UTC 2025
    - 56.6K bytes
    - Viewed (0)
  8. src/main/webapp/css/admin/bootstrap.min.css.map

    white-space: normal; // 1\n}\n\nprogress {\n  vertical-align: baseline; // Add the correct vertical alignment in Chrome, Firefox, and Opera.\n}\n\n// Correct the cursor style of increment and decrement buttons in Chrome.\n[type=\"number\"]::-webkit-inner-spin-button,\n[type=\"number\"]::-webkit-outer-spin-button {\n  height: auto;\n}\n\n[type=\"search\"] {\n  // This overrides the extra rounded corners on search inputs in iOS so that our\n  // `.form-control` class can properly style them. Note that this...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 639.3K bytes
    - Viewed (1)
  9. src/main/webapp/css/bootstrap.min.css.map

    \"\";\n\n  // Loop over each value and calculate value\n  @each $value in $values {\n    @if $value == 0 {\n      $val: $val + \" 0\";\n    } @else {\n      // Cache $value unit\n      $unit: if(type-of($value) == \"number\", unit($value), false);\n\n      // If $value isn't a number (like inherit) or $value has a unit (not px or rem, like 1.5em) or $ is 0, just print the value\n      @if not $unit or $unit != px and $unit != rem {\n        $val: $val + \" \" + $value;\n      } @else {\n        //...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Jan 12 06:14:02 UTC 2025
    - 575.5K bytes
    - Viewed (0)
  10. cmd/peer-rest-server.go

    	}
    
    	if err = globalIAMSys.LoadUser(context.Background(), objAPI, accessKey, userType); err != nil {
    		return np, grid.NewRemoteErr(err)
    	}
    
    	return
    }
    
    // LoadGroupHandler - reloads group along with members list.
    func (s *peerRESTServer) LoadGroupHandler(mss *grid.MSS) (np grid.NoPayload, nerr *grid.RemoteErr) {
    	objAPI := newObjectLayerFn()
    	if objAPI == nil {
    		return np, grid.NewRemoteErr(errServerNotInitialized)
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sun Mar 30 00:56:02 UTC 2025
    - 53.4K bytes
    - Viewed (0)
Back to top