Search Options

Results per page
Sort
Preferred Languages
Advance

Results 141 - 150 of 938 for noin (0.02 sec)

  1. scan.go

    						aliasName := utils.JoinNestedRelationNames(names[0 : len(names)-1])
    						for _, join := range db.Statement.Joins {
    							if join.Alias == aliasName {
    								names = append(strings.Split(join.Name, "."), names[len(names)-1])
    								break
    							}
    						}
    
    						if rel, ok := sch.Relationships.Relations[names[0]]; ok {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  2. cmd/sts-handlers_test.go

    	}
    	_, err := s.adm.SetConfigKV(ctx, strings.Join(configCmds, " "))
    	if err != nil {
    		c.Fatalf("unable to setup LDAP for tests: %v", err)
    	}
    
    	s.RestartIAMSuite(c)
    }
    
    // SetUpLDAPWithNonNormalizedBaseDN - expects to setup an LDAP test server using
    // the test LDAP container and canned data from
    // https://github.com/minio/minio-ldap-testing
    //
    // Sets up non-normalized base DN configuration for testing.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 100.2K bytes
    - Viewed (1)
  3. src/main/java/jcifs/smb/SmbResourceLocatorImpl.java

                    System.arraycopy(nameParts, pos, remainParts, 0, nameParts.length - pos);
                    this.unc = "\\" + StringUtil.join("\\", remainParts) + (trailingSlash ? "\\" : "");
                    this.canon = "/" + this.share + "/" + StringUtil.join("/", remainParts) + (trailingSlash ? "/" : "");
                } else {
                    this.unc = "\\";
                    if (this.share != null) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 23.6K bytes
    - Viewed (0)
  4. guava/src/com/google/common/math/PairedStatsAccumulator.java

       *
       * <p>This is guaranteed to return zero if the dataset contains a single pair of finite values. It
       * is not guaranteed to return zero when the dataset consists of the same pair of values multiple
       * times, due to numerical errors.
       *
       * <h3>Non-finite values</h3>
       *
       * <p>If the dataset contains any non-finite values ({@link Double#POSITIVE_INFINITY}, {@link
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  5. src/bytes/bytes_test.go

    			continue
    		}
    
    		if want := tt.a[len(tt.a)-1] + "z"; string(x) != want {
    			t.Errorf("last appended result was %s; want %s", x, want)
    		}
    
    		s := Join(a, []byte(tt.sep))
    		if string(s) != tt.s {
    			t.Errorf(`Join(Split(%q, %q, %d), %q) = %q`, tt.s, tt.sep, tt.n, tt.sep, s)
    		}
    		if tt.n < 0 {
    			b := sliceOfString(Split([]byte(tt.s), []byte(tt.sep)))
    			if !slices.Equal(result, b) {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Jul 28 18:13:58 UTC 2025
    - 62.9K bytes
    - Viewed (0)
  6. guava/src/com/google/common/math/Stats.java

      /**
       * Returns the <a href="http://en.wikipedia.org/wiki/Arithmetic_mean">arithmetic mean</a> of the
       * values. The count must be non-zero.
       *
       * <p>If these values are a sample drawn from a population, this is also an unbiased estimator of
       * the arithmetic mean of the population.
       *
       * <h3>Non-finite values</h3>
       *
       * <p>If the dataset contains {@link Double#NaN} then the result is {@link Double#NaN}. If it
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  7. src/test/java/org/codelibs/fess/mylasta/direction/sponsor/FessCurtainFinallyHookTest.java

            // Start all threads
            for (Thread thread : threads) {
                thread.start();
            }
    
            // Wait for all threads to complete
            for (Thread thread : threads) {
                thread.join(5000); // 5 second timeout
            }
    
            // Verify no errors occurred during concurrent execution
            assertFalse(hasError.get());
        }
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Tue Aug 19 14:09:36 UTC 2025
    - 8.7K bytes
    - Viewed (0)
  8. docs/es/llm-prompt.md

    * terminals: terminales (plural femenine, as in "las terminales")
    * lifespan: lifespan (do not translate to "vida útil" or "tiempo de vida")
    * unload: quitar de memoria (do not translate to "descargar")
    * mount (noun): mount (do not translate to "montura")
    * mount (verb): montar
    * statement (as in code statement): statement (do not translate to "declaración" or "sentencia")
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sat Jul 26 18:57:50 UTC 2025
    - 5.3K bytes
    - Viewed (0)
  9. docs/debugging/s3-check-md5/main.go

    			Recursive:    true,
    			Prefix:       prefix,
    			WithVersions: versions,
    			WithMetadata: true,
    		}
    
    		objFullPath := func(obj minio.ObjectInfo) (fpath string) {
    			fpath = path.Join(bucket, obj.Key)
    			if versions {
    				fpath += ":" + obj.VersionID
    			}
    			return
    		}
    
    		// List all objects from a bucket-name with a matching prefix.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Sat Feb 17 01:15:57 UTC 2024
    - 6.3K bytes
    - Viewed (0)
  10. cmd/sftp-server.go

    		}
    		if !found {
    			logger.Fatal(fmt.Errorf("unknown algorithm %q passed to --sftp=%s\nValid algorithms: %v", algo, arg, strings.Join(allowed, ", ")), "unable to start SFTP server")
    		}
    	}
    	if len(filteredAlgos) == 0 {
    		logger.Fatal(fmt.Errorf("no valid algorithms passed to --sftp=%s\nValid algorithms: %v", arg, strings.Join(allowed, ", ")), "unable to start SFTP server")
    	}
    	return filteredAlgos
    }
    
    func startSFTPServer(args []string) {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 16.5K bytes
    - Viewed (0)
Back to top