Search Options

Results per page
Sort
Preferred Languages
Advance

Results 201 - 210 of 261 for spice (0.31 sec)

  1. src/main/java/jcifs/internal/smb2/create/Smb2CreateRequest.java

        /**
         * Open does not cause an opportunistic lock break for the file
         */
        public static final int FILE_NOP_RECALL = 0x400000;
        /**
         * The file is being opened solely to query its free space
         */
        public static final int FILE_OPEN_FOR_FREE_SPACE_QUERY = 0x800000;
    
        private byte securityFlags;
        private byte requestedOplockLevel = SMB2_OPLOCK_LEVEL_NONE;
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 23 02:21:31 UTC 2025
    - 22.9K bytes
    - Viewed (0)
  2. tests/hooks_test.go

    	}
    
    	var products []Product
    	DB.Find(&products, "code = ?", "unique_code")
    	if products[0].AfterFindCallTimes != 2 {
    		t.Fatalf("AfterFind callbacks should work with slice, called %v", products[0].AfterFindCallTimes)
    	}
    
    	DB.Where("Code = ?", "unique_code").First(&p)
    	if !reflect.DeepEqual(p.GetCallTimes(), []int64{1, 2, 1, 1, 0, 0, 0, 0, 2}) {
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Mon Jun 17 03:59:06 UTC 2024
    - 16.7K bytes
    - Viewed (0)
  3. tests/query_test.go

    	}
    
    	var names2 []string
    	if err := DB.Model(User{}).Where("name like ?", "pluck-user%").Order("name desc").Pluck("name", &names2).Error; err != nil {
    		t.Errorf("got error when pluck name: %v", err)
    	}
    
    	sort.Slice(names2, func(i, j int) bool { return names2[i] < names2[j] })
    	AssertEqual(t, names, names2)
    
    	var ids []int
    	if err := DB.Model(User{}).Where("name like ?", "pluck-user%").Pluck("id", &ids).Error; err != nil {
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Tue Jul 22 06:21:04 UTC 2025
    - 51K bytes
    - Viewed (0)
  4. CHANGELOG/CHANGELOG-1.35.md

    - Improved the `FreeDiskSpaceFailed` warning event to provide more actionable details when image garbage collection fails to free enough disk space. Example: `Insufficient free disk space on the node's image filesystem (95.0% of 10.0 GiB used). Failed to free sufficient space by deleting unused images. Consider resizing the disk or deleting unused files.`. ([#132578](https://github.com/kubernetes/kubernetes/pull/132578), [@drigz](https://github.com/drigz))...
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Wed Dec 17 13:01:55 UTC 2025
    - 228.5K bytes
    - Viewed (0)
  5. guava-tests/test/com/google/common/hash/BloomFilterTest.java

            "BitArray.bitSize() must return a positive number, but was " + bitArray.bitSize(),
            bitArray.bitSize() > 0);
    
        // Ideally we would also test the bitSize() overflow of this BF, but it runs out of heap space
        // BloomFilter.create(Funnels.unencodedCharsFunnel(), 244412641, 1e-11);
      }
    
      /**
       * Asserts that {@link BloomFilter#approximateElementCount} is within 1 percent of the expected
       * value.
       */
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 22.1K bytes
    - Viewed (0)
  6. src/main/webapp/css/admin/adminlte.min.css.map

    Menlo, Monaco, Consolas, \"Liberation Mono\", \"Courier New\", monospace !important;\n}\n\n.text-justify {\n  text-align: justify !important;\n}\n\n.text-wrap {\n  white-space: normal !important;\n}\n\n.text-nowrap {\n  white-space: nowrap !important;\n}\n\n.text-truncate {\n  overflow: hidden;\n  text-overflow: ellipsis;\n  white-space: nowrap;\n}\n\n.text-left {\n  text-align: left !important;\n}\n\n.text-right {\n  text-align: right !important;\n}\n\n.text-center {\n  text-align: center !important;\n}\n\n@media...
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 3.7M bytes
    - Viewed (3)
  7. okhttp/src/androidMain/assets/PublicSuffixDatabase.list

    sorfold.no
    sorocaba.br
    sorreisa.no
    sortland.no
    sorum.no
    sos.pl
    sosa.chiba.jp
    sosnowiec.pl
    soundcast.me
    sowa.ibaraki.jp
    soy
    sp.gov.br
    sp.it
    sp.leg.br
    spa
    space
    space-to-rent.com
    spacekit.io
    spb.ru
    spb.su
    spdns.de
    spdns.eu
    spdns.org
    sphinx.mythic-beasts.com
    spjelkavik.no
    spock.replit.dev
    sport
    sport.hu
    spot
    spydeberg.no
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Tue Dec 31 14:50:53 UTC 2024
    - 129.6K bytes
    - Viewed (2)
  8. compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/DefaultWagonManager.java

                    int lastSpacePos = expectedChecksum.lastIndexOf(' ');
                    expectedChecksum = expectedChecksum.substring(lastSpacePos + 1);
                } else {
                    // remove everything after the first space (if available)
                    int spacePos = expectedChecksum.indexOf(' ');
    
                    if (spacePos != -1) {
                        expectedChecksum = expectedChecksum.substring(0, spacePos);
                    }
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Sat Apr 05 11:52:05 UTC 2025
    - 29.9K bytes
    - Viewed (0)
  9. docs/en/docs/deployment/concepts.md

    In this case, it would be better to get **one extra server** and run some processes on it so that they all have **enough RAM and CPU time**.
    
    There's also the chance that for some reason you have a **spike** of usage of your API. Maybe it went viral, or maybe some other services or bots start using it. And you might want to have extra resources to be safe in those cases.
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 18.6K bytes
    - Viewed (1)
  10. guava-tests/test/com/google/common/hash/HashTestUtils.java

       * (key) bits 'affects' a strictly smaller set of output bits. Funneling is bad because it can
       * result in more-than-ideal collisions for a non-uniformly distributed key space. In practice,
       * most key spaces are ANYTHING BUT uniformly distributed. A bit(i) in the input is said to
       * 'affect' a bit(j) in the output if two inputs, identical but for bit(i), will differ at output
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 18:19:59 UTC 2025
    - 25.6K bytes
    - Viewed (0)
Back to top