Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 315 for count1s (0.07 seconds)

  1. tests/count_test.go

    		t.Fatalf("Count should be 3, but got count: %v err %v", count10, err)
    	}
    
    	var count11 int64
    	sameUsers := make([]*User, 0)
    	for i := 0; i < 3; i++ {
    		sameUsers = append(sameUsers, GetUser("count-4", Config{}))
    	}
    	DB.Create(sameUsers)
    
    	if err := DB.Model(&User{}).Where("name = ?", "count-4").Group("name").Count(&count11).Error; err != nil || count11 != 1 {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Mon Sep 08 09:19:22 GMT 2025
    - 6.8K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/util/concurrent/ListenerCallQueueTest.java

      private static <T> ImmutableMultiset<T> multiset(T value, int count) {
        return multiset(ImmutableMap.of(value, count));
      }
    
      private static <T> ImmutableMultiset<T> multiset(T value1, int count1, T value2, int count2) {
        return multiset(ImmutableMap.of(value1, count1, value2, count2));
      }
    
      private static <T> ImmutableMultiset<T> multiset(Map<T, Integer> counts) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 8.4K bytes
    - Click Count (0)
  3. guava-tests/test/com/google/common/util/concurrent/ListenerCallQueueTest.java

      private static <T> ImmutableMultiset<T> multiset(T value, int count) {
        return multiset(ImmutableMap.of(value, count));
      }
    
      private static <T> ImmutableMultiset<T> multiset(T value1, int count1, T value2, int count2) {
        return multiset(ImmutableMap.of(value1, count1, value2, count2));
      }
    
      private static <T> ImmutableMultiset<T> multiset(Map<T, Integer> counts) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 8.4K bytes
    - Click Count (0)
  4. lib/fips140/v1.26.0.zip

    byteorder.BEUint32(nonce[:4]) { panic("crypto/cipher: GCM nonce prefix changed") } counter := byteorder.BEUint64(nonce[len(nonce)-8:]) if !g.startReady { // The first invocation sets the starting counter, if not fixed. g.startReady = true g.start = counter } counter -= g.start // Ensure the counter is strictly increasing. if counter == math.MaxUint64 { panic("crypto/cipher: counter exhausted") } if counter < g.next { panic("crypto/cipher: counter decreased or remained the same") } g.next = counter + 1 } fips140.RecordApproved()...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java

        for (int i = 0; i < SIZE; i++) {
          aa.set(i, (double) COUNTDOWN);
        }
        Counter c1 = new Counter(aa);
        Counter c2 = new Counter(aa);
        Thread t1 = newStartedThread(c1);
        Thread t2 = newStartedThread(c2);
        awaitTermination(t1);
        awaitTermination(t2);
        assertEquals(SIZE * COUNTDOWN, c1.counts + c2.counts);
      }
    
      /** a deserialized serialized array holds same values */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 14.8K bytes
    - Click Count (0)
  6. tests/main_test.go

    		t.Errorf("Should got error with invalid SQL")
    	}
    
    	var count1, count2 int64
    	DB.Model(&User{}).Count(&count1)
    	if count1 <= 0 {
    		t.Errorf("Should find some users")
    	}
    
    	if DB.Where("name = ?", "jinzhu; delete * from users").First(&User{}).Error == nil {
    		t.Errorf("Should got error with invalid SQL")
    	}
    
    	DB.Model(&User{}).Count(&count2)
    	if count1 != count2 {
    		t.Errorf("No user should not be deleted by invalid SQL")
    	}
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:35:55 GMT 2026
    - 1.5K bytes
    - Click Count (0)
  7. android/guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java

        for (int i = 0; i < SIZE; i++) {
          aa.set(i, (double) COUNTDOWN);
        }
        Counter c1 = new Counter(aa);
        Counter c2 = new Counter(aa);
        Thread t1 = newStartedThread(c1);
        Thread t2 = newStartedThread(c2);
        awaitTermination(t1);
        awaitTermination(t2);
        assertEquals(SIZE * COUNTDOWN, c1.counts + c2.counts);
      }
    
      /** a deserialized serialized array holds same values */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 10.8K bytes
    - Click Count (0)
  8. src/main/java/jcifs/audit/SecurityAuditLogger.java

            long currentWindow = System.currentTimeMillis() / rateLimitWindow;
            String windowKey = key + "_" + currentWindow;
    
            AtomicLong counter = rateLimitCounters.computeIfAbsent(windowKey, k -> new AtomicLong(0));
            long currentCount = counter.incrementAndGet();
    
            // Clean up old windows periodically
            if (currentCount == 1) {
                cleanupOldRateLimitCounters(currentWindow);
            }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 30 05:58:03 GMT 2025
    - 26.6K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/collect/Multisets.java

        checkNotNull(multiset1);
        checkNotNull(multiset2);
    
        return new ViewMultiset<E>() {
          @Override
          public int count(@Nullable Object element) {
            int count1 = multiset1.count(element);
            return (count1 == 0) ? 0 : min(count1, multiset2.count(element));
          }
    
          @Override
          Set<E> createElementSet() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 41.3K bytes
    - Click Count (0)
  10. guava/src/com/google/common/collect/Multisets.java

        checkNotNull(multiset1);
        checkNotNull(multiset2);
    
        return new ViewMultiset<E>() {
          @Override
          public int count(@Nullable Object element) {
            int count1 = multiset1.count(element);
            return (count1 == 0) ? 0 : min(count1, multiset2.count(element));
          }
    
          @Override
          Set<E> createElementSet() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 41.2K bytes
    - Click Count (0)
Back to Top