Search Options

Results per page
Sort
Preferred Languages
Advance

Results 201 - 210 of 288 for generator_ (0.1 sec)

  1. docs/ja/docs/tutorial/background-tasks.md

    これらは、より複雑な構成、RabbitMQ や Redis などのメッセージ/ジョブキューマネージャーを必要とする傾向がありますが、複数のプロセス、特に複数のサーバーでバックグラウンドタスクを実行できます。
    
    例を確認するには、[Project Generators](../project-generation.md){.internal-link target=_blank} を参照してください。これらにはすべて、Celery が構築済みです。
    
    ただし、同じ **FastAPI** アプリから変数とオブジェクトにアクセスする必要がある場合、または小さなバックグラウンドタスク (電子メール通知の送信など) を実行する必要がある場合は、単に `BackgroundTasks` を使用できます。
    
    ## まとめ
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 6K bytes
    - Viewed (0)
  2. common-protos/k8s.io/api/rbac/v1alpha1/generated.proto

    import "k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto";
    import "k8s.io/apimachinery/pkg/runtime/generated.proto";
    import "k8s.io/apimachinery/pkg/runtime/schema/generated.proto";
    
    // Package-wide variables from generator "generated".
    option go_package = "k8s.io/api/rbac/v1alpha1";
    
    // AggregationRule describes how to locate ClusterRoles to aggregate into the ClusterRole
    message AggregationRule {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  3. common-protos/k8s.io/api/storage/v1alpha1/generated.proto

    import "k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto";
    import "k8s.io/apimachinery/pkg/runtime/generated.proto";
    import "k8s.io/apimachinery/pkg/runtime/schema/generated.proto";
    
    // Package-wide variables from generator "generated".
    option go_package = "k8s.io/api/storage/v1alpha1";
    
    // CSIStorageCapacity stores the result of one CSI GetCapacity call.
    // For a given StorageClass, this describes the available capacity in a
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 9.4K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/cache/Striped64.java

       * class-unloading when ThreadLocals are not removed.
       */
      static final ThreadLocal<int @Nullable []> threadHashCode = new ThreadLocal<>();
    
      /** Generator of new random hash codes */
      static final Random rng = new Random();
    
      /** Number of CPUS, to place bound on table size */
      static final int NCPU = Runtime.getRuntime().availableProcessors();
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jun 14 17:55:55 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  5. ci/official/containers/linux_arm64/devel.usertools/code_check_full.bats

      | grep -e "^//" -e "^@" \
      | grep -E -v "^//tensorflow" \
      | sed -e 's|:.*||' \
      | sort -u
    }
    
    # Verify that, given a build target and a license-list generator target, all of
    # the dependencies of that target which include a license notice file are then
    # included when generating that license. Necessary because the license targets
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Wed Aug 14 18:47:44 UTC 2024
    - 12.9K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java

        assertEquals(
            String.format("expected: %08x, actual: %08x", expectedCrc, actualCrc),
            expectedCrc,
            actualCrcHasher);
      }
    
      // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41.
      // We calculate the constant below by:
      //   1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 6.5K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/hash/Hashing.java

        checkArgument(buckets > 0, "buckets must be positive: %s", buckets);
        LinearCongruentialGenerator generator = new LinearCongruentialGenerator(input);
        int candidate = 0;
        int next;
    
        // Jump from bucket to bucket until we go out of range
        while (true) {
          next = (int) ((candidate + 1) / generator.nextDouble());
          if (next >= 0 && next < buckets) {
            candidate = next;
          } else {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Jul 19 16:02:36 UTC 2024
    - 29.3K bytes
    - Viewed (0)
  8. docs/zh-CN/README.md

    *[Fess 网站搜索](https://github.com/codelibs/fess-site-search)* 是 [Google 网站搜索](https://enterprise.google.com/search/products/gss.html)的免费替代品。更多详情请参阅 [FSS JS 生成器文档](https://fss-generator.codelibs.org/docs/manual)。
    
    ## 官网
    
    [fess.codelibs.org](https://fess.codelibs.org/)
    
    ## 问题/疑问
    
    [discuss.codelibs.org](https://discuss.codelibs.org/c/FessEN/)
    
    ## 入门
    
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 12 07:19:47 UTC 2024
    - 6.8K bytes
    - Viewed (0)
  9. common-protos/k8s.io/api/certificates/v1beta1/generated.proto

    import "k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto";
    import "k8s.io/apimachinery/pkg/runtime/generated.proto";
    import "k8s.io/apimachinery/pkg/runtime/schema/generated.proto";
    
    // Package-wide variables from generator "generated".
    option go_package = "k8s.io/api/certificates/v1beta1";
    
    // Describes a certificate signing request
    message CertificateSigningRequest {
      // +optional
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 6.7K bytes
    - Viewed (0)
  10. docs/ko/README.md

    *[Fess 사이트 검색](https://github.com/codelibs/fess-site-search)*은 [Google 사이트 검색](https://enterprise.google.com/search/products/gss.html)의 무료 대안입니다. 자세한 내용은 [FSS JS 생성기 문서](https://fss-generator.codelibs.org/docs/manual)를 참조하십시오.
    
    ## 웹사이트
    
    [fess.codelibs.org](https://fess.codelibs.org/)
    
    ## 문제/질문
    
    [discuss.codelibs.org](https://discuss.codelibs.org/c/FessEN/)
    
    ## 시작하기
    
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 12 07:19:47 UTC 2024
    - 7.8K bytes
    - Viewed (0)
Back to top