Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 22 for Dividers (0.39 sec)

  1. src/main/webapp/css/admin/bootstrap.min.css.map

      }\n    }\n\n    &:empty::after {\n      margin-left: 0;\n    }\n  }\n}\n","// Horizontal dividers\n//\n// Dividers (basically an hr) within dropdowns and nav lists\n\n@mixin nav-divider($color: $nav-divider-color, $margin-y: $nav-divider-margin-y, $ignore-warning: false) {\n  height: 0;\n  margin: $margin-y 0;\n  overflow: hidden;\n  border-top: 1px solid $color;\n  @include deprecate(\"The `nav-divider()` mixin\", \"v4.4.0\", \"v5\", $ignore-warning);\n}\n","// stylelint-disable selector-no-q...
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 639.3K bytes
    - Viewed (1)
  2. build-logic/binary-compatibility/src/main/groovy/gradlebuild/EnrichedReportRenderer.groovy

                                if (this.text === level) {
                                    this.click();
                                }
                            });
    
                            var divider = \$("<hr>");
                            divider.css({ margin: "5px" });
                            var tip = \$("<small>").text("Use the 'bin.cmp.report.severity.filter' property to set the default severity filter");
    Registered: Wed Dec 31 11:36:14 UTC 2025
    - Last Modified: Tue Feb 07 20:38:43 UTC 2023
    - 7.2K bytes
    - Viewed (0)
  3. docs/erasure/README.md

    ## How are drives used for Erasure Code?
    
    MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives.  Therefore, the number of drives you present must be a multiple of one of these numbers.  Each object is written to a single erasure-coding set.
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  4. src/test/java/jcifs/smb1/smb1/SmbComQueryInformationResponseTest.java

            assertEquals(0x0010, response.getAttributes());
            // getLastWriteTime returns lastWriteTime (from readUTime) + serverTimeZoneOffset
            // readUTime multiplies the seconds value by 1000, and writeUTime divides milliseconds by 1000
            // So the round-trip should preserve the milliseconds value
            assertEquals(sampleTimeMillis + serverTimeZoneOffset, response.getLastWriteTime());
            assertEquals(1024, response.getSize());
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 5.5K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/hash/AbstractStreamingHasher.java

        int bytesToCopy = bufferSize - buffer.position();
        for (int i = 0; i < bytesToCopy; i++) {
          buffer.put(readBuffer.get());
        }
        munch(); // buffer becomes empty here, since chunkSize divides bufferSize
    
        // Now process directly from the rest of the input buffer
        while (readBuffer.remaining() >= chunkSize) {
          process(readBuffer);
        }
    
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 7.1K bytes
    - Viewed (0)
  6. src/main/webapp/css/bootstrap.min.css.map

    Suppress inline spacings and underlining of the separator\n      padding-right: var(--#{$prefix}breadcrumb-item-padding-x);\n      color: var(--#{$prefix}breadcrumb-divider-color);\n      content: var(--#{$prefix}breadcrumb-divider, escape-svg($breadcrumb-divider)) #{\"/* rtl:\"} var(--#{$prefix}breadcrumb-divider, escape-svg($breadcrumb-divider-flipped)) #{\"*/\"};\n    }\n  }\n\n  &.active {\n    color: var(--#{$prefix}breadcrumb-item-active-color);\n  }\n}\n",".pagination {\n  // scss-docs-start pagination-css-vars\n...
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Sun Jan 12 06:14:02 UTC 2025
    - 575.5K bytes
    - Viewed (0)
  7. docs/distributed/README.md

    - **MinIO creates erasure-coding sets of _2_ to _16_ drives per set.  The number of drives you provide in total must be a multiple of one of those numbers.**
    - **MinIO chooses the largest EC set size which divides into the total number of drives or total number of nodes given - making sure to keep the uniform distribution i.e each node participates equal number of drives per set**.
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 8.9K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/Iterables.java

       */
      public static <T extends @Nullable Object> Iterable<T> concat(
          Iterable<? extends Iterable<? extends T>> inputs) {
        return FluentIterable.concat(inputs);
      }
    
      /**
       * Divides an iterable into unmodifiable sublists of the given size (the final iterable may be
       * smaller). For example, partitioning an iterable containing {@code [a, b, c, d, e]} with a
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 16 18:35:28 UTC 2025
    - 43.8K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/math/QuantilesTest.java

                8, SIXTEEN_SQUARES_DECILE_8);
      }
    
      public void testScale_indexes_largeVarargs_compute_doubleCollection() {
        int scale = Integer.MAX_VALUE;
        int otherIndex = (Integer.MAX_VALUE - 1) / 3; // this divides exactly
        // For the otherIndex calculation, we have q=Integer.MAX_VALUE, k=(Integer.MAX_VALUE-1)/3, and
        // N=16. Therefore k*(N-1)/q = 5-5/Integer.MAX_VALUE, which has floor 4 and fractional part
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 11 20:45:32 UTC 2025
    - 29.8K bytes
    - Viewed (0)
  10. android/guava-tests/test/com/google/common/math/QuantilesTest.java

                8, SIXTEEN_SQUARES_DECILE_8);
      }
    
      public void testScale_indexes_largeVarargs_compute_doubleCollection() {
        int scale = Integer.MAX_VALUE;
        int otherIndex = (Integer.MAX_VALUE - 1) / 3; // this divides exactly
        // For the otherIndex calculation, we have q=Integer.MAX_VALUE, k=(Integer.MAX_VALUE-1)/3, and
        // N=16. Therefore k*(N-1)/q = 5-5/Integer.MAX_VALUE, which has floor 4 and fractional part
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 11 20:45:32 UTC 2025
    - 29.8K bytes
    - Viewed (0)
Back to top