Search Options

Results per page
Sort
Preferred Languages
Advance

Results 191 - 200 of 1,218 for Number (0.04 sec)

  1. src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java

         * Get the value for the key 'query.highlight.number.of.fragments'. <br>
         * The value is, e.g. 2 <br>
         * comment: Number of fragments for query highlighting.
         * @return The value of found property. (NotNull: if not found, exception but basically no way)
         */
        String getQueryHighlightNumberOfFragments();
    
        /**
         * Get the value for the key 'query.highlight.number.of.fragments' as {@link Integer}. <br>
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 525.6K bytes
    - Viewed (1)
  2. src/main/java/jcifs/dcerpc/ndr/NdrBuffer.java

         */
        public void setLength(final int length) {
            this.deferred.length = length;
        }
    
        /**
         * Advances the buffer index by the specified number of bytes.
         *
         * @param n the number of bytes to advance
         */
        public void advance(final int n) {
            this.index += n;
            if (this.index - this.start > this.deferred.length) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 10.7K bytes
    - Viewed (0)
  3. docs/erasure/README.md

    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 Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/helper/SuggestHelper.java

        }
    
        /**
         * Gets the total number of words in the suggest index.
         *
         * @return The total number of words.
         */
        public long getAllWordsNum() {
            return suggester.getAllWordsNum();
        }
    
        /**
         * Gets the number of words from documents in the suggest index.
         *
         * @return The number of document words.
         */
        public long getDocumentWordsNum() {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 22.3K bytes
    - Viewed (0)
  5. tests/preload_test.go

    	var users2 []User
    	DB.Preload("Account", clause.Eq{Column: "number", Value: users[0].Account.Number}).Find(&users2, "id IN ?", userIDs)
    	sort.Slice(users2, func(i, j int) bool {
    		return users2[i].ID < users2[j].ID
    	})
    
    	for idx, user := range users2[1:2] {
    		if user.Account.Number != "" {
    			t.Errorf("No account should found for user %v but got %v", idx+2, user.Account.Number)
    		}
    	}
    
    	CheckUser(t, users2[0], users[0])
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Wed Jun 12 10:00:47 UTC 2024
    - 15.9K bytes
    - Viewed (0)
  6. src/main/webapp/WEB-INF/view/admin/webconfig/admin_webconfig_edit.jsp

                                        <div class="form-inline col-sm-9">
                                            <la:errors property="depth"/>
                                            <input type="number" name="depth" id="depth"
                                                   value="${f:h(depth)}" class="form-control"
                                                   min="0" max="10000">
                                        </div>
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Feb 13 07:47:04 UTC 2020
    - 15.9K bytes
    - Viewed (0)
  7. tests/helper_test.go

    		if user.Account.Number != "" {
    			if !user.Account.UserID.Valid {
    				t.Errorf("Account's foreign key should be saved")
    			} else {
    				var account Account
    				db(unscoped).First(&account, "user_id = ?", user.ID)
    				AssertObjEqual(t, account, user.Account, "ID", "CreatedAt", "UpdatedAt", "DeletedAt", "UserID",
    					"Number")
    			}
    		}
    	})
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Tue Mar 19 03:50:28 UTC 2024
    - 8K bytes
    - Viewed (0)
  8. cmd/url_test.go

    	req, err := http.NewRequest(http.MethodGet, "http://localhost:9000/bucket/name?uploadId=upload&partNumber=1", http.NoBody)
    	if err != nil {
    		b.Fatal(err)
    	}
    
    	// benchmark utility which helps obtain number of allocations and bytes allocated per ops.
    	b.ReportAllocs()
    	// the actual benchmark for PutObject starts here. Reset the benchmark timer.
    	b.ResetTimer()
    
    	if err := req.ParseForm(); err != nil {
    		b.Fatal(err)
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Nov 16 17:28:29 UTC 2021
    - 2K bytes
    - Viewed (0)
  9. cmd/erasure-errors.go

    package cmd
    
    import "errors"
    
    // errErasureReadQuorum - did not meet read quorum.
    var errErasureReadQuorum = errors.New("Read failed. Insufficient number of drives online")
    
    // errErasureWriteQuorum - did not meet write quorum.
    var errErasureWriteQuorum = errors.New("Write failed. Insufficient number of drives online")
    
    // errNoHealRequired - returned when healing is attempted on a previously healed disks.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 04 23:10:08 UTC 2022
    - 1.2K bytes
    - Viewed (0)
  10. src/main/java/jcifs/internal/smb2/rdma/RdmaTransport.java

         *
         * @param buffer the buffer to read into
         * @param remoteAddress remote memory address
         * @param remoteKey remote access key
         * @param length number of bytes to read
         * @return number of bytes read
         * @throws IOException if operation fails
         */
        public int rdmaRead(ByteBuffer buffer, long remoteAddress, int remoteKey, int length) throws IOException {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 23 05:11:12 UTC 2025
    - 8.9K bytes
    - Viewed (0)
Back to top