Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1031 - 1040 of 1,713 for Fake (0.03 sec)

  1. internal/config/policy/opa/config.go

    }
    
    // IsAllowed - checks given policy args is allowed to continue the REST API.
    func (o *Opa) IsAllowed(args policy.Args) (bool, error) {
    	if o == nil {
    		return false, nil
    	}
    
    	// OPA input
    	body := make(map[string]interface{})
    	body["input"] = args
    
    	inputBytes, err := json.Marshal(body)
    	if err != nil {
    		return false, err
    	}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Jul 10 20:16:44 UTC 2024
    - 5.3K bytes
    - Viewed (0)
  2. internal/crypto/sse-c.go

    	if sealedKey.Algorithm != SealAlgorithm {
    		logger.CriticalIf(context.Background(), Errorf("The seal algorithm '%s' is invalid for SSE-C", sealedKey.Algorithm))
    	}
    
    	if metadata == nil {
    		metadata = make(map[string]string, 3)
    	}
    	metadata[MetaAlgorithm] = SealAlgorithm
    	metadata[MetaIV] = base64.StdEncoding.EncodeToString(sealedKey.IV[:])
    	metadata[MetaSealedKeySSEC] = base64.StdEncoding.EncodeToString(sealedKey.Key[:])
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Jan 18 07:03:17 UTC 2024
    - 5.2K bytes
    - Viewed (0)
  3. build-logic-commons/basics/src/main/kotlin/gradlebuild/basics/tasks/PackageListGenerator.kt

    
    /**
     * This task will generate the list of relocated packages into a file that will in turn be used when generating the runtime shaded jars. All we need is a list of packages that need to be relocated, so
     * we'll make sure to filter the list of packages before generating the file.
     *
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Fri Oct 11 19:14:16 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  4. istioctl/pkg/authz/listener.go

    	buf.WriteString("ACTION\tAuthorizationPolicy\tRULES\n")
    	for _, action := range []rbacpb.RBAC_Action{rbacpb.RBAC_DENY, rbacpb.RBAC_ALLOW, rbacpb.RBAC_LOG} {
    		if names, ok := actionToPolicy[action]; ok {
    			sortedNames := make([]string, 0, len(names))
    			for name := range names {
    				sortedNames = append(sortedNames, name)
    			}
    			sort.Strings(sortedNames)
    			for _, name := range sortedNames {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Sep 11 15:29:30 UTC 2023
    - 6K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/io/SourceSinkTester.java

    /**
     * @param <S> the source or sink type
     * @param <T> the data type (byte[] or String)
     * @param <F> the factory type
     * @author Colin Decker
     */
    @AndroidIncompatible // TODO(b/230620681): Make this available (even though we won't run it).
    public class SourceSinkTester<S, T, F extends SourceSinkFactory<S, T>> extends TestCase {
    
      static final String LOREM_IPSUM =
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 27 18:57:08 UTC 2022
    - 4.9K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/reflect/SubtypeTester.java

     *
     * <p>Tests should inherit from this class, and declare subtyping relationship with public methods
     * annotated by {@link TestSubtype}.
     *
     * <p>These declaration methods rely on Java static type checking to make sure what we want to
     * assert as subtypes are really subtypes according to javac. For example:
     *
     * <pre>{@code
     * class MySubtypeTests extends SubtypeTester {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 19 19:24:36 UTC 2023
    - 6.1K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/DoubleUtils.java

          return x.longValue();
        } else if (exponent > MAX_EXPONENT) {
          return x.signum() * POSITIVE_INFINITY;
        }
    
        /*
         * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding
         * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or
         * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  8. src/main/java/jcifs/smb1/netbios/NameServiceClient.java

                            response.wait( timeout );
    
                            /* JetDirect printer can respond to regular broadcast query
                             * with node status so we need to check to make sure that
                             * the record type matches the question type and if not,
                             * loop around and try again.
                             */
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 20:39:42 UTC 2019
    - 17.4K bytes
    - Viewed (0)
  9. internal/auth/credentials.go

    		random = rand.Reader
    	}
    	if length <= 0 {
    		length = accessKeyMaxLen
    	}
    	if length < accessKeyMinLen {
    		return "", errors.New("auth: access key length is too short")
    	}
    
    	key := make([]byte, length)
    	if _, err := io.ReadFull(random, key); err != nil {
    		return "", err
    	}
    	for i := range key {
    		key[i] = alphaNumericTable[key[i]%alphaNumericTableLen]
    	}
    	return string(key), nil
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue May 28 17:14:16 UTC 2024
    - 12K bytes
    - Viewed (0)
  10. cmd/endpoint-ellipses_test.go

    		{
    			[]string{"data{1...64}"},
    			nil,
    			nil,
    			2,
    			false,
    		},
    	}
    
    	for _, testCase := range testCases {
    		testCase := testCase
    		t.Run("", func(t *testing.T) {
    			argPatterns := make([]ellipses.ArgPattern, len(testCase.args))
    			for i, arg := range testCase.args {
    				patterns, err := ellipses.FindEllipsesPatterns(arg)
    				if err != nil {
    					t.Fatalf("Unexpected failure %s", err)
    				}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri May 24 23:05:23 UTC 2024
    - 15.2K bytes
    - Viewed (0)
Back to top