Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for semmi (0.2 sec)

  1. cmd/streaming-signature-v4.go

    func parseS3ChunkExtension(buf []byte) ([]byte, []byte) {
    	buf = trimTrailingWhitespace(buf)
    	semi := bytes.Index(buf, []byte(s3ChunkSignatureStr))
    	// Chunk signature not found, return the whole buffer.
    	if semi == -1 {
    		return buf, nil
    	}
    	return buf[:semi], parseChunkSignature(buf[semi:])
    }
    
    // parseChunkSignature - parse chunk signature.
    func parseChunkSignature(chunk []byte) []byte {
    Go
    - Registered: Sun May 05 19:28:20 GMT 2024
    - Last Modified: Thu Jan 18 07:03:17 GMT 2024
    - 18.2K bytes
    - Viewed (0)
  2. doc/asm.html

    <a href="https://9p.io/sys/doc/compiler.html">this description</a>)
    needs no assembler pass in the usual pipeline.
    Instead, the compiler operates on a kind of semi-abstract instruction set,
    and instruction selection occurs partly after code generation.
    The assembler works on the semi-abstract form, so
    when you see an instruction like <code>MOV</code>
    what the toolchain actually generates for that operation might
    HTML
    - Registered: Tue May 07 11:14:38 GMT 2024
    - Last Modified: Tue Nov 28 19:15:27 GMT 2023
    - 36.3K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        Multiset<Integer> elements = HashMultiset.create();
        MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create();
        int range = 10_000; // range should be small enough that equal elements occur semi-frequently
        for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) {
          for (int i = 0; i < 100; i++) {
            Integer element = random.nextInt(range);
            elements.add(element);
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Thu Mar 07 18:34:03 GMT 2024
    - 36.1K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        Multiset<Integer> elements = HashMultiset.create();
        MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create();
        int range = 10_000; // range should be small enough that equal elements occur semi-frequently
        for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) {
          for (int i = 0; i < 100; i++) {
            Integer element = random.nextInt(range);
            elements.add(element);
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Thu Mar 07 18:34:03 GMT 2024
    - 36.1K bytes
    - Viewed (0)
Back to top