Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 167 for user21 (0.14 sec)

  1. src/main/java/org/codelibs/fess/opensearch/user/cbean/cq/UserCQ.java

     * governing permissions and limitations under the License.
     */
    package org.codelibs.fess.opensearch.user.cbean.cq;
    
    import org.codelibs.fess.opensearch.user.cbean.cq.bs.BsUserCQ;
    
    /**
     * @author ESFlute (using FreeGen)
     */
    public class UserCQ extends BsUserCQ {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Mar 15 06:53:53 UTC 2025
    - 822 bytes
    - Viewed (0)
  2. tests/associations_belongs_to_test.go

    	}
    
    	if err := DB.Model(&users[1]).Association("Company").Append(&company); err != nil {
    		t.Errorf("Error happened when append company to user, got %v", err)
    	}
    
    	if users[0].CompanyID == nil || users[1].CompanyID == nil || *users[0].CompanyID != *users[1].CompanyID {
    		t.Errorf("user's company id should exists and equal, but its: %v, %v", users[0].CompanyID, users[1].CompanyID)
    	}
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Oct 30 09:15:49 UTC 2023
    - 9.3K bytes
    - Viewed (0)
  3. tests/update_belongs_to_test.go

    	var user2 User
    	DB.Preload("Company").Preload("Manager").Find(&user2, "id = ?", user.ID)
    	CheckUser(t, user2, user)
    
    	user.Company.Name += "new"
    	user.Manager.Name += "new"
    	if err := DB.Save(&user).Error; err != nil {
    		t.Fatalf("errors happened when update: %v", err)
    	}
    
    	var user3 User
    	DB.Preload("Company").Preload("Manager").Find(&user3, "id = ?", user.ID)
    	CheckUser(t, user2, user3)
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Jul 14 06:55:54 UTC 2022
    - 1.6K bytes
    - Viewed (0)
  4. tests/scopes_test.go

    	}
    }
    
    func TestScopes(t *testing.T) {
    	users := []*User{
    		GetUser("ScopeUser1", Config{}),
    		GetUser("ScopeUser2", Config{}),
    		GetUser("ScopeUser3", Config{}),
    	}
    
    	DB.Create(&users)
    
    	var users1, users2, users3 []User
    	DB.Scopes(NameIn1And2).Find(&users1)
    	if len(users1) != 2 {
    		t.Errorf("Should found two users's name in 1, 2, but got %v", len(users1))
    	}
    
    	DB.Scopes(NameIn1And2, NameIn2And3).Find(&users2)
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Fri Jan 12 08:42:21 UTC 2024
    - 3.3K bytes
    - Viewed (0)
  5. tests/connpool_test.go

    			"SELECT * FROM `users` WHERE name = ? AND `users`.`deleted_at` IS NULL ORDER BY `users`.`id` LIMIT ?",
    			"SELECT * FROM `users` WHERE name = ? AND `users`.`deleted_at` IS NULL ORDER BY `users`.`id` LIMIT ?",
    			"INSERT INTO `users` (`created_at`,`updated_at`,`deleted_at`,`name`,`age`,`birthday`,`company_id`,`manager_id`,`active`) VALUES (?,?,?,?,?,?,?,?,?)",
    			"SELECT * FROM `users` WHERE name = ? AND `users`.`deleted_at` IS NULL ORDER BY `users`.`id` LIMIT ?",
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 5.5K bytes
    - Viewed (0)
  6. tests/update_has_one_test.go

    	CheckUser(t, user2, user)
    
    	user.Account.Number += "new"
    	if err := DB.Save(&user).Error; err != nil {
    		t.Fatalf("errors happened when update: %v", err)
    	}
    
    	var user3 User
    	DB.Preload("Account").Find(&user3, "id = ?", user.ID)
    
    	CheckUser(t, user2, user3)
    	lastUpdatedAt := user2.Account.UpdatedAt
    	time.Sleep(time.Second)
    
    	if err := DB.Session(&gorm.Session{FullSaveAssociations: true}).Save(&user).Error; err != nil {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Jul 14 06:55:54 UTC 2022
    - 3.6K bytes
    - Viewed (0)
  7. chainable_api.go

    }
    
    // Limit specify the number of records to be retrieved
    //
    // Limit conditions can be cancelled by using `Limit(-1)`.
    //
    //	// retrieve 3 users
    //	db.Limit(3).Find(&users)
    //	// retrieve 3 users into users1, and all users into users2
    //	db.Limit(3).Find(&users1).Limit(-1).Find(&users2)
    func (db *DB) Limit(limit int) (tx *DB) {
    	tx = db.getInstance()
    	tx.Statement.AddClause(clause.Limit{Limit: &limit})
    	return
    }
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 14.8K bytes
    - Viewed (0)
  8. src/main/java/jcifs/pac/PacLogonInfo.java

                }
    
                // Compute User IDs with Domain ID to get User SIDs
                // First extra is user if userId is empty
                if (!userId.isEmpty() && !userId.isBlank()) {
                    this.userSid = new SID(domainId, userId);
                } else if (this.extraSids.length > 0) {
                    this.userSid = this.extraSids[0];
                }
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 14.3K bytes
    - Viewed (0)
  9. src/test/java/org/codelibs/fess/helper/PathMappingHelperTest.java

            pathMappingList.add(pathMapping);
    
            pathMappingHelper.cachedPathMappingList = pathMappingList;
    
            String text = "\"file:///home/user1/\" and \"file:///home/user2/\"";
            assertEquals("\"http://localhost/user1/\" and \"http://localhost/user2/\"", pathMappingHelper.replaceUrls(text));
        }
    
        public void test_replaceUrls_withNoQuotes() {
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Jul 12 05:35:01 UTC 2025
    - 14.9K bytes
    - Viewed (0)
  10. tests/generics_test.go

    	} else if len(users2) != len(users) {
    		t.Fatalf("Failed to load join users, got: %v, expect: %v", len(users2), len(users))
    	}
    
    	sort.Slice(users2, func(i, j int) bool {
    		return users2[i].ID > users2[j].ID
    	})
    
    	sort.Slice(users, func(i, j int) bool {
    		return users[i].ID > users[j].ID
    	})
    
    	for idx, user := range users {
    		// user
    		CheckUser(t, user, users2[idx])
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Sep 04 13:13:16 UTC 2025
    - 28K bytes
    - Viewed (0)
Back to top