Search Options

Results per page
Sort
Preferred Languages
Advance

Results 711 - 720 of 1,232 for Found (0.03 sec)

  1. docs/ja/docs/tutorial/response-status-code.md

    * **`300`** 以上は「リダイレクト」のためのものです。これらのステータスコードを持つレスポンスは`304`(Not Modified)を除き、ボディを持つことも持たないこともできます。
    * **`400`** 以上は「クライアントエラー」のレスポンスのためのものです。これらは、おそらく最も多用するであろう2番目のタイプです。
        * 例えば、`404`は「Not Found」レスポンスです。
        * クライアントからの一般的なエラーについては、`400`を使用することができます。
    * `500`以上はサーバーエラーのためのものです。これらを直接使うことはほとんどありません。アプリケーションコードやサーバーのどこかで何か問題が発生した場合、これらのステータスコードのいずれかが自動的に返されます。
    
    /// tip | "豆知識"
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  2. internal/logger/target/kafka/kafka.go

    	producer sarama.SyncProducer
    	kconfig  Config
    	config   *sarama.Config
    }
    
    func (h *Target) validate() error {
    	if len(h.kconfig.Brokers) == 0 {
    		return errors.New("no broker address found")
    	}
    	for _, b := range h.kconfig.Brokers {
    		if _, err := xnet.ParseHost(b.String()); err != nil {
    			return err
    		}
    	}
    	return nil
    }
    
    // Name returns the name of the target
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Sep 06 23:06:30 UTC 2024
    - 10.2K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/ImmutableRangeSet.java

       * contents, such as {@code "[1..100]}"}.
       *
       * @throws IllegalArgumentException if neither this range nor the domain has a lower bound, or if
       *     neither has an upper bound
       */
      public ImmutableSortedSet<C> asSet(DiscreteDomain<C> domain) {
        checkNotNull(domain);
        if (isEmpty()) {
          return ImmutableSortedSet.of();
        }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 27K bytes
    - Viewed (0)
  4. cmd/handler-api.go

    	available = 2048 * blockSizeV2 * 2 // Default to 4 GiB when we can't find the limits.
    
    	if runtime.GOOS == "linux" {
    		// Honor cgroup limits if set.
    		limit := cgroupMemLimit()
    		if limit > 0 {
    			// A valid value is found, return its 90%
    			available = (limit * 9) / 10
    			return
    		}
    	} // for all other platforms limits are based on virtual memory.
    
    	memStats, err := mem.VirtualMemory()
    	if err != nil {
    		return
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 26 17:07:10 UTC 2024
    - 10.4K bytes
    - Viewed (0)
  5. misc/ios/go_ios_exec.go

    // Copyright 2024 The Go Authors. All rights reserved.
    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // This program can be used as go_ios_$GOARCH_exec by the Go tool. It executes
    // binaries on the iOS Simulator using the XCode toolchain.
    package main
    
    import (
    	"fmt"
    	"go/build"
    	"log"
    	"os"
    	"os/exec"
    	"path/filepath"
    	"runtime"
    	"strings"
    	"syscall"
    )
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Jun 18 16:32:49 UTC 2024
    - 8.7K bytes
    - Viewed (0)
  6. tensorflow/c/c_api.cc

      mutex_lock l(graph->mu);
      tensorflow::shape_inference::InferenceContext* ic =
          graph->refiner.GetContext(node);
      if (ic == nullptr) {
        status->status =
            InvalidArgument("Node ", node->name(), " was not found in the graph");
        return;
      }
    
      auto shape_and_type_vec =
          std::vector<tensorflow::shape_inference::ShapeAndType>(
              num_shapes_and_types);
      for (int i = 0; i < num_shapes_and_types; ++i) {
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 16:27:48 UTC 2024
    - 102.3K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/collect/TreeMultisetTest.java

        for (Method m : TreeMultiset.class.getMethods()) {
          if (m.getName().equals("elementSet") && m.getReturnType().equals(SortedSet.class)) {
            return;
          }
        }
        fail("No bridge method found");
      }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:05:46 UTC 2024
    - 12.9K bytes
    - Viewed (0)
  8. src/main/java/jcifs/http/NtlmHttpFilter.java

                        }
                        this.dcList[ i ] = null;
                    }
                }
    
                /*
                 * No DCs found, for retieval of list by expiring it and retry.
                 */
                this.dcListExpiration = 0;
            }
            while ( retry-- > 0 );
    
            this.dcListExpiration = now + 1000 * 60 * 15; /* 15 min */
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 14.8K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb/Kerb5Authenticator.java

        }
    
    
        /**
         * Set the user name which is used to setup <code>GSSContext</code>. If null
         * is set, the default user will be used which is retrieved from the first
         * TGT found in <code>Subject</code> .
         *
         * @param name
         *            the user name used to setup <code>GSSContext</code>
         */
        public void setUser ( String name ) {
            this.user = name;
        }
    
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 13K bytes
    - Viewed (0)
  10. cmd/admin-handlers-pools.go

    			idx = i
    		}
    	} else {
    		idx = globalEndpoints.GetPoolIdx(v)
    	}
    
    	if idx == -1 {
    		apiErr := toAdminAPIErr(ctx, errInvalidArgument)
    		apiErr.Description = fmt.Sprintf("specified pool '%s' not found, please specify a valid pool", v)
    		// We didn't find any matching pools, invalid input
    		writeErrorResponseJSON(ctx, w, apiErr, r.URL)
    		return
    	}
    
    	status, err := pools.Status(r.Context(), idx)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Jun 28 00:22:30 UTC 2024
    - 10.9K bytes
    - Viewed (0)
Back to top