Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 21 - 30 of 441 for appended (0.04 seconds)

  1. docs/en/docs/_llm-test.md

    Tests added here will be seen by all designers of language specific prompts.
    
    Use as follows:
    
    * Have a language specific prompt – `docs/{language code}/llm-prompt.md`.
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Thu Dec 11 14:48:47 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  2. src/cmd/asm/internal/asm/testdata/ppc64.s

    	//       This only captures the MOVD. Should the SLD be appended to the encoding by the test?
    	// Hex constant 0x20004000000
    	MOVD $2199090364416, R5         // 60058001
    	// Hex constant 0xFFFFFE0004000000
    	MOVD $-2198956146688, R5        // 38a08001
    	// TODO: On GOPPC64={power8,power9}, this is preprocessed into MOVD $-1, R5; RLDC R5, $33, $63, R5.
    	//       This only captures the MOVD. Should the RLDC be appended to the encoding by the test?
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Nov 21 18:27:17 GMT 2024
    - 51.7K bytes
    - Click Count (0)
  3. cmd/bucket-metadata-sys.go

    	}
    }
    
    // Set - sets a new metadata in-memory.
    // Only a shallow copy is saved and fields with references
    // cannot be modified without causing a race condition,
    // so they should be replaced atomically and not appended to, etc.
    // Data is not persisted to disk.
    func (sys *BucketMetadataSys) Set(bucket string, meta BucketMetadata) {
    	if !isMinioMetaBucketName(bucket) {
    		sys.Lock()
    		sys.metadataMap[bucket] = meta
    		sys.Unlock()
    	}
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 20.4K bytes
    - Click Count (0)
  4. tests/create_test.go

    	if err := DB.Where("id = ?", u1.ID).First(&newUser).Error; err != nil {
    		t.Fatalf("errors happened when query: %v", err)
    	} else {
    		CheckUser(t, newUser, u1)
    	}
    
    	type user struct {
    		ID   int `gorm:"primaryKey;->:false"`
    		Name string
    		Age  int
    	}
    
    	var u2 user
    	if results := DB.Create(&u2); results.Error != nil {
    		t.Fatalf("errors happened when create: %v", results.Error)
    	} else if results.RowsAffected != 1 {
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Mon Jul 21 09:55:20 GMT 2025
    - 26.8K bytes
    - Click Count (0)
  5. doc/asm.html

    For the hardware register, use <code>R13</code>.
    </p>
    
    <p>
    Condition code syntax is to append a period and the one- or two-letter code to the instruction,
    as in <code>MOVW.EQ</code>.
    Multiple codes may be appended: <code>MOVM.IA.W</code>.
    The order of the code modifiers is irrelevant.
    </p>
    
    <p>
    Addressing modes:
    </p>
    
    <ul>
    
    <li>
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Nov 14 19:09:46 GMT 2025
    - 36.5K bytes
    - Click Count (0)
  6. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache/DiskLruCache.kt

          // The names are repetitive so re-use the same builder to avoid allocations.
          val fileBuilder = StringBuilder(key).append('.')
          val truncateTo = fileBuilder.length
          for (i in 0 until valueCount) {
            fileBuilder.append(i)
            cleanFiles += directory / fileBuilder.toString()
            fileBuilder.append(".tmp")
            dirtyFiles += directory / fileBuilder.toString()
            fileBuilder.setLength(truncateTo)
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Wed May 28 23:28:25 GMT 2025
    - 34.7K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/CompactHashSet.java

          return delegate.add(object);
        }
        int[] entries = requireEntries();
        @Nullable Object[] elements = requireElements();
    
        int newEntryIndex = this.size; // current size, and pointer to the entry to be appended
        int newSize = newEntryIndex + 1;
        int hash = smearedHash(object);
        int mask = hashTableMask();
        int tableIndex = hash & mask;
        int next = CompactHashing.tableGet(requireTable(), tableIndex);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 24.7K bytes
    - Click Count (0)
  8. guava/src/com/google/common/collect/CompactHashMap.java

        int[] entries = requireEntries();
        @Nullable Object[] keys = requireKeys();
        @Nullable Object[] values = requireValues();
    
        int newEntryIndex = this.size; // current size, and pointer to the entry to be appended
        int newSize = newEntryIndex + 1;
        int hash = smearedHash(key);
        int mask = hashTableMask();
        int tableIndex = hash & mask;
        int next = CompactHashing.tableGet(requireTable(), tableIndex);
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Jul 08 18:32:10 GMT 2025
    - 39.6K bytes
    - Click Count (0)
  9. src/bufio/bufio.go

    func (b *Writer) Available() int { return len(b.buf) - b.n }
    
    // AvailableBuffer returns an empty buffer with b.Available() capacity.
    // This buffer is intended to be appended to and
    // passed to an immediately succeeding [Writer.Write] call.
    // The buffer is only valid until the next write operation on b.
    func (b *Writer) AvailableBuffer() []byte {
    	return b.buf[b.n:][:0]
    }
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Sep 03 14:04:47 GMT 2025
    - 22K bytes
    - Click Count (0)
  10. src/archive/tar/common.go

    			continue // Skip empty fragments
    		}
    		pre.Length = cur.Offset - pre.Offset
    		if pre.Length > 0 {
    			dst = append(dst, pre) // Only add non-empty fragments
    		}
    		pre.Offset = cur.endOffset()
    	}
    	pre.Length = size - pre.Offset // Possibly the only empty fragment
    	return append(dst, pre)
    }
    
    // fileState tracks the number of logical (includes sparse holes) and physical
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Oct 07 19:46:36 GMT 2025
    - 24.5K bytes
    - Click Count (0)
Back to Top