tcount - Code Search

src/main/java/jcifs/internal/smb1/com/SmbComWrite.java

        dst[dstIndex] = (byte) 0x01; /* BufferFormat */
        dstIndex++;
        SMBUtil.writeInt2(this.count, dst, dstIndex); /* DataLength? */
        dstIndex += 2;
        System.arraycopy(this.b, this.off, dst, dstIndex, this.count);
        dstIndex += this.count;

        return dstIndex - start;
    }

    @Override

Registered: Sun Sep 07 00:10:21 UTC 2025

- Last Modified: Sat Aug 16 01:32:48 UTC 2025

- 4.6K bytes

- Viewed (0)

github.com/go-gorm/gorm

tests/named_polymorphic_test.go

	}

	// clear to omit Toy.ID in count
	hamster2.PreferredToy = Toy{}
	hamster2.OtherToy = Toy{}

	if DB.Model(&hamster2).Association("PreferredToy").Count() != 1 {
		t.Errorf("Hamster's preferred toy count should be 1")
	}

	if DB.Model(&hamster2).Association("OtherToy").Count() != 1 {
		t.Errorf("Hamster's other toy count should be 1")
	}

	// Query
	hamsterToy := Toy{}

Registered: Sun Sep 07 09:35:13 UTC 2025

- Last Modified: Wed Jul 08 09:59:40 UTC 2020

- 4.2K bytes

- Viewed (0)

github.com/apache/maven

compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraph.java

        setScopedVertices(scopedVertices);

        this.versionedVertices = scopedVertices || versionedVertices;
        this.scopedVertices = scopedVertices;

        int count = countNodes(tree);

        init(count, count + (count / 2));

        processTreeNodes(null, tree, 0, 0);
    }
    // ------------------------------------------------------------------------

Registered: Sun Sep 07 03:35:12 UTC 2025

- Last Modified: Wed Jul 23 17:27:08 UTC 2025

- 13K bytes

- Viewed (0)

github.com/go-gorm/gorm

tests/query_test.go

	}

	if totalBatch != 6 {
		t.Errorf("incorrect total batch, expects: %v, got %v", 6, totalBatch)
	}

	var count int64
	DB.Model(&User{}).Where("name = ?", "find_in_batches_new").Count(&count)
	if count != 6 {
		t.Errorf("incorrect count after update, expects: %v, got %v", 6, count)
	}
}

func TestFindInBatchesWithOffsetLimit(t *testing.T) {
	users := []User{

Registered: Sun Sep 07 09:35:13 UTC 2025

- Last Modified: Tue Jul 22 06:21:04 UTC 2025

- 51K bytes

- Viewed (0)

github.com/golang/go

src/bytes/buffer.go

)

// ErrTooLarge is passed to panic if memory cannot be allocated to store data in a buffer.
var ErrTooLarge = errors.New("bytes.Buffer: too large")
var errNegativeRead = errors.New("bytes.Buffer: reader returned negative count from Read")

const maxInt = int(^uint(0) >> 1)

// Bytes returns a slice of length b.Len() holding the unread portion of the buffer.
// The slice is valid for use only until the next buffer modification (that is,

Registered: Tue Sep 09 11:13:09 UTC 2025

- Last Modified: Mon May 19 17:38:56 UTC 2025

- 16K bytes

- Viewed (0)

github.com/codelibs/fess-crawler

fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/util/CrawlerWebServer.java

            childDir.mkdirs();
            generateContents(childDir, count - 1);
        }
    }

    private static String getHtmlContent(final int count) {
        final StringBuilder buf = new StringBuilder();
        buf.append("<html><head><title>Title ");
        buf.append(count);
        buf.append("</title></head><body><h1>Content ");
        buf.append(count);

Registered: Sun Sep 21 03:50:09 UTC 2025

- Last Modified: Sat Mar 15 06:52:00 UTC 2025

- 5K bytes

- Viewed (0)

github.com/golang/go

src/bytes/bytes.go

// Repeat returns a new byte slice consisting of count copies of b.
//
// It panics if count is negative or if the result of (len(b) * count)
// overflows.
func Repeat(b []byte, count int) []byte {
	if count == 0 {
		return []byte{}
	}

	// Since we cannot return an error on overflow,
	// we should panic if the repeat will generate an overflow.
	// See golang.org/issue/16237.
	if count < 0 {

Registered: Tue Sep 09 11:13:09 UTC 2025

- Last Modified: Wed Sep 03 14:04:47 UTC 2025

- 35.5K bytes

- Viewed (0)

github.com/google/guava

guava/src/com/google/common/io/ByteStreams.java

  // Java 9. This function is just returns the same result that
  // Arrays.equals(array1, 0, count, array2, 0, count) would. It assumes that both arrays have a
  // length of at least count.
  private static boolean arraysEqual(byte[] array1, byte[] array2, int count) {
    for (int i = 0; i < count; i++) {
      if (array1[i] != array2[i]) {
        return false;
      }
    }
    return true;
  }

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Thu Jul 17 15:26:41 UTC 2025

- 31.1K bytes

- Viewed (0)

github.com/google/guava

guava-testlib/src/com/google/common/collect/testing/google/MultisetAddTester.java

  public void testAddOccurrences() {
    int originalCount = getMultiset().count(e0());
    assertEquals("old count", originalCount, getMultiset().add(e0(), 2));
    assertEquals("old count", originalCount + 2, getMultiset().count(e0()));
  }

  @CollectionFeature.Require(SUPPORTS_ADD)
  public void testAddSeveralTimes() {
    int originalCount = getMultiset().count(e0());
    assertEquals(originalCount, getMultiset().add(e0(), 2));

Registered: Fri Sep 05 12:43:10 UTC 2025

- Last Modified: Thu Nov 14 23:40:07 UTC 2024

- 4.1K bytes

- Viewed (0)

github.com/codelibs/fess

src/main/java/org/codelibs/fess/mylasta/action/FessLabels.java

    /** The key of the message: by Click Count (asc) */
    public static final String LABELS_search_result_sort_click_count_asc = "{labels.search_result_sort_click_count_asc}";

    /** The key of the message: by Click Count (desc) */
    public static final String LABELS_search_result_sort_click_count_desc = "{labels.search_result_sort_click_count_desc}";

    /** The key of the message: by Favorite Count (asc) */

Registered: Thu Sep 04 12:52:25 UTC 2025

- Last Modified: Sat Jul 05 02:36:47 UTC 2025

- 146.4K bytes

- Viewed (0)

Search Options