Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 115 for noiden (0.04 sec)

  1. android/guava/src/com/google/common/graph/SuccessorsFunction.java

     * @author Joshua O'Madadhain
     * @author Jens Nyman
     * @param <N> Node parameter type
     * @since 23.0
     */
    @Beta
    @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
    public interface SuccessorsFunction<N> {
    
      /**
       * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
       * {@code node}'s outgoing edges in the direction (if any) of the edge.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  2. fess-crawler/src/test/resources/extractor/eml/sample1.eml

    【3】"PS3""PSP"the Best シリーズ 2012年12月発売予定タイトル
    --------------------------------------------------------------------------------
    "PS3""PSP"ベストが登場!
    お買い求めやすいプライスで、ヒット作をお楽しみください!
    
    ▼"PS3"
    『バイオハザード リバイバルセレクション』
    『真・三國無双5』
    『NINJA GAIDEN Σ』
    『戦国無双3 Z』
    『戦国BASARA3 宴』
    『機動戦士ガンダム EXTREME VS.』
    
    http://www.jp.playstation.com/R/m21111_NEWS004
    
    ▼"PSP"
    『シャイニング・ハーツ』
    『真・三國無双6 Special』
    『セブンスドラゴン2020』
    『フォトカノ』
    
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Sat Jan 16 07:50:35 UTC 2016
    - 9.3K bytes
    - Viewed (0)
  3. cmd/peer-s3-client.go

    	nodes := endpoints.GetNodes()
    	peers = make([]peerS3Client, len(nodes))
    	for i, node := range nodes {
    		if node.IsLocal {
    			peers[i] = &localPeerS3Client{node: node}
    		} else {
    			peers[i] = newPeerS3Client(node)
    		}
    		peers[i].SetPools(node.Pools)
    	}
    
    	return peers
    }
    
    // Returns a peer S3 client.
    func newPeerS3Client(node Node) peerS3Client {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 15.6K bytes
    - Viewed (0)
  4. okhttp/src/jvmTest/kotlin/okhttp3/internal/tls/HostnameVerifierTest.kt

        // [distinguished_name]
        // [req_extensions]
        // [x509_extensions]
        // subjectAltName=DNS:localhost.localdomain,DNS:localhost,IP:127.0.0.1
        //
        // $ openssl req -x509 -nodes -days 36500 -subj '/CN=localhost' -config ./cert.cnf \
        //     -newkey rsa:512 -out cert.pem
        val certificate =
          certificate(
            """
            -----BEGIN CERTIFICATE-----
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 40.4K bytes
    - Viewed (0)
  5. cmd/metrics.go

    		prometheus.NewDesc(
    			prometheus.BuildFQName(minioNamespace, "nodes", "online"),
    			"Total number of MinIO nodes online",
    			nil, nil),
    		prometheus.GaugeValue,
    		float64(nodesUp),
    	)
    	ch <- prometheus.MustNewConstMetric(
    		prometheus.NewDesc(
    			prometheus.BuildFQName(minioNamespace, "nodes", "offline"),
    			"Total number of MinIO nodes offline",
    			nil, nil),
    		prometheus.GaugeValue,
    		float64(nodesDown),
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 15 12:04:40 UTC 2024
    - 16.6K bytes
    - Viewed (0)
  6. docs/multi-tenancy/README.md

    This topic provides commands to set up different configurations of hosts, nodes, and drives. The examples provided here can be used as a starting point for other configurations.
    
    1. [Standalone Deployment](#standalone-deployment)
    2. [Distributed Deployment](#distributed-deployment)
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 3.1K bytes
    - Viewed (0)
  7. fess-crawler/src/test/resources/extractor/eml/sample3.eml

    Home"オフィシャルサイト http://www.jp.playstation.com/R/m21111_NEWS003 ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ 【3】"PS3""PSP"the Best シリーズ 2012年12月発売予定タイトル ---------- "PS3""PSP"ベストが登場! お買い求めやすいプライスで、ヒット作をお楽しみください! ▼"PS3" 『バイオハザード リバイバルセレクション』 『真・三國無双5』 『NINJA GAIDEN Σ』 『戦国無双3 Z』 『戦国BASARA3 宴』 『機動戦士ガンダム EXTREME VS.』 http://www.jp.playstation.com/R/m21111_NEWS004 ▼"PSP" 『シャイニング・ハーツ』 『真・三國無双6 Special』 『セブンスドラゴン2020』 『フォトカノ』 http://www.jp.playstation.com/R/m21111_NEWS005 ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ 【4】SCEソフトウェア情報...
    Registered: Sun Sep 21 03:50:09 UTC 2025
    - Last Modified: Sat Jan 16 07:50:35 UTC 2016
    - 539.6K bytes
    - Viewed (0)
  8. docs/de/docs/tutorial/dependencies/classes-as-dependencies.md

    Diese Parameter werden von **FastAPI** verwendet, um die Abhängigkeit „aufzulösen“.
    
    In beiden Fällen wird sie haben:
    
    * Einen optionalen `q`-Query-Parameter, der ein `str` ist.
    * Einen `skip`-Query-Parameter, der ein `int` ist, mit einem Defaultwert `0`.
    * Einen `limit`-Query-Parameter, der ein `int` ist, mit einem Defaultwert `100`.
    
    In beiden Fällen werden die Daten konvertiert, validiert, im OpenAPI-Schema dokumentiert, usw.
    
    ## Verwendung
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Mon Nov 18 02:25:44 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/hash/HashingTest.java

      }
    
      public void checkSameResult(HashCode hashCode, long equivLong) {
        assertEquals(Hashing.consistentHash(equivLong, 5555), Hashing.consistentHash(hashCode, 5555));
      }
    
      /**
       * Check a few "golden" values to see that implementations across languages are equivalent.
       *
       */
      public void testConsistentHash_linearCongruentialGeneratorCompatibility() {
        int[] golden100 = {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 17:27:14 UTC 2025
    - 26.4K bytes
    - Viewed (2)
  10. android/guava/src/com/google/common/graph/PredecessorsFunction.java

     * @author Joshua O'Madadhain
     * @author Jens Nyman
     * @param <N> Node parameter type
     * @since 23.0
     */
    @Beta
    @DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
    public interface PredecessorsFunction<N> {
    
      /**
       * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
       * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4K bytes
    - Viewed (0)
Back to top