C_value - Code Search

docs/metrics/prometheus/grafana/node/minio-node.json

          ],
          "thresholds": {
            "mode": "absolute",
            "steps": [
              {
                "color": "green",
                "value": null
              },
              {
                "color": "red",
                "value": 80
              }
            ]
          },
          "unit": "short"
        },
        "overrides": []
      },
      "gridPos": {
        "h": 5,

Created: Sun Dec 28 19:28:13 GMT 2025

- Last Modified: Mon Aug 04 01:46:49 GMT 2025

- 22.5K bytes

- Click Count (0)

github.com/tiangolo/fastapi

docs_src/websockets/tutorial002_an_py39.py

    <body>
        <h1>WebSocket Chat</h1>
        <form action="" onsubmit="sendMessage(event)">
            <label>Item ID: <input type="text" id="itemId" autocomplete="off" value="foo"/></label>
            <label>Token: <input type="text" id="token" autocomplete="off" value="some-key-token"/></label>
            <button onclick="connect(event)">Connect</button>
            <hr>

Created: Sun Dec 28 07:19:09 GMT 2025

- Last Modified: Sat Mar 18 12:29:59 GMT 2023

- 2.8K bytes

- Click Count (0)

github.com/minio/minio

internal/config/scanner/scanner.go

	config.KV{
		Key:   Speed,
		Value: "default",
	},
	config.KV{
		Key:           IdleSpeed,
		Value:         "",
		HiddenIfEmpty: true,
	},
	config.KV{
		Key:   ExcessVersions,
		Value: "100",
	},
	config.KV{
		Key:   ExcessFolders,
		Value: "50000",
	},

	// Deprecated Oct 2022
	config.KV{
		Key:           Delay,
		Value:         "",
		HiddenIfEmpty: true,
	},

Created: Sun Dec 28 19:28:13 GMT 2025

- Last Modified: Fri May 24 23:05:23 GMT 2024

- 5.5K bytes

- Click Count (0)

github.com/google/guava

guava/src/com/google/common/util/concurrent/AtomicDoubleArray.java

   * @return the previous value
   */
  public final double getAndSet(int i, double newValue) {
    long next = doubleToRawLongBits(newValue);
    return longBitsToDouble(longs.getAndSet(i, next));
  }

  /**
   * Atomically sets the element at position {@code i} to the given updated value if the current
   * value is <a href="#bitEquals">bitwise equal</a> to the expected value.
   *
   * @param i the index

Created: Fri Dec 26 12:43:10 GMT 2025

- Last Modified: Mon Mar 17 20:26:29 GMT 2025

- 10.2K bytes

- Click Count (0)

github.com/google/guava

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

  //    K key;
  //    V value;
  // }
  //
  // The imaginary `hash` and `next` values are combined into a single `int` value in the `entries`
  // array. The top bits of this value are the remaining bits of the hash value that were not used
  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,

Created: Fri Dec 26 12:43:10 GMT 2025

- Last Modified: Sat Aug 09 01:14:59 GMT 2025

- 35.7K bytes

- Click Count (0)

github.com/google/guava

android/guava-testlib/src/com/google/common/collect/testing/testers/MapPutTester.java

  public void testPut_supportedPresent() {
    assertEquals("put(present, value) should return the old value", v0(), getMap().put(k0(), v3()));
    expectReplacement(entry(k0(), v3()));
  }

  @MapFeature.Require(SUPPORTS_PUT)
  public void testPut_supportedNotPresent() {
    assertNull("put(notPresent, value) should return null", put(e3()));
    expectAdded(e3());
  }

Created: Fri Dec 26 12:43:10 GMT 2025

- Last Modified: Thu Aug 07 16:05:33 GMT 2025

- 9.1K bytes

- Click Count (0)

github.com/google/guava

android/guava/src/com/google/common/graph/GraphConnections.java

   * also becomes a successor. Associates {@code value} with the edge connecting the two nodes.
   */
  void addPredecessor(N node, V value);

  /**
   * Add {@code node} as a successor to the origin node. In the case of an undirected graph, it also
   * becomes a predecessor. Associates {@code value} with the edge connecting the two nodes. Returns
   * the value previously associated with the edge connecting the two nodes.
   */

Created: Fri Dec 26 12:43:10 GMT 2025

- Last Modified: Sun Dec 22 03:38:46 GMT 2024

- 2.4K bytes

- Click Count (0)

github.com/tiangolo/fastapi

fastapi/_compat/v2.py

            continue
        if isinstance(value, dict):
            new_schema[key] = _replace_refs(
                schema=value,
                old_name_to_new_name_map=old_name_to_new_name_map,
            )
        elif isinstance(value, list):
            new_value = []
            for item in value:
                if isinstance(item, dict):
                    new_item = _replace_refs(

Created: Sun Dec 28 07:19:09 GMT 2025

- Last Modified: Sat Dec 27 12:54:56 GMT 2025

- 19.1K bytes

- Click Count (0)

github.com/square/okhttp

okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/HpackTest.kt

    bytesIn.writeByte(0x0c) // Literal value (len = 12)
    bytesIn.writeUtf8("custom-value")
  }

  private fun checkReadThirdRequestWithoutHuffman() {
    assertThat(hpackReader!!.headerCount).isEqualTo(3)

    // [  1] (s =  54) custom-key: custom-value
    var entry = hpackReader!!.dynamicTable[readerHeaderTableLength() - 3]!!
    checkEntry(entry, "custom-key", "custom-value", 54)

Created: Fri Dec 26 11:42:13 GMT 2025

- Last Modified: Wed Mar 19 19:25:20 GMT 2025

- 38.6K bytes

- Click Count (0)

github.com/google/guava

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

  //    K key;
  //    V value;
  // }
  //
  // The imaginary `hash` and `next` values are combined into a single `int` value in the `entries`
  // array. The top bits of this value are the remaining bits of the hash value that were not used
  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,

Created: Fri Dec 26 12:43:10 GMT 2025

- Last Modified: Tue Jul 08 18:32:10 GMT 2025

- 39.6K bytes

- Click Count (0)

Search Options