Search Options

Results per page
Sort
Preferred Languages
Advance

Results 2751 - 2760 of 4,820 for if (0.01 sec)

  1. src/main/java/jcifs/internal/smb2/lease/DirectoryCacheScope.java

     * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
     * Lesser General Public License for more details.
     *
     * You should have received a copy of the GNU Lesser General Public
     * License along with this library; if not, write to the Free Software
     * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
     */
    package jcifs.internal.smb2.lease;
    
    /**
     * Defines the scope of directory caching for SMB3 directory leasing
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 01:47:47 UTC 2025
    - 1.3K bytes
    - Viewed (0)
  2. callbacks/create_test.go

    	type user struct {
    		ID    int `gorm:"primaryKey"`
    		Name  string
    		Email string `gorm:"default:(-)"`
    		Age   int    `gorm:"default:(-)"`
    	}
    
    	s, err := schema.Parse(&user{}, schemaCache, schema.NamingStrategy{})
    	if err != nil {
    		t.Errorf("parse schema error: %v, is not expected", err)
    		return
    	}
    	dest := []*user{
    		{
    			ID:    1,
    			Name:  "alice",
    			Email: "email",
    			Age:   18,
    		},
    		{
    			ID:    2,
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Mar 18 05:48:42 UTC 2024
    - 1.4K bytes
    - Viewed (0)
  3. ci/official/utilities/windows.sh

    # to setting up up volume mappings.
    # Thus, the drive letter is replaced with the passed prefix.
    # If no prefix is passed, by default, it's replaced with C:\, in case it's
    # something else (ex. T:), which is a volume used in internal CI.
    function replace_drive_letter_with_prefix () {
      local path_prefix
      if [[ -z "$2" ]]; then
        path_prefix="C:"
      else
        path_prefix="$2"
      fi
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Thu Jan 09 18:37:25 UTC 2025
    - 1.2K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/opensearch/config/exentity/CrawlingConfig.java

            if (StringUtil.isNotBlank(proxyHost) && StringUtil.isNotBlank(proxyPort)) {
                paramMap.put(Param.Client.PROXY_HOST, proxyHost);
                paramMap.put(Param.Client.PROXY_PORT, proxyPort);
                final String proxyUsername = fessConfig.getHttpProxyUsername();
                final String proxyPassword = fessConfig.getHttpProxyPassword();
                if (proxyUsername != null && proxyPassword != null) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Mar 15 06:53:53 UTC 2025
    - 5.6K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/fess/app/web/base/SearchForm.java

        }
    
        // advance
    
        @Override
        public int getStartPosition() {
            if (start == null) {
                start = ComponentUtil.getFessConfig().getPagingSearchPageStartAsInteger();
            }
            return start;
        }
    
        @Override
        public int getOffset() {
            if (offset == null) {
                offset = 0;
            }
            return offset;
        }
    
        @Override
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 5.7K bytes
    - Viewed (0)
  6. api/maven-api-core/src/main/java/org/apache/maven/api/services/ArtifactResolverResult.java

             * of the specified remote repositories.
             *
             * @return {@code true} if the artifact was resolved, {@code false} otherwise.
             */
            boolean isResolved();
    
            /**
             * Indicates whether the requested artifact is not present in any of the specified repositories.
             *
             * @return {@code true} if the artifact is not present in any repository, {@code false} otherwise.
             */
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Feb 07 00:45:02 UTC 2025
    - 4.7K bytes
    - Viewed (0)
  7. docs/en/docs/advanced/async-tests.md

    Let's look at how we can make that work.
    
    ## pytest.mark.anyio { #pytest-mark-anyio }
    
    If we want to call asynchronous functions in our tests, our test functions have to be asynchronous. AnyIO provides a neat plugin for this, that allows us to specify that some test functions are to be called asynchronously.
    
    ## HTTPX { #httpx }
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 3.9K bytes
    - Viewed (0)
  8. .teamcity/src/main/kotlin/model/FunctionalTestBucketGenerator.kt

            val result = mutableMapOf<TestCoverage, List<SmallSubprojectBucket>>()
            for (stage in model.stages) {
                for (testCoverage in stage.functionalTests) {
                    if (testCoverage.testType !in
                        listOf(TestType.ALL_VERSIONS_CROSS_VERSION, TestType.QUICK_FEEDBACK_CROSS_VERSION, TestType.SOAK)
                    ) {
    Registered: Wed Sep 10 11:36:15 UTC 2025
    - Last Modified: Thu Apr 10 15:09:32 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/app/web/admin/dict/synonym/AdminDictSynonymAction.java

                final VaErrorHook hook) {
            if (values.length == 0) {
                return;
            }
            for (final String value : values) {
                if (value.indexOf(',') >= 0) {
                    action.throwValidationError(messages -> {
                        messages.addErrorsInvalidStrIsIncluded(propertyName, value, ",");
                    }, hook);
                }
                if (value.indexOf("=>") >= 0) {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 23.7K bytes
    - Viewed (1)
  10. android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          if (impl.noAddOverflow(intsToAdd[j][0], intsToAdd[j][1])) {
            tmp++;
          }
        }
        return tmp;
      }
    
      @Benchmark
      int longAddOverflow(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          if (impl.noAddOverflow(longsToAdd[j][0], longsToAdd[j][1])) {
            tmp++;
          }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Jul 14 14:44:08 UTC 2025
    - 6.9K bytes
    - Viewed (0)
Back to top